@kontsedal/olas-core 0.0.5 → 0.1.0

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["signal","computed","signal","effect","signal","effect"],"sources":["../src/signals/readonly.ts","../src/forms/standard-schema.ts","../src/forms/validators.ts","../src/query/define.ts","../src/scope.ts","../src/selection.ts","../src/timing/debounced.ts","../src/timing/throttled.ts"],"sourcesContent":["import type { ReadSignal } from './types'\n\n/**\n * Project a Signal (or any object with a reactive `value` + `peek` + `subscribe`)\n * as a `ReadSignal`. The returned object does not expose `set` / `update` /\n * settable `value`, so it can be returned from APIs without callers mutating it.\n *\n * Internal helper — not exported from the package's public surface.\n */\nexport function readOnly<T>(source: ReadSignal<T>): ReadSignal<T> {\n  return Object.freeze({\n    get value() {\n      return source.value\n    },\n    peek() {\n      return source.peek()\n    },\n    subscribe(handler: (value: T) => void) {\n      return source.subscribe(handler)\n    },\n  })\n}\n","/**\n * Standard Schema v1 — the cross-library validation contract adopted by\n * Zod 4, Valibot 1, ArkType 2, and others. See https://standardschema.dev.\n *\n * We type-only-import the shape so consumers don't take a new runtime dep:\n * any object with a `~standard.validate(value)` method conforming to this\n * structure works.\n */\nexport type StandardSchemaV1Issue = {\n  readonly message: string\n  readonly path?: ReadonlyArray<PropertyKey | { readonly key: PropertyKey }>\n}\n\nexport type StandardSchemaV1Result<O> =\n  | { readonly value: O; readonly issues?: undefined }\n  | { readonly issues: ReadonlyArray<StandardSchemaV1Issue> }\n\nexport type StandardSchemaV1<I = unknown, O = I> = {\n  readonly '~standard': {\n    readonly version: 1\n    readonly vendor: string\n    validate(value: unknown): StandardSchemaV1Result<O> | Promise<StandardSchemaV1Result<O>>\n    readonly types?: { readonly input: I; readonly output: O } | undefined\n  }\n}\n\n/**\n * Heuristic: does `x` look like a Standard Schema?\n */\nexport function isStandardSchema(x: unknown): x is StandardSchemaV1<unknown, unknown> {\n  return (\n    x !== null &&\n    typeof x === 'object' &&\n    '~standard' in x &&\n    typeof (x as { '~standard': { validate?: unknown } })['~standard']?.validate === 'function'\n  )\n}\n","import { isStandardSchema, type StandardSchemaV1 } from './standard-schema'\nimport type { Validator } from './types'\n\n/**\n * Wrap any Standard-Schema-compatible schema (Zod 4, Valibot 1, ArkType 2,\n * …) as an Olas validator. The validator returns the first issue's message\n * on failure (or `'Invalid'` if no issues are produced), `null` on success.\n *\n * Standard Schema validators may be sync or async; this wrapper threads\n * through whichever the schema returns — `Promise<string|null>` only when\n * the underlying validate call is itself async.\n *\n * `signal` is accepted to match the `Validator<T>` shape but isn't forwarded\n * — Standard Schema v1 has no cancellation surface.\n */\nexport function validator<I, O>(schema: StandardSchemaV1<I, O>): Validator<I> {\n  return (value, signal) => {\n    void signal\n    const result = schema['~standard'].validate(value)\n    if (result instanceof Promise) {\n      return result.then(messageFromResult)\n    }\n    return messageFromResult(result)\n  }\n}\n\nfunction messageFromResult(result: { issues?: ReadonlyArray<{ message: string }> }): string | null {\n  if (result.issues === undefined || result.issues.length === 0) return null\n  return result.issues[0]?.message ?? 'Invalid'\n}\n\nexport { isStandardSchema, type StandardSchemaV1 } from './standard-schema'\n\nconst isEmpty = (value: unknown): boolean => {\n  if (value === undefined || value === null) return true\n  if (typeof value === 'string') return value.length === 0\n  if (Array.isArray(value)) return value.length === 0\n  return false\n}\n\n/** Reject empty values (undefined, null, empty string, empty array). */\nexport const required =\n  <T>(message = 'Required'): Validator<T> =>\n  (value) =>\n    isEmpty(value) ? message : null\n\n/** Reject strings / arrays shorter than `n`. Allows null/undefined (use with `required` to forbid). */\nexport const minLength =\n  (n: number, message?: string): Validator<string | readonly unknown[]> =>\n  (value) => {\n    if (value == null) return null\n    if (value.length >= n) return null\n    return message ?? `Must be at least ${n} characters`\n  }\n\n/** Reject strings / arrays longer than `n`. */\nexport const maxLength =\n  (n: number, message?: string): Validator<string | readonly unknown[]> =>\n  (value) => {\n    if (value == null) return null\n    if (value.length <= n) return null\n    return message ?? `Must be no more than ${n} characters`\n  }\n\n/** Reject numbers less than `n`. */\nexport const min =\n  (n: number, message?: string): Validator<number> =>\n  (value) => {\n    if (value == null) return null\n    if (value >= n) return null\n    return message ?? `Must be at least ${n}`\n  }\n\n/** Reject numbers greater than `n`. */\nexport const max =\n  (n: number, message?: string): Validator<number> =>\n  (value) => {\n    if (value == null) return null\n    if (value <= n) return null\n    return message ?? `Must be no more than ${n}`\n  }\n\n// RFC-5322-light. Pragmatic, not exhaustive — production forms should\n// rely on server-side validation for definitive answers.\nconst EMAIL_RE = /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/\n\n/** Reject strings that don't look like an email. Empty / null pass (use with `required` to forbid). */\nexport const email =\n  (message = 'Invalid email address'): Validator<string> =>\n  (value) => {\n    if (value == null || value === '') return null\n    return EMAIL_RE.test(value) ? null : message\n  }\n\n/** Reject strings that don't match the supplied `RegExp`. */\nexport const pattern =\n  (re: RegExp, message = 'Invalid format'): Validator<string> =>\n  (value) => {\n    if (value == null || value === '') return null\n    return re.test(value) ? null : message\n  }\n","import type { QueryClient } from './client'\nimport type { InfiniteQuery, InfiniteQuerySpec } from './infinite'\nimport { type RegisteredQuery, registerQueryById } from './plugin'\nimport type { Query, QuerySpec, Snapshot } from './types'\n\ntype QueryInternal<Args extends unknown[], T> = Query<Args, T> & {\n  readonly __spec: QuerySpec<Args, T>\n  __clients: Set<QueryClient>\n}\n\nconst warnedMissingId = new WeakSet<object>()\n\nfunction registerQueryId(spec: { queryId?: string; crossTab?: boolean }, query: object): void {\n  if (spec.queryId != null) {\n    registerQueryById(spec.queryId, query as RegisteredQuery)\n  } else if (spec.crossTab === true) {\n    // Plugins can't route a message without a `queryId`. Warn once per\n    // offending spec — repeated warnings on every render would be noisy.\n    if (__DEV__ && !warnedMissingId.has(spec as object)) {\n      warnedMissingId.add(spec as object)\n      console.warn(\n        '[olas] defineQuery({ crossTab: true }) requires a stable `queryId`. ' +\n          'Add `queryId: \"<unique-string>\"` to the spec. Cross-tab sync is disabled for this query.',\n      )\n    }\n  }\n}\n\n/**\n * Define a keyed, shared query. The returned Query value lives at module\n * scope; per-root QueryClients bind their own entry registries to it.\n */\nexport function defineQuery<Args extends unknown[], T>(spec: QuerySpec<Args, T>): Query<Args, T> {\n  const clients = new Set<QueryClient>()\n  const query = {\n    __olas: 'query' as const,\n    __spec: spec,\n    __clients: clients,\n\n    invalidate(...args: Args): void {\n      for (const client of clients) {\n        client.invalidate(query as Query<Args, T>, args)\n      }\n    },\n\n    invalidateAll(): void {\n      for (const client of clients) {\n        client.invalidateAll(query as Query<Args, T>)\n      }\n    },\n\n    setData(...rest: [...Args, updater: (prev: T | undefined) => T]): Snapshot {\n      const updater = rest[rest.length - 1] as (prev: T | undefined) => T\n      const keyArgs = rest.slice(0, -1) as unknown as Args\n      const childSnapshots: Snapshot[] = []\n      for (const client of clients) {\n        childSnapshots.push(client.setData(query as Query<Args, T>, keyArgs, updater))\n      }\n      return {\n        rollback: () => {\n          for (const s of childSnapshots) s.rollback()\n        },\n        finalize: () => {\n          for (const s of childSnapshots) s.finalize()\n        },\n      }\n    },\n\n    prefetch(...args: Args): Promise<T> {\n      // Single-client common case; if none, throw.\n      const [first] = clients\n      if (!first) {\n        return Promise.reject(new Error('[olas] prefetch called before any root has subscribed'))\n      }\n      if (__DEV__ && clients.size > 1) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          '[olas] query.prefetch() is ambiguous when multiple roots are registered; ' +\n            'using an arbitrary root. Call `root.prefetch(query, args)` (or per-root) to be explicit.',\n        )\n      }\n      return first.prefetch(query as Query<Args, T>, args)\n    },\n  } satisfies QueryInternal<Args, T>\n\n  registerQueryId(spec, query)\n  return query as Query<Args, T>\n}\n\ntype InfiniteQueryInternal<Args extends unknown[], TPage, TItem> = InfiniteQuery<\n  Args,\n  TPage,\n  TItem\n> & {\n  readonly __spec: InfiniteQuerySpec<Args, any, TPage, TItem>\n  __clients: Set<QueryClient>\n}\n\n/**\n * Define a paginated query (chat-style \"load more\", infinite scrolling). Pages\n * are kept in order and concatenated via `getNextPageParam` /\n * `getPreviousPageParam`. The returned handle is module-scoped — bind\n * subscribers via `ctx.use(infiniteQuery, () => [...args])`. Spec §5.7,\n * §20.4.\n */\nexport function defineInfiniteQuery<Args extends unknown[], PageParam, TPage, TItem = TPage>(\n  spec: InfiniteQuerySpec<Args, PageParam, TPage, TItem>,\n): InfiniteQuery<Args, TPage, TItem> {\n  const clients = new Set<QueryClient>()\n  const query = {\n    __olas: 'infiniteQuery' as const,\n    __spec: spec,\n    __clients: clients,\n\n    invalidate(...args: Args): void {\n      for (const client of clients) {\n        client.invalidateInfinite(query as InfiniteQuery<Args, TPage, TItem>, args)\n      }\n    },\n\n    invalidateAll(): void {\n      for (const client of clients) {\n        client.invalidateAllInfinite(query as InfiniteQuery<Args, TPage, TItem>)\n      }\n    },\n\n    setData(...rest: [...Args, updater: (prev: TPage[] | undefined) => TPage[]]): Snapshot {\n      const updater = rest[rest.length - 1] as (prev: TPage[] | undefined) => TPage[]\n      const keyArgs = rest.slice(0, -1) as unknown as Args\n      const childSnapshots: Snapshot[] = []\n      for (const client of clients) {\n        childSnapshots.push(\n          client.setInfiniteData<Args, TPage>(\n            query as InfiniteQuery<Args, TPage, TItem>,\n            keyArgs,\n            updater,\n          ),\n        )\n      }\n      return {\n        rollback: () => {\n          for (const s of childSnapshots) s.rollback()\n        },\n        finalize: () => {\n          for (const s of childSnapshots) s.finalize()\n        },\n      }\n    },\n\n    prefetch(...args: Args): Promise<TPage> {\n      const [first] = clients\n      if (!first) {\n        return Promise.reject(new Error('[olas] prefetch called before any root has subscribed'))\n      }\n      if (__DEV__ && clients.size > 1) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          '[olas] infiniteQuery.prefetch() is ambiguous when multiple roots are registered; ' +\n            'using an arbitrary root. Call `root.prefetch(query, args)` (or per-root) to be explicit.',\n        )\n      }\n      return first.prefetchInfinite(query as InfiniteQuery<Args, TPage, TItem>, args)\n    },\n  } satisfies InfiniteQueryInternal<Args, TPage, TItem>\n\n  registerQueryId(spec, query)\n  return query as InfiniteQuery<Args, TPage, TItem>\n}\n","/**\n * Typed cross-tree data slot. Provided by an ancestor via `ctx.provide(scope, value)`\n * and consumed anywhere in its subtree via `ctx.inject(scope)`. Defined at module\n * scope so the identity is stable across calls. See spec §10.3.\n */\nexport type Scope<T> = {\n  readonly __olas: 'scope'\n  /** Per-scope identity; matches across `provide` / `inject`. */\n  readonly __id: symbol\n  /** Optional human-readable name (used in error messages). */\n  readonly name?: string\n  /** Default value used when no provider exists; `undefined` if none was set. */\n  readonly default?: T\n  /** True iff `defineScope` was called with a `default` (even `default: undefined`). */\n  readonly hasDefault: boolean\n  // Phantom for inference — typed `T` is preserved through the scope's lifetime.\n  readonly __t?: T\n}\n\nexport type ScopeOptions<T> = {\n  default?: T\n  name?: string\n}\n\n/**\n * Create a scope. The returned value is the typed handle passed to\n * `ctx.provide(scope, value)` and `ctx.inject(scope)`. Identity is keyed by\n * an internal symbol so two `defineScope()` calls — even with identical\n * options — yield distinct scopes.\n */\nexport function defineScope<T>(options?: ScopeOptions<T>): Scope<T> {\n  const hasDefault = options !== undefined && 'default' in options\n  const name = options?.name\n  const scope: Scope<T> = {\n    __olas: 'scope',\n    __id: Symbol(name ?? 'scope'),\n    hasDefault,\n    ...(name !== undefined ? { name } : {}),\n    ...(hasDefault ? { default: options?.default as T } : {}),\n  }\n  return scope\n}\n","import { computed, signal } from './signals'\nimport { readOnly } from './signals/readonly'\nimport type { ReadSignal } from './signals/types'\n\n/**\n * Multi-select state for tables / lists with bulk actions (spec §17.5).\n *\n * Plain function — not bound to `ctx`. Place it in a controller's closure so\n * it dies with the closure. The phantom `T` parameter brands the selection by\n * item type; IDs are always strings.\n */\n// biome-ignore lint/correctness/noUnusedVariables: phantom branding param (spec §17.5)\nexport type Selection<T = unknown> = {\n  selectedIds: ReadSignal<ReadonlySet<string>>\n  size: ReadSignal<number>\n  isSelected(id: string): ReadSignal<boolean>\n\n  select(id: string): void\n  deselect(id: string): void\n  toggle(id: string): void\n  clear(): void\n  selectAll(ids: readonly string[]): void\n\n  handleClick(\n    id: string,\n    mods: { shift?: boolean; meta?: boolean },\n    ordered: readonly string[],\n  ): void\n}\n\n/**\n * Create a `Selection<T>`. Optional `initial` seeds the selected set.\n *\n * `handleClick` encapsulates the standard click semantics:\n * - plain click → select only `id` (anchor moves to `id`)\n * - meta-click  → toggle `id` (anchor moves to `id` on add)\n * - shift-click → range from anchor to `id` along `ordered` (anchor sticks,\n *   so subsequent shift-clicks extend from the same origin)\n *\n * Spec §16.5 / §17.5.\n */\nexport function selection<T = unknown>(options?: { initial?: readonly string[] }): Selection<T> {\n  const ids = signal<ReadonlySet<string>>(new Set(options?.initial))\n  let anchor: string | null = options?.initial?.length\n    ? (options.initial[options.initial.length - 1] ?? null)\n    : null\n  // Snapshot of the selection just before the first shift-click of a run.\n  // Subsequent shift-clicks re-compute the range against this snapshot so the\n  // user can shrink or grow the range. Reset on any non-shift click.\n  let preShiftSelection: ReadonlySet<string> | null = null\n\n  const size = computed(() => ids.value.size)\n\n  const isSelected = (id: string): ReadSignal<boolean> => computed(() => ids.value.has(id))\n\n  const select = (id: string): void => {\n    const prev = ids.peek()\n    if (!prev.has(id)) {\n      const next = new Set(prev)\n      next.add(id)\n      ids.set(next)\n    }\n    anchor = id\n  }\n\n  const deselect = (id: string): void => {\n    const prev = ids.peek()\n    if (!prev.has(id)) return\n    const next = new Set(prev)\n    next.delete(id)\n    ids.set(next)\n  }\n\n  const toggle = (id: string): void => {\n    const prev = ids.peek()\n    const next = new Set(prev)\n    if (prev.has(id)) {\n      next.delete(id)\n    } else {\n      next.add(id)\n      anchor = id\n    }\n    ids.set(next)\n  }\n\n  const clear = (): void => {\n    if (ids.peek().size === 0) {\n      anchor = null\n      return\n    }\n    ids.set(new Set())\n    anchor = null\n  }\n\n  const selectAll = (incoming: readonly string[]): void => {\n    ids.set(new Set(incoming))\n    anchor = incoming.length > 0 ? (incoming[incoming.length - 1] ?? null) : null\n  }\n\n  const handleClick = (\n    id: string,\n    mods: { shift?: boolean; meta?: boolean },\n    ordered: readonly string[],\n  ): void => {\n    if (mods.shift && anchor !== null) {\n      const anchorIdx = ordered.indexOf(anchor)\n      const targetIdx = ordered.indexOf(id)\n      if (anchorIdx === -1 || targetIdx === -1) {\n        // anchor or target not visible — fall back to plain select\n        ids.set(new Set([id]))\n        anchor = id\n        preShiftSelection = null\n        return\n      }\n      if (preShiftSelection === null) {\n        preShiftSelection = ids.peek()\n      }\n      const [lo, hi] = anchorIdx < targetIdx ? [anchorIdx, targetIdx] : [targetIdx, anchorIdx]\n      const next = new Set(preShiftSelection)\n      for (const k of ordered.slice(lo, hi + 1)) next.add(k)\n      ids.set(next)\n      // Anchor stays — subsequent shift-clicks extend from the same origin.\n      return\n    }\n    // Any non-shift click ends the shift run.\n    preShiftSelection = null\n    if (mods.meta) {\n      toggle(id)\n      return\n    }\n    ids.set(new Set([id]))\n    anchor = id\n  }\n\n  return {\n    selectedIds: readOnly(ids),\n    size,\n    isSelected,\n    select,\n    deselect,\n    toggle,\n    clear,\n    selectAll,\n    handleClick,\n  }\n}\n","import { effect, signal } from '../signals'\nimport type { ReadSignal } from '../signals/types'\n\n/**\n * Lag a signal by `ms`. The returned signal updates only after the source has\n * been unchanged for `ms`. Each new write resets the timer.\n *\n * Pass `options.signal` (an `AbortSignal`) to tie the internal effect to a\n * lifecycle — when the signal aborts the effect disposes, the pending timer\n * clears, and the subscriber chain on `source` drops. Without `signal`, the\n * effect lives as long as `source` does; pass a signal whenever the source\n * outlives the consumer.\n */\nexport function debounced<T>(\n  source: ReadSignal<T>,\n  ms: number,\n  options?: { signal?: AbortSignal },\n): ReadSignal<T> {\n  const out = signal<T>(source.peek())\n  let timer: ReturnType<typeof setTimeout> | null = null\n  let initial = true\n\n  const dispose = effect(() => {\n    const value = source.value\n    if (initial) {\n      // The first effect run reads the source for tracking; we already\n      // initialized `out` to the same value, so skip scheduling.\n      initial = false\n      return\n    }\n    if (timer != null) clearTimeout(timer)\n    timer = setTimeout(() => {\n      out.set(value)\n      timer = null\n    }, ms)\n  })\n\n  const sig = options?.signal\n  if (sig) {\n    const stop = () => {\n      if (timer != null) {\n        clearTimeout(timer)\n        timer = null\n      }\n      dispose()\n    }\n    if (sig.aborted) stop()\n    else sig.addEventListener('abort', stop, { once: true })\n  }\n\n  return out\n}\n","import { effect, signal } from '../signals'\nimport type { ReadSignal } from '../signals/types'\n\n/**\n * Rate-limit a signal so it emits at most once per `ms` (leading + trailing).\n * The first change passes through immediately. Subsequent changes within the\n * window are coalesced; the latest value is emitted when the window expires.\n *\n * Pass `options.signal` to tie the internal effect to a lifecycle — when the\n * signal aborts the effect disposes and any pending trailing timer clears.\n * Without `signal`, the effect lives as long as `source` does.\n */\nexport function throttled<T>(\n  source: ReadSignal<T>,\n  ms: number,\n  options?: { signal?: AbortSignal },\n): ReadSignal<T> {\n  const out = signal<T>(source.peek())\n  let lastEmit = Number.NEGATIVE_INFINITY\n  let trailingTimer: ReturnType<typeof setTimeout> | null = null\n  let trailingValue: T = source.peek()\n  let initial = true\n\n  const dispose = effect(() => {\n    const value = source.value\n    if (initial) {\n      initial = false\n      return\n    }\n    const now = Date.now()\n    const elapsed = now - lastEmit\n    if (elapsed >= ms) {\n      out.set(value)\n      lastEmit = now\n      if (trailingTimer != null) {\n        clearTimeout(trailingTimer)\n        trailingTimer = null\n      }\n    } else {\n      trailingValue = value\n      if (trailingTimer == null) {\n        trailingTimer = setTimeout(() => {\n          out.set(trailingValue)\n          lastEmit = Date.now()\n          trailingTimer = null\n        }, ms - elapsed)\n      }\n    }\n  })\n\n  const sig = options?.signal\n  if (sig) {\n    const stop = () => {\n      if (trailingTimer != null) {\n        clearTimeout(trailingTimer)\n        trailingTimer = null\n      }\n      dispose()\n    }\n    if (sig.aborted) stop()\n    else sig.addEventListener('abort', stop, { once: true })\n  }\n\n  return out\n}\n"],"mappings":";;;;;;;;;;AASA,SAAgB,SAAY,QAAsC;CAChE,OAAO,OAAO,OAAO;EACnB,IAAI,QAAQ;GACV,OAAO,OAAO;EAChB;EACA,OAAO;GACL,OAAO,OAAO,KAAK;EACrB;EACA,UAAU,SAA6B;GACrC,OAAO,OAAO,UAAU,OAAO;EACjC;CACF,CAAC;AACH;;;;;;ACQA,SAAgB,iBAAiB,GAAqD;CACpF,OACE,MAAM,QACN,OAAO,MAAM,YACb,eAAe,KACf,OAAQ,EAA8C,cAAc,aAAa;AAErF;;;;;;;;;;;;;;;ACrBA,SAAgB,UAAgB,QAA8C;CAC5E,QAAQ,OAAO,WAAW;EAExB,MAAM,SAAS,OAAO,aAAa,SAAS,KAAK;EACjD,IAAI,kBAAkB,SACpB,OAAO,OAAO,KAAK,iBAAiB;EAEtC,OAAO,kBAAkB,MAAM;CACjC;AACF;AAEA,SAAS,kBAAkB,QAAwE;CACjG,IAAI,OAAO,WAAW,KAAA,KAAa,OAAO,OAAO,WAAW,GAAG,OAAO;CACtE,OAAO,OAAO,OAAO,IAAI,WAAW;AACtC;AAIA,MAAM,WAAW,UAA4B;CAC3C,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,IAAI,OAAO,UAAU,UAAU,OAAO,MAAM,WAAW;CACvD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,WAAW;CAClD,OAAO;AACT;;AAGA,MAAa,YACP,UAAU,gBACb,UACC,QAAQ,KAAK,IAAI,UAAU;;AAG/B,MAAa,aACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,MAAM,UAAU,GAAG,OAAO;CAC9B,OAAO,WAAW,oBAAoB,EAAE;AAC1C;;AAGF,MAAa,aACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,MAAM,UAAU,GAAG,OAAO;CAC9B,OAAO,WAAW,wBAAwB,EAAE;AAC9C;;AAGF,MAAa,OACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,SAAS,GAAG,OAAO;CACvB,OAAO,WAAW,oBAAoB;AACxC;;AAGF,MAAa,OACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,SAAS,GAAG,OAAO;CACvB,OAAO,WAAW,wBAAwB;AAC5C;AAIF,MAAM,WAAW;;AAGjB,MAAa,SACV,UAAU,6BACV,UAAU;CACT,IAAI,SAAS,QAAQ,UAAU,IAAI,OAAO;CAC1C,OAAO,SAAS,KAAK,KAAK,IAAI,OAAO;AACvC;;AAGF,MAAa,WACV,IAAY,UAAU,sBACtB,UAAU;CACT,IAAI,SAAS,QAAQ,UAAU,IAAI,OAAO;CAC1C,OAAO,GAAG,KAAK,KAAK,IAAI,OAAO;AACjC;;;ACxFF,SAAS,gBAAgB,MAAgD,OAAqB;CAC5F,IAAI,KAAK,WAAW,MAClB,aAAA,kBAAkB,KAAK,SAAS,KAAwB;MACnD,IAAI,KAAK,aAAa,MAAM,CAUnC;AACF;;;;;AAMA,SAAgB,YAAuC,MAA0C;CAC/F,MAAM,0BAAU,IAAI,IAAiB;CACrC,MAAM,QAAQ;EACZ,QAAQ;EACR,QAAQ;EACR,WAAW;EAEX,WAAW,GAAG,MAAkB;GAC9B,KAAK,MAAM,UAAU,SACnB,OAAO,WAAW,OAAyB,IAAI;EAEnD;EAEA,gBAAsB;GACpB,KAAK,MAAM,UAAU,SACnB,OAAO,cAAc,KAAuB;EAEhD;EAEA,QAAQ,GAAG,MAAgE;GACzE,MAAM,UAAU,KAAK,KAAK,SAAS;GACnC,MAAM,UAAU,KAAK,MAAM,GAAG,EAAE;GAChC,MAAM,iBAA6B,CAAC;GACpC,KAAK,MAAM,UAAU,SACnB,eAAe,KAAK,OAAO,QAAQ,OAAyB,SAAS,OAAO,CAAC;GAE/E,OAAO;IACL,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;IACA,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;GACF;EACF;EAEA,SAAS,GAAG,MAAwB;GAElC,MAAM,CAAC,SAAS;GAChB,IAAI,CAAC,OACH,OAAO,QAAQ,uBAAO,IAAI,MAAM,uDAAuD,CAAC;GAS1F,OAAO,MAAM,SAAS,OAAyB,IAAI;EACrD;CACF;CAEA,gBAAgB,MAAM,KAAK;CAC3B,OAAO;AACT;;;;;;;;AAkBA,SAAgB,oBACd,MACmC;CACnC,MAAM,0BAAU,IAAI,IAAiB;CACrC,MAAM,QAAQ;EACZ,QAAQ;EACR,QAAQ;EACR,WAAW;EAEX,WAAW,GAAG,MAAkB;GAC9B,KAAK,MAAM,UAAU,SACnB,OAAO,mBAAmB,OAA4C,IAAI;EAE9E;EAEA,gBAAsB;GACpB,KAAK,MAAM,UAAU,SACnB,OAAO,sBAAsB,KAA0C;EAE3E;EAEA,QAAQ,GAAG,MAA4E;GACrF,MAAM,UAAU,KAAK,KAAK,SAAS;GACnC,MAAM,UAAU,KAAK,MAAM,GAAG,EAAE;GAChC,MAAM,iBAA6B,CAAC;GACpC,KAAK,MAAM,UAAU,SACnB,eAAe,KACb,OAAO,gBACL,OACA,SACA,OACF,CACF;GAEF,OAAO;IACL,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;IACA,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;GACF;EACF;EAEA,SAAS,GAAG,MAA4B;GACtC,MAAM,CAAC,SAAS;GAChB,IAAI,CAAC,OACH,OAAO,QAAQ,uBAAO,IAAI,MAAM,uDAAuD,CAAC;GAS1F,OAAO,MAAM,iBAAiB,OAA4C,IAAI;EAChF;CACF;CAEA,gBAAgB,MAAM,KAAK;CAC3B,OAAO;AACT;;;;;;;;;ACzIA,SAAgB,YAAe,SAAqC;CAClE,MAAM,aAAa,YAAY,KAAA,KAAa,aAAa;CACzD,MAAM,OAAO,SAAS;CAQtB,OAAO;EANL,QAAQ;EACR,MAAM,OAAO,QAAQ,OAAO;EAC5B;EACA,GAAI,SAAS,KAAA,IAAY,EAAE,KAAK,IAAI,CAAC;EACrC,GAAI,aAAa,EAAE,SAAS,SAAS,QAAa,IAAI,CAAC;CAE9C;AACb;;;;;;;;;;;;;;ACAA,SAAgB,UAAuB,SAAyD;CAC9F,MAAM,MAAMA,aAAAA,OAA4B,IAAI,IAAI,SAAS,OAAO,CAAC;CACjE,IAAI,SAAwB,SAAS,SAAS,SACzC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,MAAM,OAChD;CAIJ,IAAI,oBAAgD;CAEpD,MAAM,OAAOC,aAAAA,eAAe,IAAI,MAAM,IAAI;CAE1C,MAAM,cAAc,OAAoCA,aAAAA,eAAe,IAAI,MAAM,IAAI,EAAE,CAAC;CAExF,MAAM,UAAU,OAAqB;EACnC,MAAM,OAAO,IAAI,KAAK;EACtB,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG;GACjB,MAAM,OAAO,IAAI,IAAI,IAAI;GACzB,KAAK,IAAI,EAAE;GACX,IAAI,IAAI,IAAI;EACd;EACA,SAAS;CACX;CAEA,MAAM,YAAY,OAAqB;EACrC,MAAM,OAAO,IAAI,KAAK;EACtB,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG;EACnB,MAAM,OAAO,IAAI,IAAI,IAAI;EACzB,KAAK,OAAO,EAAE;EACd,IAAI,IAAI,IAAI;CACd;CAEA,MAAM,UAAU,OAAqB;EACnC,MAAM,OAAO,IAAI,KAAK;EACtB,MAAM,OAAO,IAAI,IAAI,IAAI;EACzB,IAAI,KAAK,IAAI,EAAE,GACb,KAAK,OAAO,EAAE;OACT;GACL,KAAK,IAAI,EAAE;GACX,SAAS;EACX;EACA,IAAI,IAAI,IAAI;CACd;CAEA,MAAM,cAAoB;EACxB,IAAI,IAAI,KAAK,EAAE,SAAS,GAAG;GACzB,SAAS;GACT;EACF;EACA,IAAI,oBAAI,IAAI,IAAI,CAAC;EACjB,SAAS;CACX;CAEA,MAAM,aAAa,aAAsC;EACvD,IAAI,IAAI,IAAI,IAAI,QAAQ,CAAC;EACzB,SAAS,SAAS,SAAS,IAAK,SAAS,SAAS,SAAS,MAAM,OAAQ;CAC3E;CAEA,MAAM,eACJ,IACA,MACA,YACS;EACT,IAAI,KAAK,SAAS,WAAW,MAAM;GACjC,MAAM,YAAY,QAAQ,QAAQ,MAAM;GACxC,MAAM,YAAY,QAAQ,QAAQ,EAAE;GACpC,IAAI,cAAc,MAAM,cAAc,IAAI;IAExC,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;IACrB,SAAS;IACT,oBAAoB;IACpB;GACF;GACA,IAAI,sBAAsB,MACxB,oBAAoB,IAAI,KAAK;GAE/B,MAAM,CAAC,IAAI,MAAM,YAAY,YAAY,CAAC,WAAW,SAAS,IAAI,CAAC,WAAW,SAAS;GACvF,MAAM,OAAO,IAAI,IAAI,iBAAiB;GACtC,KAAK,MAAM,KAAK,QAAQ,MAAM,IAAI,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC;GACrD,IAAI,IAAI,IAAI;GAEZ;EACF;EAEA,oBAAoB;EACpB,IAAI,KAAK,MAAM;GACb,OAAO,EAAE;GACT;EACF;EACA,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;EACrB,SAAS;CACX;CAEA,OAAO;EACL,aAAa,SAAS,GAAG;EACzB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;;;;;ACpIA,SAAgB,UACd,QACA,IACA,SACe;CACf,MAAM,MAAMC,aAAAA,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,QAA8C;CAClD,IAAI,UAAU;CAEd,MAAM,UAAUC,aAAAA,aAAa;EAC3B,MAAM,QAAQ,OAAO;EACrB,IAAI,SAAS;GAGX,UAAU;GACV;EACF;EACA,IAAI,SAAS,MAAM,aAAa,KAAK;EACrC,QAAQ,iBAAiB;GACvB,IAAI,IAAI,KAAK;GACb,QAAQ;EACV,GAAG,EAAE;CACP,CAAC;CAED,MAAM,MAAM,SAAS;CACrB,IAAI,KAAK;EACP,MAAM,aAAa;GACjB,IAAI,SAAS,MAAM;IACjB,aAAa,KAAK;IAClB,QAAQ;GACV;GACA,QAAQ;EACV;EACA,IAAI,IAAI,SAAS,KAAK;OACjB,IAAI,iBAAiB,SAAS,MAAM,EAAE,MAAM,KAAK,CAAC;CACzD;CAEA,OAAO;AACT;;;;;;;;;;;;ACvCA,SAAgB,UACd,QACA,IACA,SACe;CACf,MAAM,MAAMC,aAAAA,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,WAAW,OAAO;CACtB,IAAI,gBAAsD;CAC1D,IAAI,gBAAmB,OAAO,KAAK;CACnC,IAAI,UAAU;CAEd,MAAM,UAAUC,aAAAA,aAAa;EAC3B,MAAM,QAAQ,OAAO;EACrB,IAAI,SAAS;GACX,UAAU;GACV;EACF;EACA,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,UAAU,MAAM;EACtB,IAAI,WAAW,IAAI;GACjB,IAAI,IAAI,KAAK;GACb,WAAW;GACX,IAAI,iBAAiB,MAAM;IACzB,aAAa,aAAa;IAC1B,gBAAgB;GAClB;EACF,OAAO;GACL,gBAAgB;GAChB,IAAI,iBAAiB,MACnB,gBAAgB,iBAAiB;IAC/B,IAAI,IAAI,aAAa;IACrB,WAAW,KAAK,IAAI;IACpB,gBAAgB;GAClB,GAAG,KAAK,OAAO;EAEnB;CACF,CAAC;CAED,MAAM,MAAM,SAAS;CACrB,IAAI,KAAK;EACP,MAAM,aAAa;GACjB,IAAI,iBAAiB,MAAM;IACzB,aAAa,aAAa;IAC1B,gBAAgB;GAClB;GACA,QAAQ;EACV;EACA,IAAI,IAAI,SAAS,KAAK;OACjB,IAAI,iBAAiB,SAAS,MAAM,EAAE,MAAM,KAAK,CAAC;CACzD;CAEA,OAAO;AACT"}
+{"version":3,"file":"index.cjs","names":["signal","computed","readOnly","signal","effect","readOnly","signal","effect","readOnly"],"sources":["../src/forms/standard-schema.ts","../src/forms/validators.ts","../src/query/define.ts","../src/scope.ts","../src/selection.ts","../src/timing/debounced.ts","../src/timing/throttled.ts"],"sourcesContent":["/**\n * Standard Schema v1 — the cross-library validation contract adopted by\n * Zod 4, Valibot 1, ArkType 2, and others. See https://standardschema.dev.\n *\n * We type-only-import the shape so consumers don't take a new runtime dep:\n * any object with a `~standard.validate(value)` method conforming to this\n * structure works.\n */\nexport type StandardSchemaV1Issue = {\n  readonly message: string\n  readonly path?: ReadonlyArray<PropertyKey | { readonly key: PropertyKey }>\n}\n\nexport type StandardSchemaV1Result<O> =\n  | { readonly value: O; readonly issues?: undefined }\n  | { readonly issues: ReadonlyArray<StandardSchemaV1Issue> }\n\nexport type StandardSchemaV1<I = unknown, O = I> = {\n  readonly '~standard': {\n    readonly version: 1\n    readonly vendor: string\n    validate(value: unknown): StandardSchemaV1Result<O> | Promise<StandardSchemaV1Result<O>>\n    readonly types?: { readonly input: I; readonly output: O } | undefined\n  }\n}\n\n/**\n * Heuristic: does `x` look like a Standard Schema?\n */\nexport function isStandardSchema(x: unknown): x is StandardSchemaV1<unknown, unknown> {\n  return (\n    x !== null &&\n    typeof x === 'object' &&\n    '~standard' in x &&\n    typeof (x as { '~standard': { validate?: unknown } })['~standard']?.validate === 'function'\n  )\n}\n","import type { StandardSchemaV1, StandardSchemaV1Issue } from './standard-schema'\nimport type { FormIssue, Validator } from './types'\n\n/**\n * Wrap any Standard-Schema-compatible schema (Zod 4, Valibot 1, ArkType 2,\n * …) as an Olas validator. Returns **all** issues as `FormIssue[]`, each\n * carrying the schema's own `path` — so a whole-form schema used as a\n * form-level validator routes each issue onto the matching field (T5.2),\n * and a leaf schema (whose issues have empty paths) still reports on the\n * field it's attached to. An empty array means \"valid\".\n *\n * Standard Schema validators may be sync or async; this wrapper threads\n * through whichever the schema returns — `Promise<FormIssue[]>` only when\n * the underlying validate call is itself async.\n *\n * `signal` is accepted to match the `Validator<T>` shape but isn't forwarded\n * — Standard Schema v1 has no cancellation surface.\n */\nexport function validator<I, O>(schema: StandardSchemaV1<I, O>): Validator<I> {\n  return (value, signal) => {\n    void signal\n    const result = schema['~standard'].validate(value)\n    if (result instanceof Promise) {\n      return result.then(issuesFromResult)\n    }\n    return issuesFromResult(result)\n  }\n}\n\nfunction issuesFromResult(result: { issues?: ReadonlyArray<StandardSchemaV1Issue> }): FormIssue[] {\n  if (result.issues === undefined || result.issues.length === 0) return []\n  return result.issues.map((issue) => ({\n    path: normalizeIssuePath(issue.path),\n    message: issue.message ?? 'Invalid',\n  }))\n}\n\n/**\n * Standard Schema issue paths are `(PropertyKey | { key: PropertyKey })[]`.\n * Flatten to the `(string | number)[]` shape `FormIssue` uses: numeric keys\n * stay numeric (array indices), everything else stringifies.\n */\nfunction normalizeIssuePath(path: StandardSchemaV1Issue['path']): (string | number)[] {\n  if (path === undefined) return []\n  const out: (string | number)[] = []\n  for (const seg of path) {\n    const key = typeof seg === 'object' && seg !== null ? seg.key : seg\n    out.push(typeof key === 'number' ? key : String(key))\n  }\n  return out\n}\n\nexport { isStandardSchema, type StandardSchemaV1 } from './standard-schema'\n\nconst isEmpty = (value: unknown): boolean => {\n  if (value === undefined || value === null) return true\n  if (typeof value === 'string') return value.length === 0\n  if (Array.isArray(value)) return value.length === 0\n  // A boolean `false` is a legitimate value (a toggle set to \"off\"), NOT empty\n  // — `required` accepts it. For a consent / confirm checkbox that MUST be\n  // ticked, use `mustBeTrue` instead (T5.3).\n  return false\n}\n\n/** Reject empty values (undefined, null, empty string, empty array). Booleans always pass. */\nexport const required =\n  <T>(message = 'Required'): Validator<T> =>\n  (value) =>\n    isEmpty(value) ? message : null\n\n/**\n * Reject any value that isn't boolean `true` — the \"you must check this box\"\n * rule for consent / terms-of-service / confirm checkboxes. Unlike `required`\n * (which now accepts `false` as a valid boolean), this fails on `false`.\n */\nexport const mustBeTrue =\n  (message = 'Required'): Validator<boolean> =>\n  (value) =>\n    value === true ? null : message\n\n/** Reject strings / arrays shorter than `n`. Allows null/undefined (use with `required` to forbid). */\nexport const minLength =\n  (n: number, message?: string): Validator<string | readonly unknown[]> =>\n  (value) => {\n    if (value == null) return null\n    if (value.length >= n) return null\n    return message ?? `Must be at least ${n} characters`\n  }\n\n/** Reject strings / arrays longer than `n`. */\nexport const maxLength =\n  (n: number, message?: string): Validator<string | readonly unknown[]> =>\n  (value) => {\n    if (value == null) return null\n    if (value.length <= n) return null\n    return message ?? `Must be no more than ${n} characters`\n  }\n\n/** Reject numbers less than `n`. */\nexport const min =\n  (n: number, message?: string): Validator<number> =>\n  (value) => {\n    if (value == null) return null\n    if (value >= n) return null\n    return message ?? `Must be at least ${n}`\n  }\n\n/** Reject numbers greater than `n`. */\nexport const max =\n  (n: number, message?: string): Validator<number> =>\n  (value) => {\n    if (value == null) return null\n    if (value <= n) return null\n    return message ?? `Must be no more than ${n}`\n  }\n\n// RFC-5322-light. Pragmatic, not exhaustive — production forms should\n// rely on server-side validation for definitive answers.\nconst EMAIL_RE = /^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/\n\n/** Reject strings that don't look like an email. Empty / null pass (use with `required` to forbid). */\nexport const email =\n  (message = 'Invalid email address'): Validator<string> =>\n  (value) => {\n    if (value == null || value === '') return null\n    return EMAIL_RE.test(value) ? null : message\n  }\n\n/** Reject strings that don't match the supplied `RegExp`. */\nexport const pattern =\n  (re: RegExp, message = 'Invalid format'): Validator<string> =>\n  (value) => {\n    if (value == null || value === '') return null\n    return re.test(value) ? null : message\n  }\n","import type { QueryClient } from './client'\nimport type { InfiniteQuery, InfiniteQuerySpec } from './infinite'\nimport { type RegisteredQuery, registerQueryById } from './plugin'\nimport type { Query, QuerySpec, Snapshot } from './types'\n\ntype QueryInternal<Args extends unknown[], T> = Query<Args, T> & {\n  readonly __spec: QuerySpec<Args, T>\n  /** Stable identity for SSR hydration matching — see `assignQueryId`. */\n  readonly __id: string\n  __clients: Set<QueryClient>\n}\n\nconst warnedMissingId = new WeakSet<object>()\n\n/**\n * Assign a stable identity used to namespace SSR dehydrate/hydrate so a\n * subscriber of one query can't adopt a colliding-key payload from another\n * (spec §15). Prefer the explicit `queryId` (which doubles as the plugin\n * routing id, so `__id === queryId` there); otherwise auto-assign a\n * registration id. Auto ids are stable across a server/client pair that\n * evaluate the same bundle in the same order (the common, non-code-split\n * case). If they ever drift (code-split, differing import order), the\n * mismatch degrades *safely* to a hydration miss + refetch — never a\n * cross-query adoption. Set an explicit `queryId` for a hard guarantee. The\n * `\u0000` prefix keeps auto ids out of the practical user-string namespace (JSON-safe).\n */\nlet autoQueryIdCounter = 0\nfunction assignQueryId(spec: { queryId?: string }): string {\n  return spec.queryId ?? `\u0000auto:${autoQueryIdCounter++}`\n}\n\nfunction registerQueryId(\n  // The param stays wide so a JS / cast caller passing a removed value is\n  // caught at runtime; the PUBLIC `QuerySpec.crossTab` type is `boolean | 'data'`.\n  spec: { queryId?: string; crossTab?: boolean | 'data' | 'infinite' | 'both' },\n  query: object,\n): void {\n  if (__DEV__ && (spec.crossTab === 'infinite' || spec.crossTab === 'both')) {\n    // Removed in T6.4: core's `applyRemoteSetData` / `applyRemoteInvalidate`\n    // early-return for infinite (non-`'query'`) defs, so an infinite/both\n    // broadcast was pure channel noise no peer could apply. Degrade to `'data'`\n    // (regular writes still sync). Infinite cross-tab is tracked in BACKLOG.md.\n    console.warn(\n      \"[olas] crossTab: 'infinite' / 'both' is no longer supported — peers can't apply \" +\n        \"infinite-query page arrays cross-tab. Treated as 'data' (regular writes still sync).\",\n    )\n  }\n  if (spec.queryId != null) {\n    registerQueryById(spec.queryId, query as RegisteredQuery)\n  } else if (spec.crossTab === true) {\n    // Plugins can't route a message without a `queryId`. Warn once per\n    // offending spec — repeated warnings on every render would be noisy.\n    if (__DEV__ && !warnedMissingId.has(spec as object)) {\n      warnedMissingId.add(spec as object)\n      console.warn(\n        '[olas] defineQuery({ crossTab: true }) requires a stable `queryId`. ' +\n          'Add `queryId: \"<unique-string>\"` to the spec. Cross-tab sync is disabled for this query.',\n      )\n    }\n  }\n}\n\n/**\n * Define a keyed, shared query. The returned Query value lives at module\n * scope; per-root QueryClients bind their own entry registries to it.\n */\nexport function defineQuery<Args extends unknown[], T>(spec: QuerySpec<Args, T>): Query<Args, T> {\n  const clients = new Set<QueryClient>()\n  const query = {\n    __olas: 'query' as const,\n    __spec: spec,\n    __id: assignQueryId(spec),\n    __clients: clients,\n\n    invalidate(...args: Args): void {\n      for (const client of clients) {\n        client.invalidate(query as Query<Args, T>, args)\n      }\n    },\n\n    invalidateAll(): void {\n      for (const client of clients) {\n        client.invalidateAll(query as Query<Args, T>)\n      }\n    },\n\n    cancel(...args: Args): void {\n      for (const client of clients) {\n        client.cancel(query as Query<Args, T>, args)\n      }\n    },\n\n    cancelAll(): void {\n      for (const client of clients) {\n        client.cancelAll(query as Query<Args, T>)\n      }\n    },\n\n    setData(...rest: [...Args, updater: (prev: T | undefined) => T]): Snapshot {\n      const updater = rest[rest.length - 1] as (prev: T | undefined) => T\n      const keyArgs = rest.slice(0, -1) as unknown as Args\n      const childSnapshots: Snapshot[] = []\n      for (const client of clients) {\n        childSnapshots.push(client.setData(query as Query<Args, T>, keyArgs, updater))\n      }\n      return {\n        rollback: () => {\n          for (const s of childSnapshots) s.rollback()\n        },\n        finalize: () => {\n          for (const s of childSnapshots) s.finalize()\n        },\n      }\n    },\n\n    prefetch(...args: Args): Promise<T> {\n      // Single-client common case; if none, throw.\n      const [first] = clients\n      if (!first) {\n        return Promise.reject(new Error('[olas] prefetch called before any root has subscribed'))\n      }\n      if (__DEV__ && clients.size > 1) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          '[olas] query.prefetch() is ambiguous when multiple roots are registered; ' +\n            'using an arbitrary root. Call `root.prefetch(query, args)` (or per-root) to be explicit.',\n        )\n      }\n      return first.prefetch(query as Query<Args, T>, args)\n    },\n  } satisfies QueryInternal<Args, T>\n\n  registerQueryId(spec, query)\n  return query as Query<Args, T>\n}\n\ntype InfiniteQueryInternal<Args extends unknown[], TPage, TItem> = InfiniteQuery<\n  Args,\n  TPage,\n  TItem\n> & {\n  readonly __spec: InfiniteQuerySpec<Args, any, TPage, TItem>\n  /** Stable identity for SSR hydration matching — see `assignQueryId`. */\n  readonly __id: string\n  __clients: Set<QueryClient>\n}\n\n/**\n * Define a paginated query (chat-style \"load more\", infinite scrolling). Pages\n * are kept in order and concatenated via `getNextPageParam` /\n * `getPreviousPageParam`. The returned handle is module-scoped — bind\n * subscribers via `ctx.use(infiniteQuery, () => [...args])`. Spec §5.7,\n * §20.4.\n */\nexport function defineInfiniteQuery<Args extends unknown[], PageParam, TPage, TItem = TPage>(\n  spec: InfiniteQuerySpec<Args, PageParam, TPage, TItem>,\n): InfiniteQuery<Args, TPage, TItem> {\n  const clients = new Set<QueryClient>()\n  const query = {\n    __olas: 'infiniteQuery' as const,\n    __spec: spec,\n    __id: assignQueryId(spec),\n    __clients: clients,\n\n    invalidate(...args: Args): void {\n      for (const client of clients) {\n        client.invalidateInfinite(query as InfiniteQuery<Args, TPage, TItem>, args)\n      }\n    },\n\n    invalidateAll(): void {\n      for (const client of clients) {\n        client.invalidateAllInfinite(query as InfiniteQuery<Args, TPage, TItem>)\n      }\n    },\n\n    cancel(...args: Args): void {\n      for (const client of clients) {\n        client.cancelInfinite(query as InfiniteQuery<Args, TPage, TItem>, args)\n      }\n    },\n\n    cancelAll(): void {\n      for (const client of clients) {\n        client.cancelAllInfinite(query as InfiniteQuery<Args, TPage, TItem>)\n      }\n    },\n\n    setData(...rest: [...Args, updater: (prev: TPage[] | undefined) => TPage[]]): Snapshot {\n      const updater = rest[rest.length - 1] as (prev: TPage[] | undefined) => TPage[]\n      const keyArgs = rest.slice(0, -1) as unknown as Args\n      const childSnapshots: Snapshot[] = []\n      for (const client of clients) {\n        childSnapshots.push(\n          client.setInfiniteData<Args, TPage>(\n            query as InfiniteQuery<Args, TPage, TItem>,\n            keyArgs,\n            updater,\n          ),\n        )\n      }\n      return {\n        rollback: () => {\n          for (const s of childSnapshots) s.rollback()\n        },\n        finalize: () => {\n          for (const s of childSnapshots) s.finalize()\n        },\n      }\n    },\n\n    prefetch(...args: Args): Promise<TPage> {\n      const [first] = clients\n      if (!first) {\n        return Promise.reject(new Error('[olas] prefetch called before any root has subscribed'))\n      }\n      if (__DEV__ && clients.size > 1) {\n        // eslint-disable-next-line no-console\n        console.warn(\n          '[olas] infiniteQuery.prefetch() is ambiguous when multiple roots are registered; ' +\n            'using an arbitrary root. Call `root.prefetch(query, args)` (or per-root) to be explicit.',\n        )\n      }\n      return first.prefetchInfinite(query as InfiniteQuery<Args, TPage, TItem>, args)\n    },\n  } satisfies InfiniteQueryInternal<Args, TPage, TItem>\n\n  registerQueryId(spec, query)\n  return query as InfiniteQuery<Args, TPage, TItem>\n}\n","/**\n * Typed cross-tree data slot. Provided by an ancestor via `ctx.provide(scope, value)`\n * and consumed anywhere in its subtree via `ctx.inject(scope)`. Defined at module\n * scope so the identity is stable across calls. See spec §10.3.\n */\nexport type Scope<T> = {\n  readonly __olas: 'scope'\n  /** Per-scope identity; matches across `provide` / `inject`. */\n  readonly __id: symbol\n  /** Optional human-readable name (used in error messages). */\n  readonly name?: string\n  /** Default value used when no provider exists; `undefined` if none was set. */\n  readonly default?: T\n  /** True iff `defineScope` was called with a `default` (even `default: undefined`). */\n  readonly hasDefault: boolean\n  // Phantom for inference — typed `T` is preserved through the scope's lifetime.\n  readonly __t?: T\n}\n\nexport type ScopeOptions<T> = {\n  default?: T\n  name?: string\n}\n\n/**\n * Create a scope. The returned value is the typed handle passed to\n * `ctx.provide(scope, value)` and `ctx.inject(scope)`. Identity is keyed by\n * an internal symbol so two `defineScope()` calls — even with identical\n * options — yield distinct scopes.\n */\nexport function defineScope<T>(options?: ScopeOptions<T>): Scope<T> {\n  const hasDefault = options !== undefined && 'default' in options\n  const name = options?.name\n  const scope: Scope<T> = {\n    __olas: 'scope',\n    __id: Symbol(name ?? 'scope'),\n    hasDefault,\n    ...(name !== undefined ? { name } : {}),\n    ...(hasDefault ? { default: options?.default as T } : {}),\n  }\n  return scope\n}\n","import { computed, signal } from './signals'\nimport { readOnly } from './signals/readonly'\nimport type { ReadSignal } from './signals/types'\n\n/**\n * Multi-select state for tables / lists with bulk actions (spec §17.5).\n *\n * Plain function — not bound to `ctx`. Place it in a controller's closure so\n * it dies with the closure. The phantom `T` parameter brands the selection by\n * item type; IDs are always strings.\n */\n// biome-ignore lint/correctness/noUnusedVariables: phantom branding param (spec §17.5)\nexport type Selection<T = unknown> = {\n  selectedIds: ReadSignal<ReadonlySet<string>>\n  size: ReadSignal<number>\n  isSelected(id: string): ReadSignal<boolean>\n\n  select(id: string): void\n  deselect(id: string): void\n  toggle(id: string): void\n  clear(): void\n  selectAll(ids: readonly string[]): void\n\n  handleClick(\n    id: string,\n    mods: { shift?: boolean; meta?: boolean },\n    ordered: readonly string[] | ReadonlyMap<string, number>,\n  ): void\n}\n\n/**\n * Create a `Selection<T>`. Optional `initial` seeds the selected set.\n *\n * `handleClick` encapsulates the standard click semantics:\n * - plain click → select only `id` (anchor moves to `id`)\n * - meta-click  → toggle `id` (anchor moves to `id` on add)\n * - shift-click → range from anchor to `id` along `ordered` (anchor sticks,\n *   so subsequent shift-clicks extend from the same origin)\n *\n * Spec §16.5 / §17.5.\n */\nexport function selection<T = unknown>(options?: { initial?: readonly string[] }): Selection<T> {\n  const ids = signal<ReadonlySet<string>>(new Set(options?.initial))\n  let anchor: string | null = options?.initial?.length\n    ? (options.initial[options.initial.length - 1] ?? null)\n    : null\n  // Snapshot of the selection just before the first shift-click of a run.\n  // Subsequent shift-clicks re-compute the range against this snapshot so the\n  // user can shrink or grow the range. Reset on any non-shift click.\n  let preShiftSelection: ReadonlySet<string> | null = null\n\n  const size = computed(() => ids.value.size)\n\n  const isSelected = (id: string): ReadSignal<boolean> => computed(() => ids.value.has(id))\n\n  const select = (id: string): void => {\n    const prev = ids.peek()\n    if (!prev.has(id)) {\n      const next = new Set(prev)\n      next.add(id)\n      ids.set(next)\n    }\n    anchor = id\n  }\n\n  const deselect = (id: string): void => {\n    const prev = ids.peek()\n    if (!prev.has(id)) return\n    const next = new Set(prev)\n    next.delete(id)\n    ids.set(next)\n    // Clear the anchor if we just removed it — a subsequent shift-click\n    // would otherwise range from an id that's no longer in the selection.\n    if (anchor === id) anchor = null\n  }\n\n  const toggle = (id: string): void => {\n    const prev = ids.peek()\n    const next = new Set(prev)\n    if (prev.has(id)) {\n      next.delete(id)\n    } else {\n      next.add(id)\n      anchor = id\n    }\n    ids.set(next)\n  }\n\n  const clear = (): void => {\n    if (ids.peek().size === 0) {\n      anchor = null\n      return\n    }\n    ids.set(new Set())\n    anchor = null\n  }\n\n  const selectAll = (incoming: readonly string[]): void => {\n    ids.set(new Set(incoming))\n    anchor = incoming.length > 0 ? (incoming[incoming.length - 1] ?? null) : null\n  }\n\n  const handleClick = (\n    id: string,\n    mods: { shift?: boolean; meta?: boolean },\n    ordered: readonly string[] | ReadonlyMap<string, number>,\n  ): void => {\n    if (mods.shift && anchor !== null) {\n      // Accept either a positional array (back-compat, O(n) lookup) OR a\n      // precomputed `Map<id, index>` for O(1) shift-click on large lists\n      // (a 100k-row virtualized table doesn't want to scan the array twice\n      // per click). The caller decides which to pass — `Map` is cheap to\n      // build once when the row list changes.\n      let anchorIdx: number\n      let targetIdx: number\n      let slice: readonly string[]\n      if (Array.isArray(ordered)) {\n        const arr = ordered as readonly string[]\n        anchorIdx = arr.indexOf(anchor)\n        targetIdx = arr.indexOf(id)\n        if (anchorIdx === -1 || targetIdx === -1) {\n          ids.set(new Set([id]))\n          anchor = id\n          preShiftSelection = null\n          return\n        }\n        const [lo, hi] = anchorIdx < targetIdx ? [anchorIdx, targetIdx] : [targetIdx, anchorIdx]\n        slice = arr.slice(lo, hi + 1)\n      } else {\n        const map = ordered as ReadonlyMap<string, number>\n        anchorIdx = map.get(anchor) ?? -1\n        targetIdx = map.get(id) ?? -1\n        if (anchorIdx === -1 || targetIdx === -1) {\n          ids.set(new Set([id]))\n          anchor = id\n          preShiftSelection = null\n          return\n        }\n        const [lo, hi] = anchorIdx < targetIdx ? [anchorIdx, targetIdx] : [targetIdx, anchorIdx]\n        // The Map gives O(1) index lookup. To materialise the range we\n        // still need keys at [lo, hi]; iterate the insertion-ordered Map\n        // once and bail when we've collected enough. The 0..hi prefix is\n        // O(hi) — bounded by the range length, not the full list.\n        const keys: string[] = []\n        let i = 0\n        for (const k of map.keys()) {\n          if (i >= lo && i <= hi) keys.push(k)\n          if (i >= hi) break\n          i += 1\n        }\n        slice = keys\n      }\n      if (preShiftSelection === null) {\n        preShiftSelection = ids.peek()\n      }\n      const next = new Set(preShiftSelection)\n      for (const k of slice) next.add(k)\n      ids.set(next)\n      // Anchor stays — subsequent shift-clicks extend from the same origin.\n      return\n    }\n    // Any non-shift click ends the shift run.\n    preShiftSelection = null\n    if (mods.meta) {\n      toggle(id)\n      return\n    }\n    ids.set(new Set([id]))\n    anchor = id\n  }\n\n  return {\n    selectedIds: readOnly(ids),\n    size,\n    isSelected,\n    select,\n    deselect,\n    toggle,\n    clear,\n    selectAll,\n    handleClick,\n  }\n}\n","import { effect, signal } from '../signals'\nimport { readOnly } from '../signals/readonly'\nimport type { ReadSignal } from '../signals/types'\n\n/**\n * A `ReadSignal<T>` returned by `debounced` / `throttled`. Extends the\n * subscription surface with manual `cancel()` and `flush()`.\n *\n * - `cancel()` drops any pending emission without firing. Useful when a\n *   navigation away from the screen should discard the latest in-flight\n *   draft instead of writing it through to the debounced output.\n * - `flush()` immediately emits the pending value (if any). Useful at\n *   submit time: \"commit whatever the user just typed without waiting\n *   for the debounce timer to fire.\"\n *\n * Both are no-ops when nothing is pending.\n */\nexport type TimingSignal<T> = ReadSignal<T> & {\n  cancel(): void\n  flush(): void\n  /**\n   * Tear down the internal effect (drop the subscription to `source`) and\n   * clear any pending timer. Idempotent. Call this when the timing signal\n   * has no `options.signal` tying its lifecycle to an AbortController —\n   * otherwise the effect keeps `source` subscribed forever.\n   */\n  dispose(): void\n}\n\n/**\n * Lag a signal by `ms`. The returned signal updates only after the source has\n * been unchanged for `ms`. Each new write resets the timer.\n *\n * - `leading: true` (default `false`) emits immediately on the first write,\n *   then suppresses further writes until `ms` has passed since the last\n *   emission. Combine with trailing (default `true`) for \"first + last\"\n *   semantics.\n * - `trailing: false` disables the trailing emission. Pair with\n *   `leading: true` for \"only fire on the leading edge\" semantics.\n * - `options.signal` (`AbortSignal`) ties the internal effect to a\n *   lifecycle — when the signal aborts the effect disposes, the pending\n *   timer clears, and the subscriber chain on `source` drops.\n */\nexport function debounced<T>(\n  source: ReadSignal<T>,\n  ms: number,\n  options?: { signal?: AbortSignal; leading?: boolean; trailing?: boolean },\n): TimingSignal<T> {\n  const leading = options?.leading ?? false\n  const trailing = options?.trailing ?? true\n  if (!leading && !trailing) {\n    throw new Error(\n      '[olas] debounced: at least one of `leading` or `trailing` must be true (both false never emits).',\n    )\n  }\n  const out = signal<T>(source.peek())\n  let timer: ReturnType<typeof setTimeout> | null = null\n  let pendingValue: T = source.peek()\n  let hasPending = false\n  let initial = true\n  let inCooldown = false\n\n  const fireTrailing = () => {\n    timer = null\n    inCooldown = false\n    if (hasPending && trailing) {\n      out.set(pendingValue)\n      hasPending = false\n    }\n  }\n\n  const disposeEffect = effect(() => {\n    const value = source.value\n    if (initial) {\n      initial = false\n      return\n    }\n    pendingValue = value\n    if (timer != null) clearTimeout(timer)\n    if (leading && !inCooldown) {\n      // Leading edge — emit now, start a cooldown timer that, if untouched\n      // by another write, fires the trailing edge with the same value.\n      out.set(value)\n      hasPending = false\n      inCooldown = true\n      timer = setTimeout(fireTrailing, ms)\n    } else {\n      // Pending only matters if a trailing emit can actually happen. With\n      // `trailing: false` the timer just resets the cooldown and must NOT\n      // leave a value for a later `flush()` to emit. (T2.7)\n      hasPending = trailing\n      timer = setTimeout(fireTrailing, ms)\n    }\n  })\n\n  const cancel = () => {\n    if (timer != null) {\n      clearTimeout(timer)\n      timer = null\n    }\n    hasPending = false\n    inCooldown = false\n  }\n  const flush = () => {\n    if (timer != null) {\n      clearTimeout(timer)\n      timer = null\n    }\n    if (hasPending) {\n      out.set(pendingValue)\n      hasPending = false\n    }\n    inCooldown = false\n  }\n\n  const dispose = () => {\n    cancel()\n    disposeEffect()\n  }\n\n  const sig = options?.signal\n  if (sig) {\n    if (sig.aborted) dispose()\n    else sig.addEventListener('abort', dispose, { once: true })\n  }\n\n  // Expose a read-only projection of `out` plus the control surface. The old\n  // `out as TimingSignal` cast leaked `out.set` to callers. (T2.7)\n  const handle = Object.assign(Object.create(readOnly(out)), {\n    cancel,\n    flush,\n    dispose,\n  }) as TimingSignal<T>\n  return handle\n}\n","import { effect, signal } from '../signals'\nimport { readOnly } from '../signals/readonly'\nimport type { ReadSignal } from '../signals/types'\nimport type { TimingSignal } from './debounced'\n\n/**\n * Time source — `Date.now()`. Stays in lockstep with `vi.setSystemTime()`\n * for tests that exercise time-jumps; downstream consumers that need a\n * monotonic clock can pass `options.signal` and gate on system-time\n * changes externally.\n */\nfunction now(): number {\n  return Date.now()\n}\n\n/**\n * Rate-limit a signal so it emits at most once per `ms` (leading + trailing).\n * The first change passes through immediately. Subsequent changes within the\n * window are coalesced; the latest value is emitted when the window expires.\n *\n * - `leading: false` (default `true`) skips the immediate leading-edge\n *   emission. Useful for \"fire only after the window settles\" semantics.\n * - `trailing: false` (default `true`) skips the windowed trailing emit.\n *   Combine with `leading: true` for \"only fire on the leading edge.\"\n * - `options.signal` ties the internal effect to a lifecycle.\n *\n * The returned handle exposes `cancel()` / `flush()` — see `TimingSignal`.\n */\nexport function throttled<T>(\n  source: ReadSignal<T>,\n  ms: number,\n  options?: { signal?: AbortSignal; leading?: boolean; trailing?: boolean },\n): TimingSignal<T> {\n  const leading = options?.leading ?? true\n  const trailing = options?.trailing ?? true\n  if (!leading && !trailing) {\n    throw new Error(\n      '[olas] throttled: at least one of `leading` or `trailing` must be true (both false never emits).',\n    )\n  }\n  const out = signal<T>(source.peek())\n  let lastEmit = Number.NEGATIVE_INFINITY\n  let trailingTimer: ReturnType<typeof setTimeout> | null = null\n  let trailingValue: T = source.peek()\n  let hasPending = false\n  let initial = true\n\n  const fireTrailing = () => {\n    trailingTimer = null\n    if (hasPending && trailing) {\n      out.set(trailingValue)\n      lastEmit = now()\n      hasPending = false\n    }\n  }\n\n  const disposeEffect = effect(() => {\n    const value = source.value\n    if (initial) {\n      initial = false\n      return\n    }\n    const t = now()\n    const elapsed = t - lastEmit\n    if (elapsed >= ms && leading) {\n      out.set(value)\n      lastEmit = t\n      hasPending = false\n      // The leading emit consumed the value — drop any stale trailing-pending.\n      if (trailingTimer != null) {\n        clearTimeout(trailingTimer)\n        trailingTimer = null\n      }\n    } else if (trailing) {\n      // Coalesce into the trailing edge. With `trailing: false` we schedule\n      // nothing and never set `hasPending`, so a later `flush()` can't emit a\n      // value the option said should never fire. (T2.7)\n      trailingValue = value\n      hasPending = true\n      const delay = elapsed >= ms ? ms : ms - elapsed\n      if (trailingTimer == null) trailingTimer = setTimeout(fireTrailing, delay)\n    }\n  })\n\n  const cancel = () => {\n    if (trailingTimer != null) {\n      clearTimeout(trailingTimer)\n      trailingTimer = null\n    }\n    hasPending = false\n  }\n  const flush = () => {\n    if (trailingTimer != null) {\n      clearTimeout(trailingTimer)\n      trailingTimer = null\n    }\n    if (hasPending) {\n      out.set(trailingValue)\n      lastEmit = now()\n      hasPending = false\n    }\n  }\n\n  const dispose = () => {\n    cancel()\n    disposeEffect()\n  }\n\n  const sig = options?.signal\n  if (sig) {\n    if (sig.aborted) dispose()\n    else sig.addEventListener('abort', dispose, { once: true })\n  }\n\n  // Read-only projection + control surface; the old cast leaked `out.set`. (T2.7)\n  const handle = Object.assign(Object.create(readOnly(out)), {\n    cancel,\n    flush,\n    dispose,\n  }) as TimingSignal<T>\n  return handle\n}\n"],"mappings":";;;;;;AA6BA,SAAgB,iBAAiB,GAAqD;CACpF,OACE,MAAM,QACN,OAAO,MAAM,YACb,eAAe,KACf,OAAQ,EAA8C,cAAc,aAAa;AAErF;;;;;;;;;;;;;;;;;;AClBA,SAAgB,UAAgB,QAA8C;CAC5E,QAAQ,OAAO,WAAW;EAExB,MAAM,SAAS,OAAO,aAAa,SAAS,KAAK;EACjD,IAAI,kBAAkB,SACpB,OAAO,OAAO,KAAK,gBAAgB;EAErC,OAAO,iBAAiB,MAAM;CAChC;AACF;AAEA,SAAS,iBAAiB,QAAwE;CAChG,IAAI,OAAO,WAAW,KAAA,KAAa,OAAO,OAAO,WAAW,GAAG,OAAO,CAAC;CACvE,OAAO,OAAO,OAAO,KAAK,WAAW;EACnC,MAAM,mBAAmB,MAAM,IAAI;EACnC,SAAS,MAAM,WAAW;CAC5B,EAAE;AACJ;;;;;;AAOA,SAAS,mBAAmB,MAA0D;CACpF,IAAI,SAAS,KAAA,GAAW,OAAO,CAAC;CAChC,MAAM,MAA2B,CAAC;CAClC,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,MAAM,OAAO,QAAQ,YAAY,QAAQ,OAAO,IAAI,MAAM;EAChE,IAAI,KAAK,OAAO,QAAQ,WAAW,MAAM,OAAO,GAAG,CAAC;CACtD;CACA,OAAO;AACT;AAIA,MAAM,WAAW,UAA4B;CAC3C,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,IAAI,OAAO,UAAU,UAAU,OAAO,MAAM,WAAW;CACvD,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO,MAAM,WAAW;CAIlD,OAAO;AACT;;AAGA,MAAa,YACP,UAAU,gBACb,UACC,QAAQ,KAAK,IAAI,UAAU;;;;;;AAO/B,MAAa,cACV,UAAU,gBACV,UACC,UAAU,OAAO,OAAO;;AAG5B,MAAa,aACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,MAAM,UAAU,GAAG,OAAO;CAC9B,OAAO,WAAW,oBAAoB,EAAE;AAC1C;;AAGF,MAAa,aACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,MAAM,UAAU,GAAG,OAAO;CAC9B,OAAO,WAAW,wBAAwB,EAAE;AAC9C;;AAGF,MAAa,OACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,SAAS,GAAG,OAAO;CACvB,OAAO,WAAW,oBAAoB;AACxC;;AAGF,MAAa,OACV,GAAW,aACX,UAAU;CACT,IAAI,SAAS,MAAM,OAAO;CAC1B,IAAI,SAAS,GAAG,OAAO;CACvB,OAAO,WAAW,wBAAwB;AAC5C;AAIF,MAAM,WAAW;;AAGjB,MAAa,SACV,UAAU,6BACV,UAAU;CACT,IAAI,SAAS,QAAQ,UAAU,IAAI,OAAO;CAC1C,OAAO,SAAS,KAAK,KAAK,IAAI,OAAO;AACvC;;AAGF,MAAa,WACV,IAAY,UAAU,sBACtB,UAAU;CACT,IAAI,SAAS,QAAQ,UAAU,IAAI,OAAO;CAC1C,OAAO,GAAG,KAAK,KAAK,IAAI,OAAO;AACjC;;;;;;;;;;;;;;;AC5GF,IAAI,qBAAqB;AACzB,SAAS,cAAc,MAAoC;CACzD,OAAO,KAAK,WAAW,SAAS;AAClC;AAEA,SAAS,gBAGP,MACA,OACM;CAWN,IAAI,KAAK,WAAW,MAClB,aAAA,kBAAkB,KAAK,SAAS,KAAwB;MACnD,IAAI,KAAK,aAAa,MAAM,CAUnC;AACF;;;;;AAMA,SAAgB,YAAuC,MAA0C;CAC/F,MAAM,0BAAU,IAAI,IAAiB;CACrC,MAAM,QAAQ;EACZ,QAAQ;EACR,QAAQ;EACR,MAAM,cAAc,IAAI;EACxB,WAAW;EAEX,WAAW,GAAG,MAAkB;GAC9B,KAAK,MAAM,UAAU,SACnB,OAAO,WAAW,OAAyB,IAAI;EAEnD;EAEA,gBAAsB;GACpB,KAAK,MAAM,UAAU,SACnB,OAAO,cAAc,KAAuB;EAEhD;EAEA,OAAO,GAAG,MAAkB;GAC1B,KAAK,MAAM,UAAU,SACnB,OAAO,OAAO,OAAyB,IAAI;EAE/C;EAEA,YAAkB;GAChB,KAAK,MAAM,UAAU,SACnB,OAAO,UAAU,KAAuB;EAE5C;EAEA,QAAQ,GAAG,MAAgE;GACzE,MAAM,UAAU,KAAK,KAAK,SAAS;GACnC,MAAM,UAAU,KAAK,MAAM,GAAG,EAAE;GAChC,MAAM,iBAA6B,CAAC;GACpC,KAAK,MAAM,UAAU,SACnB,eAAe,KAAK,OAAO,QAAQ,OAAyB,SAAS,OAAO,CAAC;GAE/E,OAAO;IACL,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;IACA,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;GACF;EACF;EAEA,SAAS,GAAG,MAAwB;GAElC,MAAM,CAAC,SAAS;GAChB,IAAI,CAAC,OACH,OAAO,QAAQ,uBAAO,IAAI,MAAM,uDAAuD,CAAC;GAS1F,OAAO,MAAM,SAAS,OAAyB,IAAI;EACrD;CACF;CAEA,gBAAgB,MAAM,KAAK;CAC3B,OAAO;AACT;;;;;;;;AAoBA,SAAgB,oBACd,MACmC;CACnC,MAAM,0BAAU,IAAI,IAAiB;CACrC,MAAM,QAAQ;EACZ,QAAQ;EACR,QAAQ;EACR,MAAM,cAAc,IAAI;EACxB,WAAW;EAEX,WAAW,GAAG,MAAkB;GAC9B,KAAK,MAAM,UAAU,SACnB,OAAO,mBAAmB,OAA4C,IAAI;EAE9E;EAEA,gBAAsB;GACpB,KAAK,MAAM,UAAU,SACnB,OAAO,sBAAsB,KAA0C;EAE3E;EAEA,OAAO,GAAG,MAAkB;GAC1B,KAAK,MAAM,UAAU,SACnB,OAAO,eAAe,OAA4C,IAAI;EAE1E;EAEA,YAAkB;GAChB,KAAK,MAAM,UAAU,SACnB,OAAO,kBAAkB,KAA0C;EAEvE;EAEA,QAAQ,GAAG,MAA4E;GACrF,MAAM,UAAU,KAAK,KAAK,SAAS;GACnC,MAAM,UAAU,KAAK,MAAM,GAAG,EAAE;GAChC,MAAM,iBAA6B,CAAC;GACpC,KAAK,MAAM,UAAU,SACnB,eAAe,KACb,OAAO,gBACL,OACA,SACA,OACF,CACF;GAEF,OAAO;IACL,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;IACA,gBAAgB;KACd,KAAK,MAAM,KAAK,gBAAgB,EAAE,SAAS;IAC7C;GACF;EACF;EAEA,SAAS,GAAG,MAA4B;GACtC,MAAM,CAAC,SAAS;GAChB,IAAI,CAAC,OACH,OAAO,QAAQ,uBAAO,IAAI,MAAM,uDAAuD,CAAC;GAS1F,OAAO,MAAM,iBAAiB,OAA4C,IAAI;EAChF;CACF;CAEA,gBAAgB,MAAM,KAAK;CAC3B,OAAO;AACT;;;;;;;;;ACvMA,SAAgB,YAAe,SAAqC;CAClE,MAAM,aAAa,YAAY,KAAA,KAAa,aAAa;CACzD,MAAM,OAAO,SAAS;CAQtB,OAAO;EANL,QAAQ;EACR,MAAM,OAAO,QAAQ,OAAO;EAC5B;EACA,GAAI,SAAS,KAAA,IAAY,EAAE,KAAK,IAAI,CAAC;EACrC,GAAI,aAAa,EAAE,SAAS,SAAS,QAAa,IAAI,CAAC;CAE9C;AACb;;;;;;;;;;;;;;ACAA,SAAgB,UAAuB,SAAyD;CAC9F,MAAM,MAAMA,aAAAA,OAA4B,IAAI,IAAI,SAAS,OAAO,CAAC;CACjE,IAAI,SAAwB,SAAS,SAAS,SACzC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,MAAM,OAChD;CAIJ,IAAI,oBAAgD;CAEpD,MAAM,OAAOC,aAAAA,eAAe,IAAI,MAAM,IAAI;CAE1C,MAAM,cAAc,OAAoCA,aAAAA,eAAe,IAAI,MAAM,IAAI,EAAE,CAAC;CAExF,MAAM,UAAU,OAAqB;EACnC,MAAM,OAAO,IAAI,KAAK;EACtB,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG;GACjB,MAAM,OAAO,IAAI,IAAI,IAAI;GACzB,KAAK,IAAI,EAAE;GACX,IAAI,IAAI,IAAI;EACd;EACA,SAAS;CACX;CAEA,MAAM,YAAY,OAAqB;EACrC,MAAM,OAAO,IAAI,KAAK;EACtB,IAAI,CAAC,KAAK,IAAI,EAAE,GAAG;EACnB,MAAM,OAAO,IAAI,IAAI,IAAI;EACzB,KAAK,OAAO,EAAE;EACd,IAAI,IAAI,IAAI;EAGZ,IAAI,WAAW,IAAI,SAAS;CAC9B;CAEA,MAAM,UAAU,OAAqB;EACnC,MAAM,OAAO,IAAI,KAAK;EACtB,MAAM,OAAO,IAAI,IAAI,IAAI;EACzB,IAAI,KAAK,IAAI,EAAE,GACb,KAAK,OAAO,EAAE;OACT;GACL,KAAK,IAAI,EAAE;GACX,SAAS;EACX;EACA,IAAI,IAAI,IAAI;CACd;CAEA,MAAM,cAAoB;EACxB,IAAI,IAAI,KAAK,EAAE,SAAS,GAAG;GACzB,SAAS;GACT;EACF;EACA,IAAI,oBAAI,IAAI,IAAI,CAAC;EACjB,SAAS;CACX;CAEA,MAAM,aAAa,aAAsC;EACvD,IAAI,IAAI,IAAI,IAAI,QAAQ,CAAC;EACzB,SAAS,SAAS,SAAS,IAAK,SAAS,SAAS,SAAS,MAAM,OAAQ;CAC3E;CAEA,MAAM,eACJ,IACA,MACA,YACS;EACT,IAAI,KAAK,SAAS,WAAW,MAAM;GAMjC,IAAI;GACJ,IAAI;GACJ,IAAI;GACJ,IAAI,MAAM,QAAQ,OAAO,GAAG;IAC1B,MAAM,MAAM;IACZ,YAAY,IAAI,QAAQ,MAAM;IAC9B,YAAY,IAAI,QAAQ,EAAE;IAC1B,IAAI,cAAc,MAAM,cAAc,IAAI;KACxC,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;KACrB,SAAS;KACT,oBAAoB;KACpB;IACF;IACA,MAAM,CAAC,IAAI,MAAM,YAAY,YAAY,CAAC,WAAW,SAAS,IAAI,CAAC,WAAW,SAAS;IACvF,QAAQ,IAAI,MAAM,IAAI,KAAK,CAAC;GAC9B,OAAO;IACL,MAAM,MAAM;IACZ,YAAY,IAAI,IAAI,MAAM,KAAK;IAC/B,YAAY,IAAI,IAAI,EAAE,KAAK;IAC3B,IAAI,cAAc,MAAM,cAAc,IAAI;KACxC,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;KACrB,SAAS;KACT,oBAAoB;KACpB;IACF;IACA,MAAM,CAAC,IAAI,MAAM,YAAY,YAAY,CAAC,WAAW,SAAS,IAAI,CAAC,WAAW,SAAS;IAKvF,MAAM,OAAiB,CAAC;IACxB,IAAI,IAAI;IACR,KAAK,MAAM,KAAK,IAAI,KAAK,GAAG;KAC1B,IAAI,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,CAAC;KACnC,IAAI,KAAK,IAAI;KACb,KAAK;IACP;IACA,QAAQ;GACV;GACA,IAAI,sBAAsB,MACxB,oBAAoB,IAAI,KAAK;GAE/B,MAAM,OAAO,IAAI,IAAI,iBAAiB;GACtC,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;GACjC,IAAI,IAAI,IAAI;GAEZ;EACF;EAEA,oBAAoB;EACpB,IAAI,KAAK,MAAM;GACb,OAAO,EAAE;GACT;EACF;EACA,IAAI,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;EACrB,SAAS;CACX;CAEA,OAAO;EACL,aAAaC,aAAAA,SAAS,GAAG;EACzB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF;AACF;;;;;;;;;;;;;;;;;AC3IA,SAAgB,UACd,QACA,IACA,SACiB;CACjB,MAAM,UAAU,SAAS,WAAW;CACpC,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,CAAC,WAAW,CAAC,UACf,MAAM,IAAI,MACR,kGACF;CAEF,MAAM,MAAMC,aAAAA,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,QAA8C;CAClD,IAAI,eAAkB,OAAO,KAAK;CAClC,IAAI,aAAa;CACjB,IAAI,UAAU;CACd,IAAI,aAAa;CAEjB,MAAM,qBAAqB;EACzB,QAAQ;EACR,aAAa;EACb,IAAI,cAAc,UAAU;GAC1B,IAAI,IAAI,YAAY;GACpB,aAAa;EACf;CACF;CAEA,MAAM,gBAAgBC,aAAAA,aAAa;EACjC,MAAM,QAAQ,OAAO;EACrB,IAAI,SAAS;GACX,UAAU;GACV;EACF;EACA,eAAe;EACf,IAAI,SAAS,MAAM,aAAa,KAAK;EACrC,IAAI,WAAW,CAAC,YAAY;GAG1B,IAAI,IAAI,KAAK;GACb,aAAa;GACb,aAAa;GACb,QAAQ,WAAW,cAAc,EAAE;EACrC,OAAO;GAIL,aAAa;GACb,QAAQ,WAAW,cAAc,EAAE;EACrC;CACF,CAAC;CAED,MAAM,eAAe;EACnB,IAAI,SAAS,MAAM;GACjB,aAAa,KAAK;GAClB,QAAQ;EACV;EACA,aAAa;EACb,aAAa;CACf;CACA,MAAM,cAAc;EAClB,IAAI,SAAS,MAAM;GACjB,aAAa,KAAK;GAClB,QAAQ;EACV;EACA,IAAI,YAAY;GACd,IAAI,IAAI,YAAY;GACpB,aAAa;EACf;EACA,aAAa;CACf;CAEA,MAAM,gBAAgB;EACpB,OAAO;EACP,cAAc;CAChB;CAEA,MAAM,MAAM,SAAS;CACrB,IAAI,KACF,IAAI,IAAI,SAAS,QAAQ;MACpB,IAAI,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAU5D,OALe,OAAO,OAAO,OAAO,OAAOC,aAAAA,SAAS,GAAG,CAAC,GAAG;EACzD;EACA;EACA;CACF,CACY;AACd;;;;;;;;;AC3HA,SAAS,MAAc;CACrB,OAAO,KAAK,IAAI;AAClB;;;;;;;;;;;;;;AAeA,SAAgB,UACd,QACA,IACA,SACiB;CACjB,MAAM,UAAU,SAAS,WAAW;CACpC,MAAM,WAAW,SAAS,YAAY;CACtC,IAAI,CAAC,WAAW,CAAC,UACf,MAAM,IAAI,MACR,kGACF;CAEF,MAAM,MAAMC,aAAAA,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,WAAW,OAAO;CACtB,IAAI,gBAAsD;CAC1D,IAAI,gBAAmB,OAAO,KAAK;CACnC,IAAI,aAAa;CACjB,IAAI,UAAU;CAEd,MAAM,qBAAqB;EACzB,gBAAgB;EAChB,IAAI,cAAc,UAAU;GAC1B,IAAI,IAAI,aAAa;GACrB,WAAW,IAAI;GACf,aAAa;EACf;CACF;CAEA,MAAM,gBAAgBC,aAAAA,aAAa;EACjC,MAAM,QAAQ,OAAO;EACrB,IAAI,SAAS;GACX,UAAU;GACV;EACF;EACA,MAAM,IAAI,IAAI;EACd,MAAM,UAAU,IAAI;EACpB,IAAI,WAAW,MAAM,SAAS;GAC5B,IAAI,IAAI,KAAK;GACb,WAAW;GACX,aAAa;GAEb,IAAI,iBAAiB,MAAM;IACzB,aAAa,aAAa;IAC1B,gBAAgB;GAClB;EACF,OAAO,IAAI,UAAU;GAInB,gBAAgB;GAChB,aAAa;GACb,MAAM,QAAQ,WAAW,KAAK,KAAK,KAAK;GACxC,IAAI,iBAAiB,MAAM,gBAAgB,WAAW,cAAc,KAAK;EAC3E;CACF,CAAC;CAED,MAAM,eAAe;EACnB,IAAI,iBAAiB,MAAM;GACzB,aAAa,aAAa;GAC1B,gBAAgB;EAClB;EACA,aAAa;CACf;CACA,MAAM,cAAc;EAClB,IAAI,iBAAiB,MAAM;GACzB,aAAa,aAAa;GAC1B,gBAAgB;EAClB;EACA,IAAI,YAAY;GACd,IAAI,IAAI,aAAa;GACrB,WAAW,IAAI;GACf,aAAa;EACf;CACF;CAEA,MAAM,gBAAgB;EACpB,OAAO;EACP,cAAc;CAChB;CAEA,MAAM,MAAM,SAAS;CACrB,IAAI,KACF,IAAI,IAAI,SAAS,QAAQ;MACpB,IAAI,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;CAS5D,OALe,OAAO,OAAO,OAAO,OAAOC,aAAAA,SAAS,GAAG,CAAC,GAAG;EACzD;EACA;EACA;CACF,CACY;AACd"}

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-import { $ as DeepPartial, A as Mutation, B as InfiniteQuerySubscription, C as QueryClientPluginApi, D as _unregisterMutationById, E as SetDataEvent, F as DebugBus, G as LocalCache, H as AsyncStatus, I as DebugCacheEntry, J as QuerySubscription, K as Query, L as DebugEvent, M as MutationDef, N as MutationSpec, O as lookupRegisteredMutation, P as defineMutation, Q as UseOptions, R as InfiniteQuery, S as QueryClientPlugin, T as RegisteredQuery, U as DehydratedEntry, V as AsyncState, W as DehydratedState, X as RetryPolicy, Y as RetryDelay, Z as Snapshot, _ as defineScope, _t as Emitter, a as CollectionFactoryResult, at as Form, b as MutationEnqueueEvent, c as CtrlApi, ct as FormSchema, d as Field, dt as ItemInitial, et as FieldArray, f as LazyChild, ft as Validator, g as ScopeOptions, gt as ErrorContext, h as Scope, ht as Signal, i as CollectionFactoryOptions, it as FieldArrayValue, j as MutationConcurrency, k as lookupRegisteredQuery, l as CtrlProps, lt as FormValidator, m as RootOptions, mt as ReadSignal, n as Collection, nt as FieldArrayOptions, o as CollectionHomogeneousOptions, ot as FormErrors, p as Root, pt as Computed, q as QuerySpec, r as CollectionFactoryApi, rt as FieldArrayValidator, s as ControllerDef, st as FormOptions, t as AmbientDeps, tt as FieldArrayItemErrors, u as Ctx, ut as FormValue, v as GcEvent, vt as EmitterErrorReporter, w as RegisteredMutation, x as MutationSettleEvent, y as InvalidateEvent, yt as createEmitter, z as InfiniteQuerySpec } from "./types-C4Vtkxbn.cjs";
+import { $ as UseOptions, A as Mutation, B as InfiniteQuerySubscription, C as QueryClientPluginApi, Ct as EmitterErrorReporter, E as SetDataEvent, F as DebugBus, G as LocalCache, H as AsyncStatus, I as DebugCacheEntry, J as QuerySpec, K as NetworkMode, L as DebugEvent, M as MutationDef, N as MutationSpec, O as lookupRegisteredMutation, P as defineMutation, Q as Snapshot, R as InfiniteQuery, S as QueryClientPlugin, St as Emitter, T as RegisteredQuery, U as DehydratedEntry, V as AsyncState, W as DehydratedState, X as RetryDelay, Y as QuerySubscription, Z as RetryPolicy, _ as defineScope, _t as ReadSignal, a as CollectionFactoryResult, at as FieldArrayValue, b as MutationEnqueueEvent, bt as ErrorContextInput, c as CtrlApi, ct as FormOptions, d as Field, dt as FormValue, et as DeepPartial, f as LazyChild, ft as ItemInitial, g as ScopeOptions, gt as Computed, h as Scope, ht as ValidatorResult, i as CollectionFactoryOptions, it as FieldArrayValidator, j as MutationConcurrency, k as lookupRegisteredQuery, l as CtrlProps, lt as FormSchema, m as RootOptions, mt as Validator, n as Collection, nt as FieldArrayItemErrors, o as CollectionHomogeneousOptions, ot as Form, p as Root, pt as FormIssue, q as Query, r as CollectionFactoryApi, rt as FieldArrayOptions, s as ControllerDef, st as FormErrors, t as AmbientDeps, tt as FieldArray, u as Ctx, ut as FormValidator, v as GcEvent, vt as Signal, w as RegisteredMutation, wt as createEmitter, x as MutationSettleEvent, xt as ErrorHandler, y as InvalidateEvent, yt as ErrorContext, z as InfiniteQuerySpec } from "./types-DzDIypPo.cjs";
 
 //#region src/signals/runtime.d.ts
 /**
@@ -66,7 +66,52 @@ declare function defineController<Props = void, Api = unknown>(factory: (ctx: Ct
  * Construct a root controller. Root factories take no props — startup config
  * goes in `deps`.
  */
