@neurocle/synapse-react 0.0.0-stage → 0.3.0

package/dist/shared/character-count.mjs

@@ -0,0 +1,29 @@
+"use client";
+import { useTranslations } from "../provider/locale-context.mjs";
+import { useRegisteredDescription } from "./field-context.mjs";
+import { createElement } from "react";
+import { visuallyHiddenStyle } from "@zag-js/dom-query";
+//#region src/shared/character-count.tsx
+const hiddenStyle = visuallyHiddenStyle;
+const nearLimit = (length, max) => max !== void 0 && max - length <= Math.max(10, Math.ceil(max / 10));
+function CharacterCount({ id, className, length, max, compact = false }) {
+	const translate = useTranslations(void 0);
+	useRegisteredDescription(id);
+	const near = nearLimit(length, max);
+	return createElement("div", {
+		id,
+		className,
+		"data-part": "character-count",
+		...near ? { "data-near-limit": "" } : {}
+	}, createElement("span", { "aria-hidden": true }, max === void 0 ? String(length) : `${String(length)}${compact ? "/" : " / "}${String(max)}`), createElement("span", { style: hiddenStyle }, max === void 0 ? translate("field.characterCount.length", { count: length }) : translate("field.characterCount.label", {
+		count: length,
+		max
+	})), createElement("span", {
+		style: hiddenStyle,
+		"aria-live": "polite"
+	}, near && max !== void 0 ? translate("field.characterCount.remaining", { count: max - length }) : ""));
+}
+//#endregion
+export { CharacterCount, nearLimit };
+
+//# sourceMappingURL=character-count.mjs.map

package/dist/shared/character-count.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"character-count.mjs","names":[],"sources":["../../src/shared/character-count.tsx"],"sourcesContent":["'use client'\n\nimport { visuallyHiddenStyle } from '@zag-js/dom-query'\nimport { createElement, type CSSProperties, type ReactNode } from 'react'\n\nimport { useTranslations } from '#/provider/locale-context.ts'\nimport { useRegisteredDescription } from '#/shared/field-context.ts'\n\nexport interface CharacterCountProps {\n  id: string\n  className: string | undefined\n  length: number\n  max: number | undefined\n  compact?: boolean\n}\n\nconst hiddenStyle: CSSProperties = visuallyHiddenStyle\n\nexport const nearLimit = (length: number, max: number | undefined): boolean =>\n  max !== undefined && max - length <= Math.max(10, Math.ceil(max / 10))\n\nexport function CharacterCount({\n  id,\n  className,\n  length,\n  max,\n  compact = false,\n}: CharacterCountProps): ReactNode {\n  const translate = useTranslations(undefined)\n  useRegisteredDescription(id)\n  const near = nearLimit(length, max)\n  return createElement(\n    'div',\n    {\n      id,\n      className,\n      'data-part': 'character-count',\n      ...(near ? { 'data-near-limit': '' } : {}),\n    },\n    createElement(\n      'span',\n      { 'aria-hidden': true },\n      max === undefined\n        ? String(length)\n        : `${String(length)}${compact ? '/' : ' / '}${String(max)}`,\n    ),\n    createElement(\n      'span',\n      { style: hiddenStyle },\n      max === undefined\n        ? translate('field.characterCount.length', { count: length })\n        : translate('field.characterCount.label', { count: length, max }),\n    ),\n    createElement(\n      'span',\n      { style: hiddenStyle, 'aria-live': 'polite' },\n      near && max !== undefined\n        ? translate('field.characterCount.remaining', { count: max - length })\n        : '',\n    ),\n  )\n}\n"],"mappings":";;;;;;AAgBA,MAAM,cAA6B;AAEnC,MAAa,aAAa,QAAgB,QACxC,QAAQ,KAAA,KAAa,MAAM,UAAU,KAAK,IAAI,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;AAEvE,SAAgB,eAAe,EAC7B,IACA,WACA,QACA,KACA,UAAU,SACuB;CACjC,MAAM,YAAY,gBAAgB,KAAA,CAAS;CAC3C,yBAAyB,EAAE;CAC3B,MAAM,OAAO,UAAU,QAAQ,GAAG;CAClC,OAAO,cACL,OACA;EACE;EACA;EACA,aAAa;EACb,GAAI,OAAO,EAAE,mBAAmB,GAAG,IAAI,CAAC;CAC1C,GACA,cACE,QACA,EAAE,eAAe,KAAK,GACtB,QAAQ,KAAA,IACJ,OAAO,MAAM,IACb,GAAG,OAAO,MAAM,IAAI,UAAU,MAAM,QAAQ,OAAO,GAAG,GAC5D,GACA,cACE,QACA,EAAE,OAAO,YAAY,GACrB,QAAQ,KAAA,IACJ,UAAU,+BAA+B,EAAE,OAAO,OAAO,CAAC,IAC1D,UAAU,8BAA8B;EAAE,OAAO;EAAQ;CAAI,CAAC,CACpE,GACA,cACE,QACA;EAAE,OAAO;EAAa,aAAa;CAAS,GAC5C,QAAQ,QAAQ,KAAA,IACZ,UAAU,kCAAkC,EAAE,OAAO,MAAM,OAAO,CAAC,IACnE,EACN,CACF;AACF"}

package/dist/shared/collection-internal.mjs

@@ -0,0 +1,24 @@
+import { ListCollection, TreeCollection } from "@zag-js/collection";
+//#region src/shared/collection-internal.ts
+const upstreamOf = /* @__PURE__ */ new WeakMap();
+function registerUpstream(collection, upstream) {
+	upstreamOf.set(collection, upstream);
+}
+function unwrap(collection) {
+	const upstream = upstreamOf.get(collection);
+	if (!(upstream instanceof ListCollection)) throw new Error("[synapse] collection was not created by createCollection");
+	return upstream;
+}
+const upstreamTreeOf = /* @__PURE__ */ new WeakMap();
+function registerUpstreamTree(collection, upstream) {
+	upstreamTreeOf.set(collection, upstream);
+}
+function unwrapTree(collection) {
+	const upstream = upstreamTreeOf.get(collection);
+	if (!(upstream instanceof TreeCollection)) throw new Error("[synapse] collection was not created by createTreeCollection");
+	return upstream;
+}
+//#endregion
+export { registerUpstream, registerUpstreamTree, unwrap, unwrapTree };
+
+//# sourceMappingURL=collection-internal.mjs.map

package/dist/shared/collection-internal.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection-internal.mjs","names":[],"sources":["../../src/shared/collection-internal.ts"],"sourcesContent":["import { ListCollection, TreeCollection } from '@zag-js/collection'\n\nimport type { SynapseCollection, SynapseTreeCollection } from '#/shared/collection.ts'\n\nconst upstreamOf = new WeakMap<object, object>()\n\nexport function registerUpstream(collection: object, upstream: object): void {\n  upstreamOf.set(collection, upstream)\n}\n\nexport function unwrap<TItem>(collection: SynapseCollection<TItem>): ListCollection<unknown> {\n  const upstream = upstreamOf.get(collection)\n  if (!(upstream instanceof ListCollection)) {\n    throw new Error('[synapse] collection was not created by createCollection')\n  }\n  return upstream\n}\n\nconst upstreamTreeOf = new WeakMap<object, object>()\n\nexport function registerUpstreamTree(collection: object, upstream: object): void {\n  upstreamTreeOf.set(collection, upstream)\n}\n\nexport function unwrapTree<TNode>(\n  collection: SynapseTreeCollection<TNode>,\n): TreeCollection<unknown> {\n  const upstream = upstreamTreeOf.get(collection)\n  if (!(upstream instanceof TreeCollection)) {\n    throw new Error('[synapse] collection was not created by createTreeCollection')\n  }\n  return upstream\n}\n"],"mappings":";;AAIA,MAAM,6BAAa,IAAI,QAAwB;AAE/C,SAAgB,iBAAiB,YAAoB,UAAwB;CAC3E,WAAW,IAAI,YAAY,QAAQ;AACrC;AAEA,SAAgB,OAAc,YAA+D;CAC3F,MAAM,WAAW,WAAW,IAAI,UAAU;CAC1C,IAAI,EAAE,oBAAoB,iBACxB,MAAM,IAAI,MAAM,0DAA0D;CAE5E,OAAO;AACT;AAEA,MAAM,iCAAiB,IAAI,QAAwB;AAEnD,SAAgB,qBAAqB,YAAoB,UAAwB;CAC/E,eAAe,IAAI,YAAY,QAAQ;AACzC;AAEA,SAAgB,WACd,YACyB;CACzB,MAAM,WAAW,eAAe,IAAI,UAAU;CAC9C,IAAI,EAAE,oBAAoB,iBACxB,MAAM,IAAI,MAAM,8DAA8D;CAEhF,OAAO;AACT"}

package/dist/shared/collection.d.mts

