@kontsedal/olas-core 0.0.1 → 0.0.2

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":[],"sources":["../src/signals/readonly.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 {\n    get value() {\n      return source.value\n    },\n    peek() {\n      return source.peek()\n    },\n    subscribe(handler) {\n      return source.subscribe(handler)\n    },\n  }\n}\n","import type { Validator } from './types'\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 * No lifecycle — the internal effect runs for the lifetime of the program.\n * Use inside a controller closure so it dies with the closure.\n */\nexport function debounced<T>(source: ReadSignal<T>, ms: number): ReadSignal<T> {\n  const out = signal<T>(source.peek())\n  let timer: ReturnType<typeof setTimeout> | null = null\n  let initial = true\n\n  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  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 * No lifecycle — see debounced() note.\n */\nexport function throttled<T>(source: ReadSignal<T>, ms: number): 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  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  return out\n}\n"],"mappings":";;;;;;;;;AASA,SAAgB,SAAY,QAAsC;CAChE,OAAO;EACL,IAAI,QAAQ;GACV,OAAO,OAAO;EAChB;EACA,OAAO;GACL,OAAO,OAAO,KAAK;EACrB;EACA,UAAU,SAAS;GACjB,OAAO,OAAO,UAAU,OAAO;EACjC;CACF;AACF;;;ACnBA,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;;;ACzDF,SAAS,gBAAgB,MAAgD,OAAqB;CAC5F,IAAI,KAAK,WAAW,MAClB,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,MAAM,OAA4B,IAAI,IAAI,SAAS,OAAO,CAAC;CACjE,IAAI,SAAwB,SAAS,SAAS,SACzC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,MAAM,OAChD;CAIJ,IAAI,oBAAgD;CAEpD,MAAM,OAAO,eAAe,IAAI,MAAM,IAAI;CAE1C,MAAM,cAAc,OAAoC,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;;;;;;;;;;ACvIA,SAAgB,UAAa,QAAuB,IAA2B;CAC7E,MAAM,MAAM,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,QAA8C;CAClD,IAAI,UAAU;CAEd,aAAa;EACX,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,OAAO;AACT;;;;;;;;;;ACrBA,SAAgB,UAAa,QAAuB,IAA2B;CAC7E,MAAM,MAAM,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,WAAW,OAAO;CACtB,IAAI,gBAAsD;CAC1D,IAAI,gBAAmB,OAAO,KAAK;CACnC,IAAI,UAAU;CAEd,aAAa;EACX,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,OAAO;AACT"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../src/signals/readonly.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","import type { Validator } from './types'\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;;;ACnBA,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;;;ACzDF,SAAS,gBAAgB,MAAgD,OAAqB;CAC5F,IAAI,KAAK,WAAW,MAClB,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,MAAM,OAA4B,IAAI,IAAI,SAAS,OAAO,CAAC;CACjE,IAAI,SAAwB,SAAS,SAAS,SACzC,QAAQ,QAAQ,QAAQ,QAAQ,SAAS,MAAM,OAChD;CAIJ,IAAI,oBAAgD;CAEpD,MAAM,OAAO,eAAe,IAAI,MAAM,IAAI;CAE1C,MAAM,cAAc,OAAoC,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,MAAM,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,QAA8C;CAClD,IAAI,UAAU;CAEd,MAAM,UAAU,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,MAAM,OAAU,OAAO,KAAK,CAAC;CACnC,IAAI,WAAW,OAAO;CACtB,IAAI,gBAAsD;CAC1D,IAAI,gBAAmB,OAAO,KAAK;CACnC,IAAI,UAAU;CAEd,MAAM,UAAU,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"}

package/dist/{root-BCZDC5Fv.mjs → root-De-6KWIZ.mjs}

