tempest-react-sdk 0.48.0 → 0.49.0

package/dist/components/DataTable/DataTable.js

@@ -11,79 +11,81 @@ import { LoadingRows as ee } from "./LoadingRows.js";
 import { useDevWarnings as te } from "./use-dev-warnings.js";
 import { DEFAULT_EDIT_LABELS as ne } from "./edit-labels.js";
 import { useCallback as l, useEffect as re, useMemo as u, useState as d } from "react";
-import { jsx as f, jsxs as ie } from "react/jsx-runtime";
+import { jsx as f, jsxs as p } from "react/jsx-runtime";
 //#region src/components/DataTable/DataTable.tsx
-function ae(e, t) {
+function ie(e, t) {
 	return `${String(e)}::${String(t)}`;
 }
-function p(e) {
+function m(e) {
 	return typeof e.header == "string" ? e.header : String(e.key);
 }
-function m({ data: m, columns: h, pageSize: g = 10, searchable: _ = !1, searchKeys: v, initialSort: oe, rowKey: y = (e, t) => t, emptyMessage: se, onCellChange: b, editLabels: ce, totalItems: le, page: x, onPageChange: S, manualSort: ue, onSortChange: C, manualSearch: de, onSearchChange: fe, loading: w = !1, className: pe, ...me }) {
-	let [T, he] = d(""), [E, ge] = d(oe ?? null), { page: _e, setPage: ve } = t(1, g), ye = n(), D = le !== void 0, O = ue ?? D, k = de ?? D, A = x ?? _e, j = l((e) => {
-		x === void 0 && ve(e), S?.(e);
+function h({ data: h, columns: g, pageSize: _ = 10, searchable: v = !1, searchKeys: y, initialSort: ae, rowKey: b = (e, t) => t, emptyMessage: oe, onCellChange: x, editLabels: se, totalItems: ce, page: S, onPageChange: C, manualSort: le, onSortChange: ue, manualSearch: de, onSearchChange: fe, loading: w = !1, className: pe, ...me }) {
+	let [T, he] = d(""), [E, ge] = d(ae ?? null), { page: _e, setPage: D } = t(1, _), O = n(), k = ce !== void 0, A = le ?? k, j = de ?? k, M = S ?? _e, N = l((e) => {
+		S === void 0 && D(e), C?.(e);
 	}, [
-		x,
-		ve,
-		S
+		S,
+		D,
+		C
 	]);
 	te({
-		serverMode: D,
-		controlledPage: x,
-		onPageChange: S,
-		sortIsManual: O,
-		onSortChange: C
+		serverMode: k,
+		controlledPage: S,
+		onPageChange: C,
+		sortIsManual: A,
+		onSortChange: ue
 	});
-	let [M, N] = d(null), [P, F] = d(null), [I, L] = d({}), [R, z] = d({}), [B, V] = d({}), H = u(() => ({
+	let [P, F] = d(null), [I, L] = d(null), [R, z] = d({}), [B, V] = d({}), [H, ve] = d({}), U = u(() => ({
 		...ne,
-		...ce
-	}), [ce]), U = b !== void 0 && h.some((e) => e.editable), be = u(() => v && v.length > 0 ? v : h.filter((e) => {
-		let t = m.find((t) => t[e.key] != null), n = t ? t[e.key] : void 0;
+		...se
+	}), [se]), W = x !== void 0 && g.some((e) => e.editable), ye = u(() => !v || j ? [] : y && y.length > 0 ? y : g.filter((e) => {
+		let t = h.find((t) => t[e.key] != null), n = t ? t[e.key] : void 0;
 		return typeof n == "string" || typeof n == "number";
 	}).map((e) => e.key), [
 		v,
-		h,
-		m
-	]), W = u(() => {
+		j,
+		y,
+		g,
+		h
+	]), G = u(() => {
 		let e = T.trim().toLowerCase();
-		return !e || !_ || k ? m : m.filter((t) => be.some((n) => {
+		return !e || !v || j ? h : h.filter((t) => ye.some((n) => {
 			let r = t[n];
 			return r != null && String(r).toLowerCase().includes(e);
 		}));
 	}, [
-		m,
+		h,
 		T,
-		_,
-		k,
-		be
-	]), G = u(() => {
-		if (!E || O) return W;
+		v,
+		j,
+		ye
+	]), K = u(() => {
+		if (!E || A) return G;
 		let e = E.direction === "asc" ? 1 : -1;
-		return [...W].sort((t, n) => o(t[E.key], n[E.key]) * e);
+		return [...G].sort((t, n) => o(t[E.key], n[E.key]) * e);
 	}, [
-		W,
+		G,
 		E,
-		O
-	]), xe = le ?? G.length, K = Math.max(1, Math.ceil(xe / g));
+		A
+	]), be = ce ?? K.length, q = Math.max(1, Math.ceil(be / _));
 	re(() => {
-		!D && A > K && j(K);
+		!k && M > q && N(q);
 	}, [
-		D,
-		A,
-		K,
-		j
+		k,
+		M,
+		q,
+		N
 	]);
-	let q = D ? A : Math.min(A, K), J = u(() => {
-		if (D) return G;
-		let e = (q - 1) * g;
-		return G.slice(e, e + g);
+	let J = k ? M : Math.min(M, q), Y = u(() => {
+		if (k) return K;
+		let e = (J - 1) * _;
+		return K.slice(e, e + _);
 	}, [
-		D,
-		G,
-		q,
-		g
+		k,
+		K,
+		J,
+		_
 	]);
-	function Se(e) {
+	function xe(e) {
 		let t = E, n = !t || t.key !== e ? {
 			key: e,
 			direction: "asc"
@@ -91,96 +93,96 @@ function m({ data: m, columns: h, pageSize: g = 10, searchable: _ = !1, searchKe
 			key: e,
 			direction: "desc"
 		} : null;
-		ge(n), C?.(n);
+		ge(n), ue?.(n);
 	}
-	let Y = l((e) => (q - 1) * g + e, [q, g]), X = u(() => {
-		if (!U) return [];
+	let X = l((e) => (J - 1) * _ + e, [J, _]), Z = u(() => {
+		if (!W) return [];
 		let e = [];
-		return J.forEach((t, n) => {
-			let r = y(t, Y(n));
-			for (let t of h) t.editable && e.push(ae(r, t.key));
+		return Y.forEach((t, n) => {
+			let r = b(t, X(n));
+			for (let t of g) t.editable && e.push(ie(r, t.key));
 		}), e;
 	}, [
-		U,
-		J,
-		h,
-		Y
-	]), Z = l((e, t, n) => n in I ? I[n] : e[t.key], [I]), Ce = l(async (e, t, n) => {
-		V((t) => ({
+		W,
+		Y,
+		g,
+		X
+	]), Q = l((e, t, n) => n in R ? R[n] : e[t.key], [R]), Se = l(async (e, t, n) => {
+		ve((t) => ({
 			...t,
 			[e]: !0
 		}));
 		try {
-			await b?.(n), ye(H.saved(p(t)));
+			await x?.(n), O(U.saved(m(t)));
 		} catch (n) {
-			L((t) => {
+			z((t) => {
 				let n = { ...t };
 				return delete n[e], n;
 			});
-			let r = n instanceof Error && n.message ? n.message : H.saveFailed(p(t));
-			z((t) => ({
+			let r = n instanceof Error && n.message ? n.message : U.saveFailed(m(t));
+			V((t) => ({
 				...t,
 				[e]: r
 			}));
 		} finally {
-			V((t) => {
+			ve((t) => {
 				let n = { ...t };
 				return delete n[e], n;
 			});
 		}
 	}, [
-		b,
-		ye,
-		H
-	]), Q = l((e, t) => {
+		x,
+		O,
+		U
+	]), $ = l((e, t) => {
 		if (t === "none") {
-			N(null), F(e);
+			F(null), L(e);
 			return;
 		}
-		let n = X.indexOf(e), r = X[n + (t === "next" ? 1 : -1)];
+		let n = Z.indexOf(e), r = Z[n + (t === "next" ? 1 : -1)];
 		if (r === void 0) {
-			N(null), F(e);
+			F(null), L(e);
 			return;
 		}
-		N(r), F(null);
-	}, [X]), we = l((e, t, n, r, i, a) => {
-		let o = Z(e, t, n);
+		F(r), L(null);
+	}, [Z]), Ce = l((e, t, n, r, i, a) => {
+		let o = Q(e, t, n);
 		if (i === (t.formatEdit ? t.formatEdit(e) : String(o ?? ""))) {
-			Q(n, a);
+			$(n, a);
 			return;
 		}
 		let s = t.parse ? t.parse(i, e) : t.editorType === "number" ? Number(i) : i.trim(), c = t.validate?.(s, e) ?? null;
 		if (c) {
-			z((e) => ({
+			V((e) => ({
 				...e,
 				[n]: c
 			}));
 			return;
 		}
-		z((e) => {
+		V((e) => {
 			let t = { ...e };
 			return delete t[n], t;
-		}), L((e) => ({
+		}), z((e) => ({
 			...e,
 			[n]: s
-		})), Q(n, a), Ce(n, t, {
+		})), $(n, a), Se(n, t, {
 			row: e,
 			key: t.key,
 			value: s,
 			previous: o,
-			rowIndex: Y(r)
+			rowIndex: X(r)
 		});
 	}, [
-		Z,
 		Q,
-		Ce,
-		Y
-	]), Te = u(() => h.map((e) => {
-		let t = E?.key === e.key ? E?.direction === "asc" ? " ▲" : " ▼" : "", n = e.sortable ? /* @__PURE__ */ ie("button", {
+		$,
+		Se,
+		X
+	]), we = u(() => g.map((e) => {
+		let t = E?.key === e.key ? E?.direction === "asc" ? " ▲" : " ▼" : "", n = e.sortable ? /* @__PURE__ */ p("button", {
 			type: "button",
 			className: s.sortButton,
-			onClick: () => Se(e.key),
-			"aria-label": `Ordenar por ${p(e)}`,
+			onClick: () => xe(e.key),
+			"aria-label": `Ordenar por ${m(e)}`,
 			children: [e.header, /* @__PURE__ */ f("span", {
 				className: s.sortIndicator,
 				"aria-hidden": !0,
@@ -192,7 +194,7 @@ function m({ data: m, columns: h, pageSize: g = 10, searchable: _ = !1, searchKe
 				[e.key]: n
 			};
 			return e.render ? e.render(r) : r[e.key] ?? null;
-		}, a = U && e.editable === !0;
+		}, a = W && e.editable === !0;
 		return {
 			key: String(e.key),
 			header: n,
@@ -200,24 +202,24 @@ function m({ data: m, columns: h, pageSize: g = 10, searchable: _ = !1, searchKe
 			priority: e.priority,
 			width: e.width,
 			render: a ? (t, n) => {
-				let r = ae(y(t, Y(n)), e.key), a = Z(t, e, r), o = e.formatEdit ? e.formatEdit(t) : String(a ?? "");
+				let r = ie(b(t, X(n)), e.key), a = Q(t, e, r), o = e.formatEdit ? e.formatEdit(t) : String(a ?? "");
 				return /* @__PURE__ */ f(c, {
 					text: o,
-					columnLabel: p(e),
+					columnLabel: m(e),
 					rowNumber: n + 1,
 					inputType: e.editorType ?? "text",
-					editing: M === r,
-					refocus: P === r,
-					saving: B[r] === !0,
-					error: R[r] ?? null,
+					editing: P === r,
+					refocus: I === r,
+					saving: H[r] === !0,
+					error: B[r] ?? null,
 					errorId: `tempest-cell-error-${r.replace(/[^\w-]/g, "_")}`,
-					labels: H,
+					labels: U,
 					onOpen: () => {
-						N(r), F(null);
+						F(r), L(null);
 					},
-					onCommit: (i, a) => we(t, e, r, n, i, a),
+					onCommit: (i, a) => Ce(t, e, r, n, i, a),
 					onCancel: () => {
-						N(null), F(r), z((e) => {
+						F(null), L(r), V((e) => {
 							let t = { ...e };
 							return delete t[r], t;
 						});
@@ -227,53 +229,53 @@ function m({ data: m, columns: h, pageSize: g = 10, searchable: _ = !1, searchKe
 			} : r
 		};
 	}), [
-		h,
+		g,
 		E,
-		U,
-		M,
+		W,
 		P,
+		I,
+		H,
 		B,
+		U,
 		R,
-		H,
-		I,
-		Y,
-		we
-	]), $ = w && J.length === 0;
-	return /* @__PURE__ */ ie("div", {
+		X,
+		Ce
+	]), Te = w && Y.length === 0;
+	return /* @__PURE__ */ p("div", {
 		className: e(s.wrapper, pe),
 		...me,
 		children: [
-			_ && /* @__PURE__ */ f(i, {
+			v && /* @__PURE__ */ f(i, {
 				value: T,
 				onChange: (e) => {
-					he(e), j(1), fe?.(e);
+					he(e), N(1), fe?.(e);
 				},
 				wrapperClassName: s.search
 			}),
 			/* @__PURE__ */ f("div", {
-				className: e(w && !$ && s.pending),
+				className: e(w && !Te && s.pending),
 				"aria-busy": w || void 0,
 				"data-testid": "tempest-datatable-body",
-				children: $ ? /* @__PURE__ */ f(ee, {
-					columns: Te.length,
-					rows: Math.min(g, 8)
+				children: Te ? /* @__PURE__ */ f(ee, {
+					columns: we.length,
+					rows: Math.min(_, 8)
 				}) : /* @__PURE__ */ f(a, {
-					columns: Te,
-					data: J,
-					rowKey: (e, t) => y(e, Y(t)),
-					emptyMessage: se
+					columns: we,
+					data: Y,
+					rowKey: (e, t) => b(e, X(t)),
+					emptyMessage: oe
 				})
 			}),
-			K > 1 && /* @__PURE__ */ f(r, {
-				page: q,
-				totalPages: K,
-				onPageChange: j,
-				totalItems: xe
+			q > 1 && /* @__PURE__ */ f(r, {
+				page: J,
+				totalPages: q,
+				onPageChange: N,
+				totalItems: be
 			})
 		]
 	});
 }
 //#endregion
-export { m as DataTable };
+export { h as DataTable };
 
 //# sourceMappingURL=DataTable.js.map

package/dist/components/DataTable/DataTable.js.map

@@ -1 +1 @@
-{"version":3,"file":"DataTable.js","names":[],"sources":["../../../src/components/DataTable/DataTable.tsx"],"sourcesContent":["/**\n * @tempest-limits file-lines, props-count, function-lines — the table does four jobs\n * a caller turns on independently — paging (pageSize), search (searchable,\n * searchKeys), sort (initialSort) and inline edit (onCellChange, editLabels) — over\n * one row model (data, columns, rowKey, emptyMessage). The body is long because\n * those four share the derived-rows pipeline: filter, then sort, then page, then map\n * to cells, in that order and off the same memo.\n */\nimport { useCallback, useEffect, useMemo, useState } from \"react\";\nimport type { HTMLAttributes, ReactNode } from \"react\";\nimport { cn } from \"@/utils/cn\";\nimport { compareValues } from \"@/utils/compare-values\";\nimport { usePagination } from \"@/hooks\";\nimport { useAnnounce } from \"@/hooks/use-announce\";\nimport { Table, type TableAlign, type TableColumn, type TablePriority } from \"../Table\";\nimport { Pagination } from \"../Pagination\";\nimport { SearchBar } from \"../SearchBar\";\nimport { EditableCell } from \"./EditableCell\";\nimport { LoadingRows } from \"./LoadingRows\";\nimport { useDevWarnings } from \"./use-dev-warnings\";\nimport { DEFAULT_EDIT_LABELS, type CellCommitMove, type DataTableEditLabels } from \"./edit-labels\";\nimport styles from \"./DataTable.module.css\";\n\nexport type SortDirection = \"asc\" | \"desc\";\n\nexport interface DataTableSort<T> {\n    key: keyof T;\n    direction: SortDirection;\n}\n\n/** Input types an editable column can use. */\nexport type DataTableEditorType = \"text\" | \"number\" | \"date\" | \"email\" | \"tel\" | \"url\";\n\n/** One accepted cell edit, handed to `onCellChange`. */\nexport interface DataTableCellChange<T> {\n    /** The row as it was before the edit. */\n    row: T;\n    /** Which column changed. */\n    key: keyof T;\n    /** The parsed new value. */\n    value: unknown;\n    /** The value that was displayed before the edit. */\n    previous: unknown;\n    /** Index of the row in the full `data` array. */\n    rowIndex: number;\n}\n\n/**\n * Column definition for {@link DataTable}. Extends the headless {@link Table}\n * column shape with a typed `key`, opt-in sorting, opt-in inline editing, and the\n * visual options that are forwarded to the underlying Table cell.\n */\nexport interface DataTableColumn<T> {\n    /** Property of the row this column reads from. Doubles as the cell key. */\n    key: keyof T;\n    /** Column heading. */\n    header: ReactNode;\n    /** Custom cell renderer. Defaults to `String(row[key])`. */\n    render?: (row: T) => ReactNode;\n    /** Enable click-to-sort on this column's header. */\n    sortable?: boolean;\n    /** Text alignment forwarded to the Table cell. */\n    align?: TableAlign;\n    /** Responsive visibility priority forwarded to the Table cell. */\n    priority?: TablePriority;\n    /** Fixed column width forwarded to the Table cell. */\n    width?: string | number;\n    /**\n     * Let cells in this column be edited in place. Requires `onCellChange` on the\n     * table; without it the column stays read-only.\n     */\n    editable?: boolean;\n    /** Editor input type. Default `\"text\"`. */\n    editorType?: DataTableEditorType;\n    /** Text the editor opens with. Defaults to `String(value ?? \"\")`. */\n    formatEdit?: (row: T) => string;\n    /**\n     * Turn the typed string into the stored value. Defaults to the trimmed string,\n     * or `Number(raw)` when `editorType` is `\"number\"`.\n     */\n    parse?: (raw: string, row: T) => unknown;\n    /** Return a message to reject the edit, or `null` to accept it. */\n    validate?: (value: unknown, row: T) => string | null;\n}\n\nexport interface DataTableProps<T> extends HTMLAttributes<HTMLDivElement> {\n    /**\n     * The rows to work with.\n     *\n     * By default this is the **full** dataset and sorting, searching and paging\n     * all happen in memory. Pass `totalItems` and it becomes the current page as\n     * the server returned it, with those three delegated to the caller.\n     */\n    data: T[];\n    /** Column definitions. */\n    columns: DataTableColumn<T>[];\n    /** Rows per page. Default 10. */\n    pageSize?: number;\n    /** Render a search input above the table. Default false. */\n    searchable?: boolean;\n    /**\n     * Keys to match the search term against. When omitted, every column whose\n     * value is a string or number is searched.\n     */\n    searchKeys?: (keyof T)[];\n    /** Initial sort applied before any header interaction. */\n    initialSort?: DataTableSort<T>;\n    /** Stable key extractor for rows. Defaults to the row index. */\n    rowKey?: (row: T, index: number) => string | number;\n    /** Content shown when no rows match. */\n    emptyMessage?: ReactNode;\n    /**\n     * Persist an accepted cell edit. Return a promise: while it is pending the cell\n     * already shows the new value, and a rejection rolls that back and surfaces the\n     * error in the cell. Without this prop no column is editable.\n     */\n    onCellChange?: (change: DataTableCellChange<T>) => void | Promise<void>;\n    /** Override the PT-BR copy of the editing affordances. */\n    editLabels?: Partial<DataTableEditLabels>;\n    /**\n     * Total row count across every page — the `total` of a paginated envelope.\n     *\n     * Passing it switches the table to **server mode**: `data` is read as the\n     * current page, the page count comes from this number instead of\n     * `data.length`, and sorting and searching are delegated to the caller\n     * (see `manualSort` / `manualSearch`, which are implied here). Pair it with\n     * `page` and `onPageChange`.\n     */\n    totalItems?: number;\n    /** Current page, 1-based. Controlled — required in server mode. */\n    page?: number;\n    /** Called with the next page. Required whenever `page` is controlled. */\n    onPageChange?: (page: number) => void;\n    /**\n     * Sorting is the caller's job: clicking a header reports through\n     * `onSortChange` and the rows are left in the order they arrived.\n     *\n     * Implied by `totalItems`, because sorting the page in memory would sort\n     * *that page only* while the header claims the whole table is ordered.\n     */\n    manualSort?: boolean;\n    /** Called with the next sort state — `null` when the header cycles back to unsorted. */\n    onSortChange?: (sort: DataTableSort<T> | null) => void;\n    /**\n     * Searching is the caller's job: typing reports through `onSearchChange` and\n     * the rows are left as they arrived.\n     *\n     * Implied by `totalItems`. Filtering the current page would hide the rows\n     * that do not match *on this page* and show nothing for a term that only\n     * matches on page three — an empty table that looks like \"no results\".\n     */\n    manualSearch?: boolean;\n    /** Called with the current search term (debouncing, if any, is the caller's). */\n    onSearchChange?: (term: string) => void;\n    /**\n     * A fetch is in flight.\n     *\n     * With rows already on screen they stay put, dimmed and `aria-busy`, so the\n     * page does not jump under the cursor between pages. With no rows yet it\n     * renders placeholder lines at full height, which is a different statement\n     * from `emptyMessage`: \"loading\" and \"there is nothing\" are not the same\n     * screen.\n     */\n    loading?: boolean;\n}\n\n/** Identity of one cell, stable across re-renders and pagination. */\nfunction cellId(rowKeyValue: string | number, columnKey: PropertyKey): string {\n    return `${String(rowKeyValue)}::${String(columnKey)}`;\n}\n\nfunction headerText<T>(column: DataTableColumn<T>): string {\n    return typeof column.header === \"string\" ? column.header : String(column.key);\n}\n\n/**\n * Stateful, headless data table built on top of {@link Table}. Adds\n * client-side searching, click-to-sort columns, pagination and opt-in inline\n * editing while delegating all table markup to the underlying Table component.\n *\n * - Clicking a sortable header cycles asc → desc → unsorted.\n * - Search matches a case-insensitive substring across `searchKeys`\n *   (or every string/number column when not provided).\n * - Pagination is hidden when the result fits on a single page.\n * - A column with `editable` renders a button that opens an inline editor;\n *   `Enter` commits, `Escape` discards, `Tab` walks to the next editable cell.\n *\n * Editing is strictly opt-in: with no `editable` column (or no `onCellChange`) the\n * rendered markup is byte-for-byte what it was before the feature existed, which\n * matters because the component is published.\n *\n * ## Optimistic, with a visible rollback\n *\n * An accepted edit is shown immediately and `onCellChange` runs in the background.\n * If it rejects, the cell returns to the old value **and** shows the reason as a\n * `role=\"alert\"` tied to the cell. A silent revert is worse than no optimistic\n * update at all: the user watched their edit appear and has no reason to doubt it.\n *\n * The header memo depends on `columns`, `sort` and the editing state only:\n * `toggleSort` and the commit callbacks are recreated each render but always close\n * over the same setters, so including them would rebuild every header on every\n * render without changing behaviour. That is why `exhaustive-deps` is silenced on\n * that dependency array.\n */\nexport function DataTable<T>({\n    data,\n    columns,\n    pageSize = 10,\n    searchable = false,\n    searchKeys,\n    initialSort,\n    rowKey = (_row, index) => index,\n    emptyMessage,\n    onCellChange,\n    editLabels,\n    totalItems,\n    page: controlledPage,\n    onPageChange,\n    manualSort,\n    onSortChange,\n    manualSearch,\n    onSearchChange,\n    loading = false,\n    className,\n    ...rest\n}: DataTableProps<T>) {\n    const [search, setSearch] = useState<string>(\"\");\n    const [sort, setSort] = useState<DataTableSort<T> | null>(initialSort ?? null);\n    const { page: internalPage, setPage: setInternalPage } = usePagination(1, pageSize);\n    const announce = useAnnounce();\n\n    const serverMode = totalItems !== undefined;\n    const sortIsManual = manualSort ?? serverMode;\n    const searchIsManual = manualSearch ?? serverMode;\n    const page = controlledPage ?? internalPage;\n\n    const setPage = useCallback(\n        (next: number) => {\n            if (controlledPage === undefined) setInternalPage(next);\n            onPageChange?.(next);\n        },\n        [controlledPage, setInternalPage, onPageChange],\n    );\n\n    useDevWarnings({ serverMode, controlledPage, onPageChange, sortIsManual, onSortChange });\n\n    const [editing, setEditing] = useState<string | null>(null);\n    const [refocus, setRefocus] = useState<string | null>(null);\n    const [overrides, setOverrides] = useState<Record<string, unknown>>({});\n    const [errors, setErrors] = useState<Record<string, string>>({});\n    const [saving, setSaving] = useState<Record<string, boolean>>({});\n\n    const labels = useMemo<DataTableEditLabels>(\n        () => ({ ...DEFAULT_EDIT_LABELS, ...editLabels }),\n        [editLabels],\n    );\n    const editingEnabled = onCellChange !== undefined && columns.some((column) => column.editable);\n\n    const effectiveSearchKeys = useMemo<(keyof T)[]>(() => {\n        if (searchKeys && searchKeys.length > 0) return searchKeys;\n        return columns\n            .filter((column) => {\n                const sample = data.find((row) => row[column.key] != null);\n                const value = sample ? sample[column.key] : undefined;\n                return typeof value === \"string\" || typeof value === \"number\";\n            })\n            .map((column) => column.key);\n    }, [searchKeys, columns, data]);\n\n    const filtered = useMemo<T[]>(() => {\n        const term = search.trim().toLowerCase();\n        if (!term || !searchable || searchIsManual) return data;\n        return data.filter((row) =>\n            effectiveSearchKeys.some((key) => {\n                const value = row[key];\n                return value != null && String(value).toLowerCase().includes(term);\n            }),\n        );\n    }, [data, search, searchable, searchIsManual, effectiveSearchKeys]);\n\n    const sorted = useMemo<T[]>(() => {\n        if (!sort || sortIsManual) return filtered;\n        const factor = sort.direction === \"asc\" ? 1 : -1;\n        return [...filtered].sort((a, b) => compareValues(a[sort.key], b[sort.key]) * factor);\n    }, [filtered, sort, sortIsManual]);\n\n    const rowCount = totalItems ?? sorted.length;\n    const totalPages = Math.max(1, Math.ceil(rowCount / pageSize));\n\n    /**\n     * Clamp the current page when the dataset shrinks (e.g. after filtering).\n     *\n     * Skipped in server mode: `page` belongs to the caller there, and a clamp\n     * fired against a `totalItems` that has not caught up with the new filter\n     * yet would send them a page they did not ask for, mid-fetch.\n     */\n    useEffect(() => {\n        if (!serverMode && page > totalPages) setPage(totalPages);\n    }, [serverMode, page, totalPages, setPage]);\n\n    const safePage = serverMode ? page : Math.min(page, totalPages);\n    const pageRows = useMemo<T[]>(() => {\n        if (serverMode) return sorted;\n        const start = (safePage - 1) * pageSize;\n        return sorted.slice(start, start + pageSize);\n    }, [serverMode, sorted, safePage, pageSize]);\n\n    function toggleSort(key: keyof T): void {\n        const current = sort;\n        const next: DataTableSort<T> | null =\n            !current || current.key !== key\n                ? { key, direction: \"asc\" }\n                : current.direction === \"asc\"\n                  ? { key, direction: \"desc\" }\n                  : null;\n        setSort(next);\n        onSortChange?.(next);\n    }\n\n    const absoluteIndex = useCallback(\n        (pageIndex: number) => (safePage - 1) * pageSize + pageIndex,\n        [safePage, pageSize],\n    );\n\n    /**\n     * Every editable cell on the page, row-major — the order `Tab` walks.\n     *\n     * Row-major and not column-major because a row is the record a user is\n     * correcting; walking down a column would make them re-find their place on\n     * every keystroke.\n     */\n    const editableCellIds = useMemo<string[]>(() => {\n        if (!editingEnabled) return [];\n        const ids: string[] = [];\n        pageRows.forEach((row, index) => {\n            const key = rowKey(row, absoluteIndex(index));\n            for (const column of columns) {\n                if (column.editable) ids.push(cellId(key, column.key));\n            }\n        });\n        return ids;\n        // eslint-disable-next-line react-hooks/exhaustive-deps\n    }, [editingEnabled, pageRows, columns, absoluteIndex]);\n\n    const displayed = useCallback(\n        (row: T, column: DataTableColumn<T>, id: string): unknown =>\n            id in overrides ? overrides[id] : row[column.key],\n        [overrides],\n    );\n\n    /**\n     * Run the caller's `onCellChange` behind the optimistic update.\n     *\n     * Only the *success* is announced. The failure already renders as a\n     * `role=\"alert\"` inside the cell, which screen readers read on insertion —\n     * announcing it again from the shared region would read it twice and put the\n     * same text in the document twice.\n     */\n    const persist = useCallback(\n        async (id: string, column: DataTableColumn<T>, change: DataTableCellChange<T>) => {\n            setSaving((current) => ({ ...current, [id]: true }));\n            try {\n                await onCellChange?.(change);\n                announce(labels.saved(headerText(column)));\n            } catch (error) {\n                setOverrides((current) => {\n                    const next = { ...current };\n                    delete next[id];\n                    return next;\n                });\n                const message =\n                    error instanceof Error && error.message\n                        ? error.message\n                        : labels.saveFailed(headerText(column));\n                setErrors((current) => ({ ...current, [id]: message }));\n            } finally {\n                setSaving((current) => {\n                    const next = { ...current };\n                    delete next[id];\n                    return next;\n                });\n            }\n        },\n        [onCellChange, announce, labels],\n    );\n\n    const moveFrom = useCallback(\n        (id: string, move: CellCommitMove): void => {\n            if (move === \"none\") {\n                setEditing(null);\n                setRefocus(id);\n                return;\n            }\n            const index = editableCellIds.indexOf(id);\n            const target = editableCellIds[index + (move === \"next\" ? 1 : -1)];\n            if (target === undefined) {\n                setEditing(null);\n                setRefocus(id);\n                return;\n            }\n            setEditing(target);\n            setRefocus(null);\n        },\n        [editableCellIds],\n    );\n\n    /**\n     * Parse, validate, stage optimistically, then save in the background.\n     *\n     * Validation runs before anything is staged, and a rejection leaves the editor\n     * open with the message attached to the input — the user has to be able to fix\n     * what they typed without retyping it.\n     */\n    const commit = useCallback(\n        (\n            row: T,\n            column: DataTableColumn<T>,\n            id: string,\n            pageIndex: number,\n            raw: string,\n            move: CellCommitMove,\n        ): void => {\n            const previous = displayed(row, column, id);\n            const currentText = column.formatEdit ? column.formatEdit(row) : String(previous ?? \"\");\n            if (raw === currentText) {\n                moveFrom(id, move);\n                return;\n            }\n\n            const value = column.parse\n                ? column.parse(raw, row)\n                : column.editorType === \"number\"\n                  ? Number(raw)\n                  : raw.trim();\n\n            const invalid = column.validate?.(value, row) ?? null;\n            if (invalid) {\n                setErrors((current) => ({ ...current, [id]: invalid }));\n                return;\n            }\n\n            setErrors((current) => {\n                const next = { ...current };\n                delete next[id];\n                return next;\n            });\n            setOverrides((current) => ({ ...current, [id]: value }));\n            moveFrom(id, move);\n            void persist(id, column, {\n                row,\n                key: column.key,\n                value,\n                previous,\n                rowIndex: absoluteIndex(pageIndex),\n            });\n        },\n        [displayed, moveFrom, persist, absoluteIndex],\n    );\n\n    const tableColumns = useMemo<TableColumn<T>[]>(\n        () =>\n            columns.map((column) => {\n                const isSorted = sort?.key === column.key;\n                const indicator = isSorted ? (sort?.direction === \"asc\" ? \" ▲\" : \" ▼\") : \"\";\n                const header = column.sortable ? (\n                    <button\n                        type=\"button\"\n                        className={styles.sortButton}\n                        onClick={() => toggleSort(column.key)}\n                        aria-label={`Ordenar por ${headerText(column)}`}\n                    >\n                        {column.header}\n                        <span className={styles.sortIndicator} aria-hidden>\n                            {indicator}\n                        </span>\n                    </button>\n                ) : (\n                    column.header\n                );\n\n                const plainCell = (row: T): ReactNode => {\n                    if (column.render) return column.render(row);\n                    return (row[column.key] as ReactNode) ?? null;\n                };\n\n                /**\n                 * Render an editable cell's content against the optimistic value.\n                 *\n                 * The row is shallow-patched rather than the value passed alongside it,\n                 * because a column with a custom `render` (a `<Money>`, a badge) reads\n                 * the row — handing it the stale row would show the old number under a\n                 * cell the user just changed.\n                 */\n                const patchedCell = (row: T, value: unknown): ReactNode => {\n                    const patched = { ...row, [column.key]: value } as T;\n                    if (column.render) return column.render(patched);\n                    return (patched[column.key] as ReactNode) ?? null;\n                };\n\n                const editable = editingEnabled && column.editable === true;\n\n                return {\n                    key: String(column.key),\n                    header,\n                    align: column.align,\n                    priority: column.priority,\n                    width: column.width,\n                    render: editable\n                        ? (row: T, index: number) => {\n                              const id = cellId(rowKey(row, absoluteIndex(index)), column.key);\n                              const value = displayed(row, column, id);\n                              const text = column.formatEdit\n                                  ? column.formatEdit(row)\n                                  : String(value ?? \"\");\n                              return (\n                                  <EditableCell\n                                      text={text}\n                                      columnLabel={headerText(column)}\n                                      rowNumber={index + 1}\n                                      inputType={column.editorType ?? \"text\"}\n                                      editing={editing === id}\n                                      refocus={refocus === id}\n                                      saving={saving[id] === true}\n                                      error={errors[id] ?? null}\n                                      errorId={`tempest-cell-error-${id.replace(/[^\\w-]/g, \"_\")}`}\n                                      labels={labels}\n                                      onOpen={() => {\n                                          setEditing(id);\n                                          setRefocus(null);\n                                      }}\n                                      onCommit={(raw, move) =>\n                                          commit(row, column, id, index, raw, move)\n                                      }\n                                      onCancel={() => {\n                                          setEditing(null);\n                                          setRefocus(id);\n                                          setErrors((current) => {\n                                              const next = { ...current };\n                                              delete next[id];\n                                              return next;\n                                          });\n                                      }}\n                                  >\n                                      {patchedCell(row, value)}\n                                  </EditableCell>\n                              );\n                          }\n                        : plainCell,\n                };\n            }),\n        // eslint-disable-next-line react-hooks/exhaustive-deps\n        [\n            columns,\n            sort,\n            editingEnabled,\n            editing,\n            refocus,\n            saving,\n            errors,\n            labels,\n            overrides,\n            absoluteIndex,\n            commit,\n        ],\n    );\n\n    const showSkeleton = loading && pageRows.length === 0;\n\n    return (\n        <div className={cn(styles.wrapper, className)} {...rest}>\n            {searchable && (\n                <SearchBar\n                    value={search}\n                    onChange={(value) => {\n                        setSearch(value);\n                        setPage(1);\n                        onSearchChange?.(value);\n                    }}\n                    wrapperClassName={styles.search}\n                />\n            )}\n            <div\n                className={cn(loading && !showSkeleton && styles.pending)}\n                aria-busy={loading || undefined}\n                data-testid=\"tempest-datatable-body\"\n            >\n                {showSkeleton ? (\n                    <LoadingRows columns={tableColumns.length} rows={Math.min(pageSize, 8)} />\n                ) : (\n                    <Table\n                        columns={tableColumns}\n                        data={pageRows}\n                        rowKey={(row, index) => rowKey(row, absoluteIndex(index))}\n                        emptyMessage={emptyMessage}\n                    />\n                )}\n            </div>\n            {totalPages > 1 && (\n                <Pagination\n                    page={safePage}\n                    totalPages={totalPages}\n                    onPageChange={setPage}\n                    totalItems={rowCount}\n                />\n            )}\n        </div>\n    );\n}\n"],"mappings":";;;;;;;;;;;;;;;AAuKA,SAAS,GAAO,GAA8B,GAAgC;CAC1E,OAAO,GAAG,OAAO,CAAW,EAAE,IAAI,OAAO,CAAS;AACtD;AAEA,SAAS,EAAc,GAAoC;CACvD,OAAO,OAAO,EAAO,UAAW,WAAW,EAAO,SAAS,OAAO,EAAO,GAAG;AAChF;AA+BA,SAAgB,EAAa,EACzB,SACA,YACA,cAAW,IACX,gBAAa,IACb,eACA,iBACA,aAAU,GAAM,MAAU,GAC1B,kBACA,iBACA,gBACA,gBACA,MAAM,GACN,iBACA,gBACA,iBACA,kBACA,oBACA,aAAU,IACV,eACA,GAAG,MACe;CAClB,IAAM,CAAC,GAAQ,MAAa,EAAiB,EAAE,GACzC,CAAC,GAAM,MAAW,EAAkC,MAAe,IAAI,GACvE,EAAE,MAAM,IAAc,SAAS,OAAoB,EAAc,GAAG,CAAQ,GAC5E,KAAW,EAAY,GAEvB,IAAa,OAAe,KAAA,GAC5B,IAAe,MAAc,GAC7B,IAAiB,MAAgB,GACjC,IAAO,KAAkB,IAEzB,IAAU,GACX,MAAiB;EAEd,AADI,MAAmB,KAAA,KAAW,GAAgB,CAAI,GACtD,IAAe,CAAI;CACvB,GACA;EAAC;EAAgB;EAAiB;CAAY,CAClD;CAEA,GAAe;EAAE;EAAY;EAAgB;EAAc;EAAc;CAAa,CAAC;CAEvF,IAAM,CAAC,GAAS,KAAc,EAAwB,IAAI,GACpD,CAAC,GAAS,KAAc,EAAwB,IAAI,GACpD,CAAC,GAAW,KAAgB,EAAkC,CAAC,CAAC,GAChE,CAAC,GAAQ,KAAa,EAAiC,CAAC,CAAC,GACzD,CAAC,GAAQ,KAAa,EAAkC,CAAC,CAAC,GAE1D,IAAS,SACJ;EAAE,GAAG;EAAqB,GAAG;CAAW,IAC/C,CAAC,EAAU,CACf,GACM,IAAiB,MAAiB,KAAA,KAAa,EAAQ,MAAM,MAAW,EAAO,QAAQ,GAEvF,KAAsB,QACpB,KAAc,EAAW,SAAS,IAAU,IACzC,EACF,QAAQ,MAAW;EAChB,IAAM,IAAS,EAAK,MAAM,MAAQ,EAAI,EAAO,QAAQ,IAAI,GACnD,IAAQ,IAAS,EAAO,EAAO,OAAO,KAAA;EAC5C,OAAO,OAAO,KAAU,YAAY,OAAO,KAAU;CACzD,CAAC,CAAC,CACD,KAAK,MAAW,EAAO,GAAG,GAChC;EAAC;EAAY;EAAS;CAAI,CAAC,GAExB,IAAW,QAAmB;EAChC,IAAM,IAAO,EAAO,KAAK,CAAC,CAAC,YAAY;EAEvC,OADI,CAAC,KAAQ,CAAC,KAAc,IAAuB,IAC5C,EAAK,QAAQ,MAChB,GAAoB,MAAM,MAAQ;GAC9B,IAAM,IAAQ,EAAI;GAClB,OAAO,KAAS,QAAQ,OAAO,CAAK,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,CAAI;EACrE,CAAC,CACL;CACJ,GAAG;EAAC;EAAM;EAAQ;EAAY;EAAgB;CAAmB,CAAC,GAE5D,IAAS,QAAmB;EAC9B,IAAI,CAAC,KAAQ,GAAc,OAAO;EAClC,IAAM,IAAS,EAAK,cAAc,QAAQ,IAAI;EAC9C,OAAO,CAAC,GAAG,CAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAc,EAAE,EAAK,MAAM,EAAE,EAAK,IAAI,IAAI,CAAM;CACxF,GAAG;EAAC;EAAU;EAAM;CAAY,CAAC,GAE3B,KAAW,MAAc,EAAO,QAChC,IAAa,KAAK,IAAI,GAAG,KAAK,KAAK,KAAW,CAAQ,CAAC;CAS7D,SAAgB;EACZ,AAAI,CAAC,KAAc,IAAO,KAAY,EAAQ,CAAU;CAC5D,GAAG;EAAC;EAAY;EAAM;EAAY;CAAO,CAAC;CAE1C,IAAM,IAAW,IAAa,IAAO,KAAK,IAAI,GAAM,CAAU,GACxD,IAAW,QAAmB;EAChC,IAAI,GAAY,OAAO;EACvB,IAAM,KAAS,IAAW,KAAK;EAC/B,OAAO,EAAO,MAAM,GAAO,IAAQ,CAAQ;CAC/C,GAAG;EAAC;EAAY;EAAQ;EAAU;CAAQ,CAAC;CAE3C,SAAS,GAAW,GAAoB;EACpC,IAAM,IAAU,GACV,IACF,CAAC,KAAW,EAAQ,QAAQ,IACtB;GAAE;GAAK,WAAW;EAAM,IACxB,EAAQ,cAAc,QACpB;GAAE;GAAK,WAAW;EAAO,IACzB;EAEZ,AADA,GAAQ,CAAI,GACZ,IAAe,CAAI;CACvB;CAEA,IAAM,IAAgB,GACjB,OAAuB,IAAW,KAAK,IAAW,GACnD,CAAC,GAAU,CAAQ,CACvB,GASM,IAAkB,QAAwB;EAC5C,IAAI,CAAC,GAAgB,OAAO,CAAC;EAC7B,IAAM,IAAgB,CAAC;EAOvB,OANA,EAAS,SAAS,GAAK,MAAU;GAC7B,IAAM,IAAM,EAAO,GAAK,EAAc,CAAK,CAAC;GAC5C,KAAK,IAAM,KAAU,GACjB,AAAI,EAAO,YAAU,EAAI,KAAK,GAAO,GAAK,EAAO,GAAG,CAAC;EAE7D,CAAC,GACM;CAEX,GAAG;EAAC;EAAgB;EAAU;EAAS;CAAa,CAAC,GAE/C,IAAY,GACb,GAAQ,GAA4B,MACjC,KAAM,IAAY,EAAU,KAAM,EAAI,EAAO,MACjD,CAAC,CAAS,CACd,GAUM,KAAU,EACZ,OAAO,GAAY,GAA4B,MAAmC;EAC9E,GAAW,OAAa;GAAE,GAAG;IAAU,IAAK;EAAK,EAAE;EACnD,IAAI;GAEA,AADA,MAAM,IAAe,CAAM,GAC3B,GAAS,EAAO,MAAM,EAAW,CAAM,CAAC,CAAC;EAC7C,SAAS,GAAO;GACZ,GAAc,MAAY;IACtB,IAAM,IAAO,EAAE,GAAG,EAAQ;IAE1B,OADA,OAAO,EAAK,IACL;GACX,CAAC;GACD,IAAM,IACF,aAAiB,SAAS,EAAM,UAC1B,EAAM,UACN,EAAO,WAAW,EAAW,CAAM,CAAC;GAC9C,GAAW,OAAa;IAAE,GAAG;KAAU,IAAK;GAAQ,EAAE;EAC1D,UAAU;GACN,GAAW,MAAY;IACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;IAE1B,OADA,OAAO,EAAK,IACL;GACX,CAAC;EACL;CACJ,GACA;EAAC;EAAc;EAAU;CAAM,CACnC,GAEM,IAAW,GACZ,GAAY,MAA+B;EACxC,IAAI,MAAS,QAAQ;GAEjB,AADA,EAAW,IAAI,GACf,EAAW,CAAE;GACb;EACJ;EACA,IAAM,IAAQ,EAAgB,QAAQ,CAAE,GAClC,IAAS,EAAgB,KAAS,MAAS,SAAS,IAAI;EAC9D,IAAI,MAAW,KAAA,GAAW;GAEtB,AADA,EAAW,IAAI,GACf,EAAW,CAAE;GACb;EACJ;EAEA,AADA,EAAW,CAAM,GACjB,EAAW,IAAI;CACnB,GACA,CAAC,CAAe,CACpB,GASM,KAAS,GAEP,GACA,GACA,GACA,GACA,GACA,MACO;EACP,IAAM,IAAW,EAAU,GAAK,GAAQ,CAAE;EAE1C,IAAI,OADgB,EAAO,aAAa,EAAO,WAAW,CAAG,IAAI,OAAO,KAAY,EAAE,IAC7D;GACrB,EAAS,GAAI,CAAI;GACjB;EACJ;EAEA,IAAM,IAAQ,EAAO,QACf,EAAO,MAAM,GAAK,CAAG,IACrB,EAAO,eAAe,WACpB,OAAO,CAAG,IACV,EAAI,KAAK,GAEX,IAAU,EAAO,WAAW,GAAO,CAAG,KAAK;EACjD,IAAI,GAAS;GACT,GAAW,OAAa;IAAE,GAAG;KAAU,IAAK;GAAQ,EAAE;GACtD;EACJ;EASA,AAPA,GAAW,MAAY;GACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;GAE1B,OADA,OAAO,EAAK,IACL;EACX,CAAC,GACD,GAAc,OAAa;GAAE,GAAG;IAAU,IAAK;EAAM,EAAE,GACvD,EAAS,GAAI,CAAI,GACjB,GAAa,GAAI,GAAQ;GACrB;GACA,KAAK,EAAO;GACZ;GACA;GACA,UAAU,EAAc,CAAS;EACrC,CAAC;CACL,GACA;EAAC;EAAW;EAAU;EAAS;CAAa,CAChD,GAEM,KAAe,QAEb,EAAQ,KAAK,MAAW;EAEpB,IAAM,IADW,GAAM,QAAQ,EAAO,MACR,GAAM,cAAc,QAAQ,OAAO,OAAQ,IACnE,IAAS,EAAO,WAClB,mBAAC,UAAD;GACI,MAAK;GACL,WAAW,EAAO;GAClB,eAAe,GAAW,EAAO,GAAG;GACpC,cAAY,eAAe,EAAW,CAAM;GAJhD,UAAA,CAMK,EAAO,QACR,kBAAC,QAAD;IAAM,WAAW,EAAO;IAAe,eAAA;IAClC,UAAA;GACC,CAAA,CACF;EAER,CAAA,IAAA,EAAO,QAGL,KAAa,MACX,EAAO,SAAe,EAAO,OAAO,CAAG,IACnC,EAAI,EAAO,QAAsB,MAWvC,KAAe,GAAQ,MAA8B;GACvD,IAAM,IAAU;IAAE,GAAG;KAAM,EAAO,MAAM;GAAM;GAE9C,OADI,EAAO,SAAe,EAAO,OAAO,CAAO,IACvC,EAAQ,EAAO,QAAsB;EACjD,GAEM,IAAW,KAAkB,EAAO,aAAa;EAEvD,OAAO;GACH,KAAK,OAAO,EAAO,GAAG;GACtB;GACA,OAAO,EAAO;GACd,UAAU,EAAO;GACjB,OAAO,EAAO;GACd,QAAQ,KACD,GAAQ,MAAkB;IACvB,IAAM,IAAK,GAAO,EAAO,GAAK,EAAc,CAAK,CAAC,GAAG,EAAO,GAAG,GACzD,IAAQ,EAAU,GAAK,GAAQ,CAAE,GACjC,IAAO,EAAO,aACd,EAAO,WAAW,CAAG,IACrB,OAAO,KAAS,EAAE;IACxB,OACI,kBAAC,GAAD;KACU;KACN,aAAa,EAAW,CAAM;KAC9B,WAAW,IAAQ;KACnB,WAAW,EAAO,cAAc;KAChC,SAAS,MAAY;KACrB,SAAS,MAAY;KACrB,QAAQ,EAAO,OAAQ;KACvB,OAAO,EAAO,MAAO;KACrB,SAAS,sBAAsB,EAAG,QAAQ,WAAW,GAAG;KAChD;KACR,cAAc;MAEV,AADA,EAAW,CAAE,GACb,EAAW,IAAI;KACnB;KACA,WAAW,GAAK,MACZ,GAAO,GAAK,GAAQ,GAAI,GAAO,GAAK,CAAI;KAE5C,gBAAgB;MAGZ,AAFA,EAAW,IAAI,GACf,EAAW,CAAE,GACb,GAAW,MAAY;OACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;OAE1B,OADA,OAAO,EAAK,IACL;MACX,CAAC;KACL;KAEC,UAAA,EAAY,GAAK,CAAK;IACb,CAAA;GAEtB,IACA;EACV;CACJ,CAAC,GAEL;EACI;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACJ,CACJ,GAEM,IAAe,KAAW,EAAS,WAAW;CAEpD,OACI,mBAAC,OAAD;EAAK,WAAW,EAAG,EAAO,SAAS,EAAS;EAAG,GAAI;EAAnD,UAAA;GACK,KACG,kBAAC,GAAD;IACI,OAAO;IACP,WAAW,MAAU;KAGjB,AAFA,GAAU,CAAK,GACf,EAAQ,CAAC,GACT,KAAiB,CAAK;IAC1B;IACA,kBAAkB,EAAO;GAC5B,CAAA;GAEL,kBAAC,OAAD;IACI,WAAW,EAAG,KAAW,CAAC,KAAgB,EAAO,OAAO;IACxD,aAAW,KAAW,KAAA;IACtB,eAAY;IAEX,UAAA,IACG,kBAAC,IAAD;KAAa,SAAS,GAAa;KAAQ,MAAM,KAAK,IAAI,GAAU,CAAC;IAAI,CAAA,IAEzE,kBAAC,GAAD;KACI,SAAS;KACT,MAAM;KACN,SAAS,GAAK,MAAU,EAAO,GAAK,EAAc,CAAK,CAAC;KAC1C;IACjB,CAAA;GAEJ,CAAA;GACJ,IAAa,KACV,kBAAC,GAAD;IACI,MAAM;IACM;IACZ,cAAc;IACd,YAAY;GACf,CAAA;EAEJ;;AAEb"}
+{"version":3,"file":"DataTable.js","names":[],"sources":["../../../src/components/DataTable/DataTable.tsx"],"sourcesContent":["/**\n * @tempest-limits file-lines, props-count, function-lines — the table does four jobs\n * a caller turns on independently — paging (pageSize), search (searchable,\n * searchKeys), sort (initialSort) and inline edit (onCellChange, editLabels) — over\n * one row model (data, columns, rowKey, emptyMessage). The body is long because\n * those four share the derived-rows pipeline: filter, then sort, then page, then map\n * to cells, in that order and off the same memo.\n *\n * Each of the four also runs in a second mode, where the caller owns the work and\n * the table only reports intent: totalItems/page/onPageChange, onSearchChange,\n * manualSort/onSortChange, loading/loadingRows. That doubles the props without\n * adding a fifth job — every manual prop short-circuits one stage of the same\n * pipeline.\n */\nimport { useCallback, useEffect, useMemo, useState } from \"react\";\nimport type { HTMLAttributes, ReactNode } from \"react\";\nimport { cn } from \"@/utils/cn\";\nimport { compareValues } from \"@/utils/compare-values\";\nimport { usePagination } from \"@/hooks\";\nimport { useAnnounce } from \"@/hooks/use-announce\";\nimport { Table, type TableAlign, type TableColumn, type TablePriority } from \"../Table\";\nimport { Pagination } from \"../Pagination\";\nimport { SearchBar } from \"../SearchBar\";\nimport { EditableCell } from \"./EditableCell\";\nimport { LoadingRows } from \"./LoadingRows\";\nimport { useDevWarnings } from \"./use-dev-warnings\";\nimport { DEFAULT_EDIT_LABELS, type CellCommitMove, type DataTableEditLabels } from \"./edit-labels\";\nimport styles from \"./DataTable.module.css\";\n\nexport type SortDirection = \"asc\" | \"desc\";\n\nexport interface DataTableSort<T> {\n    key: keyof T;\n    direction: SortDirection;\n}\n\n/** Input types an editable column can use. */\nexport type DataTableEditorType = \"text\" | \"number\" | \"date\" | \"email\" | \"tel\" | \"url\";\n\n/** One accepted cell edit, handed to `onCellChange`. */\nexport interface DataTableCellChange<T> {\n    /** The row as it was before the edit. */\n    row: T;\n    /** Which column changed. */\n    key: keyof T;\n    /** The parsed new value. */\n    value: unknown;\n    /** The value that was displayed before the edit. */\n    previous: unknown;\n    /** Index of the row in the full `data` array. */\n    rowIndex: number;\n}\n\n/**\n * Column definition for {@link DataTable}. Extends the headless {@link Table}\n * column shape with a typed `key`, opt-in sorting, opt-in inline editing, and the\n * visual options that are forwarded to the underlying Table cell.\n */\nexport interface DataTableColumn<T> {\n    /** Property of the row this column reads from. Doubles as the cell key. */\n    key: keyof T;\n    /** Column heading. */\n    header: ReactNode;\n    /** Custom cell renderer. Defaults to `String(row[key])`. */\n    render?: (row: T) => ReactNode;\n    /** Enable click-to-sort on this column's header. */\n    sortable?: boolean;\n    /** Text alignment forwarded to the Table cell. */\n    align?: TableAlign;\n    /** Responsive visibility priority forwarded to the Table cell. */\n    priority?: TablePriority;\n    /** Fixed column width forwarded to the Table cell. */\n    width?: string | number;\n    /**\n     * Let cells in this column be edited in place. Requires `onCellChange` on the\n     * table; without it the column stays read-only.\n     */\n    editable?: boolean;\n    /** Editor input type. Default `\"text\"`. */\n    editorType?: DataTableEditorType;\n    /** Text the editor opens with. Defaults to `String(value ?? \"\")`. */\n    formatEdit?: (row: T) => string;\n    /**\n     * Turn the typed string into the stored value. Defaults to the trimmed string,\n     * or `Number(raw)` when `editorType` is `\"number\"`.\n     */\n    parse?: (raw: string, row: T) => unknown;\n    /** Return a message to reject the edit, or `null` to accept it. */\n    validate?: (value: unknown, row: T) => string | null;\n}\n\n/** Everything a table needs regardless of who owns paging, sorting and searching. */\nexport interface DataTableBaseProps<T> extends HTMLAttributes<HTMLDivElement> {\n    /**\n     * The rows to work with.\n     *\n     * By default this is the **full** dataset and sorting, searching and paging\n     * all happen in memory. Pass `totalItems` and it becomes the current page as\n     * the server returned it, with those three delegated to the caller.\n     */\n    data: T[];\n    /** Column definitions. */\n    columns: DataTableColumn<T>[];\n    /** Rows per page. Default 10. */\n    pageSize?: number;\n    /** Render a search input above the table. Default false. */\n    searchable?: boolean;\n    /**\n     * Keys to match the search term against. When omitted, every column whose\n     * value is a string or number is searched.\n     */\n    searchKeys?: (keyof T)[];\n    /** Initial sort applied before any header interaction. */\n    initialSort?: DataTableSort<T>;\n    /** Stable key extractor for rows. Defaults to the row index. */\n    rowKey?: (row: T, index: number) => string | number;\n    /** Content shown when no rows match. */\n    emptyMessage?: ReactNode;\n    /**\n     * Persist an accepted cell edit. Return a promise: while it is pending the cell\n     * already shows the new value, and a rejection rolls that back and surfaces the\n     * error in the cell. Without this prop no column is editable.\n     */\n    onCellChange?: (change: DataTableCellChange<T>) => void | Promise<void>;\n    /** Override the PT-BR copy of the editing affordances. */\n    editLabels?: Partial<DataTableEditLabels>;\n    /**\n     * Searching is the caller's job: typing reports through `onSearchChange` and\n     * the rows are left as they arrived.\n     *\n     * Implied by `totalItems`. Filtering the current page would hide the rows\n     * that do not match *on this page* and show nothing for a term that only\n     * matches on page three — an empty table that looks like \"no results\".\n     */\n    manualSearch?: boolean;\n    /** Called with the current search term (debouncing, if any, is the caller's). */\n    onSearchChange?: (term: string) => void;\n    /**\n     * A fetch is in flight.\n     *\n     * With rows already on screen they stay put, dimmed and `aria-busy`, so the\n     * page does not jump under the cursor between pages. With no rows yet it\n     * renders placeholder lines at full height, which is a different statement\n     * from `emptyMessage`: \"loading\" and \"there is nothing\" are not the same\n     * screen.\n     */\n    loading?: boolean;\n}\n\n/**\n * Paging, as one of the three shapes that actually work.\n *\n * These used to be three optional props, so the compiler accepted\n * `totalItems` with no `page` — a table whose pager moves an internal page while\n * `data` keeps showing page one. Every prop was optional on its own, so the only\n * place left to catch it was a `console.warn` in dev, in the browser, with the\n * component mounted. As a union the same mistake is a build error at the call\n * site, for free, everywhere.\n */\nexport type DataTablePagingProps =\n    | {\n          /** Not server mode. */\n          totalItems?: never;\n          /** The table owns the page. */\n          page?: never;\n          /** Nothing to report to. */\n          onPageChange?: never;\n      }\n    | {\n          /**\n           * Total row count across every page — the `total` of a paginated envelope.\n           *\n           * Passing it switches the table to **server mode**: `data` is read as the\n           * current page, the page count comes from this number instead of\n           * `data.length`, and sorting and searching are delegated to the caller\n           * (see `manualSort` / `manualSearch`, which are implied here). Pair it with\n           * `page` and `onPageChange`.\n           */\n          totalItems?: never;\n          /** Current page, 1-based. Controlled — required in server mode. */\n          page: number;\n          /** Called with the next page. Required whenever `page` is controlled. */\n          onPageChange: (page: number) => void;\n      }\n    | {\n          /**\n           * Total row count across every page — the `total` of a paginated envelope.\n           *\n           * Passing it switches the table to **server mode**: `data` is read as the\n           * current page, the page count comes from this number instead of\n           * `data.length`, and sorting and searching are delegated to the caller\n           * (see `manualSort` / `manualSearch`, which are implied here). `page` and\n           * `onPageChange` come with it — the type says so, because a server-mode\n           * table without them silently shows page one forever.\n           */\n          totalItems: number;\n          /** Current page, 1-based. Controlled, and required in server mode. */\n          page: number;\n          /** Called with the next page. */\n          onPageChange: (page: number) => void;\n      };\n\n/**\n * Sorting: delegated, and therefore reported, or neither.\n *\n * `manualSort` without `onSortChange` renders a header that moves its arrow and\n * changes nothing else — the arrow is a lie the compiler can now catch.\n */\nexport type DataTableSortProps<T> =\n    | {\n          /** The table sorts the rows it has. */\n          manualSort?: false;\n          /** Called with the next sort state — `null` when the header cycles back to unsorted. */\n          onSortChange?: (sort: DataTableSort<T> | null) => void;\n      }\n    | {\n          /**\n           * Sorting is the caller's job: clicking a header reports through\n           * `onSortChange` and the rows are left in the order they arrived.\n           *\n           * Implied by `totalItems`, because sorting the page in memory would sort\n           * *that page only* while the header claims the whole table is ordered.\n           */\n          manualSort: true;\n          /** Where the click goes. Required, since nothing else acts on it. */\n          onSortChange: (sort: DataTableSort<T> | null) => void;\n      };\n\n/**\n * The table's props: the shared half, plus one valid paging shape and one valid\n * sorting shape.\n */\nexport type DataTableProps<T> = DataTableBaseProps<T> &\n    DataTablePagingProps &\n    DataTableSortProps<T>;\n\n/** Identity of one cell, stable across re-renders and pagination. */\nfunction cellId(rowKeyValue: string | number, columnKey: PropertyKey): string {\n    return `${String(rowKeyValue)}::${String(columnKey)}`;\n}\n\nfunction headerText<T>(column: DataTableColumn<T>): string {\n    return typeof column.header === \"string\" ? column.header : String(column.key);\n}\n\n/**\n * Stateful, headless data table built on top of {@link Table}. Adds\n * client-side searching, click-to-sort columns, pagination and opt-in inline\n * editing while delegating all table markup to the underlying Table component.\n *\n * - Clicking a sortable header cycles asc → desc → unsorted.\n * - Search matches a case-insensitive substring across `searchKeys`\n *   (or every string/number column when not provided).\n * - Pagination is hidden when the result fits on a single page.\n * - A column with `editable` renders a button that opens an inline editor;\n *   `Enter` commits, `Escape` discards, `Tab` walks to the next editable cell.\n *\n * Editing is strictly opt-in: with no `editable` column (or no `onCellChange`) the\n * rendered markup is byte-for-byte what it was before the feature existed, which\n * matters because the component is published.\n *\n * ## Optimistic, with a visible rollback\n *\n * An accepted edit is shown immediately and `onCellChange` runs in the background.\n * If it rejects, the cell returns to the old value **and** shows the reason as a\n * `role=\"alert\"` tied to the cell. A silent revert is worse than no optimistic\n * update at all: the user watched their edit appear and has no reason to doubt it.\n *\n * The header memo depends on `columns`, `sort` and the editing state only:\n * `toggleSort` and the commit callbacks are recreated each render but always close\n * over the same setters, so including them would rebuild every header on every\n * render without changing behaviour. That is why `exhaustive-deps` is silenced on\n * that dependency array.\n */\nexport function DataTable<T>({\n    data,\n    columns,\n    pageSize = 10,\n    searchable = false,\n    searchKeys,\n    initialSort,\n    rowKey = (_row, index) => index,\n    emptyMessage,\n    onCellChange,\n    editLabels,\n    totalItems,\n    page: controlledPage,\n    onPageChange,\n    manualSort,\n    onSortChange,\n    manualSearch,\n    onSearchChange,\n    loading = false,\n    className,\n    ...rest\n}: DataTableProps<T>) {\n    const [search, setSearch] = useState<string>(\"\");\n    const [sort, setSort] = useState<DataTableSort<T> | null>(initialSort ?? null);\n    const { page: internalPage, setPage: setInternalPage } = usePagination(1, pageSize);\n    const announce = useAnnounce();\n\n    const serverMode = totalItems !== undefined;\n    const sortIsManual = manualSort ?? serverMode;\n    const searchIsManual = manualSearch ?? serverMode;\n    const page = controlledPage ?? internalPage;\n\n    const setPage = useCallback(\n        (next: number) => {\n            if (controlledPage === undefined) setInternalPage(next);\n            onPageChange?.(next);\n        },\n        [controlledPage, setInternalPage, onPageChange],\n    );\n\n    useDevWarnings({ serverMode, controlledPage, onPageChange, sortIsManual, onSortChange });\n\n    const [editing, setEditing] = useState<string | null>(null);\n    const [refocus, setRefocus] = useState<string | null>(null);\n    const [overrides, setOverrides] = useState<Record<string, unknown>>({});\n    const [errors, setErrors] = useState<Record<string, string>>({});\n    const [saving, setSaving] = useState<Record<string, boolean>>({});\n\n    const labels = useMemo<DataTableEditLabels>(\n        () => ({ ...DEFAULT_EDIT_LABELS, ...editLabels }),\n        [editLabels],\n    );\n    const editingEnabled = onCellChange !== undefined && columns.some((column) => column.editable);\n\n    const effectiveSearchKeys = useMemo<(keyof T)[]>(() => {\n        if (!searchable || searchIsManual) return [];\n        if (searchKeys && searchKeys.length > 0) return searchKeys;\n        return columns\n            .filter((column) => {\n                const sample = data.find((row) => row[column.key] != null);\n                const value = sample ? sample[column.key] : undefined;\n                return typeof value === \"string\" || typeof value === \"number\";\n            })\n            .map((column) => column.key);\n    }, [searchable, searchIsManual, searchKeys, columns, data]);\n\n    const filtered = useMemo<T[]>(() => {\n        const term = search.trim().toLowerCase();\n        if (!term || !searchable || searchIsManual) return data;\n        return data.filter((row) =>\n            effectiveSearchKeys.some((key) => {\n                const value = row[key];\n                return value != null && String(value).toLowerCase().includes(term);\n            }),\n        );\n    }, [data, search, searchable, searchIsManual, effectiveSearchKeys]);\n\n    const sorted = useMemo<T[]>(() => {\n        if (!sort || sortIsManual) return filtered;\n        const factor = sort.direction === \"asc\" ? 1 : -1;\n        return [...filtered].sort((a, b) => compareValues(a[sort.key], b[sort.key]) * factor);\n    }, [filtered, sort, sortIsManual]);\n\n    const rowCount = totalItems ?? sorted.length;\n    const totalPages = Math.max(1, Math.ceil(rowCount / pageSize));\n\n    /**\n     * Clamp the current page when the dataset shrinks (e.g. after filtering).\n     *\n     * Skipped in server mode: `page` belongs to the caller there, and a clamp\n     * fired against a `totalItems` that has not caught up with the new filter\n     * yet would send them a page they did not ask for, mid-fetch.\n     */\n    useEffect(() => {\n        if (!serverMode && page > totalPages) setPage(totalPages);\n    }, [serverMode, page, totalPages, setPage]);\n\n    const safePage = serverMode ? page : Math.min(page, totalPages);\n    const pageRows = useMemo<T[]>(() => {\n        if (serverMode) return sorted;\n        const start = (safePage - 1) * pageSize;\n        return sorted.slice(start, start + pageSize);\n    }, [serverMode, sorted, safePage, pageSize]);\n\n    function toggleSort(key: keyof T): void {\n        const current = sort;\n        const next: DataTableSort<T> | null =\n            !current || current.key !== key\n                ? { key, direction: \"asc\" }\n                : current.direction === \"asc\"\n                  ? { key, direction: \"desc\" }\n                  : null;\n        setSort(next);\n        onSortChange?.(next);\n    }\n\n    const absoluteIndex = useCallback(\n        (pageIndex: number) => (safePage - 1) * pageSize + pageIndex,\n        [safePage, pageSize],\n    );\n\n    /**\n     * Every editable cell on the page, row-major — the order `Tab` walks.\n     *\n     * Row-major and not column-major because a row is the record a user is\n     * correcting; walking down a column would make them re-find their place on\n     * every keystroke.\n     */\n    const editableCellIds = useMemo<string[]>(() => {\n        if (!editingEnabled) return [];\n        const ids: string[] = [];\n        pageRows.forEach((row, index) => {\n            const key = rowKey(row, absoluteIndex(index));\n            for (const column of columns) {\n                if (column.editable) ids.push(cellId(key, column.key));\n            }\n        });\n        return ids;\n        // eslint-disable-next-line react-hooks/exhaustive-deps\n    }, [editingEnabled, pageRows, columns, absoluteIndex]);\n\n    const displayed = useCallback(\n        (row: T, column: DataTableColumn<T>, id: string): unknown =>\n            id in overrides ? overrides[id] : row[column.key],\n        [overrides],\n    );\n\n    /**\n     * Run the caller's `onCellChange` behind the optimistic update.\n     *\n     * Only the *success* is announced. The failure already renders as a\n     * `role=\"alert\"` inside the cell, which screen readers read on insertion —\n     * announcing it again from the shared region would read it twice and put the\n     * same text in the document twice.\n     */\n    const persist = useCallback(\n        async (id: string, column: DataTableColumn<T>, change: DataTableCellChange<T>) => {\n            setSaving((current) => ({ ...current, [id]: true }));\n            try {\n                await onCellChange?.(change);\n                announce(labels.saved(headerText(column)));\n            } catch (error) {\n                setOverrides((current) => {\n                    const next = { ...current };\n                    delete next[id];\n                    return next;\n                });\n                const message =\n                    error instanceof Error && error.message\n                        ? error.message\n                        : labels.saveFailed(headerText(column));\n                setErrors((current) => ({ ...current, [id]: message }));\n            } finally {\n                setSaving((current) => {\n                    const next = { ...current };\n                    delete next[id];\n                    return next;\n                });\n            }\n        },\n        [onCellChange, announce, labels],\n    );\n\n    const moveFrom = useCallback(\n        (id: string, move: CellCommitMove): void => {\n            if (move === \"none\") {\n                setEditing(null);\n                setRefocus(id);\n                return;\n            }\n            const index = editableCellIds.indexOf(id);\n            const target = editableCellIds[index + (move === \"next\" ? 1 : -1)];\n            if (target === undefined) {\n                setEditing(null);\n                setRefocus(id);\n                return;\n            }\n            setEditing(target);\n            setRefocus(null);\n        },\n        [editableCellIds],\n    );\n\n    /**\n     * Parse, validate, stage optimistically, then save in the background.\n     *\n     * Validation runs before anything is staged, and a rejection leaves the editor\n     * open with the message attached to the input — the user has to be able to fix\n     * what they typed without retyping it.\n     */\n    const commit = useCallback(\n        (\n            row: T,\n            column: DataTableColumn<T>,\n            id: string,\n            pageIndex: number,\n            raw: string,\n            move: CellCommitMove,\n        ): void => {\n            const previous = displayed(row, column, id);\n            const currentText = column.formatEdit ? column.formatEdit(row) : String(previous ?? \"\");\n            if (raw === currentText) {\n                moveFrom(id, move);\n                return;\n            }\n\n            const value = column.parse\n                ? column.parse(raw, row)\n                : column.editorType === \"number\"\n                  ? Number(raw)\n                  : raw.trim();\n\n            const invalid = column.validate?.(value, row) ?? null;\n            if (invalid) {\n                setErrors((current) => ({ ...current, [id]: invalid }));\n                return;\n            }\n\n            setErrors((current) => {\n                const next = { ...current };\n                delete next[id];\n                return next;\n            });\n            setOverrides((current) => ({ ...current, [id]: value }));\n            moveFrom(id, move);\n            void persist(id, column, {\n                row,\n                key: column.key,\n                value,\n                previous,\n                rowIndex: absoluteIndex(pageIndex),\n            });\n        },\n        [displayed, moveFrom, persist, absoluteIndex],\n    );\n\n    const tableColumns = useMemo<TableColumn<T>[]>(\n        () =>\n            columns.map((column) => {\n                const isSorted = sort?.key === column.key;\n                const indicator = isSorted ? (sort?.direction === \"asc\" ? \" ▲\" : \" ▼\") : \"\";\n                const header = column.sortable ? (\n                    <button\n                        type=\"button\"\n                        className={styles.sortButton}\n                        onClick={() => toggleSort(column.key)}\n                        aria-label={`Ordenar por ${headerText(column)}`}\n                    >\n                        {column.header}\n                        <span className={styles.sortIndicator} aria-hidden>\n                            {indicator}\n                        </span>\n                    </button>\n                ) : (\n                    column.header\n                );\n\n                const plainCell = (row: T): ReactNode => {\n                    if (column.render) return column.render(row);\n                    return (row[column.key] as ReactNode) ?? null;\n                };\n\n                /**\n                 * Render an editable cell's content against the optimistic value.\n                 *\n                 * The row is shallow-patched rather than the value passed alongside it,\n                 * because a column with a custom `render` (a `<Money>`, a badge) reads\n                 * the row — handing it the stale row would show the old number under a\n                 * cell the user just changed.\n                 */\n                const patchedCell = (row: T, value: unknown): ReactNode => {\n                    const patched = { ...row, [column.key]: value } as T;\n                    if (column.render) return column.render(patched);\n                    return (patched[column.key] as ReactNode) ?? null;\n                };\n\n                const editable = editingEnabled && column.editable === true;\n\n                return {\n                    key: String(column.key),\n                    header,\n                    align: column.align,\n                    priority: column.priority,\n                    width: column.width,\n                    render: editable\n                        ? (row: T, index: number) => {\n                              const id = cellId(rowKey(row, absoluteIndex(index)), column.key);\n                              const value = displayed(row, column, id);\n                              const text = column.formatEdit\n                                  ? column.formatEdit(row)\n                                  : String(value ?? \"\");\n                              return (\n                                  <EditableCell\n                                      text={text}\n                                      columnLabel={headerText(column)}\n                                      rowNumber={index + 1}\n                                      inputType={column.editorType ?? \"text\"}\n                                      editing={editing === id}\n                                      refocus={refocus === id}\n                                      saving={saving[id] === true}\n                                      error={errors[id] ?? null}\n                                      errorId={`tempest-cell-error-${id.replace(/[^\\w-]/g, \"_\")}`}\n                                      labels={labels}\n                                      onOpen={() => {\n                                          setEditing(id);\n                                          setRefocus(null);\n                                      }}\n                                      onCommit={(raw, move) =>\n                                          commit(row, column, id, index, raw, move)\n                                      }\n                                      onCancel={() => {\n                                          setEditing(null);\n                                          setRefocus(id);\n                                          setErrors((current) => {\n                                              const next = { ...current };\n                                              delete next[id];\n                                              return next;\n                                          });\n                                      }}\n                                  >\n                                      {patchedCell(row, value)}\n                                  </EditableCell>\n                              );\n                          }\n                        : plainCell,\n                };\n            }),\n        // eslint-disable-next-line react-hooks/exhaustive-deps\n        [\n            columns,\n            sort,\n            editingEnabled,\n            editing,\n            refocus,\n            saving,\n            errors,\n            labels,\n            overrides,\n            absoluteIndex,\n            commit,\n        ],\n    );\n\n    const showSkeleton = loading && pageRows.length === 0;\n\n    return (\n        <div className={cn(styles.wrapper, className)} {...rest}>\n            {searchable && (\n                <SearchBar\n                    value={search}\n                    onChange={(value) => {\n                        setSearch(value);\n                        setPage(1);\n                        onSearchChange?.(value);\n                    }}\n                    wrapperClassName={styles.search}\n                />\n            )}\n            <div\n                className={cn(loading && !showSkeleton && styles.pending)}\n                aria-busy={loading || undefined}\n                data-testid=\"tempest-datatable-body\"\n            >\n                {showSkeleton ? (\n                    <LoadingRows columns={tableColumns.length} rows={Math.min(pageSize, 8)} />\n                ) : (\n                    <Table\n                        columns={tableColumns}\n                        data={pageRows}\n                        rowKey={(row, index) => rowKey(row, absoluteIndex(index))}\n                        emptyMessage={emptyMessage}\n                    />\n                )}\n            </div>\n            {totalPages > 1 && (\n                <Pagination\n                    page={safePage}\n                    totalPages={totalPages}\n                    onPageChange={setPage}\n                    totalItems={rowCount}\n                />\n            )}\n        </div>\n    );\n}\n"],"mappings":";;;;;;;;;;;;;;;AA6OA,SAAS,GAAO,GAA8B,GAAgC;CAC1E,OAAO,GAAG,OAAO,CAAW,EAAE,IAAI,OAAO,CAAS;AACtD;AAEA,SAAS,EAAc,GAAoC;CACvD,OAAO,OAAO,EAAO,UAAW,WAAW,EAAO,SAAS,OAAO,EAAO,GAAG;AAChF;AA+BA,SAAgB,EAAa,EACzB,SACA,YACA,cAAW,IACX,gBAAa,IACb,eACA,iBACA,aAAU,GAAM,MAAU,GAC1B,kBACA,iBACA,gBACA,gBACA,MAAM,GACN,iBACA,gBACA,kBACA,kBACA,oBACA,aAAU,IACV,eACA,GAAG,MACe;CAClB,IAAM,CAAC,GAAQ,MAAa,EAAiB,EAAE,GACzC,CAAC,GAAM,MAAW,EAAkC,MAAe,IAAI,GACvE,EAAE,MAAM,IAAc,SAAS,MAAoB,EAAc,GAAG,CAAQ,GAC5E,IAAW,EAAY,GAEvB,IAAa,OAAe,KAAA,GAC5B,IAAe,MAAc,GAC7B,IAAiB,MAAgB,GACjC,IAAO,KAAkB,IAEzB,IAAU,GACX,MAAiB;EAEd,AADI,MAAmB,KAAA,KAAW,EAAgB,CAAI,GACtD,IAAe,CAAI;CACvB,GACA;EAAC;EAAgB;EAAiB;CAAY,CAClD;CAEA,GAAe;EAAE;EAAY;EAAgB;EAAc;EAAc;CAAa,CAAC;CAEvF,IAAM,CAAC,GAAS,KAAc,EAAwB,IAAI,GACpD,CAAC,GAAS,KAAc,EAAwB,IAAI,GACpD,CAAC,GAAW,KAAgB,EAAkC,CAAC,CAAC,GAChE,CAAC,GAAQ,KAAa,EAAiC,CAAC,CAAC,GACzD,CAAC,GAAQ,MAAa,EAAkC,CAAC,CAAC,GAE1D,IAAS,SACJ;EAAE,GAAG;EAAqB,GAAG;CAAW,IAC/C,CAAC,EAAU,CACf,GACM,IAAiB,MAAiB,KAAA,KAAa,EAAQ,MAAM,MAAW,EAAO,QAAQ,GAEvF,KAAsB,QACpB,CAAC,KAAc,IAAuB,CAAC,IACvC,KAAc,EAAW,SAAS,IAAU,IACzC,EACF,QAAQ,MAAW;EAChB,IAAM,IAAS,EAAK,MAAM,MAAQ,EAAI,EAAO,QAAQ,IAAI,GACnD,IAAQ,IAAS,EAAO,EAAO,OAAO,KAAA;EAC5C,OAAO,OAAO,KAAU,YAAY,OAAO,KAAU;CACzD,CAAC,CAAC,CACD,KAAK,MAAW,EAAO,GAAG,GAChC;EAAC;EAAY;EAAgB;EAAY;EAAS;CAAI,CAAC,GAEpD,IAAW,QAAmB;EAChC,IAAM,IAAO,EAAO,KAAK,CAAC,CAAC,YAAY;EAEvC,OADI,CAAC,KAAQ,CAAC,KAAc,IAAuB,IAC5C,EAAK,QAAQ,MAChB,GAAoB,MAAM,MAAQ;GAC9B,IAAM,IAAQ,EAAI;GAClB,OAAO,KAAS,QAAQ,OAAO,CAAK,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,CAAI;EACrE,CAAC,CACL;CACJ,GAAG;EAAC;EAAM;EAAQ;EAAY;EAAgB;CAAmB,CAAC,GAE5D,IAAS,QAAmB;EAC9B,IAAI,CAAC,KAAQ,GAAc,OAAO;EAClC,IAAM,IAAS,EAAK,cAAc,QAAQ,IAAI;EAC9C,OAAO,CAAC,GAAG,CAAQ,CAAC,CAAC,MAAM,GAAG,MAAM,EAAc,EAAE,EAAK,MAAM,EAAE,EAAK,IAAI,IAAI,CAAM;CACxF,GAAG;EAAC;EAAU;EAAM;CAAY,CAAC,GAE3B,KAAW,MAAc,EAAO,QAChC,IAAa,KAAK,IAAI,GAAG,KAAK,KAAK,KAAW,CAAQ,CAAC;CAS7D,SAAgB;EACZ,AAAI,CAAC,KAAc,IAAO,KAAY,EAAQ,CAAU;CAC5D,GAAG;EAAC;EAAY;EAAM;EAAY;CAAO,CAAC;CAE1C,IAAM,IAAW,IAAa,IAAO,KAAK,IAAI,GAAM,CAAU,GACxD,IAAW,QAAmB;EAChC,IAAI,GAAY,OAAO;EACvB,IAAM,KAAS,IAAW,KAAK;EAC/B,OAAO,EAAO,MAAM,GAAO,IAAQ,CAAQ;CAC/C,GAAG;EAAC;EAAY;EAAQ;EAAU;CAAQ,CAAC;CAE3C,SAAS,GAAW,GAAoB;EACpC,IAAM,IAAU,GACV,IACF,CAAC,KAAW,EAAQ,QAAQ,IACtB;GAAE;GAAK,WAAW;EAAM,IACxB,EAAQ,cAAc,QACpB;GAAE;GAAK,WAAW;EAAO,IACzB;EAEZ,AADA,GAAQ,CAAI,GACZ,KAAe,CAAI;CACvB;CAEA,IAAM,IAAgB,GACjB,OAAuB,IAAW,KAAK,IAAW,GACnD,CAAC,GAAU,CAAQ,CACvB,GASM,IAAkB,QAAwB;EAC5C,IAAI,CAAC,GAAgB,OAAO,CAAC;EAC7B,IAAM,IAAgB,CAAC;EAOvB,OANA,EAAS,SAAS,GAAK,MAAU;GAC7B,IAAM,IAAM,EAAO,GAAK,EAAc,CAAK,CAAC;GAC5C,KAAK,IAAM,KAAU,GACjB,AAAI,EAAO,YAAU,EAAI,KAAK,GAAO,GAAK,EAAO,GAAG,CAAC;EAE7D,CAAC,GACM;CAEX,GAAG;EAAC;EAAgB;EAAU;EAAS;CAAa,CAAC,GAE/C,IAAY,GACb,GAAQ,GAA4B,MACjC,KAAM,IAAY,EAAU,KAAM,EAAI,EAAO,MACjD,CAAC,CAAS,CACd,GAUM,KAAU,EACZ,OAAO,GAAY,GAA4B,MAAmC;EAC9E,IAAW,OAAa;GAAE,GAAG;IAAU,IAAK;EAAK,EAAE;EACnD,IAAI;GAEA,AADA,MAAM,IAAe,CAAM,GAC3B,EAAS,EAAO,MAAM,EAAW,CAAM,CAAC,CAAC;EAC7C,SAAS,GAAO;GACZ,GAAc,MAAY;IACtB,IAAM,IAAO,EAAE,GAAG,EAAQ;IAE1B,OADA,OAAO,EAAK,IACL;GACX,CAAC;GACD,IAAM,IACF,aAAiB,SAAS,EAAM,UAC1B,EAAM,UACN,EAAO,WAAW,EAAW,CAAM,CAAC;GAC9C,GAAW,OAAa;IAAE,GAAG;KAAU,IAAK;GAAQ,EAAE;EAC1D,UAAU;GACN,IAAW,MAAY;IACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;IAE1B,OADA,OAAO,EAAK,IACL;GACX,CAAC;EACL;CACJ,GACA;EAAC;EAAc;EAAU;CAAM,CACnC,GAEM,IAAW,GACZ,GAAY,MAA+B;EACxC,IAAI,MAAS,QAAQ;GAEjB,AADA,EAAW,IAAI,GACf,EAAW,CAAE;GACb;EACJ;EACA,IAAM,IAAQ,EAAgB,QAAQ,CAAE,GAClC,IAAS,EAAgB,KAAS,MAAS,SAAS,IAAI;EAC9D,IAAI,MAAW,KAAA,GAAW;GAEtB,AADA,EAAW,IAAI,GACf,EAAW,CAAE;GACb;EACJ;EAEA,AADA,EAAW,CAAM,GACjB,EAAW,IAAI;CACnB,GACA,CAAC,CAAe,CACpB,GASM,KAAS,GAEP,GACA,GACA,GACA,GACA,GACA,MACO;EACP,IAAM,IAAW,EAAU,GAAK,GAAQ,CAAE;EAE1C,IAAI,OADgB,EAAO,aAAa,EAAO,WAAW,CAAG,IAAI,OAAO,KAAY,EAAE,IAC7D;GACrB,EAAS,GAAI,CAAI;GACjB;EACJ;EAEA,IAAM,IAAQ,EAAO,QACf,EAAO,MAAM,GAAK,CAAG,IACrB,EAAO,eAAe,WACpB,OAAO,CAAG,IACV,EAAI,KAAK,GAEX,IAAU,EAAO,WAAW,GAAO,CAAG,KAAK;EACjD,IAAI,GAAS;GACT,GAAW,OAAa;IAAE,GAAG;KAAU,IAAK;GAAQ,EAAE;GACtD;EACJ;EASA,AAPA,GAAW,MAAY;GACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;GAE1B,OADA,OAAO,EAAK,IACL;EACX,CAAC,GACD,GAAc,OAAa;GAAE,GAAG;IAAU,IAAK;EAAM,EAAE,GACvD,EAAS,GAAI,CAAI,GACjB,GAAa,GAAI,GAAQ;GACrB;GACA,KAAK,EAAO;GACZ;GACA;GACA,UAAU,EAAc,CAAS;EACrC,CAAC;CACL,GACA;EAAC;EAAW;EAAU;EAAS;CAAa,CAChD,GAEM,KAAe,QAEb,EAAQ,KAAK,MAAW;EAEpB,IAAM,IADW,GAAM,QAAQ,EAAO,MACR,GAAM,cAAc,QAAQ,OAAO,OAAQ,IACnE,IAAS,EAAO,WAClB,kBAAC,UAAD;GACI,MAAK;GACL,WAAW,EAAO;GAClB,eAAe,GAAW,EAAO,GAAG;GACpC,cAAY,eAAe,EAAW,CAAM;GAJhD,UAAA,CAMK,EAAO,QACR,kBAAC,QAAD;IAAM,WAAW,EAAO;IAAe,eAAA;IAClC,UAAA;GACC,CAAA,CACF;EAER,CAAA,IAAA,EAAO,QAGL,KAAa,MACX,EAAO,SAAe,EAAO,OAAO,CAAG,IACnC,EAAI,EAAO,QAAsB,MAWvC,KAAe,GAAQ,MAA8B;GACvD,IAAM,IAAU;IAAE,GAAG;KAAM,EAAO,MAAM;GAAM;GAE9C,OADI,EAAO,SAAe,EAAO,OAAO,CAAO,IACvC,EAAQ,EAAO,QAAsB;EACjD,GAEM,IAAW,KAAkB,EAAO,aAAa;EAEvD,OAAO;GACH,KAAK,OAAO,EAAO,GAAG;GACtB;GACA,OAAO,EAAO;GACd,UAAU,EAAO;GACjB,OAAO,EAAO;GACd,QAAQ,KACD,GAAQ,MAAkB;IACvB,IAAM,IAAK,GAAO,EAAO,GAAK,EAAc,CAAK,CAAC,GAAG,EAAO,GAAG,GACzD,IAAQ,EAAU,GAAK,GAAQ,CAAE,GACjC,IAAO,EAAO,aACd,EAAO,WAAW,CAAG,IACrB,OAAO,KAAS,EAAE;IACxB,OACI,kBAAC,GAAD;KACU;KACN,aAAa,EAAW,CAAM;KAC9B,WAAW,IAAQ;KACnB,WAAW,EAAO,cAAc;KAChC,SAAS,MAAY;KACrB,SAAS,MAAY;KACrB,QAAQ,EAAO,OAAQ;KACvB,OAAO,EAAO,MAAO;KACrB,SAAS,sBAAsB,EAAG,QAAQ,WAAW,GAAG;KAChD;KACR,cAAc;MAEV,AADA,EAAW,CAAE,GACb,EAAW,IAAI;KACnB;KACA,WAAW,GAAK,MACZ,GAAO,GAAK,GAAQ,GAAI,GAAO,GAAK,CAAI;KAE5C,gBAAgB;MAGZ,AAFA,EAAW,IAAI,GACf,EAAW,CAAE,GACb,GAAW,MAAY;OACnB,IAAM,IAAO,EAAE,GAAG,EAAQ;OAE1B,OADA,OAAO,EAAK,IACL;MACX,CAAC;KACL;KAEC,UAAA,EAAY,GAAK,CAAK;IACb,CAAA;GAEtB,IACA;EACV;CACJ,CAAC,GAEL;EACI;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACJ,CACJ,GAEM,KAAe,KAAW,EAAS,WAAW;CAEpD,OACI,kBAAC,OAAD;EAAK,WAAW,EAAG,EAAO,SAAS,EAAS;EAAG,GAAI;EAAnD,UAAA;GACK,KACG,kBAAC,GAAD;IACI,OAAO;IACP,WAAW,MAAU;KAGjB,AAFA,GAAU,CAAK,GACf,EAAQ,CAAC,GACT,KAAiB,CAAK;IAC1B;IACA,kBAAkB,EAAO;GAC5B,CAAA;GAEL,kBAAC,OAAD;IACI,WAAW,EAAG,KAAW,CAAC,MAAgB,EAAO,OAAO;IACxD,aAAW,KAAW,KAAA;IACtB,eAAY;IAEX,UAAA,KACG,kBAAC,IAAD;KAAa,SAAS,GAAa;KAAQ,MAAM,KAAK,IAAI,GAAU,CAAC;IAAI,CAAA,IAEzE,kBAAC,GAAD;KACI,SAAS;KACT,MAAM;KACN,SAAS,GAAK,MAAU,EAAO,GAAK,EAAc,CAAK,CAAC;KAC1C;IACjB,CAAA;GAEJ,CAAA;GACJ,IAAa,KACV,kBAAC,GAAD;IACI,MAAM;IACM;IACZ,cAAc;IACd,YAAY;GACf,CAAA;EAEJ;;AAEb"}

package/dist/components/FilterBar/filter-apply.cjs

@@ -1,2 +1,2 @@
-const e=require("./filter-model.cjs");var t=/^\d{4}-\d{2}-\d{2}$/;function n(e,t){if(!(typeof e!=`object`||!e))return e[t]}function r(e){if(typeof e==`string`&&t.test(e))return e;let n=e instanceof Date?e:typeof e==`string`&&e.trim()!==``?new Date(e):null;if(n===null||Number.isNaN(n.getTime()))return null;let r=`${n.getMonth()+1}`.padStart(2,`0`),i=`${n.getDate()}`.padStart(2,`0`);return`${n.getFullYear()}-${r}-${i}`}function i(e,n){if(e==null)return null;if(typeof e==`number`){let t=Number(n);return Number.isNaN(t)?null:e-t}if(typeof e==`boolean`){let t=n===`true`||n!==`false`&&null;return t===null?null:Number(e)-Number(t)}if(t.test(n)){let t=r(e);return t===null?null:t.localeCompare(n)}return String(e).localeCompare(n,void 0,{numeric:!0})}function a(e,t){let n=i(e,t);return n===null?String(e??``)===t:n===0}function o(e){return e==null?!0:typeof e==`string`?e.trim()===``:Array.isArray(e)?e.length===0:!1}function s(e){return e.value===void 0?[]:Array.isArray(e.value)?[...e.value]:[String(e.value)]}function c(e,t,n){switch(e){case`empty`:return o(t);case`notEmpty`:return!o(t);case`eq`:return a(t,n[0]??``);case`ne`:return!a(t,n[0]??``);case`contains`:return String(t??``).toLowerCase().includes((n[0]??``).toLowerCase());case`in`:return n.some(e=>a(t,e));case`between`:{let[e=``,r=``]=n,a=i(t,e),o=i(t,r);return a===null||o===null?!1:a>=0&&o<=0}default:{let r=i(t,n[0]??``);return r===null?!1:e===`gt`?r>0:e===`gte`?r>=0:e===`lt`?r<0:r<=0}}}function l(e){let[n=``,r=``]=e;if(t.test(n)&&t.test(r))return n<=r?[n,r]:[r,n];let i=Number(n),a=Number(r);return!Number.isNaN(i)&&!Number.isNaN(a)?i<=a?[n,r]:[r,n]:n.localeCompare(r,void 0,{numeric:!0})<=0?[n,r]:[r,n]}function u(t,r){let i=r.filter(e.isComplete);return i.length===0?[...t]:t.filter(t=>i.every(r=>{let i=n(t,r.field);if(e.isValueless(r.operator))return c(r.operator,i,[]);let a=r.operator===`between`?l(s(r)):s(r);return c(r.operator,i,a)}))}exports.applyFilters=u,exports.orderRange=l;
+const e=require("./filter-model.cjs"),t=require("../../utils/format.cjs");var n=/^\d{4}-\d{2}-\d{2}$/,r=new Intl.Collator(void 0,{numeric:!0});function i(e,t){if(!(typeof e!=`object`||!e))return e[t]}function a(e){return e instanceof Date?t.formatDateForInput(e)||null:typeof e!=`string`||e.trim()===``?null:t.formatDateForInput(e)||null}function o(e,t){if(e==null)return null;if(typeof e==`number`){let n=Number(t);return Number.isNaN(n)?null:e-n}if(typeof e==`boolean`){let n=t===`true`||t!==`false`&&null;return n===null?null:Number(e)-Number(n)}if(n.test(t)){let n=a(e);return n===null?null:n.localeCompare(t)}return r.compare(String(e),t)}function s(e,t){if(e===t)return!0;let n=o(e,t);return n===null?String(e??``)===t:n===0}function c(e){return e==null?!0:typeof e==`string`?e.trim()===``:Array.isArray(e)?e.length===0:!1}function l(e){return e.value===void 0?[]:Array.isArray(e.value)?[...e.value]:[String(e.value)]}function u(e,t,n){switch(e){case`empty`:return c(t);case`notEmpty`:return!c(t);case`eq`:return s(t,n[0]??``);case`ne`:return!s(t,n[0]??``);case`contains`:return String(t??``).toLowerCase().includes((n[0]??``).toLowerCase());case`in`:return n.some(e=>s(t,e));case`between`:{let[e=``,r=``]=n,i=o(t,e),a=o(t,r);return i===null||a===null?!1:i>=0&&a<=0}default:{let r=o(t,n[0]??``);return r===null?!1:e===`gt`?r>0:e===`gte`?r>=0:e===`lt`?r<0:r<=0}}}function d(e){let[t=``,i=``]=e;if(n.test(t)&&n.test(i))return t<=i?[t,i]:[i,t];let a=Number(t),o=Number(i);return!Number.isNaN(a)&&!Number.isNaN(o)?a<=o?[t,i]:[i,t]:r.compare(t,i)<=0?[t,i]:[i,t]}function f(t,n){let r=n.filter(e.isComplete).map(e=>({field:e.field,operator:e.operator,values:e.operator===`between`?d(l(e)):l(e)}));return r.length===0?[...t]:t.filter(e=>r.every(({field:t,operator:n,values:r})=>u(n,i(e,t),r)))}exports.applyFilters=f,exports.orderRange=d;
 //# sourceMappingURL=filter-apply.cjs.map

package/dist/components/FilterBar/filter-apply.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"filter-apply.cjs","names":[],"sources":["../../../src/components/FilterBar/filter-apply.ts"],"sourcesContent":["// The other half of the filter model: evaluating a `Filter[]` instead of only\n// describing it. `FilterBar` produces filters, `applyFilters` runs them over an\n// in-memory list, and `filtersToQueryParams` (filter-query.ts) hands the same set\n// to a paginated backend. Without these two the model stops one step short of\n// useful and every app writes the eleven operator branches again.\n\nimport type { Filter, FilterOperator } from \"./filter-model\";\nimport { isComplete, isValueless } from \"./filter-model\";\n\n/** Matches a plain `yyyy-mm-dd`, the shape `<input type=\"date\">` produces. */\nconst DATE_ONLY = /^\\d{4}-\\d{2}-\\d{2}$/;\n\n/**\n * Read a property off a row without asserting the row's shape.\n *\n * `Filter.field` is a string chosen by the app's field list, so it cannot be a\n * `keyof T`; the lookup goes through an index signature and a missing property\n * yields `undefined`, which the operators treat as an empty value.\n *\n * @param item - The row being tested.\n * @param field - Property name from the filter.\n * @returns The property value, or `undefined` when the row has no such key.\n */\nfunction readField(item: unknown, field: string): unknown {\n    if (item == null || typeof item !== \"object\") return undefined;\n    return (item as Record<string, unknown>)[field];\n}\n\n/**\n * Local `yyyy-mm-dd` for a value that represents a date, or `null`.\n *\n * Built from the local calendar parts rather than `toISOString`, which converts\n * to UTC first and therefore reports the next day for anything after 21:00 in\n * UTC-3. A `yyyy-mm-dd` string is returned untouched, so a filter value and a\n * row value that already agree never round-trip through `Date` at all.\n *\n * @param value - A `Date`, a date-ish string, or anything else.\n * @returns The day key, or `null` when the value does not denote a date.\n */\nfunction dayKey(value: unknown): string | null {\n    if (typeof value === \"string\" && DATE_ONLY.test(value)) return value;\n\n    const date =\n        value instanceof Date\n            ? value\n            : typeof value === \"string\" && value.trim() !== \"\"\n              ? new Date(value)\n              : null;\n    if (date === null || Number.isNaN(date.getTime())) return null;\n\n    const month = `${date.getMonth() + 1}`.padStart(2, \"0\");\n    const day = `${date.getDate()}`.padStart(2, \"0\");\n    return `${date.getFullYear()}-${month}-${day}`;\n}\n\n/**\n * Compare a row value against a filter value, in the row value's own type.\n *\n * The filter always carries strings — it comes from form inputs and from the\n * URL — while the row carries whatever the API returned. Comparing them as text\n * gets the two common cases wrong: `10` would sort before `9`, and a date would\n * be compared by however it happens to be formatted. So the row value picks the\n * comparison, and the filter value is coerced into it.\n *\n * Dates compare by **day**, not by instant: a row stamped `2026-03-05T13:00:00Z`\n * is `>= 2026-03-05`, which is what the person picking a date in the UI means.\n *\n * @param left - The row value.\n * @param right - The raw filter value.\n * @returns Negative, zero or positive, or `null` when the two cannot be compared.\n */\nfunction compare(left: unknown, right: string): number | null {\n    if (left == null) return null;\n\n    if (typeof left === \"number\") {\n        const parsed = Number(right);\n        return Number.isNaN(parsed) ? null : left - parsed;\n    }\n\n    if (typeof left === \"boolean\") {\n        const parsed = right === \"true\" ? true : right === \"false\" ? false : null;\n        return parsed === null ? null : Number(left) - Number(parsed);\n    }\n\n    if (DATE_ONLY.test(right)) {\n        const key = dayKey(left);\n        return key === null ? null : key.localeCompare(right);\n    }\n\n    return String(left).localeCompare(right, undefined, { numeric: true });\n}\n\n/**\n * Equality in the row value's type, falling back to exact text.\n *\n * Case-sensitive on purpose: `eq` maps to a plain `WHERE column = value` on the\n * server side, so a case-insensitive client would quietly disagree with the\n * backend for the same filter. `contains` is the case-insensitive operator, and\n * it is also the default one for text fields, so the friendly behaviour is what\n * people get without asking.\n *\n * @param left - The row value.\n * @param right - The raw filter value.\n * @returns Whether the two are equal.\n */\nfunction equals(left: unknown, right: string): boolean {\n    const result = compare(left, right);\n    if (result !== null) return result === 0;\n    return String(left ?? \"\") === right;\n}\n\n/**\n * Is this row value empty?\n *\n * Empty means absent, blank text or an empty list — never falsy. `0` and `false`\n * are values somebody chose, and a filter that hid them would be reporting the\n * wrong count on every dashboard that tracks zeroes.\n *\n * @param value - The row value.\n * @returns Whether the value counts as empty.\n */\nfunction isEmptyValue(value: unknown): boolean {\n    if (value == null) return true;\n    if (typeof value === \"string\") return value.trim() === \"\";\n    if (Array.isArray(value)) return value.length === 0;\n    return false;\n}\n\n/**\n * The filter's value as a list, whatever arity the operator uses.\n *\n * @param filter - The filter to read.\n * @returns Its values, trimmed of nothing — a leading space may be meaningful text.\n */\nfunction valuesOf(filter: Filter): string[] {\n    if (filter.value === undefined) return [];\n    return Array.isArray(filter.value) ? [...filter.value] : [String(filter.value)];\n}\n\n/**\n * Evaluate one operator against one row value.\n *\n * @param operator - The comparison to make.\n * @param left - The row value.\n * @param values - The filter values (one, two for `between`, many for `in`).\n * @returns Whether the row value satisfies the operator.\n */\nfunction matchesOperator(operator: FilterOperator, left: unknown, values: string[]): boolean {\n    switch (operator) {\n        case \"empty\":\n            return isEmptyValue(left);\n        case \"notEmpty\":\n            return !isEmptyValue(left);\n        case \"eq\":\n            return equals(left, values[0] ?? \"\");\n        case \"ne\":\n            return !equals(left, values[0] ?? \"\");\n        case \"contains\":\n            return String(left ?? \"\")\n                .toLowerCase()\n                .includes((values[0] ?? \"\").toLowerCase());\n        case \"in\":\n            return values.some((value) => equals(left, value));\n        case \"between\": {\n            const [first = \"\", second = \"\"] = values;\n            const low = compare(left, first);\n            const high = compare(left, second);\n            if (low === null || high === null) return false;\n            return low >= 0 && high <= 0;\n        }\n        default: {\n            const result = compare(left, values[0] ?? \"\");\n            if (result === null) return false;\n            if (operator === \"gt\") return result > 0;\n            if (operator === \"gte\") return result >= 0;\n            if (operator === \"lt\") return result < 0;\n            return result <= 0;\n        }\n    }\n}\n\n/**\n * Order the two values of a `between` so the range is never empty by accident.\n *\n * A person who picks the later date first means the range between the two dates,\n * not \"no rows\". The server-side `BETWEEN` needs `(lo, hi)` in order too, which\n * is why the normalisation lives here and is shared by `filtersToQueryParams`.\n *\n * @param values - The raw pair.\n * @returns The pair, ascending.\n */\nexport function orderRange(values: readonly string[]): string[] {\n    const [first = \"\", second = \"\"] = values;\n    if (DATE_ONLY.test(first) && DATE_ONLY.test(second)) {\n        return first <= second ? [first, second] : [second, first];\n    }\n    const low = Number(first);\n    const high = Number(second);\n    if (!Number.isNaN(low) && !Number.isNaN(high)) {\n        return low <= high ? [first, second] : [second, first];\n    }\n    return first.localeCompare(second, undefined, { numeric: true }) <= 0\n        ? [first, second]\n        : [second, first];\n}\n\n/**\n * Run a filter set over an in-memory list.\n *\n * Closes the loop `FilterBar` opens: the bar produces `Filter[]`, this applies\n * them. Filters combine with `AND`, matching the flat model the bar builds, and\n * an incomplete filter is skipped rather than treated as a match of nothing — a\n * half-filled form should not empty the table underneath it.\n *\n * Comparison follows the row's type, not the filter's: numbers compare\n * numerically, dates compare by day, and everything else compares as text with\n * `numeric: true` so `\"item 2\"` lands before `\"item 10\"`.\n *\n * A few behaviours differ from the SQL the server-side twin produces, and the\n * difference is deliberate rather than accidental:\n *\n * - `ne` matches rows whose value is absent. In SQL, `column <> 'x'` is `NULL`\n *   for a `NULL` column and the row drops out. Here \"is not paid\" shows the rows\n *   with no status at all, which is what the chip claims.\n * - `empty` matches `NULL`, blank text and empty lists; `__isnull` on the server\n *   only matches `NULL`. A column that stores `\"\"` instead of `NULL` is where\n *   the two disagree.\n *\n * @example\n * const visible = applyFilters(orders, filters);\n *\n * @param items - The full list.\n * @param filters - Applied filters; incomplete ones are ignored.\n * @returns A new array with the rows that satisfy every complete filter.\n */\nexport function applyFilters<T>(items: readonly T[], filters: readonly Filter[]): T[] {\n    const active = filters.filter(isComplete);\n    if (active.length === 0) return [...items];\n\n    return items.filter((item) =>\n        active.every((filter) => {\n            const left = readField(item, filter.field);\n            if (isValueless(filter.operator)) {\n                return matchesOperator(filter.operator, left, []);\n            }\n            const values =\n                filter.operator === \"between\" ? orderRange(valuesOf(filter)) : valuesOf(filter);\n            return matchesOperator(filter.operator, left, values);\n        }),\n    );\n}\n"],"mappings":"sCAUA,IAAM,EAAY,sBAalB,SAAS,EAAU,EAAe,EAAwB,CAClD,KAAgB,OAAO,GAAS,WAAhC,GACJ,OAAQ,EAAiC,EAC7C,CAaA,SAAS,EAAO,EAA+B,CAC3C,GAAI,OAAO,GAAU,UAAY,EAAU,KAAK,CAAK,EAAG,OAAO,EAE/D,IAAM,EACF,aAAiB,KACX,EACA,OAAO,GAAU,UAAY,EAAM,KAAK,IAAM,GAC5C,IAAI,KAAK,CAAK,EACd,KACZ,GAAI,IAAS,MAAQ,OAAO,MAAM,EAAK,QAAQ,CAAC,EAAG,OAAO,KAE1D,IAAM,EAAQ,GAAG,EAAK,SAAS,EAAI,IAAI,SAAS,EAAG,GAAG,EAChD,EAAM,GAAG,EAAK,QAAQ,IAAI,SAAS,EAAG,GAAG,EAC/C,MAAO,GAAG,EAAK,YAAY,EAAE,GAAG,EAAM,GAAG,GAC7C,CAkBA,SAAS,EAAQ,EAAe,EAA8B,CAC1D,GAAI,GAAQ,KAAM,OAAO,KAEzB,GAAI,OAAO,GAAS,SAAU,CAC1B,IAAM,EAAS,OAAO,CAAK,EAC3B,OAAO,OAAO,MAAM,CAAM,EAAI,KAAO,EAAO,CAChD,CAEA,GAAI,OAAO,GAAS,UAAW,CAC3B,IAAM,EAAS,IAAU,QAAgB,IAAU,SAAkB,KACrE,OAAO,IAAW,KAAO,KAAO,OAAO,CAAI,EAAI,OAAO,CAAM,CAChE,CAEA,GAAI,EAAU,KAAK,CAAK,EAAG,CACvB,IAAM,EAAM,EAAO,CAAI,EACvB,OAAO,IAAQ,KAAO,KAAO,EAAI,cAAc,CAAK,CACxD,CAEA,OAAO,OAAO,CAAI,CAAC,CAAC,cAAc,EAAO,IAAA,GAAW,CAAE,QAAS,EAAK,CAAC,CACzE,CAeA,SAAS,EAAO,EAAe,EAAwB,CACnD,IAAM,EAAS,EAAQ,EAAM,CAAK,EAElC,OADI,IAAW,KACR,OAAO,GAAQ,EAAE,IAAM,EADF,IAAW,CAE3C,CAYA,SAAS,EAAa,EAAyB,CAI3C,OAHI,GAAS,KAAa,GACtB,OAAO,GAAU,SAAiB,EAAM,KAAK,IAAM,GACnD,MAAM,QAAQ,CAAK,EAAU,EAAM,SAAW,EAC3C,EACX,CAQA,SAAS,EAAS,EAA0B,CAExC,OADI,EAAO,QAAU,IAAA,GAAkB,CAAC,EACjC,MAAM,QAAQ,EAAO,KAAK,EAAI,CAAC,GAAG,EAAO,KAAK,EAAI,CAAC,OAAO,EAAO,KAAK,CAAC,CAClF,CAUA,SAAS,EAAgB,EAA0B,EAAe,EAA2B,CACzF,OAAQ,EAAR,CACI,IAAK,QACD,OAAO,EAAa,CAAI,EAC5B,IAAK,WACD,MAAO,CAAC,EAAa,CAAI,EAC7B,IAAK,KACD,OAAO,EAAO,EAAM,EAAO,IAAM,EAAE,EACvC,IAAK,KACD,MAAO,CAAC,EAAO,EAAM,EAAO,IAAM,EAAE,EACxC,IAAK,WACD,OAAO,OAAO,GAAQ,EAAE,CAAC,CACpB,YAAY,CAAC,CACb,UAAU,EAAO,IAAM,GAAA,CAAI,YAAY,CAAC,EACjD,IAAK,KACD,OAAO,EAAO,KAAM,GAAU,EAAO,EAAM,CAAK,CAAC,EACrD,IAAK,UAAW,CACZ,GAAM,CAAC,EAAQ,GAAI,EAAS,IAAM,EAC5B,EAAM,EAAQ,EAAM,CAAK,EACzB,EAAO,EAAQ,EAAM,CAAM,EAEjC,OADI,IAAQ,MAAQ,IAAS,KAAa,GACnC,GAAO,GAAK,GAAQ,CAC/B,CACA,QAAS,CACL,IAAM,EAAS,EAAQ,EAAM,EAAO,IAAM,EAAE,EAK5C,OAJI,IAAW,KAAa,GACxB,IAAa,KAAa,EAAS,EACnC,IAAa,MAAc,GAAU,EACrC,IAAa,KAAa,EAAS,EAChC,GAAU,CACrB,CACJ,CACJ,CAYA,SAAgB,EAAW,EAAqC,CAC5D,GAAM,CAAC,EAAQ,GAAI,EAAS,IAAM,EAClC,GAAI,EAAU,KAAK,CAAK,GAAK,EAAU,KAAK,CAAM,EAC9C,OAAO,GAAS,EAAS,CAAC,EAAO,CAAM,EAAI,CAAC,EAAQ,CAAK,EAE7D,IAAM,EAAM,OAAO,CAAK,EAClB,EAAO,OAAO,CAAM,EAI1B,MAHI,CAAC,OAAO,MAAM,CAAG,GAAK,CAAC,OAAO,MAAM,CAAI,EACjC,GAAO,EAAO,CAAC,EAAO,CAAM,EAAI,CAAC,EAAQ,CAAK,EAElD,EAAM,cAAc,EAAQ,IAAA,GAAW,CAAE,QAAS,EAAK,CAAC,GAAK,EAC9D,CAAC,EAAO,CAAM,EACd,CAAC,EAAQ,CAAK,CACxB,CA+BA,SAAgB,EAAgB,EAAqB,EAAiC,CAClF,IAAM,EAAS,EAAQ,OAAO,EAAA,UAAU,EAGxC,OAFI,EAAO,SAAW,EAAU,CAAC,GAAG,CAAK,EAElC,EAAM,OAAQ,GACjB,EAAO,MAAO,GAAW,CACrB,IAAM,EAAO,EAAU,EAAM,EAAO,KAAK,EACzC,GAAI,EAAA,YAAY,EAAO,QAAQ,EAC3B,OAAO,EAAgB,EAAO,SAAU,EAAM,CAAC,CAAC,EAEpD,IAAM,EACF,EAAO,WAAa,UAAY,EAAW,EAAS,CAAM,CAAC,EAAI,EAAS,CAAM,EAClF,OAAO,EAAgB,EAAO,SAAU,EAAM,CAAM,CACxD,CAAC,CACL,CACJ"}
+{"version":3,"file":"filter-apply.cjs","names":[],"sources":["../../../src/components/FilterBar/filter-apply.ts"],"sourcesContent":["// The other half of the filter model: evaluating a `Filter[]` instead of only\n// describing it. `FilterBar` produces filters, `applyFilters` runs them over an\n// in-memory list, and `filtersToQueryParams` (filter-query.ts) hands the same set\n// to a paginated backend. Without these two the model stops one step short of\n// useful and every app writes the eleven operator branches again.\n\nimport { formatDateForInput } from \"@/utils/format\";\nimport type { Filter, FilterOperator } from \"./filter-model\";\nimport { isComplete } from \"./filter-model\";\n\n/** Matches a plain `yyyy-mm-dd`, the shape `<input type=\"date\">` produces. */\nconst DATE_ONLY = /^\\d{4}-\\d{2}-\\d{2}$/;\n\n/**\n * One collator for every text comparison in this module.\n *\n * `localeCompare(value, undefined, { numeric: true })` builds a collator on each\n * call — passing an options bag opts out of the engine's cached-default fast\n * path — and this comparison runs once per row per filter. Measured at 200k\n * comparisons: 453 ms through `localeCompare` against 25 ms through a hoisted\n * collator, i.e. ~23 ms of main thread per keystroke on a 10k-row list.\n */\nconst TEXT_COLLATOR = new Intl.Collator(undefined, { numeric: true });\n\n/**\n * Read a property off a row without asserting the row's shape.\n *\n * `Filter.field` is a string chosen by the app's field list, so it cannot be a\n * `keyof T`; the lookup goes through an index signature and a missing property\n * yields `undefined`, which the operators treat as an empty value.\n *\n * @param item - The row being tested.\n * @param field - Property name from the filter.\n * @returns The property value, or `undefined` when the row has no such key.\n */\nfunction readField(item: unknown, field: string): unknown {\n    if (item == null || typeof item !== \"object\") return undefined;\n    return (item as Record<string, unknown>)[field];\n}\n\n/**\n * Local `yyyy-mm-dd` for a value that represents a date, or `null`.\n *\n * Delegates the formatting to {@link formatDateForInput}, which owns the rule\n * that the key is built from the local calendar parts rather than `toISOString`.\n * This adds only the narrowing from `unknown` and maps \"not a date\" to `null`\n * instead of to the empty string a date input wants.\n *\n * @param value - A `Date`, a date-ish string, or anything else.\n * @returns The day key, or `null` when the value does not denote a date.\n */\nfunction dayKey(value: unknown): string | null {\n    if (value instanceof Date) return formatDateForInput(value) || null;\n    if (typeof value !== \"string\" || value.trim() === \"\") return null;\n    return formatDateForInput(value) || null;\n}\n\n/**\n * Compare a row value against a filter value, in the row value's own type.\n *\n * The filter always carries strings — it comes from form inputs and from the\n * URL — while the row carries whatever the API returned. Comparing them as text\n * gets the two common cases wrong: `10` would sort before `9`, and a date would\n * be compared by however it happens to be formatted. So the row value picks the\n * comparison, and the filter value is coerced into it.\n *\n * Dates compare by **day**, not by instant: a row stamped `2026-03-05T13:00:00Z`\n * is `>= 2026-03-05`, which is what the person picking a date in the UI means.\n *\n * @param left - The row value.\n * @param right - The raw filter value.\n * @returns Negative, zero or positive, or `null` when the two cannot be compared.\n */\nfunction compare(left: unknown, right: string): number | null {\n    if (left == null) return null;\n\n    if (typeof left === \"number\") {\n        const parsed = Number(right);\n        return Number.isNaN(parsed) ? null : left - parsed;\n    }\n\n    if (typeof left === \"boolean\") {\n        const parsed = right === \"true\" ? true : right === \"false\" ? false : null;\n        return parsed === null ? null : Number(left) - Number(parsed);\n    }\n\n    if (DATE_ONLY.test(right)) {\n        const key = dayKey(left);\n        return key === null ? null : key.localeCompare(right);\n    }\n\n    return TEXT_COLLATOR.compare(String(left), right);\n}\n\n/**\n * Equality in the row value's type, falling back to exact text.\n *\n * Case-sensitive on purpose: `eq` maps to a plain `WHERE column = value` on the\n * server side, so a case-insensitive client would quietly disagree with the\n * backend for the same filter. `contains` is the case-insensitive operator, and\n * it is also the default one for text fields, so the friendly behaviour is what\n * people get without asking.\n *\n * Identical strings take a fast path out, since the row value is text in the\n * common case and the collator is the expensive part.\n *\n * @param left - The row value.\n * @param right - The raw filter value.\n * @returns Whether the two are equal.\n */\nfunction equals(left: unknown, right: string): boolean {\n    if (left === right) return true;\n    const result = compare(left, right);\n    if (result !== null) return result === 0;\n    return String(left ?? \"\") === right;\n}\n\n/**\n * Is this row value empty?\n *\n * Empty means absent, blank text or an empty list — never falsy. `0` and `false`\n * are values somebody chose, and a filter that hid them would be reporting the\n * wrong count on every dashboard that tracks zeroes.\n *\n * @param value - The row value.\n * @returns Whether the value counts as empty.\n */\nfunction isEmptyValue(value: unknown): boolean {\n    if (value == null) return true;\n    if (typeof value === \"string\") return value.trim() === \"\";\n    if (Array.isArray(value)) return value.length === 0;\n    return false;\n}\n\n/**\n * The filter's value as a list, whatever arity the operator uses.\n *\n * @param filter - The filter to read.\n * @returns Its values, trimmed of nothing — a leading space may be meaningful text.\n */\nfunction valuesOf(filter: Filter): string[] {\n    if (filter.value === undefined) return [];\n    return Array.isArray(filter.value) ? [...filter.value] : [String(filter.value)];\n}\n\n/**\n * Evaluate one operator against one row value.\n *\n * @param operator - The comparison to make.\n * @param left - The row value.\n * @param values - The filter values (one, two for `between`, many for `in`).\n * @returns Whether the row value satisfies the operator.\n */\nfunction matchesOperator(operator: FilterOperator, left: unknown, values: string[]): boolean {\n    switch (operator) {\n        case \"empty\":\n            return isEmptyValue(left);\n        case \"notEmpty\":\n            return !isEmptyValue(left);\n        case \"eq\":\n            return equals(left, values[0] ?? \"\");\n        case \"ne\":\n            return !equals(left, values[0] ?? \"\");\n        case \"contains\":\n            return String(left ?? \"\")\n                .toLowerCase()\n                .includes((values[0] ?? \"\").toLowerCase());\n        case \"in\":\n            return values.some((value) => equals(left, value));\n        case \"between\": {\n            const [first = \"\", second = \"\"] = values;\n            const low = compare(left, first);\n            const high = compare(left, second);\n            if (low === null || high === null) return false;\n            return low >= 0 && high <= 0;\n        }\n        default: {\n            const result = compare(left, values[0] ?? \"\");\n            if (result === null) return false;\n            if (operator === \"gt\") return result > 0;\n            if (operator === \"gte\") return result >= 0;\n            if (operator === \"lt\") return result < 0;\n            return result <= 0;\n        }\n    }\n}\n\n/**\n * Order the two values of a `between` so the range is never empty by accident.\n *\n * A person who picks the later date first means the range between the two dates,\n * not \"no rows\". The server-side `BETWEEN` needs `(lo, hi)` in order too, which\n * is why the normalisation lives here and is shared by `filtersToQueryParams`.\n *\n * @param values - The raw pair.\n * @returns The pair, ascending.\n */\nexport function orderRange(values: readonly string[]): string[] {\n    const [first = \"\", second = \"\"] = values;\n    if (DATE_ONLY.test(first) && DATE_ONLY.test(second)) {\n        return first <= second ? [first, second] : [second, first];\n    }\n    const low = Number(first);\n    const high = Number(second);\n    if (!Number.isNaN(low) && !Number.isNaN(high)) {\n        return low <= high ? [first, second] : [second, first];\n    }\n    return TEXT_COLLATOR.compare(first, second) <= 0 ? [first, second] : [second, first];\n}\n\n/**\n * Run a filter set over an in-memory list.\n *\n * Closes the loop `FilterBar` opens: the bar produces `Filter[]`, this applies\n * them. Filters combine with `AND`, matching the flat model the bar builds, and\n * an incomplete filter is skipped rather than treated as a match of nothing — a\n * half-filled form should not empty the table underneath it.\n *\n * Comparison follows the row's type, not the filter's: numbers compare\n * numerically, dates compare by day, and everything else compares as text with\n * `numeric: true` so `\"item 2\"` lands before `\"item 10\"`.\n *\n * A few behaviours differ from the SQL the server-side twin produces, and the\n * difference is deliberate rather than accidental:\n *\n * - `ne` matches rows whose value is absent. In SQL, `column <> 'x'` is `NULL`\n *   for a `NULL` column and the row drops out. Here \"is not paid\" shows the rows\n *   with no status at all, which is what the chip claims.\n * - `empty` matches `NULL`, blank text and empty lists; `__isnull` on the server\n *   only matches `NULL`. A column that stores `\"\"` instead of `NULL` is where\n *   the two disagree.\n *\n * @example\n * const visible = applyFilters(orders, filters);\n *\n * Each filter's values are normalised once, before the scan, rather than inside\n * the per-row predicate: the arity, the `between` ordering and the value array\n * depend only on the filter, so deriving them per row multiplied that work by\n * the row count. `empty`/`notEmpty` ignore their values entirely, which is why\n * the prepared shape does not need to distinguish them.\n *\n * @param items - The full list.\n * @param filters - Applied filters; incomplete ones are ignored.\n * @returns A new array with the rows that satisfy every complete filter.\n */\nexport function applyFilters<T>(items: readonly T[], filters: readonly Filter[]): T[] {\n    const active = filters.filter(isComplete).map((filter) => ({\n        field: filter.field,\n        operator: filter.operator,\n        values: filter.operator === \"between\" ? orderRange(valuesOf(filter)) : valuesOf(filter),\n    }));\n    if (active.length === 0) return [...items];\n\n    return items.filter((item) =>\n        active.every(({ field, operator, values }) =>\n            matchesOperator(operator, readField(item, field), values),\n        ),\n    );\n}\n"],"mappings":"0EAWA,IAAM,EAAY,sBAWZ,EAAgB,IAAI,KAAK,SAAS,IAAA,GAAW,CAAE,QAAS,EAAK,CAAC,EAapE,SAAS,EAAU,EAAe,EAAwB,CAClD,KAAgB,OAAO,GAAS,WAAhC,GACJ,OAAQ,EAAiC,EAC7C,CAaA,SAAS,EAAO,EAA+B,CAG3C,OAFI,aAAiB,KAAa,EAAA,mBAAmB,CAAK,GAAK,KAC3D,OAAO,GAAU,UAAY,EAAM,KAAK,IAAM,GAAW,KACtD,EAAA,mBAAmB,CAAK,GAAK,IACxC,CAkBA,SAAS,EAAQ,EAAe,EAA8B,CAC1D,GAAI,GAAQ,KAAM,OAAO,KAEzB,GAAI,OAAO,GAAS,SAAU,CAC1B,IAAM,EAAS,OAAO,CAAK,EAC3B,OAAO,OAAO,MAAM,CAAM,EAAI,KAAO,EAAO,CAChD,CAEA,GAAI,OAAO,GAAS,UAAW,CAC3B,IAAM,EAAS,IAAU,QAAgB,IAAU,SAAkB,KACrE,OAAO,IAAW,KAAO,KAAO,OAAO,CAAI,EAAI,OAAO,CAAM,CAChE,CAEA,GAAI,EAAU,KAAK,CAAK,EAAG,CACvB,IAAM,EAAM,EAAO,CAAI,EACvB,OAAO,IAAQ,KAAO,KAAO,EAAI,cAAc,CAAK,CACxD,CAEA,OAAO,EAAc,QAAQ,OAAO,CAAI,EAAG,CAAK,CACpD,CAkBA,SAAS,EAAO,EAAe,EAAwB,CACnD,GAAI,IAAS,EAAO,MAAO,GAC3B,IAAM,EAAS,EAAQ,EAAM,CAAK,EAElC,OADI,IAAW,KACR,OAAO,GAAQ,EAAE,IAAM,EADF,IAAW,CAE3C,CAYA,SAAS,EAAa,EAAyB,CAI3C,OAHI,GAAS,KAAa,GACtB,OAAO,GAAU,SAAiB,EAAM,KAAK,IAAM,GACnD,MAAM,QAAQ,CAAK,EAAU,EAAM,SAAW,EAC3C,EACX,CAQA,SAAS,EAAS,EAA0B,CAExC,OADI,EAAO,QAAU,IAAA,GAAkB,CAAC,EACjC,MAAM,QAAQ,EAAO,KAAK,EAAI,CAAC,GAAG,EAAO,KAAK,EAAI,CAAC,OAAO,EAAO,KAAK,CAAC,CAClF,CAUA,SAAS,EAAgB,EAA0B,EAAe,EAA2B,CACzF,OAAQ,EAAR,CACI,IAAK,QACD,OAAO,EAAa,CAAI,EAC5B,IAAK,WACD,MAAO,CAAC,EAAa,CAAI,EAC7B,IAAK,KACD,OAAO,EAAO,EAAM,EAAO,IAAM,EAAE,EACvC,IAAK,KACD,MAAO,CAAC,EAAO,EAAM,EAAO,IAAM,EAAE,EACxC,IAAK,WACD,OAAO,OAAO,GAAQ,EAAE,CAAC,CACpB,YAAY,CAAC,CACb,UAAU,EAAO,IAAM,GAAA,CAAI,YAAY,CAAC,EACjD,IAAK,KACD,OAAO,EAAO,KAAM,GAAU,EAAO,EAAM,CAAK,CAAC,EACrD,IAAK,UAAW,CACZ,GAAM,CAAC,EAAQ,GAAI,EAAS,IAAM,EAC5B,EAAM,EAAQ,EAAM,CAAK,EACzB,EAAO,EAAQ,EAAM,CAAM,EAEjC,OADI,IAAQ,MAAQ,IAAS,KAAa,GACnC,GAAO,GAAK,GAAQ,CAC/B,CACA,QAAS,CACL,IAAM,EAAS,EAAQ,EAAM,EAAO,IAAM,EAAE,EAK5C,OAJI,IAAW,KAAa,GACxB,IAAa,KAAa,EAAS,EACnC,IAAa,MAAc,GAAU,EACrC,IAAa,KAAa,EAAS,EAChC,GAAU,CACrB,CACJ,CACJ,CAYA,SAAgB,EAAW,EAAqC,CAC5D,GAAM,CAAC,EAAQ,GAAI,EAAS,IAAM,EAClC,GAAI,EAAU,KAAK,CAAK,GAAK,EAAU,KAAK,CAAM,EAC9C,OAAO,GAAS,EAAS,CAAC,EAAO,CAAM,EAAI,CAAC,EAAQ,CAAK,EAE7D,IAAM,EAAM,OAAO,CAAK,EAClB,EAAO,OAAO,CAAM,EAI1B,MAHI,CAAC,OAAO,MAAM,CAAG,GAAK,CAAC,OAAO,MAAM,CAAI,EACjC,GAAO,EAAO,CAAC,EAAO,CAAM,EAAI,CAAC,EAAQ,CAAK,EAElD,EAAc,QAAQ,EAAO,CAAM,GAAK,EAAI,CAAC,EAAO,CAAM,EAAI,CAAC,EAAQ,CAAK,CACvF,CAqCA,SAAgB,EAAgB,EAAqB,EAAiC,CAClF,IAAM,EAAS,EAAQ,OAAO,EAAA,UAAU,CAAC,CAAC,IAAK,IAAY,CACvD,MAAO,EAAO,MACd,SAAU,EAAO,SACjB,OAAQ,EAAO,WAAa,UAAY,EAAW,EAAS,CAAM,CAAC,EAAI,EAAS,CAAM,CAC1F,EAAE,EAGF,OAFI,EAAO,SAAW,EAAU,CAAC,GAAG,CAAK,EAElC,EAAM,OAAQ,GACjB,EAAO,OAAO,CAAE,QAAO,WAAU,YAC7B,EAAgB,EAAU,EAAU,EAAM,CAAK,EAAG,CAAM,CAC5D,CACJ,CACJ"}