@@ -0,0 +1,120 @@
+import { CSSProperties } from "react";
+//#region src/shared/collection.d.ts
+export interface CollectionOptions<TItem> {
+  items: readonly TItem[];
+  itemToValue: (item: TItem) => string;
+  itemToLabel: (item: TItem) => string;
+  isItemDisabled?: (item: TItem) => boolean;
+  groupBy?: (item: TItem, index: number) => string;
+  groupOrder?: readonly string[] | 'asc' | 'desc';
+}
+export interface ItemPosition {
+  index: number;
+  collectionSize: number;
+  group: string | null;
+  posInSet: number;
+  setSize: number;
+}
+export interface WindowEntry<TItem> {
+  item: TItem;
+  value: string;
+  index: number;
+}
+export interface WindowRequest {
+  start: number;
+  count: number;
+  activeValue?: string | null;
+  overscan?: number;
+}
+export interface WindowRow<TItem, TPosition = ItemPosition> extends WindowEntry<TItem> {
+  position: TPosition;
+  pinned: boolean;
+}
+export interface CollectionWindow<TItem, TPosition = ItemPosition> {
+  start: number;
+  end: number;
+  entries: readonly WindowEntry<TItem>[];
+  leadingCount: number;
+  trailingCount: number;
+  pinned: WindowEntry<TItem> | null;
+  rows: readonly WindowRow<TItem, TPosition>[];
+}
+export interface NavigateOptions {
+  step?: number;
+  loop?: boolean;
+}
+export interface TypeaheadState {
+  query: string;
+  lastKeyAt: number;
+}
+export interface SynapseCollection<TItem> {
+  readonly size: number;
+  readonly values: readonly string[];
+  itemAt: (index: number) => TItem | null;
+  itemOf: (value: string | null | undefined) => TItem | null;
+  valueOf: (item: TItem) => string;
+  labelOf: (value: string | null | undefined) => string | null;
+  isDisabled: (value: string | null | undefined) => boolean;
+  has: (value: string | null | undefined) => boolean;
+  indexOf: (value: string | null | undefined) => number;
+  positionOf: (value: string | null | undefined) => ItemPosition | null;
+  first: () => string | null;
+  last: () => string | null;
+  next: (value: string, options?: NavigateOptions) => string | null;
+  previous: (value: string, options?: NavigateOptions) => string | null;
+  typeahead: (key: string, state: TypeaheadState, from: string | null, now?: number, timeout?: number) => string | null;
+  resolveWindow: (request: WindowRequest) => CollectionWindow<TItem>;
+  followActive: (value: string | null | undefined, start: number, count: number) => number;
+  withItems: (items: readonly TItem[]) => SynapseCollection<TItem>;
+}
+export interface RowProps {
+  readonly 'aria-posinset': number;
+  readonly 'aria-setsize': number;
+  readonly 'aria-level'?: number;
+  readonly style?: CSSProperties;
+}
+export declare function rowProps(row: WindowRow<unknown, ItemPosition | TreeNodePosition>): RowProps;
+export declare function createCollection<TItem>(options: CollectionOptions<TItem>): SynapseCollection<TItem>;
+export interface TreeNodePosition {
+  level: number;
+  posInSet: number;
+  setSize: number;
+  indexPath: readonly number[];
+  valuePath: readonly string[];
+  branch: boolean;
+}
+export interface TreeCollectionOptions<TNode> {
+  rootNode: TNode;
+  nodeToValue: (node: TNode) => string;
+  nodeToLabel: (node: TNode) => string;
+  nodeToChildren?: (node: TNode) => readonly TNode[] | undefined;
+  isNodeDisabled?: (node: TNode) => boolean;
+  nodeToChildrenCount?: (node: TNode) => number | undefined;
+}
+export interface TreeWindowRequest {
+  expandedValues: readonly string[];
+  start: number;
+  count: number;
+  activeValue?: string | null;
+  overscan?: number;
+}
+export interface SynapseTreeCollection<TNode> {
+  readonly rootNode: TNode;
+  readonly size: number;
+  has: (value: string | null | undefined) => boolean;
+  nodeOf: (value: string | null | undefined) => TNode | null;
+  valueOf: (node: TNode) => string;
+  labelOf: (value: string | null | undefined) => string | null;
+  isDisabled: (value: string | null | undefined) => boolean;
+  isBranch: (value: string | null | undefined) => boolean;
+  childrenOf: (value: string | null | undefined) => readonly TNode[];
+  positionOf: (value: string | null | undefined) => TreeNodePosition | null;
+  visibleValues: (expandedValues: readonly string[]) => readonly string[];
+  resolveWindow: (request: TreeWindowRequest) => CollectionWindow<TNode, TreeNodePosition>;
+  followActive: (value: string | null | undefined, expandedValues: readonly string[], start: number, count: number) => number;
+  expansionFor: (value: string | null | undefined, expandedValues: readonly string[]) => readonly string[];
+  withRootNode: (rootNode: TNode) => SynapseTreeCollection<TNode>;
+}
+export declare function createTreeCollection<TNode>(options: TreeCollectionOptions<TNode>): SynapseTreeCollection<TNode>;
+//#endregion
+//# sourceMappingURL=collection.d.mts.map

package/dist/shared/collection.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection.d.mts","names":[],"sources":["../../src/shared/collection.ts"],"mappings":";;iBAOiB,kBAAkB;EACjC,gBAAgB;EAChB,cAAc,MAAM;EACpB,cAAc,MAAM;EACpB,kBAAkB,MAAM;EACxB,WAAW,MAAM,OAAO;EACxB;;iBAGe;EACf;EACA;EACA;EACA;EACA;;iBAGe,YAAY;EAC3B,MAAM;EACN;EACA;;iBAGe;EACf;EACA;EACA;EACA;;iBAGe,UAAU,OAAO,YAAY,sBAAsB,YAAY;EAC9E,UAAU;EACV;;iBAGe,iBAAiB,OAAO,YAAY;EACnD;EACA;EACA,kBAAkB,YAAY;EAC9B;EACA;EACA,QAAQ,YAAY;EACpB,eAAe,UAAU,OAAO;;iBAGjB;EACf;EACA;;iBAGe;EACf;EACA;;iBAGe,kBAAkB;WACxB;WACA;EAET,SAAS,kBAAkB;EAC3B,SAAS,qCAAqC;EAC9C,UAAU,MAAM;EAChB,UAAU;EACV,aAAa;EACb,MAAM;EACN,UAAU;EAEV,aAAa,qCAAqC;EAElD;EACA;EACA,OAAO,eAAe,UAAU;EAChC,WAAW,eAAe,UAAU;EAEpC,YACE,aACA,OAAO,gBACP,qBACA,cACA;EAGF,gBAAgB,SAAS,kBAAkB,iBAAiB;EAE5D,eAAe,kCAAkC,eAAe;EAEhE,YAAY,gBAAgB,YAAY,kBAAkB;;iBAG3C;WACN;WACA;WACA;WACA,QAAQ;;wBAGH,SAAS,KAAK,mBAAmB,eAAe,oBAAoB;wBAYpE,iBAAiB,OAC/B,SAAS,kBAAkB,SAC1B,kBAAkB;iBA4OJ;EACf;EACA;EACA;EACA;EACA;EACA;;iBAGe,sBAAsB;EACrC,UAAU;EACV,cAAc,MAAM;EACpB,cAAc,MAAM;EACpB,kBAAkB,MAAM,mBAAmB;EAC3C,kBAAkB,MAAM;EACxB,uBAAuB,MAAM;;iBAGd;EACf;EACA;EACA;EACA;EACA;;iBAGe,sBAAsB;WAC5B,UAAU;WACV;EAET,MAAM;EACN,SAAS,qCAAqC;EAC9C,UAAU,MAAM;EAChB,UAAU;EACV,aAAa;EACb,WAAW;EACX,aAAa,8CAA8C;EAE3D,aAAa,qCAAqC;EAElD,gBAAgB;EAEhB,gBAAgB,SAAS,sBAAsB,iBAAiB,OAAO;EAEvE,eACE,kCACA,mCACA,eACA;EAGF,eACE,kCACA;EAGF,eAAe,UAAU,UAAU,sBAAsB;;wBAmB3C,qBAAqB,OACnC,SAAS,sBAAsB,SAC9B,sBAAsB"}

package/dist/shared/collection.mjs

