argus-table 0.3.0 → 0.4.0

package/dist/core/src/columns/spread-width.js

@@ -0,0 +1,43 @@
+// ../core/src/columns/spread-width.ts
+/**
+* Spreads `total` px over columns in proportion to their widths, each within its
+* bounds: a column that hits a bound keeps it, and the rest is spread over the
+* others. Widths are whole px that add up to `total` (rounded) as far as the
+* bounds allow. Columns of no width share equally.
+*/
+function spreadWidth(columns, total) {
+	const exact = /* @__PURE__ */ new Map();
+	let open = [...columns];
+	let remaining = total;
+	while (open.length > 0) {
+		const sum = open.reduce((s, c) => s + Math.max(0, c.width), 0);
+		const share = (c) => sum > 0 ? Math.max(0, c.width) / sum * remaining : remaining / open.length;
+		const clamped = open.filter((c) => {
+			const w = share(c);
+			return w < c.minWidth || w > c.maxWidth;
+		});
+		if (clamped.length === 0) {
+			for (const c of open) exact.set(c.id, share(c));
+			break;
+		}
+		for (const c of clamped) {
+			const w = Math.min(c.maxWidth, Math.max(c.minWidth, share(c)));
+			exact.set(c.id, w);
+			remaining -= w;
+		}
+		open = open.filter((c) => !clamped.includes(c));
+	}
+	const widths = /* @__PURE__ */ new Map();
+	let acc = 0;
+	let rounded = 0;
+	for (const c of columns) {
+		acc += exact.get(c.id) ?? c.width;
+		const next = Math.round(acc);
+		widths.set(c.id, next - rounded);
+		rounded = next;
+	}
+	return widths;
+}
+export { spreadWidth };
+
+//# sourceMappingURL=spread-width.js.map

package/dist/core/src/columns/spread-width.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"spread-width.js","names":[],"sources":["../../../../../core/src/columns/spread-width.ts"],"sourcesContent":["/** A column taking part in a group resize: its width now, and its bounds. */\nexport interface SpreadColumn {\n  id: string;\n  width: number;\n  minWidth: number;\n  maxWidth: number;\n}\n\n/**\n * Spreads `total` px over columns in proportion to their widths, each within its\n * bounds: a column that hits a bound keeps it, and the rest is spread over the\n * others. Widths are whole px that add up to `total` (rounded) as far as the\n * bounds allow. Columns of no width share equally.\n */\nexport function spreadWidth(columns: readonly SpreadColumn[], total: number): Map<string, number> {\n  const exact = new Map<string, number>();\n  let open = [...columns];\n  let remaining = total;\n  while (open.length > 0) {\n    const sum = open.reduce((s, c) => s + Math.max(0, c.width), 0);\n    const share = (c: SpreadColumn) =>\n      sum > 0 ? (Math.max(0, c.width) / sum) * remaining : remaining / open.length;\n    const clamped = open.filter((c) => {\n      const w = share(c);\n      return w < c.minWidth || w > c.maxWidth;\n    });\n    if (clamped.length === 0) {\n      for (const c of open) exact.set(c.id, share(c));\n      break;\n    }\n    for (const c of clamped) {\n      const w = Math.min(c.maxWidth, Math.max(c.minWidth, share(c)));\n      exact.set(c.id, w);\n      remaining -= w;\n    }\n    open = open.filter((c) => !clamped.includes(c));\n  }\n  // Whole px: round the running sum, so the parts add up to the rounded total.\n  const widths = new Map<string, number>();\n  let acc = 0;\n  let rounded = 0;\n  for (const c of columns) {\n    acc += exact.get(c.id) ?? c.width;\n    const next = Math.round(acc);\n    widths.set(c.id, next - rounded);\n    rounded = next;\n  }\n  return widths;\n}\n"],"mappings":";;;;;;;AAcA,SAAgB,YAAY,SAAkC,OAAoC;CAChG,MAAM,wBAAQ,IAAI,IAAoB;CACtC,IAAI,OAAO,CAAC,GAAG,OAAO;CACtB,IAAI,YAAY;CAChB,OAAO,KAAK,SAAS,GAAG;EACtB,MAAM,MAAM,KAAK,QAAQ,GAAG,MAAM,IAAI,KAAK,IAAI,GAAG,EAAE,KAAK,GAAG,CAAC;EAC7D,MAAM,SAAS,MACb,MAAM,IAAK,KAAK,IAAI,GAAG,EAAE,KAAK,IAAI,MAAO,YAAY,YAAY,KAAK;EACxE,MAAM,UAAU,KAAK,QAAQ,MAAM;GACjC,MAAM,IAAI,MAAM,CAAC;GACjB,OAAO,IAAI,EAAE,YAAY,IAAI,EAAE;EACjC,CAAC;EACD,IAAI,QAAQ,WAAW,GAAG;GACxB,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI,EAAE,IAAI,MAAM,CAAC,CAAC;GAC9C;EACF;EACA,KAAK,MAAM,KAAK,SAAS;GACvB,MAAM,IAAI,KAAK,IAAI,EAAE,UAAU,KAAK,IAAI,EAAE,UAAU,MAAM,CAAC,CAAC,CAAC;GAC7D,MAAM,IAAI,EAAE,IAAI,CAAC;GACjB,aAAa;EACf;EACA,OAAO,KAAK,QAAQ,MAAM,CAAC,QAAQ,SAAS,CAAC,CAAC;CAChD;CAEA,MAAM,yBAAS,IAAI,IAAoB;CACvC,IAAI,MAAM;CACV,IAAI,UAAU;CACd,KAAK,MAAM,KAAK,SAAS;EACvB,OAAO,MAAM,IAAI,EAAE,EAAE,KAAK,EAAE;EAC5B,MAAM,OAAO,KAAK,MAAM,GAAG;EAC3B,OAAO,IAAI,EAAE,IAAI,OAAO,OAAO;EAC/B,UAAU;CACZ;CACA,OAAO;AACT"}

package/dist/core/src/filters/filter.js