@@ -212,14 +212,16 @@ function untracked$1(fn) {
 //#endregion
 //#region src/utils.ts
 /**
-* True iff `err` is an AbortError. Used to filter superseded latest-wins
-* mutations and aborted fetches from genuine failures.
+* True iff `err` looks like an AbortError. Matches the standard `DOMException`
+* shape thrown by `AbortController` AND any object whose `name === 'AbortError'`
+* — that covers axios / msw / user-thrown plain Errors that signal abort.
 *
-* Spec: §20.12 — checks `err instanceof DOMException && err.name === 'AbortError'`.
-* Node 17+ exposes a global DOMException, so this works server-side too.
+* Spec: §20.12. Node 17+ exposes a global DOMException, so the instanceof
+* branch works server-side; the name-based branch is the portable fallback.
 */
 function isAbortError(err) {
 	if (typeof DOMException !== "undefined" && err instanceof DOMException) return err.name === "AbortError";
+	if (err != null && typeof err === "object" && "name" in err) return err.name === "AbortError";
 	return false;
 }
 /**
@@ -1630,12 +1632,25 @@ function waitUntilFalse(sig) {
 //#endregion
 //#region src/emitter.ts
 var EmitterImpl = class {
+	onError;
 	handlers = /* @__PURE__ */ new Set();
 	disposed = false;
+	constructor(onError) {
+		this.onError = onError;
+	}
 	emit(value) {
 		if (this.disposed) return;
 		const snapshot = Array.from(this.handlers);
-		for (const handler of snapshot) handler(value);
+		for (const handler of snapshot) try {
+			handler(value);
+		} catch (err) {
+			if (this.onError) try {
+				this.onError(err);
+			} catch {
+				console.error("[olas] emitter handler threw and reporter threw:", err);
+			}
+			else console.error("[olas] emitter handler threw:", err);
+		}
 	}
 	on(handler) {
 		if (this.disposed) return () => {};
@@ -1667,9 +1682,14 @@ var EmitterImpl = class {
 * (or the emitter is disposed). Use this for emitters that live outside any
 * single controller — typically in deps. Use `ctx.emitter()` for emitters that
 * should auto-clean with a controller.
+*
+* Pass `onError` to receive emit-time handler throws (spec §20.6 — one
+* throwing handler must not block the rest of the fan-out). `ctx.emitter()`
+* wires this to the root's `onError` so deps-level emitters get isolation
+* by default when constructed via `ctx`.
 */
-function createEmitter() {
-	const impl = new EmitterImpl();
+function createEmitter(options) {
+	const impl = new EmitterImpl(options?.onError);
 	return {
 		emit: ((value) => impl.emit(value)),
 		on: (handler) => impl.on(handler),
@@ -2034,8 +2054,23 @@ var FormImpl = class {
 			else child.set(val);
 			else if (isFieldArray(child)) {
 				const arr = child;
-				arr.clear();
-				for (const itemVal of val) arr.add(itemVal);
+				const newValues = val;
+				if (asInitial) {
+					arr.clear();
+					for (const itemVal of newValues) arr.add(itemVal);
+					arr.replaceInitialItems(newValues);
+				} else {
+					const current = arr.items.peek();
+					const overlap = Math.min(current.length, newValues.length);
+					for (let i = 0; i < overlap; i++) {
+						const item = current[i];
+						const v = newValues[i];
+						if (isForm(item)) item.set(v);
+						else item.set(v);
+					}
+					for (let i = current.length; i < newValues.length; i++) arr.add(newValues[i]);
+					for (let i = current.length - 1; i >= newValues.length; i--) arr.remove(i);
+				}
 			} else {
 				const f = child;
 				if (asInitial) f.setAsInitial(val);
@@ -2283,6 +2318,15 @@ var FieldArrayImpl = class {
 		for (const item of this.items$.peek()) item.dispose?.();
 		this.items$.set([]);
 	}
+	/**
+	* Internal — used by `Form.resetWithInitial` to re-anchor the array's
+	* initial items after a parent-driven `applyPartial(..., asInitial: true)`.
+	* Without this, a subsequent `reset()` would revert to the construction-
+	* time initials rather than the most-recently-applied ones.
+	*/
+	replaceInitialItems(items) {
+		this.initialItems = [...items];
+	}
 	reset() {
 		if (this.disposed) return;
 		batch$1(() => {
@@ -3228,7 +3272,12 @@ var ControllerInstance = class ControllerInstance {
 				return m;
 			},
 			emitter() {
-				const e = createEmitter();
+				const e = createEmitter({ onError: (err) => {
+					dispatchError(self.rootShared.onError, err, {
+						kind: "emitter",
+						controllerPath: self.path
+					});
+				} });
 				self.entries.push({
 					kind: "cleanup",
 					dispose: () => e.dispose()
@@ -3395,6 +3444,255 @@ var ControllerInstance = class ControllerInstance {
 					}
 				};
 			},
+			session(def, props, options) {
+				const segment = self.makeChildSegment(getFactory(def), getName(def));
+				const override = options?.deps;
+				const childDeps = override !== void 0 ? {
+					...self.deps,
+					...override
+				} : self.deps;
+				const childInstance = new ControllerInstance(self, self.rootShared, segment, childDeps);
+				const api = childInstance.construct(getFactory(def), props);
+				const entry = {
+					kind: "child",
+					instance: childInstance
+				};
+				self.entries.push(entry);
+				let disposed = false;
+				const dispose = () => {
+					if (disposed) return;
+					disposed = true;
+					const idx = self.entries.indexOf(entry);
+					if (idx >= 0) self.entries.splice(idx, 1);
+					try {
+						childInstance.dispose();
+					} catch (err) {
+						dispatchError(self.rootShared.onError, err, {
+							kind: "effect",
+							controllerPath: self.path
+						});
+					}
+				};
+				return [api, dispose];
+			},
+			collection(options) {
+				const childMap = /* @__PURE__ */ new Map();
+				const items$ = signal$1([]);
+				const size$ = computed$1(() => items$.value.length);
+				const isFactoryForm = options.factory !== void 0;
+				const buildChild = (item) => {
+					let def;
+					let childProps;
+					if (isFactoryForm) {
+						const result = options.factory(item);
+						def = result.controller;
+						childProps = result.props;
+					} else {
+						const homoOpts = options;
+						def = homoOpts.controller;
+						childProps = homoOpts.propsOf(item);
+					}
+					const segment = self.makeChildSegment(getFactory(def), getName(def));
+					const childDeps = options.deps !== void 0 ? {
+						...self.deps,
+						...options.deps
+					} : self.deps;
+					const instance = new ControllerInstance(self, self.rootShared, segment, childDeps);
+					try {
+						return {
+							instance,
+							api: instance.construct(getFactory(def), childProps),
+							def
+						};
+					} catch (err) {
+						dispatchError(self.rootShared.onError, err, {
+							kind: "construction",
+							controllerPath: self.path
+						});
+						return null;
+					}
+				};
+				const removeKey = (key) => {
+					const info = childMap.get(key);
+					if (info === void 0) return;
+					childMap.delete(key);
+					const idx = self.entries.indexOf(info.entry);
+					if (idx >= 0) self.entries.splice(idx, 1);
+					try {
+						info.instance.dispose();
+					} catch (err) {
+						dispatchError(self.rootShared.onError, err, {
+							kind: "effect",
+							controllerPath: self.path
+						});
+					}
+				};
+				const reconcile = () => {
+					const source = options.source.value;
+					const itemByKey = /* @__PURE__ */ new Map();
+					for (const item of source) {
+						const key = options.keyOf(item);
+						if (!itemByKey.has(key)) itemByKey.set(key, item);
+					}
+					for (const key of [...childMap.keys()]) if (!itemByKey.has(key)) removeKey(key);
+					for (const [key, item] of itemByKey) {
+						const existing = childMap.get(key);
+						if (existing !== void 0) {
+							if (isFactoryForm) {
+								if (options.factory(item).controller !== existing.def) {
+									removeKey(key);
+									const built = buildChild(item);
+									if (built !== null) {
+										const entry = {
+											kind: "child",
+											instance: built.instance
+										};
+										self.entries.push(entry);
+										childMap.set(key, {
+											...built,
+											entry
+										});
+									}
+								}
+							}
+							continue;
+						}
+						const built = buildChild(item);
+						if (built !== null) {
+							const entry = {
+								kind: "child",
+								instance: built.instance
+							};
+							self.entries.push(entry);
+							childMap.set(key, {
+								...built,
+								entry
+							});
+						}
+					}
+					const next = [];
+					const seen = /* @__PURE__ */ new Set();
+					for (const item of source) {
+						const key = options.keyOf(item);
+						if (seen.has(key)) continue;
+						seen.add(key);
+						const info = childMap.get(key);
+						if (info !== void 0) next.push({
+							key,
+							api: info.api
+						});
+					}
+					items$.set(next);
+				};
+				const wrapped = () => {
+					try {
+						reconcile();
+					} catch (err) {
+						dispatchError(self.rootShared.onError, err, {
+							kind: "effect",
+							controllerPath: self.path
+						});
+					}
+				};
+				const effectEntry = {
+					kind: "effect",
+					factory: wrapped,
+					dispose: null
+				};
+				if (self.state !== "suspended") effectEntry.dispose = effect$1(wrapped);
+				self.entries.push(effectEntry);
+				return {
+					items: items$,
+					size: size$,
+					get: (key) => childMap.get(key)?.api,
+					has: (key) => childMap.has(key)
+				};
+			},
+			lazyChild(loader, props, options) {
+				const status$ = signal$1("idle");
+				const api$ = signal$1(void 0);
+				const error$ = signal$1(void 0);
+				let childInstance = null;
+				let childEntry = null;
+				let pendingLoad = null;
+				let disposed = false;
+				const flagEntry = {
+					kind: "onDispose",
+					fn: () => {
+						disposed = true;
+					}
+				};
+				self.entries.push(flagEntry);
+				const handleFailure = (err) => {
+					status$.set("error");
+					error$.set(err);
+					dispatchError(self.rootShared.onError, err, {
+						kind: "construction",
+						controllerPath: self.path
+					});
+				};
+				const load = () => {
+					if (disposed) return Promise.reject(/* @__PURE__ */ new Error("[olas] ctx.lazyChild: cannot load after dispose"));
+					if (pendingLoad !== null) return pendingLoad;
+					status$.set("loading");
+					pendingLoad = loader().then((def) => {
+						if (disposed) throw new Error("[olas] ctx.lazyChild: disposed during load");
+						const segment = self.makeChildSegment(getFactory(def), getName(def));
+						const childDeps = options?.deps !== void 0 ? {
+							...self.deps,
+							...options.deps
+						} : self.deps;
+						const instance = new ControllerInstance(self, self.rootShared, segment, childDeps);
+						try {
+							const api = instance.construct(getFactory(def), props);
+							childInstance = instance;
+							childEntry = {
+								kind: "child",
+								instance
+							};
+							self.entries.push(childEntry);
+							api$.set(api);
+							status$.set("ready");
+							return api;
+						} catch (err) {
+							handleFailure(err);
+							throw err;
+						}
+					}, (err) => {
+						if (disposed) throw err;
+						handleFailure(err);
+						throw err;
+					});
+					return pendingLoad;
+				};
+				const dispose = () => {
+					if (disposed) return;
+					disposed = true;
+					if (childEntry !== null && childInstance !== null) {
+						const idx = self.entries.indexOf(childEntry);
+						if (idx >= 0) self.entries.splice(idx, 1);
+						try {
+							childInstance.dispose();
+						} catch (err) {
+							dispatchError(self.rootShared.onError, err, {
+								kind: "effect",
+								controllerPath: self.path
+							});
+						}
+						childInstance = null;
+						childEntry = null;
+					}
+					const flagIdx = self.entries.indexOf(flagEntry);
+					if (flagIdx >= 0) self.entries.splice(flagIdx, 1);
+				};
+				return {
+					status: status$,
+					api: api$,
+					error: error$,
+					load,
+					dispose
+				};
+			},
 			onDispose(fn) {
 				self.entries.push({
 					kind: "onDispose",
@@ -3570,4 +3868,4 @@ function createRoot(def, options) {
 //#endregion
 export { lookupRegisteredQuery as a, isAbortError as c, effect$1 as d, signal$1 as f, createEmitter as i, batch$1 as l, defineController as m, createRootWithProps as n, registerQueryById as o, untracked$1 as p, debouncedValidator as r, stableHash as s, createRoot as t, computed$1 as u };
 
-//# sourceMappingURL=root-BCZDC5Fv.mjs.map
+//# sourceMappingURL=root-De-6KWIZ.mjs.map