@@ -0,0 +1,395 @@
+import { devWarn } from "../system/dev-warn.mjs";
+import { registerUpstream, registerUpstreamTree } from "./collection-internal.mjs";
+import { ListCollection, TreeCollection } from "@zag-js/collection";
+import { visuallyHiddenStyle } from "@zag-js/dom-query";
+//#region src/shared/collection.ts
+function rowProps(row) {
+	const level = "level" in row.position ? row.position.level : void 0;
+	const base = {
+		"aria-posinset": row.position.posInSet,
+		"aria-setsize": row.position.setSize,
+		...level === void 0 ? {} : { "aria-level": level }
+	};
+	return row.pinned ? {
+		...base,
+		style: visuallyHiddenStyle
+	} : base;
+}
+const TYPEAHEAD_TIMEOUT = 350;
+function createCollection(options) {
+	const { items, itemToValue, itemToLabel, isItemDisabled, groupBy, groupOrder } = options;
+	const upstream = new ListCollection({
+		items: [...items],
+		itemToValue,
+		itemToString: itemToLabel,
+		isItemDisabled: isItemDisabled ?? (() => false),
+		...groupBy ? { groupBy } : {},
+		...groupOrder ? { groupSort: typeof groupOrder === "string" ? groupOrder : [...groupOrder] } : {}
+	});
+	const ordered = [];
+	const groupKeys = [];
+	for (const [key, groupItems] of upstream.group()) for (const item of groupItems) {
+		ordered.push(item);
+		groupKeys.push(groupBy ? key : null);
+	}
+	const indexByValue = /* @__PURE__ */ new Map();
+	const orderedValues = [];
+	ordered.forEach((item, index) => {
+		const value = itemToValue(item);
+		orderedValues.push(value);
+		if (!indexByValue.has(value)) indexByValue.set(value, index);
+	});
+	const groupSizes = /* @__PURE__ */ new Map();
+	const groupOffsets = [];
+	groupKeys.forEach((key) => {
+		const k = key ?? "";
+		const seen = groupSizes.get(k) ?? 0;
+		groupOffsets.push(seen);
+		groupSizes.set(k, seen + 1);
+	});
+	const size = ordered.length;
+	const indexOf = (value) => value === null || value === void 0 ? -1 : indexByValue.get(value) ?? -1;
+	const itemAt = (index) => {
+		if (index < 0 || index >= size) return null;
+		const item = ordered[index];
+		return item === void 0 ? null : item;
+	};
+	const entryAt = (index) => {
+		const item = ordered[index];
+		const value = orderedValues[index];
+		return item === void 0 || value === void 0 ? null : {
+			item,
+			value,
+			index
+		};
+	};
+	const disabledAt = (index) => {
+		const item = itemAt(index);
+		return item === null ? false : isItemDisabled?.(item) ?? false;
+	};
+	const matchFrom = (query, fromIndex, skipSelf) => {
+		const needle = query.toLowerCase();
+		for (let offset = 1; offset <= size; offset++) {
+			const index = (fromIndex + offset) % size;
+			if (skipSelf && index === fromIndex) continue;
+			if (disabledAt(index)) continue;
+			const item = itemAt(index);
+			if (item === null) continue;
+			if (itemToLabel(item).toLowerCase().startsWith(needle)) return index;
+		}
+		return -1;
+	};
+	const seek = (from, direction, loop) => {
+		let index = from;
+		for (let guard = 0; guard <= size; guard++) {
+			index += direction;
+			if (index < 0 || index >= size) {
+				if (!loop) return -1;
+				index = direction === 1 ? 0 : size - 1;
+			}
+			if (!disabledAt(index)) return index;
+		}
+		return -1;
+	};
+	const step = (value, direction, navigate) => {
+		const origin = indexOf(value);
+		if (origin === -1) return null;
+		const distance = Math.max(1, navigate?.step ?? 1);
+		const loop = navigate?.loop ?? false;
+		let target = origin + direction * distance;
+		if (target < 0 || target >= size) {
+			if (loop && distance === 1) target = direction === 1 ? 0 : size - 1;
+			else target = direction === 1 ? size - 1 : 0;
+		}
+		if (target === origin) return null;
+		if (!disabledAt(target)) return orderedValues[target] ?? null;
+		const resolved = seek(target, direction, loop);
+		if (resolved !== -1) return orderedValues[resolved] ?? null;
+		const back = seek(target, direction === 1 ? -1 : 1, false);
+		return back === -1 || back === origin ? null : orderedValues[back] ?? null;
+	};
+	const edge = (direction) => {
+		const start = direction === 1 ? 0 : size - 1;
+		if (size === 0) return null;
+		if (!disabledAt(start)) return orderedValues[start] ?? null;
+		const resolved = seek(start, direction, false);
+		return resolved === -1 ? null : orderedValues[resolved] ?? null;
+	};
+	const positionOf = (value) => {
+		const index = indexOf(value);
+		if (index === -1) return null;
+		const group = groupKeys[index] ?? null;
+		const grouped = group !== null;
+		return {
+			index,
+			collectionSize: size,
+			group,
+			posInSet: grouped ? (groupOffsets[index] ?? 0) + 1 : index + 1,
+			setSize: grouped ? groupSizes.get(group) ?? size : size
+		};
+	};
+	const collection = {
+		size,
+		values: orderedValues,
+		itemAt,
+		itemOf: (value) => itemAt(indexOf(value)),
+		valueOf: itemToValue,
+		labelOf: (value) => {
+			const item = itemAt(indexOf(value));
+			return item === null ? null : itemToLabel(item);
+		},
+		isDisabled: (value) => disabledAt(indexOf(value)),
+		has: (value) => indexOf(value) !== -1,
+		indexOf,
+		positionOf,
+		first: () => edge(1),
+		last: () => edge(-1),
+		next: (value, navigate) => step(value, 1, navigate),
+		previous: (value, navigate) => step(value, -1, navigate),
+		typeahead: (key, state, from, now = Date.now(), timeout = TYPEAHEAD_TIMEOUT) => {
+			const accumulated = (now - state.lastKeyAt > timeout ? "" : state.query) + key;
+			state.query = accumulated;
+			state.lastKeyAt = now;
+			const query = accumulated.length > 1 && [...accumulated].every((c) => c === accumulated[0]) ? accumulated.charAt(0) : accumulated;
+			const fromIndex = indexOf(from);
+			const origin = fromIndex === -1 ? -1 : fromIndex;
+			const skipSelf = query.length === 1;
+			const matched = matchFrom(query, origin, skipSelf);
+			if (matched === -1) return null;
+			return orderedValues[matched] ?? null;
+		},
+		resolveWindow: ({ start, count, activeValue, overscan = 0 }) => {
+			const safeCount = Math.max(0, count);
+			const rawStart = Math.max(0, Math.min(start, Math.max(0, size - safeCount)));
+			const windowStart = Math.max(0, rawStart - overscan);
+			const windowEnd = Math.min(size, rawStart + safeCount + overscan);
+			const entries = [];
+			for (let index = windowStart; index < windowEnd; index++) {
+				const entry = entryAt(index);
+				if (entry !== null) entries.push(entry);
+			}
+			const activeIndex = indexOf(activeValue);
+			const pinned = activeIndex !== -1 && (activeIndex < windowStart || activeIndex >= windowEnd) ? entryAt(activeIndex) : null;
+			const rows = (pinned === null ? entries : pinned.index < windowStart ? [pinned, ...entries] : [...entries, pinned]).map((entry) => ({
+				item: entry.item,
+				value: entry.value,
+				index: entry.index,
+				position: positionOf(entry.value) ?? {
+					index: entry.index,
+					collectionSize: size,
+					group: null,
+					posInSet: entry.index + 1,
+					setSize: size
+				},
+				pinned: pinned !== null && entry.index === pinned.index
+			}));
+			return {
+				start: windowStart,
+				end: windowEnd,
+				entries,
+				leadingCount: windowStart,
+				trailingCount: size - windowEnd,
+				pinned,
+				rows
+			};
+		},
+		followActive: (value, start, count) => {
+			const safeCount = Math.max(1, count);
+			const maxStart = Math.max(0, size - safeCount);
+			const clamp = (index) => Math.max(0, Math.min(index, maxStart));
+			const from = clamp(start);
+			const index = indexOf(value);
+			if (index === -1) return from;
+			if (index < from) return clamp(index);
+			if (index >= from + safeCount) return clamp(index - safeCount + 1);
+			return from;
+		},
+		withItems: (next) => createCollection({
+			...options,
+			items: next
+		})
+	};
+	registerUpstream(collection, upstream);
+	return collection;
+}
+function isNodeList(value) {
+	return Array.isArray(value);
+}
+function createTreeCollection(options) {
+	const { rootNode, nodeToValue, nodeToLabel, nodeToChildren, isNodeDisabled, nodeToChildrenCount } = options;
+	const childrenOfNode = (node) => {
+		if (nodeToChildren) return nodeToChildren(node) ?? [];
+		const children = typeof node === "object" && node !== null ? Reflect.get(node, "children") : void 0;
+		return isNodeList(children) ? children : [];
+	};
+	const upstream = new TreeCollection({
+		rootNode,
+		nodeToValue,
+		nodeToString: nodeToLabel,
+		nodeToChildren: (node) => [...childrenOfNode(node)],
+		isNodeDisabled: isNodeDisabled ?? (() => false),
+		...nodeToChildrenCount ? { nodeToChildrenCount } : {}
+	});
+	const byValue = /* @__PURE__ */ new Map();
+	const order = [];
+	const topLevel = [];
+	const walk = (node, level, indexPath, valuePath) => {
+		const children = childrenOfNode(node);
+		const setSize = children.length;
+		children.forEach((child, index) => {
+			const value = nodeToValue(child);
+			const childIndexPath = [...indexPath, index];
+			const childValuePath = [...valuePath, value];
+			const grandchildren = childrenOfNode(child);
+			const declaredCount = nodeToChildrenCount?.(child);
+			const entry = {
+				node: child,
+				value,
+				level,
+				posInSet: index + 1,
+				setSize,
+				indexPath: childIndexPath,
+				valuePath: childValuePath,
+				branch: grandchildren.length > 0 || (declaredCount ?? 0) > 0,
+				childValues: grandchildren.map(nodeToValue)
+			};
+			devWarn(byValue.has(value), `createTreeCollection: two nodes share the value "${value}". A value is a node's identity and the basis of its DOM id, so the second one cannot be addressed, selected, or pointed at by \`aria-activedescendant\`. The first is kept.`);
+			if (!byValue.has(value)) {
+				byValue.set(value, entry);
+				order.push(value);
+			}
+			walk(child, level + 1, childIndexPath, childValuePath);
+		});
+	};
+	for (const child of childrenOfNode(rootNode)) topLevel.push(child);
+	walk(rootNode, 1, [], []);
+	const entryOf = (value) => value === null || value === void 0 ? null : byValue.get(value) ?? null;
+	const visibleValues = (expandedValues) => {
+		const expanded = new Set(expandedValues);
+		const visible = [];
+		const descend = (values) => {
+			for (const value of values) {
+				visible.push(value);
+				const entry = byValue.get(value);
+				if (entry && expanded.has(value)) descend(entry.childValues);
+			}
+		};
+		descend(topLevel.map(nodeToValue));
+		return visible;
+	};
+	const positionOf = (value) => {
+		const entry = entryOf(value);
+		if (entry === null) return null;
+		const declaredCount = nodeToChildrenCount?.(entry.node);
+		return {
+			level: entry.level,
+			posInSet: entry.posInSet,
+			setSize: entry.setSize,
+			indexPath: entry.indexPath,
+			valuePath: entry.valuePath,
+			branch: entry.branch || (declaredCount ?? 0) > 0
+		};
+	};
+	const followActive = (value, expandedValues, start, count) => {
+		const visible = visibleValues(expandedValues);
+		const safeCount = Math.max(1, count);
+		const maxStart = Math.max(0, visible.length - safeCount);
+		const clamp = (index) => Math.max(0, Math.min(index, maxStart));
+		const from = clamp(start);
+		const index = value === null || value === void 0 ? -1 : visible.indexOf(value);
+		if (index === -1) return from;
+		if (index < from) return clamp(index);
+		if (index >= from + safeCount) return clamp(index - safeCount + 1);
+		return from;
+	};
+	const collection = {
+		rootNode,
+		size: order.length,
+		has: (value) => entryOf(value) !== null,
+		nodeOf: (value) => entryOf(value)?.node ?? null,
+		valueOf: nodeToValue,
+		labelOf: (value) => {
+			const entry = entryOf(value);
+			return entry === null ? null : nodeToLabel(entry.node);
+		},
+		isDisabled: (value) => {
+			const entry = entryOf(value);
+			return entry === null ? false : isNodeDisabled?.(entry.node) ?? false;
+		},
+		isBranch: (value) => positionOf(value)?.branch ?? false,
+		childrenOf: (value) => {
+			if (value === null || value === void 0) return topLevel;
+			const entry = entryOf(value);
+			return entry === null ? [] : childrenOfNode(entry.node);
+		},
+		positionOf,
+		visibleValues,
+		resolveWindow: ({ expandedValues, start, count, activeValue, overscan = 0 }) => {
+			const visible = visibleValues(expandedValues);
+			const size = visible.length;
+			const safeCount = Math.max(0, count);
+			const rawStart = Math.max(0, Math.min(start, Math.max(0, size - safeCount)));
+			const windowStart = Math.max(0, rawStart - overscan);
+			const windowEnd = Math.min(size, rawStart + safeCount + overscan);
+			const entryAt = (index) => {
+				const value = visible[index];
+				const entry = value === void 0 ? void 0 : byValue.get(value);
+				if (value === void 0 || entry === void 0) throw new Error(`[synapse] tree collection has no visible node at index ${index}`);
+				return {
+					item: entry.node,
+					value,
+					index
+				};
+			};
+			const entries = [];
+			for (let index = windowStart; index < windowEnd; index++) entries.push(entryAt(index));
+			const activeIndex = activeValue === null || activeValue === void 0 ? -1 : visible.indexOf(activeValue);
+			const pinned = activeIndex !== -1 && (activeIndex < windowStart || activeIndex >= windowEnd) ? entryAt(activeIndex) : null;
+			const rows = (pinned === null ? entries : pinned.index < windowStart ? [pinned, ...entries] : [...entries, pinned]).map((entry) => ({
+				item: entry.item,
+				value: entry.value,
+				index: entry.index,
+				position: positionOf(entry.value) ?? {
+					level: 1,
+					posInSet: entry.index + 1,
+					setSize: size,
+					indexPath: [entry.index],
+					valuePath: [entry.value],
+					branch: false
+				},
+				pinned: pinned !== null && entry.index === pinned.index
+			}));
+			return {
+				start: windowStart,
+				end: windowEnd,
+				entries,
+				leadingCount: windowStart,
+				trailingCount: size - windowEnd,
+				pinned,
+				rows
+			};
+		},
+		followActive,
+		expansionFor: (value, expandedValues) => {
+			const entry = entryOf(value);
+			if (entry === null) return expandedValues;
+			const expanded = new Set(expandedValues);
+			const added = [];
+			for (const ancestor of entry.valuePath.slice(0, -1)) if (!expanded.has(ancestor)) {
+				expanded.add(ancestor);
+				added.push(ancestor);
+			}
+			return added.length === 0 ? expandedValues : [...expandedValues, ...added];
+		},
+		withRootNode: (next) => createTreeCollection({
+			...options,
+			rootNode: next
+		})
+	};
+	registerUpstreamTree(collection, upstream);
+	return collection;
+}
+//#endregion
+export { createCollection, createTreeCollection, rowProps };
+
+//# sourceMappingURL=collection.mjs.map