-declare function createRoot<Api, TDeps extends Record<string, unknown> = AmbientDeps>(def: ControllerDef<void, Api>, options: RootOptions<TDeps>): Root<Api>;
+declare function createRoot<Api extends object, TDeps extends Record<string, unknown> = AmbientDeps>(def: ControllerDef<void, Api>, options: RootOptions<TDeps>): Root<Api>;
+//#endregion
+//#region src/forms/field.d.ts
+/**
+ * When a field's validators are first allowed to run.
+ *
+ * - `'change'` (default) — validators run on every `set()`. Matches the
+ *   current behavior, ideal for "type and see errors live."
+ * - `'blur'` — first run is gated on `markTouched()`. After that, subsequent
+ *   value changes do trigger re-validation. UI binding should call
+ *   `markTouched()` on `onBlur`.
+ * - `'submit'` — first run is gated on `revalidate()` / `Form.submit()`.
+ *   After that, subsequent value changes re-validate. Use when you want
+ *   "show errors only after the user explicitly tried to submit."
+ *
+ * `revalidate()` always unlocks the field regardless of mode.
+ */
+type ValidateOn = 'change' | 'blur' | 'submit';
+/**
+ * A bidirectional `T ↔ string` transform, suitable for HTML input bindings
+ * where DOM values are always strings.
+ *
+ * `parse(raw)` converts the input's string value into the field's type;
+ * `format(value)` converts the field's typed value back into a string for
+ * the input. Both must be pure — `useFieldInput` calls them on every
+ * render and every input event respectively.
+ *
+ * ```ts
+ * const numberTransform: FieldTransform<number> = {
+ *   parse: (raw) => Number(raw),
+ *   format: (v) => String(v),
+ * }
+ * ```
+ */
+type FieldTransform<T> = {
+  parse: (raw: string) => T;
+  format: (value: T) => string;
+};
+/**
+ * Wrap an async validator with a debounce. The debounce timer resets on every
+ * value change. While debouncing or the request is in flight, the field's
+ * `isValidating` is true and `isValid` HOLDS its last settled value (T5.3) — so
+ * editing an already-valid field doesn't strobe a submit button to disabled on
+ * every keystroke. A field with no prior settled validation defaults to valid.
+ */
+declare function debouncedValidator<T>(fn: (value: T, signal: AbortSignal) => Promise<string | null>, ms: number): (value: T, signal: AbortSignal) => Promise<string | null>;
 //#endregion
 //#region src/forms/standard-schema.d.ts
 /**
@@ -108,19 +153,28 @@ declare function isStandardSchema(x: unknown): x is StandardSchemaV1<unknown, un
 //#region src/forms/validators.d.ts
 /**
  * Wrap any Standard-Schema-compatible schema (Zod 4, Valibot 1, ArkType 2,
- * …) as an Olas validator. The validator returns the first issue's message
- * on failure (or `'Invalid'` if no issues are produced), `null` on success.
+ * …) as an Olas validator. Returns **all** issues as `FormIssue[]`, each
+ * carrying the schema's own `path` — so a whole-form schema used as a
+ * form-level validator routes each issue onto the matching field (T5.2),
+ * and a leaf schema (whose issues have empty paths) still reports on the
+ * field it's attached to. An empty array means "valid".
  *
  * Standard Schema validators may be sync or async; this wrapper threads
- * through whichever the schema returns — `Promise<string|null>` only when
+ * through whichever the schema returns — `Promise<FormIssue[]>` only when
  * the underlying validate call is itself async.
  *
  * `signal` is accepted to match the `Validator<T>` shape but isn't forwarded
  * — Standard Schema v1 has no cancellation surface.
  */
 declare function validator<I, O>(schema: StandardSchemaV1<I, O>): Validator<I>;
