@kontsedal/olas-core 0.0.1-rc.0

package/dist/index.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.cts","names":[],"sources":["../src/signals/runtime.ts","../src/controller/define.ts","../src/controller/root.ts","../src/forms/validators.ts","../src/forms/field.ts","../src/query/define.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;;;;;;;iBC4HR,UAAA,oBAA8B,MAAA,oBAA0B,WAAA,CAAA,CACtE,GAAA,EAAK,aAAA,OAAoB,GAAA,GACzB,OAAA,EAAS,WAAA,CAAY,KAAA,IACpB,IAAA,CAAK,GAAA;;;;cCnJK,QAAA,MACP,OAAA,cAAuB,SAAS,CAAC,CAAA;AH2DvC;AAAA,cGtDa,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;;;;;;;;iBCwNrC,kBAAA,GAAA,CACd,EAAA,GAAK,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,WAAA,KAAgB,OAAA,iBACvC,EAAA,WACC,SAAA,CAAU,CAAA;;;;AJtNb;;;iBKtCgB,WAAA,2BAAA,CAAuC,IAAA,EAAM,SAAA,CAAU,IAAA,EAAM,CAAA,IAAK,KAAA,CAAM,IAAA,EAAM,CAAA;;;;;;;;iBAkE9E,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;;;;;AL9B9B;;;;;KM1DY,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;;;;;;;;;;;ANwDgD;iBMzCpC,SAAA,aAAA,CAAuB,OAAA;EAAY,OAAA;AAAA,IAAgC,SAAS,CAAC,CAAA;;;;;AN6B7F;;;;;iBO5DgB,SAAA,GAAA,CAAa,MAAA,EAAQ,UAAA,CAAW,CAAA,GAAI,EAAA,WAAa,UAAA,CAAW,CAAA;;;;;AP4D5E;;;;;iBQ5DgB,SAAA,GAAA,CAAa,MAAA,EAAQ,UAAA,CAAW,CAAA,GAAI,EAAA,WAAa,UAAA,CAAW,CAAA;;;;;;AR4D5E;;;;iBS/DgB,YAAA,CAAa,GAAY"}

package/dist/index.d.mts