package/dist/shared/collection.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection.mjs","names":[],"sources":["../../src/shared/collection.ts"],"sourcesContent":["import { ListCollection, TreeCollection } from '@zag-js/collection'\nimport { visuallyHiddenStyle } from '@zag-js/dom-query'\nimport type { CSSProperties } from 'react'\n\nimport { registerUpstream, registerUpstreamTree } from '#/shared/collection-internal.ts'\nimport { devWarn } from '#/system/dev-warn.ts'\n\nexport interface CollectionOptions<TItem> {\n  items: readonly TItem[]\n  itemToValue: (item: TItem) => string\n  itemToLabel: (item: TItem) => string\n  isItemDisabled?: (item: TItem) => boolean\n  groupBy?: (item: TItem, index: number) => string\n  groupOrder?: readonly string[] | 'asc' | 'desc'\n}\n\nexport interface ItemPosition {\n  index: number\n  collectionSize: number\n  group: string | null\n  posInSet: number\n  setSize: number\n}\n\nexport interface WindowEntry<TItem> {\n  item: TItem\n  value: string\n  index: number\n}\n\nexport interface WindowRequest {\n  start: number\n  count: number\n  activeValue?: string | null\n  overscan?: number\n}\n\nexport interface WindowRow<TItem, TPosition = ItemPosition> extends WindowEntry<TItem> {\n  position: TPosition\n  pinned: boolean\n}\n\nexport interface CollectionWindow<TItem, TPosition = ItemPosition> {\n  start: number\n  end: number\n  entries: readonly WindowEntry<TItem>[]\n  leadingCount: number\n  trailingCount: number\n  pinned: WindowEntry<TItem> | null\n  rows: readonly WindowRow<TItem, TPosition>[]\n}\n\nexport interface NavigateOptions {\n  step?: number\n  loop?: boolean\n}\n\nexport interface TypeaheadState {\n  query: string\n  lastKeyAt: number\n}\n\nexport interface SynapseCollection<TItem> {\n  readonly size: number\n  readonly values: readonly string[]\n\n  itemAt: (index: number) => TItem | null\n  itemOf: (value: string | null | undefined) => TItem | null\n  valueOf: (item: TItem) => string\n  labelOf: (value: string | null | undefined) => string | null\n  isDisabled: (value: string | null | undefined) => boolean\n  has: (value: string | null | undefined) => boolean\n  indexOf: (value: string | null | undefined) => number\n\n  positionOf: (value: string | null | undefined) => ItemPosition | null\n\n  first: () => string | null\n  last: () => string | null\n  next: (value: string, options?: NavigateOptions) => string | null\n  previous: (value: string, options?: NavigateOptions) => string | null\n\n  typeahead: (\n    key: string,\n    state: TypeaheadState,\n    from: string | null,\n    now?: number,\n    timeout?: number,\n  ) => string | null\n\n  resolveWindow: (request: WindowRequest) => CollectionWindow<TItem>\n\n  followActive: (value: string | null | undefined, start: number, count: number) => number\n\n  withItems: (items: readonly TItem[]) => SynapseCollection<TItem>\n}\n\nexport interface RowProps {\n  readonly 'aria-posinset': number\n  readonly 'aria-setsize': number\n  readonly 'aria-level'?: number\n  readonly style?: CSSProperties\n}\n\nexport function rowProps(row: WindowRow<unknown, ItemPosition | TreeNodePosition>): RowProps {\n  const level = 'level' in row.position ? row.position.level : undefined\n  const base: RowProps = {\n    'aria-posinset': row.position.posInSet,\n    'aria-setsize': row.position.setSize,\n    ...(level === undefined ? {} : { 'aria-level': level }),\n  }\n  return row.pinned ? { ...base, style: visuallyHiddenStyle } : base\n}\n\nconst TYPEAHEAD_TIMEOUT = 350\n\nexport function createCollection<TItem>(\n  options: CollectionOptions<TItem>,\n): SynapseCollection<TItem> {\n  const { items, itemToValue, itemToLabel, isItemDisabled, groupBy, groupOrder } = options\n\n  const upstream = new ListCollection<TItem>({\n    items: [...items],\n    itemToValue,\n    itemToString: itemToLabel,\n    isItemDisabled: isItemDisabled ?? (() => false),\n    ...(groupBy ? { groupBy } : {}),\n    ...(groupOrder\n      ? { groupSort: typeof groupOrder === 'string' ? groupOrder : [...groupOrder] }\n      : {}),\n  })\n\n  const ordered: TItem[] = []\n  const groupKeys: (string | null)[] = []\n  for (const [key, groupItems] of upstream.group()) {\n    for (const item of groupItems) {\n      ordered.push(item)\n      groupKeys.push(groupBy ? key : null)\n    }\n  }\n\n  const indexByValue = new Map<string, number>()\n  const orderedValues: string[] = []\n  ordered.forEach((item, index) => {\n    const value = itemToValue(item)\n    orderedValues.push(value)\n    if (!indexByValue.has(value)) indexByValue.set(value, index)\n  })\n\n  const groupSizes = new Map<string, number>()\n  const groupOffsets: number[] = []\n  groupKeys.forEach((key) => {\n    const k = key ?? ''\n    const seen = groupSizes.get(k) ?? 0\n    groupOffsets.push(seen)\n    groupSizes.set(k, seen + 1)\n  })\n\n  const size = ordered.length\n\n  const indexOf = (value: string | null | undefined): number =>\n    value === null || value === undefined ? -1 : (indexByValue.get(value) ?? -1)\n\n  const itemAt = (index: number): TItem | null => {\n    if (index < 0 || index >= size) return null\n    const item = ordered[index]\n    return item === undefined ? null : item\n  }\n\n  const entryAt = (index: number): WindowEntry<TItem> | null => {\n    const item = ordered[index]\n    const value = orderedValues[index]\n    return item === undefined || value === undefined ? null : { item, value, index }\n  }\n\n  const disabledAt = (index: number): boolean => {\n    const item = itemAt(index)\n    return item === null ? false : (isItemDisabled?.(item) ?? false)\n  }\n\n  const matchFrom = (query: string, fromIndex: number, skipSelf: boolean): number => {\n    const needle = query.toLowerCase()\n    for (let offset = 1; offset <= size; offset++) {\n      const index = (fromIndex + offset) % size\n      if (skipSelf && index === fromIndex) continue\n      if (disabledAt(index)) continue\n      const item = itemAt(index)\n      if (item === null) continue\n      if (itemToLabel(item).toLowerCase().startsWith(needle)) return index\n    }\n    return -1\n  }\n\n  const seek = (from: number, direction: 1 | -1, loop: boolean): number => {\n    let index = from\n    for (let guard = 0; guard <= size; guard++) {\n      index += direction\n      if (index < 0 || index >= size) {\n        if (!loop) return -1\n        index = direction === 1 ? 0 : size - 1\n      }\n      if (!disabledAt(index)) return index\n    }\n    return -1\n  }\n\n  const step = (value: string, direction: 1 | -1, navigate?: NavigateOptions): string | null => {\n    const origin = indexOf(value)\n    if (origin === -1) return null\n    const distance = Math.max(1, navigate?.step ?? 1)\n    const loop = navigate?.loop ?? false\n\n    let target = origin + direction * distance\n    if (target < 0 || target >= size) {\n      if (loop && distance === 1) target = direction === 1 ? 0 : size - 1\n      else target = direction === 1 ? size - 1 : 0\n    }\n    if (target === origin) return null\n    if (!disabledAt(target)) return orderedValues[target] ?? null\n\n    const resolved = seek(target, direction, loop)\n    if (resolved !== -1) return orderedValues[resolved] ?? null\n    const back = seek(target, direction === 1 ? -1 : 1, false)\n    return back === -1 || back === origin ? null : (orderedValues[back] ?? null)\n  }\n\n  const edge = (direction: 1 | -1): string | null => {\n    const start = direction === 1 ? 0 : size - 1\n    if (size === 0) return null\n    if (!disabledAt(start)) return orderedValues[start] ?? null\n    const resolved = seek(start, direction, false)\n    return resolved === -1 ? null : (orderedValues[resolved] ?? null)\n  }\n\n  const positionOf = (value: string | null | undefined): ItemPosition | null => {\n    const index = indexOf(value)\n    if (index === -1) return null\n    const group = groupKeys[index] ?? null\n    const grouped = group !== null\n    return {\n      index,\n      collectionSize: size,\n      group,\n      posInSet: grouped ? (groupOffsets[index] ?? 0) + 1 : index + 1,\n      setSize: grouped ? (groupSizes.get(group) ?? size) : size,\n    }\n  }\n\n  const collection: SynapseCollection<TItem> = {\n    size,\n    values: orderedValues,\n\n    itemAt,\n    itemOf: (value) => itemAt(indexOf(value)),\n    valueOf: itemToValue,\n    labelOf: (value) => {\n      const item = itemAt(indexOf(value))\n      return item === null ? null : itemToLabel(item)\n    },\n    isDisabled: (value) => disabledAt(indexOf(value)),\n    has: (value) => indexOf(value) !== -1,\n    indexOf,\n\n    positionOf,\n\n    first: () => edge(1),\n    last: () => edge(-1),\n    next: (value, navigate) => step(value, 1, navigate),\n    previous: (value, navigate) => step(value, -1, navigate),\n\n    typeahead: (key, state, from, now = Date.now(), timeout = TYPEAHEAD_TIMEOUT) => {\n      const expired = now - state.lastKeyAt > timeout\n      const accumulated = (expired ? '' : state.query) + key\n      state.query = accumulated\n      state.lastKeyAt = now\n\n      const repeated = accumulated.length > 1 && [...accumulated].every((c) => c === accumulated[0])\n      const query = repeated ? accumulated.charAt(0) : accumulated\n\n      const fromIndex = indexOf(from)\n      const origin = fromIndex === -1 ? -1 : fromIndex\n      const skipSelf = query.length === 1\n      const matched = matchFrom(query, origin, skipSelf)\n      if (matched === -1) return null\n      return orderedValues[matched] ?? null\n    },\n\n    resolveWindow: ({ start, count, activeValue, overscan = 0 }) => {\n      const safeCount = Math.max(0, count)\n      const rawStart = Math.max(0, Math.min(start, Math.max(0, size - safeCount)))\n      const windowStart = Math.max(0, rawStart - overscan)\n      const windowEnd = Math.min(size, rawStart + safeCount + overscan)\n\n      const entries: WindowEntry<TItem>[] = []\n      for (let index = windowStart; index < windowEnd; index++) {\n        const entry = entryAt(index)\n        if (entry !== null) entries.push(entry)\n      }\n\n      const activeIndex = indexOf(activeValue)\n      const outside = activeIndex !== -1 && (activeIndex < windowStart || activeIndex >= windowEnd)\n      const pinned: WindowEntry<TItem> | null = outside ? entryAt(activeIndex) : null\n\n      const withPin: WindowEntry<TItem>[] =\n        pinned === null\n          ? entries\n          : pinned.index < windowStart\n            ? [pinned, ...entries]\n            : [...entries, pinned]\n\n      const rows: WindowRow<TItem>[] = withPin.map((entry) => ({\n        item: entry.item,\n        value: entry.value,\n        index: entry.index,\n        position: positionOf(entry.value) ?? {\n          index: entry.index,\n          collectionSize: size,\n          group: null,\n          posInSet: entry.index + 1,\n          setSize: size,\n        },\n        pinned: pinned !== null && entry.index === pinned.index,\n      }))\n\n      return {\n        start: windowStart,\n        end: windowEnd,\n        entries,\n        leadingCount: windowStart,\n        trailingCount: size - windowEnd,\n        pinned,\n        rows,\n      }\n    },\n\n    followActive: (value, start, count) => {\n      const safeCount = Math.max(1, count)\n      const maxStart = Math.max(0, size - safeCount)\n      const clamp = (index: number): number => Math.max(0, Math.min(index, maxStart))\n      const from = clamp(start)\n      const index = indexOf(value)\n      if (index === -1) return from\n      if (index < from) return clamp(index)\n      if (index >= from + safeCount) return clamp(index - safeCount + 1)\n      return from\n    },\n\n    withItems: (next) => createCollection({ ...options, items: next }),\n  }\n\n  registerUpstream(collection, upstream)\n  return collection\n}\n\nexport interface TreeNodePosition {\n  level: number\n  posInSet: number\n  setSize: number\n  indexPath: readonly number[]\n  valuePath: readonly string[]\n  branch: boolean\n}\n\nexport interface TreeCollectionOptions<TNode> {\n  rootNode: TNode\n  nodeToValue: (node: TNode) => string\n  nodeToLabel: (node: TNode) => string\n  nodeToChildren?: (node: TNode) => readonly TNode[] | undefined\n  isNodeDisabled?: (node: TNode) => boolean\n  nodeToChildrenCount?: (node: TNode) => number | undefined\n}\n\nexport interface TreeWindowRequest {\n  expandedValues: readonly string[]\n  start: number\n  count: number\n  activeValue?: string | null\n  overscan?: number\n}\n\nexport interface SynapseTreeCollection<TNode> {\n  readonly rootNode: TNode\n  readonly size: number\n\n  has: (value: string | null | undefined) => boolean\n  nodeOf: (value: string | null | undefined) => TNode | null\n  valueOf: (node: TNode) => string\n  labelOf: (value: string | null | undefined) => string | null\n  isDisabled: (value: string | null | undefined) => boolean\n  isBranch: (value: string | null | undefined) => boolean\n  childrenOf: (value: string | null | undefined) => readonly TNode[]\n\n  positionOf: (value: string | null | undefined) => TreeNodePosition | null\n\n  visibleValues: (expandedValues: readonly string[]) => readonly string[]\n\n  resolveWindow: (request: TreeWindowRequest) => CollectionWindow<TNode, TreeNodePosition>\n\n  followActive: (\n    value: string | null | undefined,\n    expandedValues: readonly string[],\n    start: number,\n    count: number,\n  ) => number\n\n  expansionFor: (\n    value: string | null | undefined,\n    expandedValues: readonly string[],\n  ) => readonly string[]\n\n  withRootNode: (rootNode: TNode) => SynapseTreeCollection<TNode>\n}\n\ninterface TreeEntry<TNode> {\n  node: TNode\n  value: string\n  level: number\n  posInSet: number\n  setSize: number\n  indexPath: readonly number[]\n  valuePath: readonly string[]\n  branch: boolean\n  childValues: readonly string[]\n}\n\nfunction isNodeList<TNode>(value: unknown): value is readonly TNode[] {\n  return Array.isArray(value)\n}\n\nexport function createTreeCollection<TNode>(\n  options: TreeCollectionOptions<TNode>,\n): SynapseTreeCollection<TNode> {\n  const {\n    rootNode,\n    nodeToValue,\n    nodeToLabel,\n    nodeToChildren,\n    isNodeDisabled,\n    nodeToChildrenCount,\n  } = options\n\n  const childrenOfNode = (node: TNode): readonly TNode[] => {\n    if (nodeToChildren) return nodeToChildren(node) ?? []\n    const children: unknown =\n      typeof node === 'object' && node !== null ? Reflect.get(node, 'children') : undefined\n    return isNodeList<TNode>(children) ? children : []\n  }\n\n  const upstream = new TreeCollection<TNode>({\n    rootNode,\n    nodeToValue,\n    nodeToString: nodeToLabel,\n    nodeToChildren: (node: TNode) => [...childrenOfNode(node)],\n    isNodeDisabled: isNodeDisabled ?? (() => false),\n    ...(nodeToChildrenCount ? { nodeToChildrenCount } : {}),\n  })\n\n  const byValue = new Map<string, TreeEntry<TNode>>()\n  const order: string[] = []\n  const topLevel: TNode[] = []\n\n  const walk = (\n    node: TNode,\n    level: number,\n    indexPath: readonly number[],\n    valuePath: readonly string[],\n  ): void => {\n    const children = childrenOfNode(node)\n    const setSize = children.length\n    children.forEach((child, index) => {\n      const value = nodeToValue(child)\n      const childIndexPath = [...indexPath, index]\n      const childValuePath = [...valuePath, value]\n      const grandchildren = childrenOfNode(child)\n      const declaredCount = nodeToChildrenCount?.(child)\n      const entry: TreeEntry<TNode> = {\n        node: child,\n        value,\n        level,\n        posInSet: index + 1,\n        setSize,\n        indexPath: childIndexPath,\n        valuePath: childValuePath,\n        branch: grandchildren.length > 0 || (declaredCount ?? 0) > 0,\n        childValues: grandchildren.map(nodeToValue),\n      }\n      devWarn(\n        byValue.has(value),\n        `createTreeCollection: two nodes share the value \"${value}\". A value is a node's ` +\n          `identity and the basis of its DOM id, so the second one cannot be addressed, ` +\n          `selected, or pointed at by \\`aria-activedescendant\\`. The first is kept.`,\n      )\n      if (!byValue.has(value)) {\n        byValue.set(value, entry)\n        order.push(value)\n      }\n      walk(child, level + 1, childIndexPath, childValuePath)\n    })\n  }\n\n  for (const child of childrenOfNode(rootNode)) topLevel.push(child)\n  walk(rootNode, 1, [], [])\n\n  const entryOf = (value: string | null | undefined): TreeEntry<TNode> | null =>\n    value === null || value === undefined ? null : (byValue.get(value) ?? null)\n\n  const visibleValues = (expandedValues: readonly string[]): readonly string[] => {\n    const expanded = new Set(expandedValues)\n    const visible: string[] = []\n    const descend = (values: readonly string[]): void => {\n      for (const value of values) {\n        visible.push(value)\n        const entry = byValue.get(value)\n        if (entry && expanded.has(value)) descend(entry.childValues)\n      }\n    }\n    descend(topLevel.map(nodeToValue))\n    return visible\n  }\n\n  const positionOf = (value: string | null | undefined): TreeNodePosition | null => {\n    const entry = entryOf(value)\n    if (entry === null) return null\n    const declaredCount = nodeToChildrenCount?.(entry.node)\n    return {\n      level: entry.level,\n      posInSet: entry.posInSet,\n      setSize: entry.setSize,\n      indexPath: entry.indexPath,\n      valuePath: entry.valuePath,\n      branch: entry.branch || (declaredCount ?? 0) > 0,\n    }\n  }\n\n  const followActive = (\n    value: string | null | undefined,\n    expandedValues: readonly string[],\n    start: number,\n    count: number,\n  ): number => {\n    const visible = visibleValues(expandedValues)\n    const safeCount = Math.max(1, count)\n    const maxStart = Math.max(0, visible.length - safeCount)\n    const clamp = (index: number): number => Math.max(0, Math.min(index, maxStart))\n    const from = clamp(start)\n    const index = value === null || value === undefined ? -1 : visible.indexOf(value)\n    if (index === -1) return from\n    if (index < from) return clamp(index)\n    if (index >= from + safeCount) return clamp(index - safeCount + 1)\n    return from\n  }\n\n  const collection: SynapseTreeCollection<TNode> = {\n    rootNode,\n    size: order.length,\n\n    has: (value) => entryOf(value) !== null,\n    nodeOf: (value) => entryOf(value)?.node ?? null,\n    valueOf: nodeToValue,\n    labelOf: (value) => {\n      const entry = entryOf(value)\n      return entry === null ? null : nodeToLabel(entry.node)\n    },\n    isDisabled: (value) => {\n      const entry = entryOf(value)\n      return entry === null ? false : (isNodeDisabled?.(entry.node) ?? false)\n    },\n    isBranch: (value) => positionOf(value)?.branch ?? false,\n    childrenOf: (value) => {\n      if (value === null || value === undefined) return topLevel\n      const entry = entryOf(value)\n      return entry === null ? [] : childrenOfNode(entry.node)\n    },\n\n    positionOf,\n    visibleValues,\n\n    resolveWindow: ({ expandedValues, start, count, activeValue, overscan = 0 }) => {\n      const visible = visibleValues(expandedValues)\n      const size = visible.length\n      const safeCount = Math.max(0, count)\n      const rawStart = Math.max(0, Math.min(start, Math.max(0, size - safeCount)))\n      const windowStart = Math.max(0, rawStart - overscan)\n      const windowEnd = Math.min(size, rawStart + safeCount + overscan)\n\n      const entryAt = (index: number): WindowEntry<TNode> => {\n        const value = visible[index]\n        const entry = value === undefined ? undefined : byValue.get(value)\n        if (value === undefined || entry === undefined) {\n          throw new Error(`[synapse] tree collection has no visible node at index ${index}`)\n        }\n        return { item: entry.node, value, index }\n      }\n\n      const entries: WindowEntry<TNode>[] = []\n      for (let index = windowStart; index < windowEnd; index++) entries.push(entryAt(index))\n\n      const activeIndex =\n        activeValue === null || activeValue === undefined ? -1 : visible.indexOf(activeValue)\n      const outside = activeIndex !== -1 && (activeIndex < windowStart || activeIndex >= windowEnd)\n      const pinned: WindowEntry<TNode> | null = outside ? entryAt(activeIndex) : null\n\n      const withPin: WindowEntry<TNode>[] =\n        pinned === null\n          ? entries\n          : pinned.index < windowStart\n            ? [pinned, ...entries]\n            : [...entries, pinned]\n\n      const rows: WindowRow<TNode, TreeNodePosition>[] = withPin.map((entry) => ({\n        item: entry.item,\n        value: entry.value,\n        index: entry.index,\n        position: positionOf(entry.value) ?? {\n          level: 1,\n          posInSet: entry.index + 1,\n          setSize: size,\n          indexPath: [entry.index],\n          valuePath: [entry.value],\n          branch: false,\n        },\n        pinned: pinned !== null && entry.index === pinned.index,\n      }))\n\n      return {\n        start: windowStart,\n        end: windowEnd,\n        entries,\n        leadingCount: windowStart,\n        trailingCount: size - windowEnd,\n        pinned,\n        rows,\n      }\n    },\n\n    followActive,\n\n    expansionFor: (value, expandedValues) => {\n      const entry = entryOf(value)\n      if (entry === null) return expandedValues\n      const expanded = new Set(expandedValues)\n      const added: string[] = []\n      for (const ancestor of entry.valuePath.slice(0, -1)) {\n        if (!expanded.has(ancestor)) {\n          expanded.add(ancestor)\n          added.push(ancestor)\n        }\n      }\n      return added.length === 0 ? expandedValues : [...expandedValues, ...added]\n    },\n\n    withRootNode: (next) => createTreeCollection({ ...options, rootNode: next }),\n  }\n\n  registerUpstreamTree(collection, upstream)\n  return collection\n}\n"],"mappings":";;;;;AAuGA,SAAgB,SAAS,KAAoE;CAC3F,MAAM,QAAQ,WAAW,IAAI,WAAW,IAAI,SAAS,QAAQ,KAAA;CAC7D,MAAM,OAAiB;EACrB,iBAAiB,IAAI,SAAS;EAC9B,gBAAgB,IAAI,SAAS;EAC7B,GAAI,UAAU,KAAA,IAAY,CAAC,IAAI,EAAE,cAAc,MAAM;CACvD;CACA,OAAO,IAAI,SAAS;EAAE,GAAG;EAAM,OAAO;CAAoB,IAAI;AAChE;AAEA,MAAM,oBAAoB;AAE1B,SAAgB,iBACd,SAC0B;CAC1B,MAAM,EAAE,OAAO,aAAa,aAAa,gBAAgB,SAAS,eAAe;CAEjF,MAAM,WAAW,IAAI,eAAsB;EACzC,OAAO,CAAC,GAAG,KAAK;EAChB;EACA,cAAc;EACd,gBAAgB,yBAAyB;EACzC,GAAI,UAAU,EAAE,QAAQ,IAAI,CAAC;EAC7B,GAAI,aACA,EAAE,WAAW,OAAO,eAAe,WAAW,aAAa,CAAC,GAAG,UAAU,EAAE,IAC3E,CAAC;CACP,CAAC;CAED,MAAM,UAAmB,CAAC;CAC1B,MAAM,YAA+B,CAAC;CACtC,KAAK,MAAM,CAAC,KAAK,eAAe,SAAS,MAAM,GAC7C,KAAK,MAAM,QAAQ,YAAY;EAC7B,QAAQ,KAAK,IAAI;EACjB,UAAU,KAAK,UAAU,MAAM,IAAI;CACrC;CAGF,MAAM,+BAAe,IAAI,IAAoB;CAC7C,MAAM,gBAA0B,CAAC;CACjC,QAAQ,SAAS,MAAM,UAAU;EAC/B,MAAM,QAAQ,YAAY,IAAI;EAC9B,cAAc,KAAK,KAAK;EACxB,IAAI,CAAC,aAAa,IAAI,KAAK,GAAG,aAAa,IAAI,OAAO,KAAK;CAC7D,CAAC;CAED,MAAM,6BAAa,IAAI,IAAoB;CAC3C,MAAM,eAAyB,CAAC;CAChC,UAAU,SAAS,QAAQ;EACzB,MAAM,IAAI,OAAO;EACjB,MAAM,OAAO,WAAW,IAAI,CAAC,KAAK;EAClC,aAAa,KAAK,IAAI;EACtB,WAAW,IAAI,GAAG,OAAO,CAAC;CAC5B,CAAC;CAED,MAAM,OAAO,QAAQ;CAErB,MAAM,WAAW,UACf,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAM,aAAa,IAAI,KAAK,KAAK;CAE3E,MAAM,UAAU,UAAgC;EAC9C,IAAI,QAAQ,KAAK,SAAS,MAAM,OAAO;EACvC,MAAM,OAAO,QAAQ;EACrB,OAAO,SAAS,KAAA,IAAY,OAAO;CACrC;CAEA,MAAM,WAAW,UAA6C;EAC5D,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,cAAc;EAC5B,OAAO,SAAS,KAAA,KAAa,UAAU,KAAA,IAAY,OAAO;GAAE;GAAM;GAAO;EAAM;CACjF;CAEA,MAAM,cAAc,UAA2B;EAC7C,MAAM,OAAO,OAAO,KAAK;EACzB,OAAO,SAAS,OAAO,QAAS,iBAAiB,IAAI,KAAK;CAC5D;CAEA,MAAM,aAAa,OAAe,WAAmB,aAA8B;EACjF,MAAM,SAAS,MAAM,YAAY;EACjC,KAAK,IAAI,SAAS,GAAG,UAAU,MAAM,UAAU;GAC7C,MAAM,SAAS,YAAY,UAAU;GACrC,IAAI,YAAY,UAAU,WAAW;GACrC,IAAI,WAAW,KAAK,GAAG;GACvB,MAAM,OAAO,OAAO,KAAK;GACzB,IAAI,SAAS,MAAM;GACnB,IAAI,YAAY,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,WAAW,MAAM,GAAG,OAAO;EACjE;EACA,OAAO;CACT;CAEA,MAAM,QAAQ,MAAc,WAAmB,SAA0B;EACvE,IAAI,QAAQ;EACZ,KAAK,IAAI,QAAQ,GAAG,SAAS,MAAM,SAAS;GAC1C,SAAS;GACT,IAAI,QAAQ,KAAK,SAAS,MAAM;IAC9B,IAAI,CAAC,MAAM,OAAO;IAClB,QAAQ,cAAc,IAAI,IAAI,OAAO;GACvC;GACA,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO;EACjC;EACA,OAAO;CACT;CAEA,MAAM,QAAQ,OAAe,WAAmB,aAA8C;EAC5F,MAAM,SAAS,QAAQ,KAAK;EAC5B,IAAI,WAAW,IAAI,OAAO;EAC1B,MAAM,WAAW,KAAK,IAAI,GAAG,UAAU,QAAQ,CAAC;EAChD,MAAM,OAAO,UAAU,QAAQ;EAE/B,IAAI,SAAS,SAAS,YAAY;EAClC,IAAI,SAAS,KAAK,UAAU,MAAM;GAChC,IAAI,QAAQ,aAAa,GAAG,SAAS,cAAc,IAAI,IAAI,OAAO;QAC7D,SAAS,cAAc,IAAI,OAAO,IAAI;EAC7C;EACA,IAAI,WAAW,QAAQ,OAAO;EAC9B,IAAI,CAAC,WAAW,MAAM,GAAG,OAAO,cAAc,WAAW;EAEzD,MAAM,WAAW,KAAK,QAAQ,WAAW,IAAI;EAC7C,IAAI,aAAa,IAAI,OAAO,cAAc,aAAa;EACvD,MAAM,OAAO,KAAK,QAAQ,cAAc,IAAI,KAAK,GAAG,KAAK;EACzD,OAAO,SAAS,MAAM,SAAS,SAAS,OAAQ,cAAc,SAAS;CACzE;CAEA,MAAM,QAAQ,cAAqC;EACjD,MAAM,QAAQ,cAAc,IAAI,IAAI,OAAO;EAC3C,IAAI,SAAS,GAAG,OAAO;EACvB,IAAI,CAAC,WAAW,KAAK,GAAG,OAAO,cAAc,UAAU;EACvD,MAAM,WAAW,KAAK,OAAO,WAAW,KAAK;EAC7C,OAAO,aAAa,KAAK,OAAQ,cAAc,aAAa;CAC9D;CAEA,MAAM,cAAc,UAA0D;EAC5E,MAAM,QAAQ,QAAQ,KAAK;EAC3B,IAAI,UAAU,IAAI,OAAO;EACzB,MAAM,QAAQ,UAAU,UAAU;EAClC,MAAM,UAAU,UAAU;EAC1B,OAAO;GACL;GACA,gBAAgB;GAChB;GACA,UAAU,WAAW,aAAa,UAAU,KAAK,IAAI,QAAQ;GAC7D,SAAS,UAAW,WAAW,IAAI,KAAK,KAAK,OAAQ;EACvD;CACF;CAEA,MAAM,aAAuC;EAC3C;EACA,QAAQ;EAER;EACA,SAAS,UAAU,OAAO,QAAQ,KAAK,CAAC;EACxC,SAAS;EACT,UAAU,UAAU;GAClB,MAAM,OAAO,OAAO,QAAQ,KAAK,CAAC;GAClC,OAAO,SAAS,OAAO,OAAO,YAAY,IAAI;EAChD;EACA,aAAa,UAAU,WAAW,QAAQ,KAAK,CAAC;EAChD,MAAM,UAAU,QAAQ,KAAK,MAAM;EACnC;EAEA;EAEA,aAAa,KAAK,CAAC;EACnB,YAAY,KAAK,EAAE;EACnB,OAAO,OAAO,aAAa,KAAK,OAAO,GAAG,QAAQ;EAClD,WAAW,OAAO,aAAa,KAAK,OAAO,IAAI,QAAQ;EAEvD,YAAY,KAAK,OAAO,MAAM,MAAM,KAAK,IAAI,GAAG,UAAU,sBAAsB;GAE9E,MAAM,eADU,MAAM,MAAM,YAAY,UACT,KAAK,MAAM,SAAS;GACnD,MAAM,QAAQ;GACd,MAAM,YAAY;GAGlB,MAAM,QADW,YAAY,SAAS,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,OAAO,MAAM,MAAM,YAAY,EAAE,IACpE,YAAY,OAAO,CAAC,IAAI;GAEjD,MAAM,YAAY,QAAQ,IAAI;GAC9B,MAAM,SAAS,cAAc,KAAK,KAAK;GACvC,MAAM,WAAW,MAAM,WAAW;GAClC,MAAM,UAAU,UAAU,OAAO,QAAQ,QAAQ;GACjD,IAAI,YAAY,IAAI,OAAO;GAC3B,OAAO,cAAc,YAAY;EACnC;EAEA,gBAAgB,EAAE,OAAO,OAAO,aAAa,WAAW,QAAQ;GAC9D,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK;GACnC,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,CAAC,CAAC;GAC3E,MAAM,cAAc,KAAK,IAAI,GAAG,WAAW,QAAQ;GACnD,MAAM,YAAY,KAAK,IAAI,MAAM,WAAW,YAAY,QAAQ;GAEhE,MAAM,UAAgC,CAAC;GACvC,KAAK,IAAI,QAAQ,aAAa,QAAQ,WAAW,SAAS;IACxD,MAAM,QAAQ,QAAQ,KAAK;IAC3B,IAAI,UAAU,MAAM,QAAQ,KAAK,KAAK;GACxC;GAEA,MAAM,cAAc,QAAQ,WAAW;GAEvC,MAAM,SADU,gBAAgB,OAAO,cAAc,eAAe,eAAe,aAC/B,QAAQ,WAAW,IAAI;GAS3E,MAAM,QANJ,WAAW,OACP,UACA,OAAO,QAAQ,cACb,CAAC,QAAQ,GAAG,OAAO,IACnB,CAAC,GAAG,SAAS,MAAM,EAAA,CAEc,KAAK,WAAW;IACvD,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,OAAO,MAAM;IACb,UAAU,WAAW,MAAM,KAAK,KAAK;KACnC,OAAO,MAAM;KACb,gBAAgB;KAChB,OAAO;KACP,UAAU,MAAM,QAAQ;KACxB,SAAS;IACX;IACA,QAAQ,WAAW,QAAQ,MAAM,UAAU,OAAO;GACpD,EAAE;GAEF,OAAO;IACL,OAAO;IACP,KAAK;IACL;IACA,cAAc;IACd,eAAe,OAAO;IACtB;IACA;GACF;EACF;EAEA,eAAe,OAAO,OAAO,UAAU;GACrC,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK;GACnC,MAAM,WAAW,KAAK,IAAI,GAAG,OAAO,SAAS;GAC7C,MAAM,SAAS,UAA0B,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,QAAQ,CAAC;GAC9E,MAAM,OAAO,MAAM,KAAK;GACxB,MAAM,QAAQ,QAAQ,KAAK;GAC3B,IAAI,UAAU,IAAI,OAAO;GACzB,IAAI,QAAQ,MAAM,OAAO,MAAM,KAAK;GACpC,IAAI,SAAS,OAAO,WAAW,OAAO,MAAM,QAAQ,YAAY,CAAC;GACjE,OAAO;EACT;EAEA,YAAY,SAAS,iBAAiB;GAAE,GAAG;GAAS,OAAO;EAAK,CAAC;CACnE;CAEA,iBAAiB,YAAY,QAAQ;CACrC,OAAO;AACT;AAyEA,SAAS,WAAkB,OAA2C;CACpE,OAAO,MAAM,QAAQ,KAAK;AAC5B;AAEA,SAAgB,qBACd,SAC8B;CAC9B,MAAM,EACJ,UACA,aACA,aACA,gBACA,gBACA,wBACE;CAEJ,MAAM,kBAAkB,SAAkC;EACxD,IAAI,gBAAgB,OAAO,eAAe,IAAI,KAAK,CAAC;EACpD,MAAM,WACJ,OAAO,SAAS,YAAY,SAAS,OAAO,QAAQ,IAAI,MAAM,UAAU,IAAI,KAAA;EAC9E,OAAO,WAAkB,QAAQ,IAAI,WAAW,CAAC;CACnD;CAEA,MAAM,WAAW,IAAI,eAAsB;EACzC;EACA;EACA,cAAc;EACd,iBAAiB,SAAgB,CAAC,GAAG,eAAe,IAAI,CAAC;EACzD,gBAAgB,yBAAyB;EACzC,GAAI,sBAAsB,EAAE,oBAAoB,IAAI,CAAC;CACvD,CAAC;CAED,MAAM,0BAAU,IAAI,IAA8B;CAClD,MAAM,QAAkB,CAAC;CACzB,MAAM,WAAoB,CAAC;CAE3B,MAAM,QACJ,MACA,OACA,WACA,cACS;EACT,MAAM,WAAW,eAAe,IAAI;EACpC,MAAM,UAAU,SAAS;EACzB,SAAS,SAAS,OAAO,UAAU;GACjC,MAAM,QAAQ,YAAY,KAAK;GAC/B,MAAM,iBAAiB,CAAC,GAAG,WAAW,KAAK;GAC3C,MAAM,iBAAiB,CAAC,GAAG,WAAW,KAAK;GAC3C,MAAM,gBAAgB,eAAe,KAAK;GAC1C,MAAM,gBAAgB,sBAAsB,KAAK;GACjD,MAAM,QAA0B;IAC9B,MAAM;IACN;IACA;IACA,UAAU,QAAQ;IAClB;IACA,WAAW;IACX,WAAW;IACX,QAAQ,cAAc,SAAS,MAAM,iBAAiB,KAAK;IAC3D,aAAa,cAAc,IAAI,WAAW;GAC5C;GACA,QACE,QAAQ,IAAI,KAAK,GACjB,oDAAoD,MAAM,6KAG5D;GACA,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;IACvB,QAAQ,IAAI,OAAO,KAAK;IACxB,MAAM,KAAK,KAAK;GAClB;GACA,KAAK,OAAO,QAAQ,GAAG,gBAAgB,cAAc;EACvD,CAAC;CACH;CAEA,KAAK,MAAM,SAAS,eAAe,QAAQ,GAAG,SAAS,KAAK,KAAK;CACjE,KAAK,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;CAExB,MAAM,WAAW,UACf,UAAU,QAAQ,UAAU,KAAA,IAAY,OAAQ,QAAQ,IAAI,KAAK,KAAK;CAExE,MAAM,iBAAiB,mBAAyD;EAC9E,MAAM,WAAW,IAAI,IAAI,cAAc;EACvC,MAAM,UAAoB,CAAC;EAC3B,MAAM,WAAW,WAAoC;GACnD,KAAK,MAAM,SAAS,QAAQ;IAC1B,QAAQ,KAAK,KAAK;IAClB,MAAM,QAAQ,QAAQ,IAAI,KAAK;IAC/B,IAAI,SAAS,SAAS,IAAI,KAAK,GAAG,QAAQ,MAAM,WAAW;GAC7D;EACF;EACA,QAAQ,SAAS,IAAI,WAAW,CAAC;EACjC,OAAO;CACT;CAEA,MAAM,cAAc,UAA8D;EAChF,MAAM,QAAQ,QAAQ,KAAK;EAC3B,IAAI,UAAU,MAAM,OAAO;EAC3B,MAAM,gBAAgB,sBAAsB,MAAM,IAAI;EACtD,OAAO;GACL,OAAO,MAAM;GACb,UAAU,MAAM;GAChB,SAAS,MAAM;GACf,WAAW,MAAM;GACjB,WAAW,MAAM;GACjB,QAAQ,MAAM,WAAW,iBAAiB,KAAK;EACjD;CACF;CAEA,MAAM,gBACJ,OACA,gBACA,OACA,UACW;EACX,MAAM,UAAU,cAAc,cAAc;EAC5C,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK;EACnC,MAAM,WAAW,KAAK,IAAI,GAAG,QAAQ,SAAS,SAAS;EACvD,MAAM,SAAS,UAA0B,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,QAAQ,CAAC;EAC9E,MAAM,OAAO,MAAM,KAAK;EACxB,MAAM,QAAQ,UAAU,QAAQ,UAAU,KAAA,IAAY,KAAK,QAAQ,QAAQ,KAAK;EAChF,IAAI,UAAU,IAAI,OAAO;EACzB,IAAI,QAAQ,MAAM,OAAO,MAAM,KAAK;EACpC,IAAI,SAAS,OAAO,WAAW,OAAO,MAAM,QAAQ,YAAY,CAAC;EACjE,OAAO;CACT;CAEA,MAAM,aAA2C;EAC/C;EACA,MAAM,MAAM;EAEZ,MAAM,UAAU,QAAQ,KAAK,MAAM;EACnC,SAAS,UAAU,QAAQ,KAAK,CAAC,EAAE,QAAQ;EAC3C,SAAS;EACT,UAAU,UAAU;GAClB,MAAM,QAAQ,QAAQ,KAAK;GAC3B,OAAO,UAAU,OAAO,OAAO,YAAY,MAAM,IAAI;EACvD;EACA,aAAa,UAAU;GACrB,MAAM,QAAQ,QAAQ,KAAK;GAC3B,OAAO,UAAU,OAAO,QAAS,iBAAiB,MAAM,IAAI,KAAK;EACnE;EACA,WAAW,UAAU,WAAW,KAAK,CAAC,EAAE,UAAU;EAClD,aAAa,UAAU;GACrB,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;GAClD,MAAM,QAAQ,QAAQ,KAAK;GAC3B,OAAO,UAAU,OAAO,CAAC,IAAI,eAAe,MAAM,IAAI;EACxD;EAEA;EACA;EAEA,gBAAgB,EAAE,gBAAgB,OAAO,OAAO,aAAa,WAAW,QAAQ;GAC9E,MAAM,UAAU,cAAc,cAAc;GAC5C,MAAM,OAAO,QAAQ;GACrB,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK;GACnC,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,CAAC,CAAC;GAC3E,MAAM,cAAc,KAAK,IAAI,GAAG,WAAW,QAAQ;GACnD,MAAM,YAAY,KAAK,IAAI,MAAM,WAAW,YAAY,QAAQ;GAEhE,MAAM,WAAW,UAAsC;IACrD,MAAM,QAAQ,QAAQ;IACtB,MAAM,QAAQ,UAAU,KAAA,IAAY,KAAA,IAAY,QAAQ,IAAI,KAAK;IACjE,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GACnC,MAAM,IAAI,MAAM,0DAA0D,OAAO;IAEnF,OAAO;KAAE,MAAM,MAAM;KAAM;KAAO;IAAM;GAC1C;GAEA,MAAM,UAAgC,CAAC;GACvC,KAAK,IAAI,QAAQ,aAAa,QAAQ,WAAW,SAAS,QAAQ,KAAK,QAAQ,KAAK,CAAC;GAErF,MAAM,cACJ,gBAAgB,QAAQ,gBAAgB,KAAA,IAAY,KAAK,QAAQ,QAAQ,WAAW;GAEtF,MAAM,SADU,gBAAgB,OAAO,cAAc,eAAe,eAAe,aAC/B,QAAQ,WAAW,IAAI;GAS3E,MAAM,QANJ,WAAW,OACP,UACA,OAAO,QAAQ,cACb,CAAC,QAAQ,GAAG,OAAO,IACnB,CAAC,GAAG,SAAS,MAAM,EAAA,CAEgC,KAAK,WAAW;IACzE,MAAM,MAAM;IACZ,OAAO,MAAM;IACb,OAAO,MAAM;IACb,UAAU,WAAW,MAAM,KAAK,KAAK;KACnC,OAAO;KACP,UAAU,MAAM,QAAQ;KACxB,SAAS;KACT,WAAW,CAAC,MAAM,KAAK;KACvB,WAAW,CAAC,MAAM,KAAK;KACvB,QAAQ;IACV;IACA,QAAQ,WAAW,QAAQ,MAAM,UAAU,OAAO;GACpD,EAAE;GAEF,OAAO;IACL,OAAO;IACP,KAAK;IACL;IACA,cAAc;IACd,eAAe,OAAO;IACtB;IACA;GACF;EACF;EAEA;EAEA,eAAe,OAAO,mBAAmB;GACvC,MAAM,QAAQ,QAAQ,KAAK;GAC3B,IAAI,UAAU,MAAM,OAAO;GAC3B,MAAM,WAAW,IAAI,IAAI,cAAc;GACvC,MAAM,QAAkB,CAAC;GACzB,KAAK,MAAM,YAAY,MAAM,UAAU,MAAM,GAAG,EAAE,GAChD,IAAI,CAAC,SAAS,IAAI,QAAQ,GAAG;IAC3B,SAAS,IAAI,QAAQ;IACrB,MAAM,KAAK,QAAQ;GACrB;GAEF,OAAO,MAAM,WAAW,IAAI,iBAAiB,CAAC,GAAG,gBAAgB,GAAG,KAAK;EAC3E;EAEA,eAAe,SAAS,qBAAqB;GAAE,GAAG;GAAS,UAAU;EAAK,CAAC;CAC7E;CAEA,qBAAqB,YAAY,QAAQ;CACzC,OAAO;AACT"}

package/dist/shared/controller.d.mts

@@ -0,0 +1,4 @@
+//#region src/shared/controller.d.ts
+export type Controller<TApi, TCommand extends keyof TApi> = { readonly [K in TCommand]: TApi[K]; };
+//#endregion
+//# sourceMappingURL=controller.d.mts.map

package/dist/shared/controller.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"controller.d.mts","names":[],"sources":["../../src/shared/controller.ts"],"mappings":";YAYY,WAAW,MAAM,uBAAuB,oBACxC,KAAK,WAAW,KAAK"}