-/** Reject empty values (undefined, null, empty string, empty array). */
+/** Reject empty values (undefined, null, empty string, empty array). Booleans always pass. */
 declare const required: <T>(message?: string) => Validator<T>;
+/**
+ * Reject any value that isn't boolean `true` — the "you must check this box"
+ * rule for consent / terms-of-service / confirm checkboxes. Unlike `required`
+ * (which now accepts `false` as a valid boolean), this fails on `false`.
+ */
+declare const mustBeTrue: (message?: string) => Validator<boolean>;
 /** Reject strings / arrays shorter than `n`. Allows null/undefined (use with `required` to forbid). */
 declare const minLength: (n: number, message?: string) => Validator<string | readonly unknown[]>;
 /** Reject strings / arrays longer than `n`. */
@@ -134,14 +188,6 @@ declare const email: (message?: string) => Validator<string>;
 /** Reject strings that don't match the supplied `RegExp`. */
 declare const pattern: (re: RegExp, message?: string) => Validator<string>;
 //#endregion
-//#region src/forms/field.d.ts
-/**
- * Wrap an async validator with a debounce. The debounce timer resets on every
- * value change. While debouncing or the request is in flight, the field's
- * `isValidating` is true and `isValid` is false (treat-as-invalid-until-proven-valid).
- */
-declare function debouncedValidator<T>(fn: (value: T, signal: AbortSignal) => Promise<string | null>, ms: number): Validator<T>;
-//#endregion
 //#region src/query/define.d.ts
 /**
  * Define a keyed, shared query. The returned Query value lives at module
@@ -161,7 +207,7 @@ declare function defineInfiniteQuery<Args extends unknown[], PageParam, TPage, T
 /**
  * Stable string hash of a key tuple. Two equal-by-content args produce the
  * same string regardless of property iteration order. Handles primitives,
- * arrays, plain objects, Date.
+ * arrays, plain objects, Date, BigInt, NaN, ±Infinity.
  *
  * Functions and symbols throw — keys must be serializable so distinct
  * subscribers can share entries.
@@ -188,7 +234,7 @@ type Selection<T = unknown> = {
   handleClick(id: string, mods: {
     shift?: boolean;
     meta?: boolean;
-  }, ordered: readonly string[]): void;
+  }, ordered: readonly string[] | ReadonlyMap<string, number>): void;
 };
 /**
  * Create a `Selection<T>`. Optional `initial` seeds the selected set.
@@ -206,19 +252,49 @@ declare function selection<T = unknown>(options?: {
 }): Selection<T>;
 //#endregion
 //#region src/timing/debounced.d.ts
+/**
+ * A `ReadSignal<T>` returned by `debounced` / `throttled`. Extends the
+ * subscription surface with manual `cancel()` and `flush()`.
+ *
+ * - `cancel()` drops any pending emission without firing. Useful when a
+ *   navigation away from the screen should discard the latest in-flight
+ *   draft instead of writing it through to the debounced output.
+ * - `flush()` immediately emits the pending value (if any). Useful at
+ *   submit time: "commit whatever the user just typed without waiting
+ *   for the debounce timer to fire."
+ *
+ * Both are no-ops when nothing is pending.
+ */
+type TimingSignal<T> = ReadSignal<T> & {
+  cancel(): void;
+  flush(): void;
+  /**
+   * Tear down the internal effect (drop the subscription to `source`) and
+   * clear any pending timer. Idempotent. Call this when the timing signal
+   * has no `options.signal` tying its lifecycle to an AbortController —
+   * otherwise the effect keeps `source` subscribed forever.
+   */
+  dispose(): void;
+};
 /**
  * Lag a signal by `ms`. The returned signal updates only after the source has
  * been unchanged for `ms`. Each new write resets the timer.
  *
- * Pass `options.signal` (an `AbortSignal`) to tie the internal effect to a
- * lifecycle — when the signal aborts the effect disposes, the pending timer
- * clears, and the subscriber chain on `source` drops. Without `signal`, the
- * effect lives as long as `source` does; pass a signal whenever the source
- * outlives the consumer.
+ * - `leading: true` (default `false`) emits immediately on the first write,
+ *   then suppresses further writes until `ms` has passed since the last
+ *   emission. Combine with trailing (default `true`) for "first + last"
+ *   semantics.
+ * - `trailing: false` disables the trailing emission. Pair with
+ *   `leading: true` for "only fire on the leading edge" semantics.
+ * - `options.signal` (`AbortSignal`) ties the internal effect to a
+ *   lifecycle — when the signal aborts the effect disposes, the pending
+ *   timer clears, and the subscriber chain on `source` drops.
  */
 declare function debounced<T>(source: ReadSignal<T>, ms: number, options?: {
   signal?: AbortSignal;
-}): ReadSignal<T>;
+  leading?: boolean;
+  trailing?: boolean;
+}): TimingSignal<T>;
 //#endregion
 //#region src/timing/throttled.d.ts
 /**
@@ -226,13 +302,19 @@ declare function debounced<T>(source: ReadSignal<T>, ms: number, options?: {
  * The first change passes through immediately. Subsequent changes within the
  * window are coalesced; the latest value is emitted when the window expires.
  *
- * Pass `options.signal` to tie the internal effect to a lifecycle — when the
- * signal aborts the effect disposes and any pending trailing timer clears.
- * Without `signal`, the effect lives as long as `source` does.
+ * - `leading: false` (default `true`) skips the immediate leading-edge
+ *   emission. Useful for "fire only after the window settles" semantics.
+ * - `trailing: false` (default `true`) skips the windowed trailing emit.
+ *   Combine with `leading: true` for "only fire on the leading edge."
+ * - `options.signal` ties the internal effect to a lifecycle.
+ *
+ * The returned handle exposes `cancel()` / `flush()` — see `TimingSignal`.
  */
 declare function throttled<T>(source: ReadSignal<T>, ms: number, options?: {
   signal?: AbortSignal;
-}): ReadSignal<T>;
+  leading?: boolean;
+  trailing?: boolean;
+}): TimingSignal<T>;
 //#endregion
 //#region src/utils.d.ts
 /**
@@ -245,5 +327,5 @@ declare function throttled<T>(source: ReadSignal<T>, ms: number, options?: {
  */
 declare function isAbortError(err: unknown): boolean;
 //#endregion