@@ -0,0 +1,178 @@
+import { $ as Validator, A as DehydratedEntry, B as DeepPartial, C as DebugCacheEntry, D as InfiniteQuerySubscription, E as InfiniteQuerySpec, F as QuerySubscription, G as FieldArrayValue, H as FieldArrayItemErrors, I as RetryDelay, J as FormOptions, K as Form, L as RetryPolicy, M as LocalCache, N as Query, O as AsyncState, P as QuerySpec, Q as ItemInitial, R as Snapshot, S as DebugBus, T as InfiniteQuery, U as FieldArrayOptions, V as FieldArray, W as FieldArrayValidator, X as FormValidator, Y as FormSchema, Z as FormValue, _ as SetDataEvent, a as Ctx, at as createEmitter, b as MutationConcurrency, c as RootOptions, d as defineScope, et as Computed, f as GcEvent, g as RegisteredQuery, h as QueryClientPluginApi, i as CtrlProps, it as Emitter, j as DehydratedState, k as AsyncStatus, l as Scope, m as QueryClientPlugin, n as ControllerDef, nt as Signal, o as Field, p as InvalidateEvent, q as FormErrors, r as CtrlApi, rt as ErrorContext, s as Root, t as AmbientDeps, tt as ReadSignal, u as ScopeOptions, v as lookupRegisteredQuery, w as DebugEvent, x as MutationSpec, y as Mutation, z as UseOptions } from "./types-CAMgqCMz.mjs";
+
+//#region src/signals/runtime.d.ts
+/**
+ * Create a writable `Signal<T>`. Reads track the current auto-tracking scope
+ * (effect / computed); writes notify all subscribers (deduped via `Object.is`).
+ *
+ * Spec §20.1. For a single-pass non-tracked read use `signal.peek()`.
+ */
+declare function signal<T>(initial: T): Signal<T>;
+/**
+ * Create a `Computed<T>` — a read-only derived signal. The provided `fn` is
+ * re-evaluated whenever a signal it read during its last run changes; the
+ * resulting value is cached until then.
+ *
+ * Spec §20.1. The graph is glitch-free: a `computed` re-runs at most once per
+ * batched-write cycle.
+ */
+declare function computed<T>(fn: () => T): Computed<T>;
+/**
+ * Run `fn` immediately and again whenever any signal it reads changes. If
+ * `fn` returns a function, that function is called as a cleanup before the
+ * next re-run and on dispose.
+ *
+ * Returns a `dispose` function. Inside a controller use `ctx.effect(...)`
+ * instead — that variant is auto-disposed with the controller.
+ */
+declare function effect(fn: () => void | (() => void)): () => void;
+/**
+ * Batch synchronous signal writes so subscribers see one notification at the
+ * end of the batch rather than one per write. Returns whatever `fn` returns.
+ */
+declare function batch<T>(fn: () => T): T;
+/**
+ * Run `fn` with auto-tracking suppressed — signals read inside don't become
+ * dependencies of the surrounding `computed` / `effect`. Useful for "read
+ * these signals once to log them" or for snapshotting state inside an effect
+ * without subscribing to it. For a single-signal peek, prefer `signal.peek()`.
+ */
+declare function untracked<T>(fn: () => T): T;
+//#endregion
+//#region src/controller/define.d.ts
+/** Optional configuration for `defineController`. */
+type DefineControllerOptions = {
+  /**
+   * A short, human-readable name for this controller — used in the devtools
+   * tree, `controller:*` events, and error contexts (e.g. `["root","board[0]"]`).
+   *
+   * When omitted, the runtime falls back to `factory.name` (the JS-inferred
+   * function name) or `"anonymous"` for arrow-function factories defined
+   * inline. Naming is strongly recommended in app code.
+   */
+  name?: string;
+};
+/**
+ * Create a controller definition. The factory is stored on the returned object
+ * and invoked during `createRoot` / `ctx.child` to build instances.
+ *
+ * `Props` defaults to `void` so a factory written as `(ctx) => ...` is typed
+ * as `ControllerDef<void, Api>` — the form `createRoot` requires.
+ */
+declare function defineController<Props = void, Api = unknown>(factory: (ctx: Ctx, props: Props) => Api, options?: DefineControllerOptions): ControllerDef<Props, Api>;
+//#endregion
+//#region src/controller/root.d.ts
+/**
+ * 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>;
+//#endregion
+//#region src/forms/validators.d.ts
+/** Reject empty values (undefined, null, empty string, empty array). */
+declare const required: <T>(message?: string) => Validator<T>;
+/** 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`. */
+declare const maxLength: (n: number, message?: string) => Validator<string | readonly unknown[]>;
+/** Reject numbers less than `n`. */
+declare const min: (n: number, message?: string) => Validator<number>;
+/** Reject numbers greater than `n`. */
+declare const max: (n: number, message?: string) => Validator<number>;
+/** Reject strings that don't look like an email. Empty / null pass (use with `required` to forbid). */
+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
+ * scope; per-root QueryClients bind their own entry registries to it.
+ */
+declare function defineQuery<Args extends unknown[], T>(spec: QuerySpec<Args, T>): Query<Args, T>;
+/**
+ * Define a paginated query (chat-style "load more", infinite scrolling). Pages
+ * are kept in order and concatenated via `getNextPageParam` /
+ * `getPreviousPageParam`. The returned handle is module-scoped — bind
+ * subscribers via `ctx.use(infiniteQuery, () => [...args])`. Spec §5.7,
+ * §20.4.
+ */
+declare function defineInfiniteQuery<Args extends unknown[], PageParam, TPage, TItem = TPage>(spec: InfiniteQuerySpec<Args, PageParam, TPage, TItem>): InfiniteQuery<Args, TPage, TItem>;
+//#endregion
+//#region src/selection.d.ts
+/**
+ * Multi-select state for tables / lists with bulk actions (spec §17.5).
+ *
+ * Plain function — not bound to `ctx`. Place it in a controller's closure so
+ * it dies with the closure. The phantom `T` parameter brands the selection by
+ * item type; IDs are always strings.
+ */
+type Selection<T = unknown> = {
+  selectedIds: ReadSignal<ReadonlySet<string>>;
+  size: ReadSignal<number>;
+  isSelected(id: string): ReadSignal<boolean>;
+  select(id: string): void;
+  deselect(id: string): void;
+  toggle(id: string): void;
+  clear(): void;
+  selectAll(ids: readonly string[]): void;
+  handleClick(id: string, mods: {
+    shift?: boolean;
+    meta?: boolean;
+  }, ordered: readonly string[]): void;
+};
+/**
+ * Create a `Selection<T>`. Optional `initial` seeds the selected set.
+ *
+ * `handleClick` encapsulates the standard click semantics:
+ * - plain click → select only `id` (anchor moves to `id`)
+ * - meta-click  → toggle `id` (anchor moves to `id` on add)
+ * - shift-click → range from anchor to `id` along `ordered` (anchor sticks,
+ *   so subsequent shift-clicks extend from the same origin)
+ *
+ * Spec §16.5 / §17.5.
+ */
+declare function selection<T = unknown>(options?: {
+  initial?: readonly string[];
+}): Selection<T>;
+//#endregion
+//#region src/timing/debounced.d.ts
+/**
+ * Lag a signal by `ms`. The returned signal updates only after the source has
+ * been unchanged for `ms`. Each new write resets the timer.
+ *
+ * No lifecycle — the internal effect runs for the lifetime of the program.
+ * Use inside a controller closure so it dies with the closure.
+ */
+declare function debounced<T>(source: ReadSignal<T>, ms: number): ReadSignal<T>;
+//#endregion
+//#region src/timing/throttled.d.ts
+/**
+ * Rate-limit a signal so it emits at most once per `ms` (leading + trailing).
+ * The first change passes through immediately. Subsequent changes within the
+ * window are coalesced; the latest value is emitted when the window expires.
+ *
+ * No lifecycle — see debounced() note.
+ */
+declare function throttled<T>(source: ReadSignal<T>, ms: number): ReadSignal<T>;
+//#endregion
+//#region src/utils.d.ts
+/**
+ * True iff `err` is an AbortError. Used to filter superseded latest-wins
+ * mutations and aborted fetches from genuine failures.
+ *
+ * Spec: §20.12 — checks `err instanceof DOMException && err.name === 'AbortError'`.
+ * Node 17+ exposes a global DOMException, so this works server-side too.
+ */
+declare function isAbortError(err: unknown): boolean;
+//#endregion
+export { type AmbientDeps, type AsyncState, type AsyncStatus, 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 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 LocalCache, type Mutation, type MutationConcurrency, type MutationSpec, type Query, type QueryClientPlugin, type QueryClientPluginApi, type QuerySpec, type QuerySubscription, type ReadSignal, type RegisteredQuery, type RetryDelay, type RetryPolicy, type Root, type RootOptions, type Scope, type ScopeOptions, type Selection, type SetDataEvent, type Signal, type Snapshot, type UseOptions, type Validator, batch, computed, createEmitter, createRoot, debounced, debouncedValidator, defineController, defineInfiniteQuery, defineQuery, defineScope, effect, email, isAbortError, lookupRegisteredQuery, max, maxLength, min, minLength, pattern, required, selection, signal, throttled, untracked };
+//# sourceMappingURL=index.d.mts.map