@@ -87,11 +87,9 @@ function compileFilter(filter) {
 			if (filter.op === "notEmpty") return (v) => textOf(v) !== "";
 			const needle = (filter.value ?? "").toLowerCase();
 			if (!needle) return void 0;
-			const op = filter.op;
-			return (v) => {
-				const text = textOf(v).toLowerCase();
-				return op === "equals" ? text === needle : op === "startsWith" ? text.startsWith(needle) : text.includes(needle);
-			};
+			if (filter.op === "equals") return (v) => textOf(v).toLowerCase() === needle;
+			if (filter.op === "startsWith") return (v) => textOf(v).toLowerCase().startsWith(needle);
+			return (v) => textOf(v).toLowerCase().includes(needle);
 		}
 		case "number": {
 			const test = compare(filter.op, numberOf(filter.value), numberOf(filter.to));
@@ -118,13 +116,13 @@ function quickTerms(quickFilter) {
 *
 * Each value is read once per test through the column's `getValue`. A column with a
 * `filterFn` uses it in place of the built-in matching. Filters for unknown columns,
-* and `except` (for the values a column's own filter offers), are skipped.
+* and on the `except` columns (for the values a column's own filter offers), are skipped.
 */
 function rowPredicate(columns, filters, quickFilter, quickColumns, except) {
 	const tests = [];
 	for (const [id, filter] of Object.entries(filters ?? {})) {
 		const column = columns.get(id);
-		if (!column || id === except) continue;
+		if (!column || except?.has(id)) continue;
 		const { getValue, filterFn } = column;
 		if (filterFn) {
 			tests.push((row, index) => filterFn(getValue(row, index), filter, row));
@@ -180,6 +178,6 @@ function distinctValues(rows, column, keep, limit) {
 		truncated
 	};
 }
-export { compareSetValues, compileFilter, dayOf, distinctValues, isEmptyValue, quickTerms, rowPredicate, setValueOf, textOf };
+export { compareSetValues, compileFilter, dayOf, distinctValues, isEmptyValue, rowPredicate, setValueOf, textOf };
 
 //# sourceMappingURL=filter.js.map

package/dist/core/src/filters/filter.js.map

@@ -1 +1 @@
-{"version":3,"file":"filter.js","names":[],"sources":["../../../../../core/src/filters/filter.ts"],"sourcesContent":["import type { ColumnFilter, ColumnFilterState, FilterValue, RangeFilterOp } from '../types.js';\n\n// Filtering rules, free of TanStack and the DOM: each filter compiles once into a\n// test of one value, and the tests of a filter state combine into one test of a row.\n\n/** A column as filtering sees it. */\nexport interface FilterColumn<TData> {\n  id: string;\n  getValue: (row: TData, index: number) => unknown;\n  filterFn?: ((value: unknown, filter: ColumnFilter, row: TData) => boolean) | undefined;\n}\n\n/** Keeps a row (by its object and its index in `data`) or drops it. */\nexport type RowPredicate<TData> = (row: TData, index: number) => boolean;\n\n/** `true` for `undefined`, `null`, `''`, `NaN` and an invalid `Date`. */\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === '') return true;\n  if (typeof value === 'number') return Number.isNaN(value);\n  return value instanceof Date && Number.isNaN(value.getTime());\n}\n\nconst pad = (n: number, width = 2) => String(n).padStart(width, '0');\n\n/** A `Date` as its local day, `'2026-11-10'`. */\nfunction isoDay(date: Date): string {\n  return `${pad(date.getFullYear(), 4)}-${pad(date.getMonth() + 1)}-${pad(date.getDate())}`;\n}\n\n/**\n * A value as the text filters and the quick filter read it: strings as they are,\n * numbers and booleans as `String()` gives them, a `Date` as its local day\n * (`'2026-11-10'`), and anything else (empty values, objects) as `''`.\n */\nexport function textOf(value: unknown): string {\n  if (typeof value === 'string') return value;\n  if (typeof value === 'number') return Number.isNaN(value) ? '' : String(value);\n  if (typeof value === 'boolean') return String(value);\n  if (value instanceof Date) return Number.isNaN(value.getTime()) ? '' : isoDay(value);\n  return '';\n}\n\nconst DAY = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n\n/**\n * A value's local day as a sortable number (`20261110`), or `undefined`. Takes a `Date`,\n * a timestamp, an ISO date (`'2026-11-10'`, read as that day, not as UTC midnight) or\n * any other string `Date` can parse.\n */\nexport function dayOf(value: unknown): number | undefined {\n  let date: Date;\n  if (value instanceof Date) date = value;\n  else if (typeof value === 'number') date = new Date(value);\n  else if (typeof value === 'string') {\n    const day = DAY.exec(value.trim());\n    if (day) return Number(day[1]) * 10000 + Number(day[2]) * 100 + Number(day[3]);\n    if (!value.trim()) return undefined;\n    date = new Date(value);\n  } else return undefined;\n  const time = date.getTime();\n  if (Number.isNaN(time)) return undefined;\n  return date.getFullYear() * 10000 + (date.getMonth() + 1) * 100 + date.getDate();\n}\n\n/** A value as a number for the number filters: numbers, and strings that are numbers. */\nfunction numberOf(value: unknown): number | undefined {\n  if (typeof value === 'number') return Number.isNaN(value) ? undefined : value;\n  if (typeof value === 'string' && value.trim() !== '') {\n    const n = Number(value);\n    return Number.isNaN(n) ? undefined : n;\n  }\n  return undefined;\n}\n\n/**\n * The value a `'set'` filter lists and compares: strings, numbers and booleans stay,\n * a `Date` becomes its local day, and empty values (and objects) become `null`.\n */\nexport function setValueOf(value: unknown): FilterValue {\n  if (isEmptyValue(value)) return null;\n  if (typeof value === 'string' || typeof value === 'number' || typeof value === 'boolean') {\n    return value;\n  }\n  return value instanceof Date ? isoDay(value) : null;\n}\n\nfunction compare(\n  op: RangeFilterOp,\n  from: number | undefined,\n  to: number | undefined,\n): ((n: number | undefined) => boolean) | undefined {\n  if (op === 'empty') return (n) => n === undefined;\n  if (op === 'notEmpty') return (n) => n !== undefined;\n  if (op === 'between') {\n    if (from === undefined && to === undefined) return undefined;\n    return (n) =>\n      n !== undefined && (from === undefined || n >= from) && (to === undefined || n <= to);\n  }\n  if (from === undefined) return undefined;\n  switch (op) {\n    case 'eq':\n      return (n) => n === from;\n    case 'ne':\n      // Like a spreadsheet: an empty cell isn't equal to the number, so it stays.\n      return (n) => n !== from;\n    case 'lt':\n      return (n) => n !== undefined && n < from;\n    case 'le':\n      return (n) => n !== undefined && n <= from;\n    case 'gt':\n      return (n) => n !== undefined && n > from;\n    case 'ge':\n      return (n) => n !== undefined && n >= from;\n  }\n}\n\n/**\n * A test of one value for a filter, or `undefined` when the filter keeps every row\n * (no text to match, no bound to compare with). Text matching ignores case.\n */\nexport function compileFilter(filter: ColumnFilter): ((value: unknown) => boolean) | undefined {\n  switch (filter.kind) {\n    case 'text': {\n      if (filter.op === 'empty') return (v) => textOf(v) === '';\n      if (filter.op === 'notEmpty') return (v) => textOf(v) !== '';\n      const needle = (filter.value ?? '').toLowerCase();\n      if (!needle) return undefined;\n      const op = filter.op;\n      return (v) => {\n        const text = textOf(v).toLowerCase();\n        return op === 'equals'\n          ? text === needle\n          : op === 'startsWith'\n            ? text.startsWith(needle)\n            : text.includes(needle);\n      };\n    }\n    case 'number': {\n      const test = compare(filter.op, numberOf(filter.value), numberOf(filter.to));\n      return test && ((v) => test(numberOf(v)));\n    }\n    case 'date': {\n      const test = compare(filter.op, dayOf(filter.value), dayOf(filter.to));\n      return test && ((v) => test(dayOf(v)));\n    }\n    case 'set': {\n      const values = new Set(filter.values);\n      return (v) => values.has(setValueOf(v));\n    }\n  }\n}\n\n/** The words of a quick filter, lowercased; empty when it keeps every row. */\nexport function quickTerms(quickFilter: string | undefined): string[] {\n  return (quickFilter ?? '').toLowerCase().split(/\\s+/).filter(Boolean);\n}\n\n/**\n * One test of a row for the column filters and the quick filter, or `undefined` when\n * they keep every row. A row passes every column filter, and each word of the quick\n * filter is found in the text of one of `quickColumns` (ignoring case).\n *\n * Each value is read once per test through the column's `getValue`. A column with a\n * `filterFn` uses it in place of the built-in matching. Filters for unknown columns,\n * and `except` (for the values a column's own filter offers), are skipped.\n */\nexport function rowPredicate<TData>(\n  columns: ReadonlyMap<string, FilterColumn<TData>>,\n  filters: ColumnFilterState | undefined,\n  quickFilter: string | undefined,\n  quickColumns: readonly FilterColumn<TData>[],\n  except?: string,\n): RowPredicate<TData> | undefined {\n  const tests: RowPredicate<TData>[] = [];\n  for (const [id, filter] of Object.entries(filters ?? {})) {\n    const column = columns.get(id);\n    if (!column || id === except) continue;\n    const { getValue, filterFn } = column;\n    if (filterFn) {\n      tests.push((row, index) => filterFn(getValue(row, index), filter, row));\n      continue;\n    }\n    const test = compileFilter(filter);\n    if (test) tests.push((row, index) => test(getValue(row, index)));\n  }\n  const terms = quickTerms(quickFilter);\n  if (terms.length && quickColumns.length) {\n    const textAt = (c: FilterColumn<TData>, row: TData, index: number) =>\n      textOf(c.getValue(row, index)).toLowerCase();\n    const [term] = terms;\n    tests.push(\n      terms.length === 1 && term !== undefined\n        ? (row, index) => quickColumns.some((c) => textAt(c, row, index).includes(term))\n        : (row, index) => {\n            const texts = quickColumns.map((c) => textAt(c, row, index));\n            return terms.every((t) => texts.some((text) => text.includes(t)));\n          },\n    );\n  }\n  if (!tests.length) return undefined;\n  if (tests.length === 1) return tests[0];\n  return (row, index) => tests.every((test) => test(row, index));\n}\n\nconst kindOrder = (v: FilterValue) =>\n  v === null ? 3 : typeof v === 'boolean' ? 2 : typeof v === 'number' ? 0 : 1;\n\n/** Orders set values: numbers, then text (by locale, numbers inside text by value), then booleans, then empty. */\nexport function compareSetValues(a: FilterValue, b: FilterValue): number {\n  const kind = kindOrder(a) - kindOrder(b);\n  if (kind) return kind;\n  if (typeof a === 'number' && typeof b === 'number') return a - b;\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a.localeCompare(b, undefined, { numeric: true, sensitivity: 'base' });\n  }\n  return Number(a) - Number(b);\n}\n\n/**\n * The distinct values of `column` over the rows `keep` passes, as a `'set'` filter\n * lists them (see `setValueOf`), sorted. Stops after `limit` values (`truncated`).\n */\nexport function distinctValues<TData>(\n  rows: Iterable<{ original: TData; index: number }>,\n  column: FilterColumn<TData>,\n  keep: RowPredicate<TData> | undefined,\n  limit: number,\n): { values: FilterValue[]; truncated: boolean } {\n  const seen = new Set<FilterValue>();\n  let truncated = false;\n  for (const { original, index } of rows) {\n    if (keep && !keep(original, index)) continue;\n    const value = setValueOf(column.getValue(original, index));\n    if (seen.has(value)) continue;\n    if (seen.size === limit) {\n      truncated = true;\n      break;\n    }\n    seen.add(value);\n  }\n  return { values: [...seen].sort(compareSetValues), truncated };\n}\n"],"mappings":";;AAgBA,SAAgB,aAAa,OAAyB;CACpD,IAAI,UAAU,KAAA,KAAa,UAAU,QAAQ,UAAU,IAAI,OAAO;CAClE,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK;CACxD,OAAO,iBAAiB,QAAQ,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC9D;AAEA,IAAM,OAAO,GAAW,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,OAAO,GAAG;;AAGnE,SAAS,OAAO,MAAoB;CAClC,OAAO,GAAG,IAAI,KAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,EAAE,GAAG,IAAI,KAAK,QAAQ,CAAC;AACxF;;;;;;AAOA,SAAgB,OAAO,OAAwB;CAC7C,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK;CAC7E,IAAI,OAAO,UAAU,WAAW,OAAO,OAAO,KAAK;CACnD,IAAI,iBAAiB,MAAM,OAAO,OAAO,MAAM,MAAM,QAAQ,CAAC,IAAI,KAAK,OAAO,KAAK;CACnF,OAAO;AACT;AAEA,IAAM,MAAM;;;;;;AAOZ,SAAgB,MAAM,OAAoC;CACxD,IAAI;CACJ,IAAI,iBAAiB,MAAM,OAAO;MAC7B,IAAI,OAAO,UAAU,UAAU,OAAO,IAAI,KAAK,KAAK;MACpD,IAAI,OAAO,UAAU,UAAU;EAClC,MAAM,MAAM,IAAI,KAAK,MAAM,KAAK,CAAC;EACjC,IAAI,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI,MAAQ,OAAO,IAAI,EAAE,IAAI,MAAM,OAAO,IAAI,EAAE;EAC7E,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO,KAAA;EAC1B,OAAO,IAAI,KAAK,KAAK;CACvB,OAAO,OAAO,KAAA;CACd,MAAM,OAAO,KAAK,QAAQ;CAC1B,IAAI,OAAO,MAAM,IAAI,GAAG,OAAO,KAAA;CAC/B,OAAO,KAAK,YAAY,IAAI,OAAS,KAAK,SAAS,IAAI,KAAK,MAAM,KAAK,QAAQ;AACjF;;AAGA,SAAS,SAAS,OAAoC;CACpD,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK,IAAI,KAAA,IAAY;CACxE,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAAI;EACpD,MAAM,IAAI,OAAO,KAAK;EACtB,OAAO,OAAO,MAAM,CAAC,IAAI,KAAA,IAAY;CACvC;AAEF;;;;;AAMA,SAAgB,WAAW,OAA6B;CACtD,IAAI,aAAa,KAAK,GAAG,OAAO;CAChC,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAC7E,OAAO;CAET,OAAO,iBAAiB,OAAO,OAAO,KAAK,IAAI;AACjD;AAEA,SAAS,QACP,IACA,MACA,IACkD;CAClD,IAAI,OAAO,SAAS,QAAQ,MAAM,MAAM,KAAA;CACxC,IAAI,OAAO,YAAY,QAAQ,MAAM,MAAM,KAAA;CAC3C,IAAI,OAAO,WAAW;EACpB,IAAI,SAAS,KAAA,KAAa,OAAO,KAAA,GAAW,OAAO,KAAA;EACnD,QAAQ,MACN,MAAM,KAAA,MAAc,SAAS,KAAA,KAAa,KAAK,UAAU,OAAO,KAAA,KAAa,KAAK;CACtF;CACA,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,QAAQ,IAAR;EACE,KAAK,MACH,QAAQ,MAAM,MAAM;EACtB,KAAK,MAEH,QAAQ,MAAM,MAAM;EACtB,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,IAAI;EACvC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,KAAK;EACxC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,IAAI;EACvC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,KAAK;CAC1C;AACF;;;;;AAMA,SAAgB,cAAc,QAAiE;CAC7F,QAAQ,OAAO,MAAf;EACE,KAAK,QAAQ;GACX,IAAI,OAAO,OAAO,SAAS,QAAQ,MAAM,OAAO,CAAC,MAAM;GACvD,IAAI,OAAO,OAAO,YAAY,QAAQ,MAAM,OAAO,CAAC,MAAM;GAC1D,MAAM,UAAU,OAAO,SAAS,GAAA,CAAI,YAAY;GAChD,IAAI,CAAC,QAAQ,OAAO,KAAA;GACpB,MAAM,KAAK,OAAO;GAClB,QAAQ,MAAM;IACZ,MAAM,OAAO,OAAO,CAAC,CAAC,CAAC,YAAY;IACnC,OAAO,OAAO,WACV,SAAS,SACT,OAAO,eACL,KAAK,WAAW,MAAM,IACtB,KAAK,SAAS,MAAM;GAC5B;EACF;EACA,KAAK,UAAU;GACb,MAAM,OAAO,QAAQ,OAAO,IAAI,SAAS,OAAO,KAAK,GAAG,SAAS,OAAO,EAAE,CAAC;GAC3E,OAAO,UAAU,MAAM,KAAK,SAAS,CAAC,CAAC;EACzC;EACA,KAAK,QAAQ;GACX,MAAM,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,KAAK,GAAG,MAAM,OAAO,EAAE,CAAC;GACrE,OAAO,UAAU,MAAM,KAAK,MAAM,CAAC,CAAC;EACtC;EACA,KAAK,OAAO;GACV,MAAM,SAAS,IAAI,IAAI,OAAO,MAAM;GACpC,QAAQ,MAAM,OAAO,IAAI,WAAW,CAAC,CAAC;EACxC;CACF;AACF;;AAGA,SAAgB,WAAW,aAA2C;CACpE,QAAQ,eAAe,GAAA,CAAI,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;AACtE;;;;;;;;;;AAWA,SAAgB,aACd,SACA,SACA,aACA,cACA,QACiC;CACjC,MAAM,QAA+B,CAAC;CACtC,KAAK,MAAM,CAAC,IAAI,WAAW,OAAO,QAAQ,WAAW,CAAC,CAAC,GAAG;EACxD,MAAM,SAAS,QAAQ,IAAI,EAAE;EAC7B,IAAI,CAAC,UAAU,OAAO,QAAQ;EAC9B,MAAM,EAAE,UAAU,aAAa;EAC/B,IAAI,UAAU;GACZ,MAAM,MAAM,KAAK,UAAU,SAAS,SAAS,KAAK,KAAK,GAAG,QAAQ,GAAG,CAAC;GACtE;EACF;EACA,MAAM,OAAO,cAAc,MAAM;EACjC,IAAI,MAAM,MAAM,MAAM,KAAK,UAAU,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC;CACjE;CACA,MAAM,QAAQ,WAAW,WAAW;CACpC,IAAI,MAAM,UAAU,aAAa,QAAQ;EACvC,MAAM,UAAU,GAAwB,KAAY,UAClD,OAAO,EAAE,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,YAAY;EAC7C,MAAM,CAAC,QAAQ;EACf,MAAM,KACJ,MAAM,WAAW,KAAK,SAAS,KAAA,KAC1B,KAAK,UAAU,aAAa,MAAM,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,KAC5E,KAAK,UAAU;GACd,MAAM,QAAQ,aAAa,KAAK,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC;GAC3D,OAAO,MAAM,OAAO,MAAM,MAAM,MAAM,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC;EAClE,CACN;CACF;CACA,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAA;CAC1B,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;CACrC,QAAQ,KAAK,UAAU,MAAM,OAAO,SAAS,KAAK,KAAK,KAAK,CAAC;AAC/D;AAEA,IAAM,aAAa,MACjB,MAAM,OAAO,IAAI,OAAO,MAAM,YAAY,IAAI,OAAO,MAAM,WAAW,IAAI;;AAG5E,SAAgB,iBAAiB,GAAgB,GAAwB;CACvE,MAAM,OAAO,UAAU,CAAC,IAAI,UAAU,CAAC;CACvC,IAAI,MAAM,OAAO;CACjB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO,IAAI;CAC/D,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,EAAE,cAAc,GAAG,KAAA,GAAW;EAAE,SAAS;EAAM,aAAa;CAAO,CAAC;CAE7E,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAC7B;;;;;AAMA,SAAgB,eACd,MACA,QACA,MACA,OAC+C;CAC/C,MAAM,uBAAO,IAAI,IAAiB;CAClC,IAAI,YAAY;CAChB,KAAK,MAAM,EAAE,UAAU,WAAW,MAAM;EACtC,IAAI,QAAQ,CAAC,KAAK,UAAU,KAAK,GAAG;EACpC,MAAM,QAAQ,WAAW,OAAO,SAAS,UAAU,KAAK,CAAC;EACzD,IAAI,KAAK,IAAI,KAAK,GAAG;EACrB,IAAI,KAAK,SAAS,OAAO;GACvB,YAAY;GACZ;EACF;EACA,KAAK,IAAI,KAAK;CAChB;CACA,OAAO;EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,gBAAgB;EAAG;CAAU;AAC/D"}
+{"version":3,"file":"filter.js","names":[],"sources":["../../../../../core/src/filters/filter.ts"],"sourcesContent":["import type { ColumnFilter, ColumnFilterState, FilterValue, RangeFilterOp } from '../types.js';\n\n// Filtering rules, free of TanStack and the DOM: each filter compiles once into a\n// test of one value, and the tests of a filter state combine into one test of a row.\n\n/** A column as filtering sees it. */\nexport interface FilterColumn<TData> {\n  id: string;\n  getValue: (row: TData, index: number) => unknown;\n  filterFn?: ((value: unknown, filter: ColumnFilter, row: TData) => boolean) | undefined;\n}\n\n/** Keeps a row (by its object and its index in `data`) or drops it. */\nexport type RowPredicate<TData> = (row: TData, index: number) => boolean;\n\n/** `true` for `undefined`, `null`, `''`, `NaN` and an invalid `Date`. */\nexport function isEmptyValue(value: unknown): boolean {\n  if (value === undefined || value === null || value === '') return true;\n  if (typeof value === 'number') return Number.isNaN(value);\n  return value instanceof Date && Number.isNaN(value.getTime());\n}\n\nconst pad = (n: number, width = 2) => String(n).padStart(width, '0');\n\n/** A `Date` as its local day, `'2026-11-10'`. */\nfunction isoDay(date: Date): string {\n  return `${pad(date.getFullYear(), 4)}-${pad(date.getMonth() + 1)}-${pad(date.getDate())}`;\n}\n\n/**\n * A value as the text filters and the quick filter read it: strings as they are,\n * numbers and booleans as `String()` gives them, a `Date` as its local day\n * (`'2026-11-10'`), and anything else (empty values, objects) as `''`.\n */\nexport function textOf(value: unknown): string {\n  if (typeof value === 'string') return value;\n  if (typeof value === 'number') return Number.isNaN(value) ? '' : String(value);\n  if (typeof value === 'boolean') return String(value);\n  if (value instanceof Date) return Number.isNaN(value.getTime()) ? '' : isoDay(value);\n  return '';\n}\n\nconst DAY = /^(\\d{4})-(\\d{2})-(\\d{2})$/;\n\n/**\n * A value's local day as a sortable number (`20261110`), or `undefined`. Takes a `Date`,\n * a timestamp, an ISO date (`'2026-11-10'`, read as that day, not as UTC midnight) or\n * any other string `Date` can parse.\n */\nexport function dayOf(value: unknown): number | undefined {\n  let date: Date;\n  if (value instanceof Date) date = value;\n  else if (typeof value === 'number') date = new Date(value);\n  else if (typeof value === 'string') {\n    const day = DAY.exec(value.trim());\n    if (day) return Number(day[1]) * 10000 + Number(day[2]) * 100 + Number(day[3]);\n    if (!value.trim()) return undefined;\n    date = new Date(value);\n  } else return undefined;\n  const time = date.getTime();\n  if (Number.isNaN(time)) return undefined;\n  return date.getFullYear() * 10000 + (date.getMonth() + 1) * 100 + date.getDate();\n}\n\n/** A value as a number for the number filters: numbers, and strings that are numbers. */\nfunction numberOf(value: unknown): number | undefined {\n  if (typeof value === 'number') return Number.isNaN(value) ? undefined : value;\n  if (typeof value === 'string' && value.trim() !== '') {\n    const n = Number(value);\n    return Number.isNaN(n) ? undefined : n;\n  }\n  return undefined;\n}\n\n/**\n * The value a `'set'` filter lists and compares: strings, numbers and booleans stay,\n * a `Date` becomes its local day, and empty values (and objects) become `null`.\n */\nexport function setValueOf(value: unknown): FilterValue {\n  if (isEmptyValue(value)) return null;\n  if (typeof value === 'string' || typeof value === 'number' || typeof value === 'boolean') {\n    return value;\n  }\n  return value instanceof Date ? isoDay(value) : null;\n}\n\nfunction compare(\n  op: RangeFilterOp,\n  from: number | undefined,\n  to: number | undefined,\n): ((n: number | undefined) => boolean) | undefined {\n  if (op === 'empty') return (n) => n === undefined;\n  if (op === 'notEmpty') return (n) => n !== undefined;\n  if (op === 'between') {\n    if (from === undefined && to === undefined) return undefined;\n    return (n) =>\n      n !== undefined && (from === undefined || n >= from) && (to === undefined || n <= to);\n  }\n  if (from === undefined) return undefined;\n  switch (op) {\n    case 'eq':\n      return (n) => n === from;\n    case 'ne':\n      // Like a spreadsheet: an empty cell isn't equal to the number, so it stays.\n      return (n) => n !== from;\n    case 'lt':\n      return (n) => n !== undefined && n < from;\n    case 'le':\n      return (n) => n !== undefined && n <= from;\n    case 'gt':\n      return (n) => n !== undefined && n > from;\n    case 'ge':\n      return (n) => n !== undefined && n >= from;\n  }\n}\n\n/**\n * A test of one value for a filter, or `undefined` when the filter keeps every row\n * (no text to match, no bound to compare with). Text matching ignores case.\n */\nexport function compileFilter(filter: ColumnFilter): ((value: unknown) => boolean) | undefined {\n  switch (filter.kind) {\n    case 'text': {\n      if (filter.op === 'empty') return (v) => textOf(v) === '';\n      if (filter.op === 'notEmpty') return (v) => textOf(v) !== '';\n      const needle = (filter.value ?? '').toLowerCase();\n      if (!needle) return undefined;\n      if (filter.op === 'equals') return (v) => textOf(v).toLowerCase() === needle;\n      if (filter.op === 'startsWith') return (v) => textOf(v).toLowerCase().startsWith(needle);\n      return (v) => textOf(v).toLowerCase().includes(needle);\n    }\n    case 'number': {\n      const test = compare(filter.op, numberOf(filter.value), numberOf(filter.to));\n      return test && ((v) => test(numberOf(v)));\n    }\n    case 'date': {\n      const test = compare(filter.op, dayOf(filter.value), dayOf(filter.to));\n      return test && ((v) => test(dayOf(v)));\n    }\n    case 'set': {\n      const values = new Set(filter.values);\n      return (v) => values.has(setValueOf(v));\n    }\n  }\n}\n\n/** The words of a quick filter, lowercased; empty when it keeps every row. */\nfunction quickTerms(quickFilter: string | undefined): string[] {\n  return (quickFilter ?? '').toLowerCase().split(/\\s+/).filter(Boolean);\n}\n\n/**\n * One test of a row for the column filters and the quick filter, or `undefined` when\n * they keep every row. A row passes every column filter, and each word of the quick\n * filter is found in the text of one of `quickColumns` (ignoring case).\n *\n * Each value is read once per test through the column's `getValue`. A column with a\n * `filterFn` uses it in place of the built-in matching. Filters for unknown columns,\n * and on the `except` columns (for the values a column's own filter offers), are skipped.\n */\nexport function rowPredicate<TData>(\n  columns: ReadonlyMap<string, FilterColumn<TData>>,\n  filters: ColumnFilterState | undefined,\n  quickFilter: string | undefined,\n  quickColumns: readonly FilterColumn<TData>[],\n  except?: ReadonlySet<string>,\n): RowPredicate<TData> | undefined {\n  const tests: RowPredicate<TData>[] = [];\n  for (const [id, filter] of Object.entries(filters ?? {})) {\n    const column = columns.get(id);\n    if (!column || except?.has(id)) continue;\n    const { getValue, filterFn } = column;\n    if (filterFn) {\n      tests.push((row, index) => filterFn(getValue(row, index), filter, row));\n      continue;\n    }\n    const test = compileFilter(filter);\n    if (test) tests.push((row, index) => test(getValue(row, index)));\n  }\n  const terms = quickTerms(quickFilter);\n  if (terms.length && quickColumns.length) {\n    const textAt = (c: FilterColumn<TData>, row: TData, index: number) =>\n      textOf(c.getValue(row, index)).toLowerCase();\n    const [term] = terms;\n    tests.push(\n      terms.length === 1 && term !== undefined\n        ? (row, index) => quickColumns.some((c) => textAt(c, row, index).includes(term))\n        : (row, index) => {\n            const texts = quickColumns.map((c) => textAt(c, row, index));\n            return terms.every((t) => texts.some((text) => text.includes(t)));\n          },\n    );\n  }\n  if (!tests.length) return undefined;\n  if (tests.length === 1) return tests[0];\n  return (row, index) => tests.every((test) => test(row, index));\n}\n\nconst kindOrder = (v: FilterValue) =>\n  v === null ? 3 : typeof v === 'boolean' ? 2 : typeof v === 'number' ? 0 : 1;\n\n/** Orders set values: numbers, then text (by locale, numbers inside text by value), then booleans, then empty. */\nexport function compareSetValues(a: FilterValue, b: FilterValue): number {\n  const kind = kindOrder(a) - kindOrder(b);\n  if (kind) return kind;\n  if (typeof a === 'number' && typeof b === 'number') return a - b;\n  if (typeof a === 'string' && typeof b === 'string') {\n    return a.localeCompare(b, undefined, { numeric: true, sensitivity: 'base' });\n  }\n  return Number(a) - Number(b);\n}\n\n/**\n * The distinct values of `column` over the rows `keep` passes, as a `'set'` filter\n * lists them (see `setValueOf`), sorted. Stops after `limit` values (`truncated`).\n */\nexport function distinctValues<TData>(\n  rows: Iterable<{ original: TData; index: number }>,\n  column: FilterColumn<TData>,\n  keep: RowPredicate<TData> | undefined,\n  limit: number,\n): { values: FilterValue[]; truncated: boolean } {\n  const seen = new Set<FilterValue>();\n  let truncated = false;\n  for (const { original, index } of rows) {\n    if (keep && !keep(original, index)) continue;\n    const value = setValueOf(column.getValue(original, index));\n    if (seen.has(value)) continue;\n    if (seen.size === limit) {\n      truncated = true;\n      break;\n    }\n    seen.add(value);\n  }\n  return { values: [...seen].sort(compareSetValues), truncated };\n}\n"],"mappings":";;AAgBA,SAAgB,aAAa,OAAyB;CACpD,IAAI,UAAU,KAAA,KAAa,UAAU,QAAQ,UAAU,IAAI,OAAO;CAClE,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK;CACxD,OAAO,iBAAiB,QAAQ,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC9D;AAEA,IAAM,OAAO,GAAW,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,SAAS,OAAO,GAAG;;AAGnE,SAAS,OAAO,MAAoB;CAClC,OAAO,GAAG,IAAI,KAAK,YAAY,GAAG,CAAC,EAAE,GAAG,IAAI,KAAK,SAAS,IAAI,CAAC,EAAE,GAAG,IAAI,KAAK,QAAQ,CAAC;AACxF;;;;;;AAOA,SAAgB,OAAO,OAAwB;CAC7C,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK,IAAI,KAAK,OAAO,KAAK;CAC7E,IAAI,OAAO,UAAU,WAAW,OAAO,OAAO,KAAK;CACnD,IAAI,iBAAiB,MAAM,OAAO,OAAO,MAAM,MAAM,QAAQ,CAAC,IAAI,KAAK,OAAO,KAAK;CACnF,OAAO;AACT;AAEA,IAAM,MAAM;;;;;;AAOZ,SAAgB,MAAM,OAAoC;CACxD,IAAI;CACJ,IAAI,iBAAiB,MAAM,OAAO;MAC7B,IAAI,OAAO,UAAU,UAAU,OAAO,IAAI,KAAK,KAAK;MACpD,IAAI,OAAO,UAAU,UAAU;EAClC,MAAM,MAAM,IAAI,KAAK,MAAM,KAAK,CAAC;EACjC,IAAI,KAAK,OAAO,OAAO,IAAI,EAAE,IAAI,MAAQ,OAAO,IAAI,EAAE,IAAI,MAAM,OAAO,IAAI,EAAE;EAC7E,IAAI,CAAC,MAAM,KAAK,GAAG,OAAO,KAAA;EAC1B,OAAO,IAAI,KAAK,KAAK;CACvB,OAAO,OAAO,KAAA;CACd,MAAM,OAAO,KAAK,QAAQ;CAC1B,IAAI,OAAO,MAAM,IAAI,GAAG,OAAO,KAAA;CAC/B,OAAO,KAAK,YAAY,IAAI,OAAS,KAAK,SAAS,IAAI,KAAK,MAAM,KAAK,QAAQ;AACjF;;AAGA,SAAS,SAAS,OAAoC;CACpD,IAAI,OAAO,UAAU,UAAU,OAAO,OAAO,MAAM,KAAK,IAAI,KAAA,IAAY;CACxE,IAAI,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM,IAAI;EACpD,MAAM,IAAI,OAAO,KAAK;EACtB,OAAO,OAAO,MAAM,CAAC,IAAI,KAAA,IAAY;CACvC;AAEF;;;;;AAMA,SAAgB,WAAW,OAA6B;CACtD,IAAI,aAAa,KAAK,GAAG,OAAO;CAChC,IAAI,OAAO,UAAU,YAAY,OAAO,UAAU,YAAY,OAAO,UAAU,WAC7E,OAAO;CAET,OAAO,iBAAiB,OAAO,OAAO,KAAK,IAAI;AACjD;AAEA,SAAS,QACP,IACA,MACA,IACkD;CAClD,IAAI,OAAO,SAAS,QAAQ,MAAM,MAAM,KAAA;CACxC,IAAI,OAAO,YAAY,QAAQ,MAAM,MAAM,KAAA;CAC3C,IAAI,OAAO,WAAW;EACpB,IAAI,SAAS,KAAA,KAAa,OAAO,KAAA,GAAW,OAAO,KAAA;EACnD,QAAQ,MACN,MAAM,KAAA,MAAc,SAAS,KAAA,KAAa,KAAK,UAAU,OAAO,KAAA,KAAa,KAAK;CACtF;CACA,IAAI,SAAS,KAAA,GAAW,OAAO,KAAA;CAC/B,QAAQ,IAAR;EACE,KAAK,MACH,QAAQ,MAAM,MAAM;EACtB,KAAK,MAEH,QAAQ,MAAM,MAAM;EACtB,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,IAAI;EACvC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,KAAK;EACxC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,IAAI;EACvC,KAAK,MACH,QAAQ,MAAM,MAAM,KAAA,KAAa,KAAK;CAC1C;AACF;;;;;AAMA,SAAgB,cAAc,QAAiE;CAC7F,QAAQ,OAAO,MAAf;EACE,KAAK,QAAQ;GACX,IAAI,OAAO,OAAO,SAAS,QAAQ,MAAM,OAAO,CAAC,MAAM;GACvD,IAAI,OAAO,OAAO,YAAY,QAAQ,MAAM,OAAO,CAAC,MAAM;GAC1D,MAAM,UAAU,OAAO,SAAS,GAAA,CAAI,YAAY;GAChD,IAAI,CAAC,QAAQ,OAAO,KAAA;GACpB,IAAI,OAAO,OAAO,UAAU,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,MAAM;GACtE,IAAI,OAAO,OAAO,cAAc,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,WAAW,MAAM;GACvF,QAAQ,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,MAAM;EACvD;EACA,KAAK,UAAU;GACb,MAAM,OAAO,QAAQ,OAAO,IAAI,SAAS,OAAO,KAAK,GAAG,SAAS,OAAO,EAAE,CAAC;GAC3E,OAAO,UAAU,MAAM,KAAK,SAAS,CAAC,CAAC;EACzC;EACA,KAAK,QAAQ;GACX,MAAM,OAAO,QAAQ,OAAO,IAAI,MAAM,OAAO,KAAK,GAAG,MAAM,OAAO,EAAE,CAAC;GACrE,OAAO,UAAU,MAAM,KAAK,MAAM,CAAC,CAAC;EACtC;EACA,KAAK,OAAO;GACV,MAAM,SAAS,IAAI,IAAI,OAAO,MAAM;GACpC,QAAQ,MAAM,OAAO,IAAI,WAAW,CAAC,CAAC;EACxC;CACF;AACF;;AAGA,SAAS,WAAW,aAA2C;CAC7D,QAAQ,eAAe,GAAA,CAAI,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;AACtE;;;;;;;;;;AAWA,SAAgB,aACd,SACA,SACA,aACA,cACA,QACiC;CACjC,MAAM,QAA+B,CAAC;CACtC,KAAK,MAAM,CAAC,IAAI,WAAW,OAAO,QAAQ,WAAW,CAAC,CAAC,GAAG;EACxD,MAAM,SAAS,QAAQ,IAAI,EAAE;EAC7B,IAAI,CAAC,UAAU,QAAQ,IAAI,EAAE,GAAG;EAChC,MAAM,EAAE,UAAU,aAAa;EAC/B,IAAI,UAAU;GACZ,MAAM,MAAM,KAAK,UAAU,SAAS,SAAS,KAAK,KAAK,GAAG,QAAQ,GAAG,CAAC;GACtE;EACF;EACA,MAAM,OAAO,cAAc,MAAM;EACjC,IAAI,MAAM,MAAM,MAAM,KAAK,UAAU,KAAK,SAAS,KAAK,KAAK,CAAC,CAAC;CACjE;CACA,MAAM,QAAQ,WAAW,WAAW;CACpC,IAAI,MAAM,UAAU,aAAa,QAAQ;EACvC,MAAM,UAAU,GAAwB,KAAY,UAClD,OAAO,EAAE,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,YAAY;EAC7C,MAAM,CAAC,QAAQ;EACf,MAAM,KACJ,MAAM,WAAW,KAAK,SAAS,KAAA,KAC1B,KAAK,UAAU,aAAa,MAAM,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC,SAAS,IAAI,CAAC,KAC5E,KAAK,UAAU;GACd,MAAM,QAAQ,aAAa,KAAK,MAAM,OAAO,GAAG,KAAK,KAAK,CAAC;GAC3D,OAAO,MAAM,OAAO,MAAM,MAAM,MAAM,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC;EAClE,CACN;CACF;CACA,IAAI,CAAC,MAAM,QAAQ,OAAO,KAAA;CAC1B,IAAI,MAAM,WAAW,GAAG,OAAO,MAAM;CACrC,QAAQ,KAAK,UAAU,MAAM,OAAO,SAAS,KAAK,KAAK,KAAK,CAAC;AAC/D;AAEA,IAAM,aAAa,MACjB,MAAM,OAAO,IAAI,OAAO,MAAM,YAAY,IAAI,OAAO,MAAM,WAAW,IAAI;;AAG5E,SAAgB,iBAAiB,GAAgB,GAAwB;CACvE,MAAM,OAAO,UAAU,CAAC,IAAI,UAAU,CAAC;CACvC,IAAI,MAAM,OAAO;CACjB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO,IAAI;CAC/D,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,EAAE,cAAc,GAAG,KAAA,GAAW;EAAE,SAAS;EAAM,aAAa;CAAO,CAAC;CAE7E,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;AAC7B;;;;;AAMA,SAAgB,eACd,MACA,QACA,MACA,OAC+C;CAC/C,MAAM,uBAAO,IAAI,IAAiB;CAClC,IAAI,YAAY;CAChB,KAAK,MAAM,EAAE,UAAU,WAAW,MAAM;EACtC,IAAI,QAAQ,CAAC,KAAK,UAAU,KAAK,GAAG;EACpC,MAAM,QAAQ,WAAW,OAAO,SAAS,UAAU,KAAK,CAAC;EACzD,IAAI,KAAK,IAAI,KAAK,GAAG;EACrB,IAAI,KAAK,SAAS,OAAO;GACvB,YAAY;GACZ;EACF;EACA,KAAK,IAAI,KAAK;CAChB;CACA,OAAO;EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,gBAAgB;EAAG;CAAU;AAC/D"}

package/dist/core/src/grid/row-layout.js

@@ -1,37 +1,45 @@
 // ../core/src/grid/row-layout.ts
 /**
-* Where each row sits in the grid as a whole: the header row, then the rows
+* Where each row sits in the grid as a whole: the header rows, then the rows
 * pinned to the top, the body rows, and the rows pinned to the bottom. The
 * position is 0-based and `aria-rowindex` is one more. Keyboard navigation
 * steps through positions, so it crosses sections without special cases.
 */
 var RowLayout = class {
-	constructor(top, body, bottom) {
+	constructor(top, body, bottom, header = 1) {
 		this.top = top;
 		this.body = body;
 		this.bottom = bottom;
+		this.header = Math.max(1, header);
 	}
-	/** Number of rows, the header included (`aria-rowcount`). */
+	/** Number of rows, the header rows included (`aria-rowcount`). */
 	get total() {
-		return 1 + this.top + this.body + this.bottom;
+		return this.header + this.top + this.body + this.bottom;
+	}
+	/** The row of column headers: the last header row. */
+	get leafHeader() {
+		return {
+			section: "header",
+			index: this.header - 1
+		};
 	}
 	/** 0-based position of a row in the grid. */
 	position({ section, index }) {
 		switch (section) {
-			case "header": return 0;
-			case "top": return 1 + index;
-			case "body": return 1 + this.top + index;
-			case "bottom": return 1 + this.top + this.body + index;
+			case "header": return index;
+			case "top": return this.header + index;
+			case "body": return this.header + this.top + index;
+			case "bottom": return this.header + this.top + this.body + index;
 		}
 	}
 	/** The row at a 0-based position, or `undefined` outside the grid. */
 	at(position) {
 		if (!Number.isInteger(position) || position < 0 || position >= this.total) return void 0;
-		if (position === 0) return {
+		if (position < this.header) return {
 			section: "header",
-			index: 0
+			index: position
 		};
-		let index = position - 1;
+		let index = position - this.header;
 		if (index < this.top) return {
 			section: "top",
 			index

package/dist/core/src/grid/row-layout.js.map

@@ -1 +1 @@
-{"version":3,"file":"row-layout.js","names":[],"sources":["../../../../../core/src/grid/row-layout.ts"],"sourcesContent":["/** The row groups of the grid, top to bottom. */\nexport type GridSection = 'header' | 'top' | 'body' | 'bottom';\n\n/** A row of the grid: its section and its index within it (the header is index 0). */\nexport interface GridRow {\n  section: GridSection;\n  index: number;\n}\n\n/**\n * Where each row sits in the grid as a whole: the header row, then the rows\n * pinned to the top, the body rows, and the rows pinned to the bottom. The\n * position is 0-based and `aria-rowindex` is one more. Keyboard navigation\n * steps through positions, so it crosses sections without special cases.\n */\nexport class RowLayout {\n  readonly top: number;\n  readonly body: number;\n  readonly bottom: number;\n\n  constructor(top: number, body: number, bottom: number) {\n    this.top = top;\n    this.body = body;\n    this.bottom = bottom;\n  }\n\n  /** Number of rows, the header included (`aria-rowcount`). */\n  get total(): number {\n    return 1 + this.top + this.body + this.bottom;\n  }\n\n  /** 0-based position of a row in the grid. */\n  position({ section, index }: GridRow): number {\n    switch (section) {\n      case 'header':\n        return 0;\n      case 'top':\n        return 1 + index;\n      case 'body':\n        return 1 + this.top + index;\n      case 'bottom':\n        return 1 + this.top + this.body + index;\n    }\n  }\n\n  /** The row at a 0-based position, or `undefined` outside the grid. */\n  at(position: number): GridRow | undefined {\n    if (!Number.isInteger(position) || position < 0 || position >= this.total) return undefined;\n    if (position === 0) return { section: 'header', index: 0 };\n    let index = position - 1;\n    if (index < this.top) return { section: 'top', index };\n    index -= this.top;\n    if (index < this.body) return { section: 'body', index };\n    return { section: 'bottom', index: index - this.body };\n  }\n\n  ariaRowIndex(row: GridRow): number {\n    return this.position(row) + 1;\n  }\n\n  fromAriaRowIndex(ariaRowIndex: number): GridRow | undefined {\n    return this.at(ariaRowIndex - 1);\n  }\n}\n"],"mappings":";;;;;;;AAeA,IAAa,YAAb,MAAuB;CAKrB,YAAY,KAAa,MAAc,QAAgB;EACrD,KAAK,MAAM;EACX,KAAK,OAAO;EACZ,KAAK,SAAS;CAChB;;CAGA,IAAI,QAAgB;EAClB,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK;CACzC;;CAGA,SAAS,EAAE,SAAS,SAA0B;EAC5C,QAAQ,SAAR;GACE,KAAK,UACH,OAAO;GACT,KAAK,OACH,OAAO,IAAI;GACb,KAAK,QACH,OAAO,IAAI,KAAK,MAAM;GACxB,KAAK,UACH,OAAO,IAAI,KAAK,MAAM,KAAK,OAAO;EACtC;CACF;;CAGA,GAAG,UAAuC;EACxC,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,KAAK,YAAY,KAAK,OAAO,OAAO,KAAA;EAClF,IAAI,aAAa,GAAG,OAAO;GAAE,SAAS;GAAU,OAAO;EAAE;EACzD,IAAI,QAAQ,WAAW;EACvB,IAAI,QAAQ,KAAK,KAAK,OAAO;GAAE,SAAS;GAAO;EAAM;EACrD,SAAS,KAAK;EACd,IAAI,QAAQ,KAAK,MAAM,OAAO;GAAE,SAAS;GAAQ;EAAM;EACvD,OAAO;GAAE,SAAS;GAAU,OAAO,QAAQ,KAAK;EAAK;CACvD;CAEA,aAAa,KAAsB;EACjC,OAAO,KAAK,SAAS,GAAG,IAAI;CAC9B;CAEA,iBAAiB,cAA2C;EAC1D,OAAO,KAAK,GAAG,eAAe,CAAC;CACjC;AACF"}
+{"version":3,"file":"row-layout.js","names":[],"sources":["../../../../../core/src/grid/row-layout.ts"],"sourcesContent":["/** The row groups of the grid, top to bottom. */\nexport type GridSection = 'header' | 'top' | 'body' | 'bottom';\n\n/**\n * A row of the grid: its section and its index within it. Header rows count from\n * the top: with column groups the column headers are the last header row.\n */\nexport interface GridRow {\n  section: GridSection;\n  index: number;\n}\n\n/**\n * Where each row sits in the grid as a whole: the header rows, then the rows\n * pinned to the top, the body rows, and the rows pinned to the bottom. The\n * position is 0-based and `aria-rowindex` is one more. Keyboard navigation\n * steps through positions, so it crosses sections without special cases.\n */\nexport class RowLayout {\n  readonly top: number;\n  readonly body: number;\n  readonly bottom: number;\n  /** Number of header rows: one, and one more per level of column groups. */\n  readonly header: number;\n\n  constructor(top: number, body: number, bottom: number, header = 1) {\n    this.top = top;\n    this.body = body;\n    this.bottom = bottom;\n    this.header = Math.max(1, header);\n  }\n\n  /** Number of rows, the header rows included (`aria-rowcount`). */\n  get total(): number {\n    return this.header + this.top + this.body + this.bottom;\n  }\n\n  /** The row of column headers: the last header row. */\n  get leafHeader(): GridRow {\n    return { section: 'header', index: this.header - 1 };\n  }\n\n  /** 0-based position of a row in the grid. */\n  position({ section, index }: GridRow): number {\n    switch (section) {\n      case 'header':\n        return index;\n      case 'top':\n        return this.header + index;\n      case 'body':\n        return this.header + this.top + index;\n      case 'bottom':\n        return this.header + this.top + this.body + index;\n    }\n  }\n\n  /** The row at a 0-based position, or `undefined` outside the grid. */\n  at(position: number): GridRow | undefined {\n    if (!Number.isInteger(position) || position < 0 || position >= this.total) return undefined;\n    if (position < this.header) return { section: 'header', index: position };\n    let index = position - this.header;\n    if (index < this.top) return { section: 'top', index };\n    index -= this.top;\n    if (index < this.body) return { section: 'body', index };\n    return { section: 'bottom', index: index - this.body };\n  }\n\n  ariaRowIndex(row: GridRow): number {\n    return this.position(row) + 1;\n  }\n\n  fromAriaRowIndex(ariaRowIndex: number): GridRow | undefined {\n    return this.at(ariaRowIndex - 1);\n  }\n}\n"],"mappings":";;;;;;;AAkBA,IAAa,YAAb,MAAuB;CAOrB,YAAY,KAAa,MAAc,QAAgB,SAAS,GAAG;EACjE,KAAK,MAAM;EACX,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,KAAK,SAAS,KAAK,IAAI,GAAG,MAAM;CAClC;;CAGA,IAAI,QAAgB;EAClB,OAAO,KAAK,SAAS,KAAK,MAAM,KAAK,OAAO,KAAK;CACnD;;CAGA,IAAI,aAAsB;EACxB,OAAO;GAAE,SAAS;GAAU,OAAO,KAAK,SAAS;EAAE;CACrD;;CAGA,SAAS,EAAE,SAAS,SAA0B;EAC5C,QAAQ,SAAR;GACE,KAAK,UACH,OAAO;GACT,KAAK,OACH,OAAO,KAAK,SAAS;GACvB,KAAK,QACH,OAAO,KAAK,SAAS,KAAK,MAAM;GAClC,KAAK,UACH,OAAO,KAAK,SAAS,KAAK,MAAM,KAAK,OAAO;EAChD;CACF;;CAGA,GAAG,UAAuC;EACxC,IAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,KAAK,YAAY,KAAK,OAAO,OAAO,KAAA;EAClF,IAAI,WAAW,KAAK,QAAQ,OAAO;GAAE,SAAS;GAAU,OAAO;EAAS;EACxE,IAAI,QAAQ,WAAW,KAAK;EAC5B,IAAI,QAAQ,KAAK,KAAK,OAAO;GAAE,SAAS;GAAO;EAAM;EACrD,SAAS,KAAK;EACd,IAAI,QAAQ,KAAK,MAAM,OAAO;GAAE,SAAS;GAAQ;EAAM;EACvD,OAAO;GAAE,SAAS;GAAU,OAAO,QAAQ,KAAK;EAAK;CACvD;CAEA,aAAa,KAAsB;EACjC,OAAO,KAAK,SAAS,GAAG,IAAI;CAC9B;CAEA,iBAAiB,cAA2C;EAC1D,OAAO,KAAK,GAAG,eAAe,CAAC;CACjC;AACF"}

package/dist/core/src/state/selection.js

@@ -28,7 +28,8 @@ function toggleRow(current, mode, id) {
 function selectRange(current, from, to, idAt, add) {
 	const ids = add ? [...current] : [];
 	const have = new Set(ids);
-	const [first, last] = (to >= from ? 1 : -1) === 1 ? [from, to] : [to, from];
+	const first = Math.min(from, to);
+	const last = Math.max(from, to);
 	for (let index = first; index <= last; index++) {
 		const id = idAt(index);
 		if (id === void 0 || have.has(id)) continue;

package/dist/core/src/state/selection.js.map

@@ -1 +1 @@
-{"version":3,"file":"selection.js","names":[],"sources":["../../../../../core/src/state/selection.ts"],"sourcesContent":["import type { SelectionMode, SelectionState } from '../types.js';\n\n/**\n * Row selection rules, DOM-free. The element owns the state (through\n * `controllable`) and the anchor; these functions only compute the next ones.\n *\n * The anchor is the row a range starts from: the last row clicked or toggled\n * without Shift. Ranges are by index in the current row order, so they follow\n * sorting; `idAt` returns `undefined` for a row that can't be selected (a\n * `dataSource` row not loaded), and such rows are left out.\n */\n\n/** The selection after a step, and the row later ranges start from. */\nexport interface SelectionStep {\n  selection: SelectionState;\n  anchor: string | undefined;\n}\n\n/** The row a click or key acts on: its id and its index in the current row order. */\nexport interface SelectionTarget {\n  id: string;\n  index: number;\n}\n\n/** Modifier keys of a click: Ctrl or Cmd toggles, Shift selects a range. */\nexport interface SelectionModifiers {\n  toggle: boolean;\n  range: boolean;\n}\n\n/** Whether two selections hold the same ids, in any order. */\nexport function sameSelection(a: readonly string[], b: readonly string[]): boolean {\n  if (a.length !== b.length) return false;\n  const ids = new Set(a);\n  return b.every((id) => ids.has(id));\n}\n\n/**\n * Selects or deselects one row and makes it the anchor. In `'single'` mode,\n * selecting a row replaces the selection.\n */\nexport function toggleRow(\n  current: readonly string[],\n  mode: SelectionMode,\n  id: string,\n): SelectionStep | undefined {\n  if (mode === 'none') return undefined;\n  if (current.includes(id)) return { selection: current.filter((s) => s !== id), anchor: id };\n  return { selection: mode === 'single' ? [id] : [...current, id], anchor: id };\n}\n\n/**\n * The rows from index `from` to `to` (either order, both inclusive), in row\n * order. With `add`, they join the current selection instead of replacing it.\n * The anchor stays where it was.\n */\nexport function selectRange(\n  current: readonly string[],\n  from: number,\n  to: number,\n  idAt: (index: number) => string | undefined,\n  add: boolean,\n): SelectionState {\n  const ids: string[] = add ? [...current] : [];\n  const have = new Set(ids);\n  const step = to >= from ? 1 : -1;\n  const [first, last] = step === 1 ? [from, to] : [to, from];\n  for (let index = first; index <= last; index++) {\n    const id = idAt(index);\n    if (id === undefined || have.has(id)) continue;\n    have.add(id);\n    ids.push(id);\n  }\n  return ids;\n}\n\n/**\n * Every row of `ids` selected, keeping the rows already selected (with a\n * `dataSource`, `ids` are only the loaded rows: selected rows elsewhere stay).\n */\nexport function selectAll(current: readonly string[], ids: readonly string[]): SelectionState {\n  const have = new Set(current);\n  return [...current, ...ids.filter((id) => !have.has(id))];\n}\n\n/**\n * A click on a row, desktop style. A plain click selects only that row; Ctrl or\n * Cmd toggles it. In `'multi'` mode, Shift selects the range from the anchor\n * (at `anchorIndex`) to the row, and Ctrl+Shift adds that range. Without an\n * anchor in the current rows, Shift acts like a plain click. `undefined` in\n * `'none'` mode. The selection may come back unchanged (a click on the one\n * selected row): check with `sameSelection` before reporting a change.\n */\nexport function clickSelection(\n  current: readonly string[],\n  mode: SelectionMode,\n  target: SelectionTarget,\n  anchor: { id: string; index: number } | undefined,\n  modifiers: SelectionModifiers,\n  idAt: (index: number) => string | undefined,\n): SelectionStep | undefined {\n  if (mode === 'none') return undefined;\n  if (mode === 'multi' && modifiers.range && anchor) {\n    return {\n      selection: selectRange(current, anchor.index, target.index, idAt, modifiers.toggle),\n      anchor: anchor.id,\n    };\n  }\n  if (modifiers.toggle) return toggleRow(current, mode, target.id);\n  return { selection: [target.id], anchor: target.id };\n}\n"],"mappings":";;AA+BA,SAAgB,cAAc,GAAsB,GAA+B;CACjF,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,MAAM,MAAM,IAAI,IAAI,CAAC;CACrB,OAAO,EAAE,OAAO,OAAO,IAAI,IAAI,EAAE,CAAC;AACpC;;;;;AAMA,SAAgB,UACd,SACA,MACA,IAC2B;CAC3B,IAAI,SAAS,QAAQ,OAAO,KAAA;CAC5B,IAAI,QAAQ,SAAS,EAAE,GAAG,OAAO;EAAE,WAAW,QAAQ,QAAQ,MAAM,MAAM,EAAE;EAAG,QAAQ;CAAG;CAC1F,OAAO;EAAE,WAAW,SAAS,WAAW,CAAC,EAAE,IAAI,CAAC,GAAG,SAAS,EAAE;EAAG,QAAQ;CAAG;AAC9E;;;;;;AAOA,SAAgB,YACd,SACA,MACA,IACA,MACA,KACgB;CAChB,MAAM,MAAgB,MAAM,CAAC,GAAG,OAAO,IAAI,CAAC;CAC5C,MAAM,OAAO,IAAI,IAAI,GAAG;CAExB,MAAM,CAAC,OAAO,SADD,MAAM,OAAO,IAAI,QACC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI;CACzD,KAAK,IAAI,QAAQ,OAAO,SAAS,MAAM,SAAS;EAC9C,MAAM,KAAK,KAAK,KAAK;EACrB,IAAI,OAAO,KAAA,KAAa,KAAK,IAAI,EAAE,GAAG;EACtC,KAAK,IAAI,EAAE;EACX,IAAI,KAAK,EAAE;CACb;CACA,OAAO;AACT;;;;;AAMA,SAAgB,UAAU,SAA4B,KAAwC;CAC5F,MAAM,OAAO,IAAI,IAAI,OAAO;CAC5B,OAAO,CAAC,GAAG,SAAS,GAAG,IAAI,QAAQ,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;AAC1D;;;;;;;;;AAUA,SAAgB,eACd,SACA,MACA,QACA,QACA,WACA,MAC2B;CAC3B,IAAI,SAAS,QAAQ,OAAO,KAAA;CAC5B,IAAI,SAAS,WAAW,UAAU,SAAS,QACzC,OAAO;EACL,WAAW,YAAY,SAAS,OAAO,OAAO,OAAO,OAAO,MAAM,UAAU,MAAM;EAClF,QAAQ,OAAO;CACjB;CAEF,IAAI,UAAU,QAAQ,OAAO,UAAU,SAAS,MAAM,OAAO,EAAE;CAC/D,OAAO;EAAE,WAAW,CAAC,OAAO,EAAE;EAAG,QAAQ,OAAO;CAAG;AACrD"}
+{"version":3,"file":"selection.js","names":[],"sources":["../../../../../core/src/state/selection.ts"],"sourcesContent":["import type { SelectionMode, SelectionState } from '../types.js';\n\n/**\n * Row selection rules, DOM-free. The element owns the state (through\n * `controllable`) and the anchor; these functions only compute the next ones.\n *\n * The anchor is the row a range starts from: the last row clicked or toggled\n * without Shift. Ranges are by index in the current row order, so they follow\n * sorting; `idAt` returns `undefined` for a row that can't be selected (a\n * `dataSource` row not loaded), and such rows are left out.\n */\n\n/** The selection after a step, and the row later ranges start from. */\nexport interface SelectionStep {\n  selection: SelectionState;\n  anchor: string | undefined;\n}\n\n/** The row a click or key acts on: its id and its index in the current row order. */\nexport interface SelectionTarget {\n  id: string;\n  index: number;\n}\n\n/** Modifier keys of a click: Ctrl or Cmd toggles, Shift selects a range. */\nexport interface SelectionModifiers {\n  toggle: boolean;\n  range: boolean;\n}\n\n/** Whether two selections hold the same ids, in any order. */\nexport function sameSelection(a: readonly string[], b: readonly string[]): boolean {\n  if (a.length !== b.length) return false;\n  const ids = new Set(a);\n  return b.every((id) => ids.has(id));\n}\n\n/**\n * Selects or deselects one row and makes it the anchor. In `'single'` mode,\n * selecting a row replaces the selection.\n */\nexport function toggleRow(\n  current: readonly string[],\n  mode: SelectionMode,\n  id: string,\n): SelectionStep | undefined {\n  if (mode === 'none') return undefined;\n  if (current.includes(id)) return { selection: current.filter((s) => s !== id), anchor: id };\n  return { selection: mode === 'single' ? [id] : [...current, id], anchor: id };\n}\n\n/**\n * The rows from index `from` to `to` (either order, both inclusive), in row\n * order. With `add`, they join the current selection instead of replacing it.\n * The anchor stays where it was.\n */\nexport function selectRange(\n  current: readonly string[],\n  from: number,\n  to: number,\n  idAt: (index: number) => string | undefined,\n  add: boolean,\n): SelectionState {\n  const ids: string[] = add ? [...current] : [];\n  const have = new Set(ids);\n  const first = Math.min(from, to);\n  const last = Math.max(from, to);\n  for (let index = first; index <= last; index++) {\n    const id = idAt(index);\n    if (id === undefined || have.has(id)) continue;\n    have.add(id);\n    ids.push(id);\n  }\n  return ids;\n}\n\n/**\n * Every row of `ids` selected, keeping the rows already selected (with a\n * `dataSource`, `ids` are only the loaded rows: selected rows elsewhere stay).\n */\nexport function selectAll(current: readonly string[], ids: readonly string[]): SelectionState {\n  const have = new Set(current);\n  return [...current, ...ids.filter((id) => !have.has(id))];\n}\n\n/**\n * A click on a row, desktop style. A plain click selects only that row; Ctrl or\n * Cmd toggles it. In `'multi'` mode, Shift selects the range from the anchor\n * (at `anchorIndex`) to the row, and Ctrl+Shift adds that range. Without an\n * anchor in the current rows, Shift acts like a plain click. `undefined` in\n * `'none'` mode. The selection may come back unchanged (a click on the one\n * selected row): check with `sameSelection` before reporting a change.\n */\nexport function clickSelection(\n  current: readonly string[],\n  mode: SelectionMode,\n  target: SelectionTarget,\n  anchor: SelectionTarget | undefined,\n  modifiers: SelectionModifiers,\n  idAt: (index: number) => string | undefined,\n): SelectionStep | undefined {\n  if (mode === 'none') return undefined;\n  if (mode === 'multi' && modifiers.range && anchor) {\n    return {\n      selection: selectRange(current, anchor.index, target.index, idAt, modifiers.toggle),\n      anchor: anchor.id,\n    };\n  }\n  if (modifiers.toggle) return toggleRow(current, mode, target.id);\n  return { selection: [target.id], anchor: target.id };\n}\n"],"mappings":";;AA+BA,SAAgB,cAAc,GAAsB,GAA+B;CACjF,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,MAAM,MAAM,IAAI,IAAI,CAAC;CACrB,OAAO,EAAE,OAAO,OAAO,IAAI,IAAI,EAAE,CAAC;AACpC;;;;;AAMA,SAAgB,UACd,SACA,MACA,IAC2B;CAC3B,IAAI,SAAS,QAAQ,OAAO,KAAA;CAC5B,IAAI,QAAQ,SAAS,EAAE,GAAG,OAAO;EAAE,WAAW,QAAQ,QAAQ,MAAM,MAAM,EAAE;EAAG,QAAQ;CAAG;CAC1F,OAAO;EAAE,WAAW,SAAS,WAAW,CAAC,EAAE,IAAI,CAAC,GAAG,SAAS,EAAE;EAAG,QAAQ;CAAG;AAC9E;;;;;;AAOA,SAAgB,YACd,SACA,MACA,IACA,MACA,KACgB;CAChB,MAAM,MAAgB,MAAM,CAAC,GAAG,OAAO,IAAI,CAAC;CAC5C,MAAM,OAAO,IAAI,IAAI,GAAG;CACxB,MAAM,QAAQ,KAAK,IAAI,MAAM,EAAE;CAC/B,MAAM,OAAO,KAAK,IAAI,MAAM,EAAE;CAC9B,KAAK,IAAI,QAAQ,OAAO,SAAS,MAAM,SAAS;EAC9C,MAAM,KAAK,KAAK,KAAK;EACrB,IAAI,OAAO,KAAA,KAAa,KAAK,IAAI,EAAE,GAAG;EACtC,KAAK,IAAI,EAAE;EACX,IAAI,KAAK,EAAE;CACb;CACA,OAAO;AACT;;;;;AAMA,SAAgB,UAAU,SAA4B,KAAwC;CAC5F,MAAM,OAAO,IAAI,IAAI,OAAO;CAC5B,OAAO,CAAC,GAAG,SAAS,GAAG,IAAI,QAAQ,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;AAC1D;;;;;;;;;AAUA,SAAgB,eACd,SACA,MACA,QACA,QACA,WACA,MAC2B;CAC3B,IAAI,SAAS,QAAQ,OAAO,KAAA;CAC5B,IAAI,SAAS,WAAW,UAAU,SAAS,QACzC,OAAO;EACL,WAAW,YAAY,SAAS,OAAO,OAAO,OAAO,OAAO,MAAM,UAAU,MAAM;EAClF,QAAQ,OAAO;CACjB;CAEF,IAAI,UAAU,QAAQ,OAAO,UAAU,SAAS,MAAM,OAAO,EAAE;CAC/D,OAAO;EAAE,WAAW,CAAC,OAAO,EAAE;EAAG,QAAQ,OAAO;CAAG;AACrD"}

package/dist/core/src/table/create-table.js

@@ -1,4 +1,5 @@
-import { moveColumn, normalizeOrder } from "../columns/column-order.js";
+import { cellOver, headerGroupRows, resolveColumnGroups } from "../columns/column-groups.js";
+import { moveUnit, normalizeOrder, siblingUnits } from "../columns/column-order.js";
 import { resolveColumns } from "../columns/resolve-columns.js";
 import { distinctValues, rowPredicate } from "../filters/filter.js";
 import { filteredRowModel, setRowPredicate } from "./filtered-row-model.js";
@@ -89,6 +90,9 @@ function createTableModel(initial) {
 	let byId = new Map(resolved.map((c) => [c.id, c]));
 	let tanStackById = new Map(resolved.map((c) => [c.id, toTanStack(c)]));
 	let views;
+	const treeOf = () => resolveColumnGroups(options.columnGroups, new Set(resolved.map((c) => c.id)));
+	let tree = treeOf();
+	let groupRows;
 	const pinOf = (column, pinning = options.columnPinning) => {
 		const state = pinning?.[column.id];
 		if (state === "start" || state === "end") return state;
@@ -129,7 +133,7 @@ function createTableModel(initial) {
 		reorderable: c.reorderable
 	}));
 	let order;
-	const orderState = () => order ??= normalizeOrder(options.columnOrder ?? [], orderable());
+	const orderState = () => order ??= normalizeOrder(options.columnOrder ?? [], orderable(), tree);
 	const rowViews = /* @__PURE__ */ new WeakMap();
 	let indexById;
 	let ordered;
@@ -154,12 +158,12 @@ function createTableModel(initial) {
 		onColumnSizingChange: () => void 0
 	});
 	const table = constructTable(tableOptions());
-	const predicateFor = (except) => options.remote ? void 0 : rowPredicate(byId, options.columnFilters, options.quickFilter, resolved.filter((c) => c.hasAccessor && !hiddenOf(c)), except);
+	const predicateFor = (except, quick = false) => options.remote ? void 0 : rowPredicate(byId, options.columnFilters, options.quickFilter, resolved.filter((c) => c.hasAccessor && !hiddenOf(c) && !(quick && except?.has(c.id))), except);
 	setRowPredicate(table, predicateFor());
 	const rows = () => table.getRowModel().rows;
 	const pinned = (side) => options.pinnedRows?.[side] ?? [];
 	const widthOf = (id) => table.getColumn(id)?.getSize() ?? 0;
-	const view = (def, colIndex, offset, pinEdge, width) => {
+	const view = (def, colIndex, offset, pinEdge) => {
 		const sort = options.sorting.find((s) => s.id === def.id);
 		const pin = pinOf(def);
 		const resized = options.columnSizing[def.id] !== void 0;
@@ -171,7 +175,7 @@ function createTableModel(initial) {
 			offset,
 			pinEdge,
 			hidden: colIndex === 0,
-			width,
+			width: widthOf(def.id),
 			flex: pin === void 0 && !resized ? def.flex : void 0,
 			auto: def.auto && !resized,
 			minWidth: def.minWidth,
@@ -206,23 +210,22 @@ function createTableModel(initial) {
 		if (lead && byId.has("--argus-selection")) throw new Error(`argus-table: the column id '${SELECTION_COLUMN_ID}' is reserved.`);
 		let x = lead * 40;
 		const list = start.map((def, i) => {
-			const width = widthOf(def.id);
-			const v = view(def, lead + i + 1, x, i === start.length - 1, width);
-			x += width;
+			const v = view(def, lead + i + 1, x, i === start.length - 1);
+			x += v.width;
 			return v;
 		});
 		x = 0;
 		for (const [i, def] of center.entries()) {
-			const width = widthOf(def.id);
-			list.push(view(def, lead + start.length + i + 1, x, false, width));
-			x += width;
+			const v = view(def, lead + start.length + i + 1, x, false);
+			list.push(v);
+			x += v.width;
 		}
 		const ends = [];
 		x = 0;
 		for (const [i, def] of [...end.entries()].reverse()) {
-			const width = widthOf(def.id);
-			ends.unshift(view(def, lead + start.length + center.length + i + 1, x, i === 0, width));
-			x += width;
+			const v = view(def, lead + start.length + center.length + i + 1, x, i === 0);
+			ends.unshift(v);
+			x += v.width;
 		}
 		list.push(...ends);
 		if (lead) list.unshift(selectionView(start.length === 0));
@@ -235,7 +238,7 @@ function createTableModel(initial) {
 			const shownView = byShownId.get(id);
 			if (shownView) return [shownView];
 			const def = byId.get(id);
-			return def ? [view(def, 0, 0, false, widthOf(id))] : [];
+			return def ? [view(def, 0, 0, false)] : [];
 		});
 	};
 	return {
@@ -252,11 +255,14 @@ function createTableModel(initial) {
 				byId = new Map(resolved.map((c) => [c.id, c]));
 				tanStackById = new Map(resolved.map((c) => [c.id, toTanStack(c)]));
 			}
+			const columnsChanged = merged.columns !== options.columns;
 			const pinningChanged = merged.columnPinning !== options.columnPinning;
-			if (merged.columns !== options.columns || merged.columnSizing !== options.columnSizing || merged.autoWidths !== options.autoWidths || pinningChanged) sizing = void 0;
-			if (merged.columns !== options.columns || merged.columnOrder !== options.columnOrder || pinningChanged) order = void 0;
-			const refilter = merged.columns !== options.columns || merged.columnFilters !== options.columnFilters || merged.quickFilter !== options.quickFilter || merged.columnVisibility !== options.columnVisibility || merged.remote !== options.remote;
+			const groupsChanged = merged.columnGroups !== options.columnGroups;
+			if (columnsChanged || merged.columnSizing !== options.columnSizing || merged.autoWidths !== options.autoWidths || pinningChanged) sizing = void 0;
+			if (columnsChanged || groupsChanged || merged.columnOrder !== options.columnOrder || pinningChanged) order = void 0;
+			const refilter = columnsChanged || merged.columnFilters !== options.columnFilters || merged.quickFilter !== options.quickFilter || merged.columnVisibility !== options.columnVisibility || merged.remote !== options.remote;
 			options = merged;
+			if (columnsChanged || groupsChanged) tree = treeOf();
 			views = void 0;
 			allViews = void 0;
 			if (refilter) setRowPredicate(table, predicateFor());
@@ -284,6 +290,25 @@ function createTableModel(initial) {
 		get totalWidth() {
 			return this.columns.reduce((sum, column) => sum + column.width, 0);
 		},
+		get headerGroups() {
+			const current = this.columns;
+			if (groupRows?.views === current && groupRows.tree === tree) return groupRows.rows;
+			const key = tree.groups.size ? current.map((c) => `${c.id}\u0000${String(c.pin)}\u0000${String(c.offset)}\u0000${String(c.pinEdge)}\u0000${String(c.reorderable)}\u0000${String(c.resizable)}`).join("
") : "";
+			if (groupRows?.tree !== tree || groupRows.key !== key) groupRows = {
+				views: current,
+				tree,
+				key,
+				rows: headerGroupRows(tree, current)
+			};
+			else groupRows.views = current;
+			return groupRows.rows;
+		},
+		get headerRows() {
+			return this.headerGroups.length + 1;
+		},
+		headerCell(level, columnId) {
+			return cellOver(this.headerGroups, level, columnId);
+		},
 		rowAt(index) {
 			if (options.remote) {
 				const entry = options.remote.entryAt(index);
@@ -371,10 +396,13 @@ function createTableModel(initial) {
 			};
 		},
 		orderOf(base) {
-			return base === void 0 ? orderState() : normalizeOrder(base, orderable());
+			return base === void 0 ? orderState() : normalizeOrder(base, orderable(), tree);
 		},
-		nextOrder(columnId, to, base) {
-			return moveColumn(base ?? orderState(), orderable(), columnId, to, shown);
+		siblingUnits(unit, base) {
+			return siblingUnits(base ?? orderState(), orderable(), tree, unit, shown);
+		},
+		nextMove(unit, to, base) {
+			return moveUnit(base ?? orderState(), orderable(), tree, unit, to, shown);
 		},
 		nextPinning(columnId, pin, base = options.columnPinning) {
 			const column = byId.get(columnId);
@@ -420,7 +448,14 @@ function createTableModel(initial) {
 			};
 			if (options.remote) return void 0;
 			const rows = table.getCoreRowModel().rows;
-			return distinctValues(rows, column, predicateFor(columnId), limit);
+			return distinctValues(rows, column, predicateFor(/* @__PURE__ */ new Set([columnId])), limit);
+		},
+		indexesPassing(except) {
+			if (options.remote) return void 0;
+			const keep = predicateFor(new Set(except), true);
+			const kept = [];
+			for (const row of table.getCoreRowModel().rows) if (!keep || keep(row.original, row.index)) kept.push(row.index);
+			return kept;
 		},
 		pinnedCount(side) {
 			return pinned(side).length;