-export { type AmbientDeps, type AsyncState, type AsyncStatus, type Collection, type CollectionFactoryApi, type CollectionFactoryOptions, type CollectionFactoryResult, type CollectionHomogeneousOptions, type Computed, type ControllerDef, type CtrlApi, type CtrlProps, type Ctx, type DebugBus, type DebugCacheEntry, type DebugEvent, type DeepPartial, type DehydratedEntry, type DehydratedState, type Emitter, type EmitterErrorReporter, type ErrorContext, type Field, type FieldArray, type FieldArrayItemErrors, type FieldArrayOptions, type FieldArrayValidator, type FieldArrayValue, type Form, type FormErrors, type FormOptions, type FormSchema, type FormValidator, type FormValue, type GcEvent, type InfiniteQuery, type InfiniteQuerySpec, type InfiniteQuerySubscription, type InvalidateEvent, type ItemInitial, type LazyChild, type LocalCache, type Mutation, type MutationConcurrency, type MutationDef, type MutationEnqueueEvent, type MutationSettleEvent, type MutationSpec, type Query, type QueryClientPlugin, type QueryClientPluginApi, type QuerySpec, type QuerySubscription, type ReadSignal, type RegisteredMutation, type RegisteredQuery, type RetryDelay, type RetryPolicy, type Root, type RootOptions, type Scope, type ScopeOptions, type Selection, type SetDataEvent, type Signal, type Snapshot, type StandardSchemaV1, type UseOptions, type Validator, _unregisterMutationById, batch, computed, createEmitter, createRoot, debounced, debouncedValidator, defineController, defineInfiniteQuery, defineMutation, defineQuery, defineScope, effect, email, isAbortError, isStandardSchema, lookupRegisteredMutation, lookupRegisteredQuery, max, maxLength, min, minLength, pattern, required, selection, signal, stableHash, throttled, untracked, validator };
+export { type AmbientDeps, type AsyncState, type AsyncStatus, type Collection, type CollectionFactoryApi, type CollectionFactoryOptions, type CollectionFactoryResult, type CollectionHomogeneousOptions, type Computed, type ControllerDef, type CtrlApi, type CtrlProps, type Ctx, type DebugBus, type DebugCacheEntry, type DebugEvent, type DeepPartial, type DehydratedEntry, type DehydratedState, type Emitter, type EmitterErrorReporter, type ErrorContext, type ErrorContextInput, type ErrorHandler, type Field, type FieldArray, type FieldArrayItemErrors, type FieldArrayOptions, type FieldArrayValidator, type FieldArrayValue, type FieldTransform, type Form, type FormErrors, type FormIssue, type FormOptions, type FormSchema, type FormValidator, type FormValue, type GcEvent, type InfiniteQuery, type InfiniteQuerySpec, type InfiniteQuerySubscription, type InvalidateEvent, type ItemInitial, type LazyChild, type LocalCache, type Mutation, type MutationConcurrency, type MutationDef, type MutationEnqueueEvent, type MutationSettleEvent, type MutationSpec, type NetworkMode, type Query, type QueryClientPlugin, type QueryClientPluginApi, type QuerySpec, type QuerySubscription, type ReadSignal, type RegisteredMutation, type RegisteredQuery, type RetryDelay, type RetryPolicy, type Root, type RootOptions, type Scope, type ScopeOptions, type Selection, type SetDataEvent, type Signal, type Snapshot, type StandardSchemaV1, type TimingSignal, type UseOptions, type ValidateOn, type Validator, type ValidatorResult, batch, computed, createEmitter, createRoot, debounced, debouncedValidator, defineController, defineInfiniteQuery, defineMutation, defineQuery, defineScope, effect, email, isAbortError, isStandardSchema, lookupRegisteredMutation, lookupRegisteredQuery, max, maxLength, min, minLength, mustBeTrue, pattern, required, selection, signal, stableHash, throttled, untracked, validator };
 //# sourceMappingURL=index.d.cts.map