package/dist/index.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.mts","names":[],"sources":["../src/signals/runtime.ts","../src/controller/define.ts","../src/controller/root.ts","../src/forms/validators.ts","../src/forms/field.ts","../src/query/define.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;;;;;;;iBC4HR,UAAA,oBAA8B,MAAA,oBAA0B,WAAA,CAAA,CACtE,GAAA,EAAK,aAAA,OAAoB,GAAA,GACzB,OAAA,EAAS,WAAA,CAAY,KAAA,IACpB,IAAA,CAAK,GAAA;;;;cCnJK,QAAA,MACP,OAAA,cAAuB,SAAS,CAAC,CAAA;AH2DvC;AAAA,cGtDa,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;;;;;;;;iBCwNrC,kBAAA,GAAA,CACd,EAAA,GAAK,KAAA,EAAO,CAAA,EAAG,MAAA,EAAQ,WAAA,KAAgB,OAAA,iBACvC,EAAA,WACC,SAAA,CAAU,CAAA;;;;AJtNb;;;iBKtCgB,WAAA,2BAAA,CAAuC,IAAA,EAAM,SAAA,CAAU,IAAA,EAAM,CAAA,IAAK,KAAA,CAAM,IAAA,EAAM,CAAA;;;;;;;;iBAkE9E,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;;;;;AL9B9B;;;;;KM1DY,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;;;;;;;;;;;ANwDgD;iBMzCpC,SAAA,aAAA,CAAuB,OAAA;EAAY,OAAA;AAAA,IAAgC,SAAS,CAAC,CAAA;;;;;AN6B7F;;;;;iBO5DgB,SAAA,GAAA,CAAa,MAAA,EAAQ,UAAA,CAAW,CAAA,GAAI,EAAA,WAAa,UAAA,CAAW,CAAA;;;;;AP4D5E;;;;;iBQ5DgB,SAAA,GAAA,CAAa,MAAA,EAAQ,UAAA,CAAW,CAAA,GAAI,EAAA,WAAa,UAAA,CAAW,CAAA;;;;;;AR4D5E;;;;iBS/DgB,YAAA,CAAa,GAAY"}