package/dist/index.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.cts","names":[],"sources":["../src/signals/runtime.ts","../src/controller/define.ts","../src/controller/root.ts","../src/forms/standard-schema.ts","../src/forms/validators.ts","../src/forms/field.ts","../src/query/define.ts","../src/query/keys.ts","../src/selection.ts","../src/timing/debounced.ts","../src/timing/throttled.ts","../src/utils.ts"],"mappings":";;;;;AAsEA;;;;iBAAgB,MAAA,GAAA,CAAU,OAAA,EAAS,CAAA,GAAI,MAAA,CAAO,CAAA;;;;;;;;;iBAY9B,QAAA,GAAA,CAAY,EAAA,QAAU,CAAA,GAAI,QAAA,CAAS,CAAA;AAZJ;AAY/C;;;;;;;AAZ+C,iBAwB/B,MAAA,CAAO,EAA6B;;;;;iBAQpC,KAAA,GAAA,CAAS,EAAA,QAAU,CAAA,GAAI,CAAC;;AApBY;AAYpD;;;;iBAkBgB,SAAA,GAAA,CAAa,EAAA,QAAU,CAAA,GAAI,CAAC;;;;KCxGhC,uBAAA;ED8DI;;;;;;;;ECrDd,IAAI;AAAA;;;;;ADqDyC;AAY/C;;iBCvDgB,gBAAA,6BAAA,CACd,OAAA,GAAU,GAAA,EAAK,GAAA,EAAK,KAAA,EAAO,KAAA,KAAU,GAAA,EACrC,OAAA,GAAU,uBAAA,GACT,aAAA,CAAc,KAAA,EAAO,GAAA;;;;;;;iBCoIR,UAAA,oBAA8B,MAAA,oBAA0B,WAAA,CAAA,CACtE,GAAA,EAAK,aAAA,OAAoB,GAAA,GACzB,OAAA,EAAS,WAAA,CAAY,KAAA,IACpB,IAAA,CAAK,GAAA;;;;;;AF/FR;;;;;KG9DY,qBAAA;EAAA,SACD,OAAA;EAAA,SACA,IAAA,GAAO,aAAA,CAAc,WAAA;IAAA,SAAyB,GAAA,EAAK,WAAA;EAAA;AAAA;AAAA,KAGlD,sBAAA;EAAA,SACG,KAAA,EAAO,CAAA;EAAA,SAAY,MAAA;AAAA;EAAA,SACnB,MAAA,EAAQ,aAAA,CAAc,qBAAA;AAAA;AAAA,KAEzB,gBAAA,kBAAkC,CAAA;EAAA,SACnC,WAAA;IAAA,SACE,OAAA;IAAA,SACA,MAAA;IACT,QAAA,CAAS,KAAA,YAAiB,sBAAA,CAAuB,CAAA,IAAK,OAAA,CAAQ,sBAAA,CAAuB,CAAA;IAAA,SAC5E,KAAA;MAAA,SAAmB,KAAA,EAAO,CAAA;MAAA,SAAY,MAAA,EAAQ,CAAA;IAAA;EAAA;AAAA;;AH4DP;AAYpD;iBGjEgB,gBAAA,CAAiB,CAAA,YAAa,CAAA,IAAK,gBAAgB;;;;AHyCnE;;;;;;;;;;;iBIvDgB,SAAA,MAAA,CAAgB,MAAA,EAAQ,gBAAA,CAAiB,CAAA,EAAG,CAAA,IAAK,SAAA,CAAU,CAAA;;cA0B9D,QAAA,MACP,OAAA,cAAuB,SAAS,CAAC,CAAA;AJwCvC;AAAA,cInCa,SAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAQ7B,SAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAQ7B,GAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAQ7B,GAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAY7B,KAAA,GACV,OAAA,cAAoC,SAAS;;cAOnC,OAAA,GACV,EAAA,EAAI,MAAA,EAAQ,OAAA,cAA6B,SAAS;;;;;;;;iBC2RrC,kBAAA,GAAA,CACd,EAAA,GAAK,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,WAAA,KAAgB,OAAA,iBACvC,EAAA,WACC,SAAA,CAAU,CAAA;;;;ALxTb;;;iBMtCgB,WAAA,2BAAA,CAAuC,IAAA,EAAM,SAAA,CAAU,IAAA,EAAM,CAAA,IAAK,KAAA,CAAM,IAAA,EAAM,CAAA;;;;;;;;iBAyE9E,mBAAA,mDAAsE,KAAA,CAAA,CACpF,IAAA,EAAM,iBAAA,CAAkB,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,KAAA,IAC/C,aAAA,CAAc,IAAA,EAAM,KAAA,EAAO,KAAA;;;;;;ANrC9B;;;;;iBO9DgB,UAAA,CAAW,IAAwB;;;;;AP8DnD;;;;;KQ1DY,SAAA;EACV,WAAA,EAAa,UAAA,CAAW,WAAA;EACxB,IAAA,EAAM,UAAA;EACN,UAAA,CAAW,EAAA,WAAa,UAAA;EAExB,MAAA,CAAO,EAAA;EACP,QAAA,CAAS,EAAA;EACT,MAAA,CAAO,EAAA;EACP,KAAA;EACA,SAAA,CAAU,GAAA;EAEV,WAAA,CACE,EAAA,UACA,IAAA;IAAQ,KAAA;IAAiB,IAAA;EAAA,GACzB,OAAA;AAAA;;;;;;;;;;;ARwDgD;iBQzCpC,SAAA,aAAA,CAAuB,OAAA;EAAY,OAAA;AAAA,IAAgC,SAAS,CAAC,CAAA;;;;;AR6B7F;;;;;;;;iBSzDgB,SAAA,GAAA,CACd,MAAA,EAAQ,UAAA,CAAW,CAAA,GACnB,EAAA,UACA,OAAA;EAAY,MAAA,GAAS,WAAA;AAAA,IACpB,UAAA,CAAW,CAAA;;;;;ATqDd;;;;;;;iBU1DgB,SAAA,GAAA,CACd,MAAA,EAAQ,UAAA,CAAW,CAAA,GACnB,EAAA,UACA,OAAA;EAAY,MAAA,GAAS,WAAA;AAAA,IACpB,UAAA,CAAW,CAAA;;;;;;AVsDd;;;;;iBW9DgB,YAAA,CAAa,GAAY"}
+{"version":3,"file":"index.d.cts","names":[],"sources":["../src/signals/runtime.ts","../src/controller/define.ts","../src/controller/root.ts","../src/forms/field.ts","../src/forms/standard-schema.ts","../src/forms/validators.ts","../src/query/define.ts","../src/query/keys.ts","../src/selection.ts","../src/timing/debounced.ts","../src/timing/throttled.ts","../src/utils.ts"],"mappings":";;;;;AAiGA;;;;iBAAgB,MAAA,GAAA,CAAU,OAAA,EAAS,CAAA,GAAI,MAAA,CAAO,CAAA;;;;;;;;;iBAY9B,QAAA,GAAA,CAAY,EAAA,QAAU,CAAA,GAAI,QAAA,CAAS,CAAA;AAZJ;AAY/C;;;;;;;AAZ+C,iBAwB/B,MAAA,CAAO,EAA6B;;;;;iBAQpC,KAAA,GAAA,CAAS,EAAA,QAAU,CAAA,GAAI,CAAC;;AApBY;AAYpD;;;;iBAkBgB,SAAA,GAAA,CAAa,EAAA,QAAU,CAAA,GAAI,CAAC;;;;KCnIhC,uBAAA;EDyFI;;;;;;;;EChFd,IAAI;AAAA;;;;;ADgFyC;AAY/C;;iBClFgB,gBAAA,6BAAA,CACd,OAAA,GAAU,GAAA,EAAK,GAAA,EAAK,KAAA,EAAO,KAAA,KAAU,GAAA,EACrC,OAAA,GAAU,uBAAA,GACT,aAAA,CAAc,KAAA,EAAO,GAAA;;;;;;;iBCgKR,UAAA,mCAA6C,MAAA,oBAA0B,WAAA,CAAA,CACrF,GAAA,EAAK,aAAA,OAAoB,GAAA,GACzB,OAAA,EAAS,WAAA,CAAY,KAAA,IACpB,IAAA,CAAK,GAAA;;;;;;;;;;;;AFpF4C;AAYpD;;;;KGvBY,UAAA;;AHyCgC;;;;ACnI5C;;;;AASM;AAUN;;;;;;KEihBY,cAAA;EACV,KAAA,GAAQ,GAAA,aAAgB,CAAA;EACxB,MAAA,GAAS,KAAA,EAAO,CAAC;AAAA;;;;;;;;iBAUH,kBAAA,GAAA,CACd,EAAA,GAAK,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,WAAA,KAAgB,OAAA,iBACvC,EAAA,YACE,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,WAAA,KAAgB,OAAA;;;;;;AH1dtC;;;;;KIzFY,qBAAA;EAAA,SACD,OAAA;EAAA,SACA,IAAA,GAAO,aAAA,CAAc,WAAA;IAAA,SAAyB,GAAA,EAAK,WAAA;EAAA;AAAA;AAAA,KAGlD,sBAAA;EAAA,SACG,KAAA,EAAO,CAAA;EAAA,SAAY,MAAA;AAAA;EAAA,SACnB,MAAA,EAAQ,aAAA,CAAc,qBAAA;AAAA;AAAA,KAEzB,gBAAA,kBAAkC,CAAA;EAAA,SACnC,WAAA;IAAA,SACE,OAAA;IAAA,SACA,MAAA;IACT,QAAA,CAAS,KAAA,YAAiB,sBAAA,CAAuB,CAAA,IAAK,OAAA,CAAQ,sBAAA,CAAuB,CAAA;IAAA,SAC5E,KAAA;MAAA,SAAmB,KAAA,EAAO,CAAA;MAAA,SAAY,MAAA,EAAQ,CAAA;IAAA;EAAA;AAAA;;AJuFP;AAYpD;iBI5FgB,gBAAA,CAAiB,CAAA,YAAa,CAAA,IAAK,gBAAgB;;;;AJoEnE;;;;;;;;;;;;;;iBK/EgB,SAAA,MAAA,CAAgB,MAAA,EAAQ,gBAAA,CAAiB,CAAA,EAAG,CAAA,IAAK,SAAA,CAAU,CAAA;;cA+C9D,QAAA,MACP,OAAA,cAAuB,SAAS,CAAC,CAAA;;;;;;cAS1B,UAAA,GACV,OAAA,cAAuB,SAAS;;cAKtB,SAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAQ7B,SAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAQ7B,GAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;ALqB1C;AAAA,cKba,GAAA,GACV,CAAA,UAAW,OAAA,cAAmB,SAAS;;cAY7B,KAAA,GACV,OAAA,cAAoC,SAAS;ALDI;AAAA,cKQvC,OAAA,GACV,EAAA,EAAI,MAAA,EAAQ,OAAA,cAA6B,SAAS;;;;ALjCrD;;;iBM/BgB,WAAA,2BAAA,CAAuC,IAAA,EAAM,SAAA,CAAU,IAAA,EAAM,CAAA,IAAK,KAAA,CAAM,IAAA,EAAM,CAAA;;;;;;;;iBAwF9E,mBAAA,mDAAsE,KAAA,CAAA,CACpF,IAAA,EAAM,iBAAA,CAAkB,IAAA,EAAM,SAAA,EAAW,KAAA,EAAO,KAAA,IAC/C,aAAA,CAAc,IAAA,EAAM,KAAA,EAAO,KAAA;;;;;;AN3D9B;;;;;iBOzFgB,UAAA,CAAW,IAAwB;;;;;APyFnD;;;;;KQrFY,SAAA;EACV,WAAA,EAAa,UAAA,CAAW,WAAA;EACxB,IAAA,EAAM,UAAA;EACN,UAAA,CAAW,EAAA,WAAa,UAAA;EAExB,MAAA,CAAO,EAAA;EACP,QAAA,CAAS,EAAA;EACT,MAAA,CAAO,EAAA;EACP,KAAA;EACA,SAAA,CAAU,GAAA;EAEV,WAAA,CACE,EAAA,UACA,IAAA;IAAQ,KAAA;IAAiB,IAAA;EAAA,GACzB,OAAA,sBAA6B,WAAA;AAAA;;;;;;;;;;;ARmFmB;iBQpEpC,SAAA,aAAA,CAAuB,OAAA;EAAY,OAAA;AAAA,IAAgC,SAAS,CAAC,CAAA;;;;;ARwD7F;;;;;;;;;;;KShFY,YAAA,MAAkB,UAAU,CAAC,CAAA;EACvC,MAAA;EACA,KAAA;ET8E6C;AAY/C;;;;;ESnFE,OAAA;AAAA;;;;;;;;ATmFkD;AAYpD;;;;AAAoD;AAQpD;iBStFgB,SAAA,GAAA,CACd,MAAA,EAAQ,UAAA,CAAW,CAAA,GACnB,EAAA,UACA,OAAA;EAAY,MAAA,GAAS,WAAA;EAAa,OAAA;EAAmB,QAAA;AAAA,IACpD,YAAA,CAAa,CAAA;;;;ATkDhB;;;;;;;;;;;;iBUrEgB,SAAA,GAAA,CACd,MAAA,EAAQ,UAAA,CAAW,CAAA,GACnB,EAAA,UACA,OAAA;EAAY,MAAA,GAAS,WAAA;EAAa,OAAA;EAAmB,QAAA;AAAA,IACpD,YAAA,CAAa,CAAA;;;;;;AViEhB;;;;;iBWzFgB,YAAA,CAAa,GAAY"}