package/dist/index.mjs

@@ -0,0 +1,339 @@
+import { a as lookupRegisteredQuery, c as batch, d as signal, f as untracked, i as createEmitter, l as computed, o as registerQueryById, p as defineController, r as debouncedValidator, s as isAbortError, t as createRoot, u as effect } from "./root-BImHnGj1.mjs";
+//#region src/signals/readonly.ts
+/**
+* Project a Signal (or any object with a reactive `value` + `peek` + `subscribe`)
+* as a `ReadSignal`. The returned object does not expose `set` / `update` /
+* settable `value`, so it can be returned from APIs without callers mutating it.
+*
+* Internal helper — not exported from the package's public surface.
+*/
+function readOnly(source) {
+	return {
+		get value() {
+			return source.value;
+		},
+		peek() {
+			return source.peek();
+		},
+		subscribe(handler) {
+			return source.subscribe(handler);
+		}
+	};
+}
+//#endregion
+//#region src/forms/validators.ts
+const isEmpty = (value) => {
+	if (value === void 0 || value === null) return true;
+	if (typeof value === "string") return value.length === 0;
+	if (Array.isArray(value)) return value.length === 0;
+	return false;
+};
+/** Reject empty values (undefined, null, empty string, empty array). */
+const required = (message = "Required") => (value) => isEmpty(value) ? message : null;
+/** Reject strings / arrays shorter than `n`. Allows null/undefined (use with `required` to forbid). */
+const minLength = (n, message) => (value) => {
+	if (value == null) return null;
+	if (value.length >= n) return null;
+	return message ?? `Must be at least ${n} characters`;
+};
+/** Reject strings / arrays longer than `n`. */
+const maxLength = (n, message) => (value) => {
+	if (value == null) return null;
+	if (value.length <= n) return null;
+	return message ?? `Must be no more than ${n} characters`;
+};
+/** Reject numbers less than `n`. */
+const min = (n, message) => (value) => {
+	if (value == null) return null;
+	if (value >= n) return null;
+	return message ?? `Must be at least ${n}`;
+};
+/** Reject numbers greater than `n`. */
+const max = (n, message) => (value) => {
+	if (value == null) return null;
+	if (value <= n) return null;
+	return message ?? `Must be no more than ${n}`;
+};
+const EMAIL_RE = /^[^\s@]+@[^\s@]+\.[^\s@]+$/;
+/** Reject strings that don't look like an email. Empty / null pass (use with `required` to forbid). */
+const email = (message = "Invalid email address") => (value) => {
+	if (value == null || value === "") return null;
+	return EMAIL_RE.test(value) ? null : message;
+};
+/** Reject strings that don't match the supplied `RegExp`. */
+const pattern = (re, message = "Invalid format") => (value) => {
+	if (value == null || value === "") return null;
+	return re.test(value) ? null : message;
+};
+//#endregion
+//#region src/query/define.ts
+function registerQueryId(spec, query) {
+	if (spec.queryId != null) registerQueryById(spec.queryId, query);
+	else if (spec.crossTab === true) {}
+}
+/**
+* Define a keyed, shared query. The returned Query value lives at module
+* scope; per-root QueryClients bind their own entry registries to it.
+*/
+function defineQuery(spec) {
+	const clients = /* @__PURE__ */ new Set();
+	const query = {
+		__olas: "query",
+		__spec: spec,
+		__clients: clients,
+		invalidate(...args) {
+			for (const client of clients) client.invalidate(query, args);
+		},
+		invalidateAll() {
+			for (const client of clients) client.invalidateAll(query);
+		},
+		setData(...rest) {
+			const updater = rest[rest.length - 1];
+			const keyArgs = rest.slice(0, -1);
+			const childSnapshots = [];
+			for (const client of clients) childSnapshots.push(client.setData(query, keyArgs, updater));
+			return {
+				rollback: () => {
+					for (const s of childSnapshots) s.rollback();
+				},
+				finalize: () => {
+					for (const s of childSnapshots) s.finalize();
+				}
+			};
+		},
+		prefetch(...args) {
+			const [first] = clients;
+			if (!first) return Promise.reject(/* @__PURE__ */ new Error("[olas] prefetch called before any root has subscribed"));
+			return first.prefetch(query, args);
+		}
+	};
+	registerQueryId(spec, query);
+	return query;
+}
+/**
+* Define a paginated query (chat-style "load more", infinite scrolling). Pages
+* are kept in order and concatenated via `getNextPageParam` /
+* `getPreviousPageParam`. The returned handle is module-scoped — bind
+* subscribers via `ctx.use(infiniteQuery, () => [...args])`. Spec §5.7,
+* §20.4.
+*/
+function defineInfiniteQuery(spec) {
+	const clients = /* @__PURE__ */ new Set();
+	const query = {
+		__olas: "infiniteQuery",
+		__spec: spec,
+		__clients: clients,
+		invalidate(...args) {
+			for (const client of clients) client.invalidateInfinite(query, args);
+		},
+		invalidateAll() {
+			for (const client of clients) client.invalidateAllInfinite(query);
+		},
+		setData(...rest) {
+			const updater = rest[rest.length - 1];
+			const keyArgs = rest.slice(0, -1);
+			const childSnapshots = [];
+			for (const client of clients) childSnapshots.push(client.setInfiniteData(query, keyArgs, updater));
+			return {
+				rollback: () => {
+					for (const s of childSnapshots) s.rollback();
+				},
+				finalize: () => {
+					for (const s of childSnapshots) s.finalize();
+				}
+			};
+		},
+		prefetch(...args) {
+			const [first] = clients;
+			if (!first) return Promise.reject(/* @__PURE__ */ new Error("[olas] prefetch called before any root has subscribed"));
+			return first.prefetchInfinite(query, args);
+		}
+	};
+	registerQueryId(spec, query);
+	return query;
+}
+//#endregion
+//#region src/scope.ts
+/**
+* Create a scope. The returned value is the typed handle passed to
+* `ctx.provide(scope, value)` and `ctx.inject(scope)`. Identity is keyed by
+* an internal symbol so two `defineScope()` calls — even with identical
+* options — yield distinct scopes.
+*/
+function defineScope(options) {
+	const hasDefault = options !== void 0 && "default" in options;
+	const name = options?.name;
+	return {
+		__olas: "scope",
+		__id: Symbol(name ?? "scope"),
+		hasDefault,
+		...name !== void 0 ? { name } : {},
+		...hasDefault ? { default: options?.default } : {}
+	};
+}
+//#endregion
+//#region src/selection.ts
+/**
+* Create a `Selection<T>`. Optional `initial` seeds the selected set.
+*
+* `handleClick` encapsulates the standard click semantics:
+* - plain click → select only `id` (anchor moves to `id`)
+* - meta-click  → toggle `id` (anchor moves to `id` on add)
+* - shift-click → range from anchor to `id` along `ordered` (anchor sticks,
+*   so subsequent shift-clicks extend from the same origin)
+*
+* Spec §16.5 / §17.5.
+*/
+function selection(options) {
+	const ids = signal(new Set(options?.initial));
+	let anchor = options?.initial?.length ? options.initial[options.initial.length - 1] ?? null : null;
+	let preShiftSelection = null;
+	const size = computed(() => ids.value.size);
+	const isSelected = (id) => computed(() => ids.value.has(id));
+	const select = (id) => {
+		const prev = ids.peek();
+		if (!prev.has(id)) {
+			const next = new Set(prev);
+			next.add(id);
+			ids.set(next);
+		}
+		anchor = id;
+	};
+	const deselect = (id) => {
+		const prev = ids.peek();
+		if (!prev.has(id)) return;
+		const next = new Set(prev);
+		next.delete(id);
+		ids.set(next);
+	};
+	const toggle = (id) => {
+		const prev = ids.peek();
+		const next = new Set(prev);
+		if (prev.has(id)) next.delete(id);
+		else {
+			next.add(id);
+			anchor = id;
+		}
+		ids.set(next);
+	};
+	const clear = () => {
+		if (ids.peek().size === 0) {
+			anchor = null;
+			return;
+		}
+		ids.set(/* @__PURE__ */ new Set());
+		anchor = null;
+	};
+	const selectAll = (incoming) => {
+		ids.set(new Set(incoming));
+		anchor = incoming.length > 0 ? incoming[incoming.length - 1] ?? null : null;
+	};
+	const handleClick = (id, mods, ordered) => {
+		if (mods.shift && anchor !== null) {
+			const anchorIdx = ordered.indexOf(anchor);
+			const targetIdx = ordered.indexOf(id);
+			if (anchorIdx === -1 || targetIdx === -1) {
+				ids.set(new Set([id]));
+				anchor = id;
+				preShiftSelection = null;
+				return;
+			}
+			if (preShiftSelection === null) preShiftSelection = ids.peek();
+			const [lo, hi] = anchorIdx < targetIdx ? [anchorIdx, targetIdx] : [targetIdx, anchorIdx];
+			const next = new Set(preShiftSelection);
+			for (const k of ordered.slice(lo, hi + 1)) next.add(k);
+			ids.set(next);
+			return;
+		}
+		preShiftSelection = null;
+		if (mods.meta) {
+			toggle(id);
+			return;
+		}
+		ids.set(new Set([id]));
+		anchor = id;
+	};
+	return {
+		selectedIds: readOnly(ids),
+		size,
+		isSelected,
+		select,
+		deselect,
+		toggle,
+		clear,
+		selectAll,
+		handleClick
+	};
+}
+//#endregion
+//#region src/timing/debounced.ts
+/**
+* Lag a signal by `ms`. The returned signal updates only after the source has
+* been unchanged for `ms`. Each new write resets the timer.
+*
+* No lifecycle — the internal effect runs for the lifetime of the program.
+* Use inside a controller closure so it dies with the closure.
+*/
+function debounced(source, ms) {
+	const out = signal(source.peek());
+	let timer = null;
+	let initial = true;
+	effect(() => {
+		const value = source.value;
+		if (initial) {
+			initial = false;
+			return;
+		}
+		if (timer != null) clearTimeout(timer);
+		timer = setTimeout(() => {
+			out.set(value);
+			timer = null;
+		}, ms);
+	});
+	return out;
+}
+//#endregion
+//#region src/timing/throttled.ts
+/**
+* Rate-limit a signal so it emits at most once per `ms` (leading + trailing).
+* The first change passes through immediately. Subsequent changes within the
+* window are coalesced; the latest value is emitted when the window expires.
+*
+* No lifecycle — see debounced() note.
+*/
+function throttled(source, ms) {
+	const out = signal(source.peek());
+	let lastEmit = Number.NEGATIVE_INFINITY;
+	let trailingTimer = null;
+	let trailingValue = source.peek();
+	let initial = true;
+	effect(() => {
+		const value = source.value;
+		if (initial) {
+			initial = false;
+			return;
+		}
+		const now = Date.now();
+		const elapsed = now - lastEmit;
+		if (elapsed >= ms) {
+			out.set(value);
+			lastEmit = now;
+			if (trailingTimer != null) {
+				clearTimeout(trailingTimer);
+				trailingTimer = null;
+			}
+		} else {
+			trailingValue = value;
+			if (trailingTimer == null) trailingTimer = setTimeout(() => {
+				out.set(trailingValue);
+				lastEmit = Date.now();
+				trailingTimer = null;
+			}, ms - elapsed);
+		}
+	});
+	return out;
+}
+//#endregion
+export { batch, computed, createEmitter, createRoot, debounced, debouncedValidator, defineController, defineInfiniteQuery, defineQuery, defineScope, effect, email, isAbortError, lookupRegisteredQuery, max, maxLength, min, minLength, pattern, required, selection, signal, throttled, untracked };
+
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +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      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      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;GAE1F,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;GAE1F,OAAO,MAAM,iBAAiB,OAA4C,IAAI;EAChF;CACF;CAEA,gBAAgB,MAAM,KAAK;CAC3B,OAAO;AACT;;;;;;;;;AC3HA,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"}