@tanstack/table-core 9.0.0-beta.47 → 9.0.0-beta.48

package/dist/features/aggregation/aggregationFns.js

@@ -0,0 +1,229 @@
+import { constructAggregationFn } from "./aggregationFeature.types.js";
+
+//#region src/features/aggregation/aggregationFns.ts
+function isNumber(value) {
+	return typeof value === "number";
+}
+function isValidDate(value) {
+	return value instanceof Date && !Number.isNaN(value.getTime());
+}
+function getRangeKind(value) {
+	if (isNumber(value)) return "number";
+	if (isValidDate(value)) return "date";
+}
+function compareRangeValues(left, right) {
+	return (left instanceof Date ? left.getTime() : left) - (right instanceof Date ? right.getTime() : right);
+}
+function collectRangeValues(context) {
+	const values = [];
+	let kind;
+	for (let i = 0; i < context.rows.length; i++) {
+		const value = context.getValue(context.rows[i]);
+		const valueKind = getRangeKind(value);
+		if (!valueKind) continue;
+		kind ??= valueKind;
+		if (valueKind === kind) values.push(value);
+	}
+	return values;
+}
+/**
+* Sums numeric row values. Non-number values contribute zero. As in the
+* previous API, `NaN` is a number and therefore propagates through the sum.
+*/
+const aggregationFn_sum = constructAggregationFn({
+	aggregate: (context) => {
+		let sum = 0;
+		for (let i = 0; i < context.rows.length; i++) {
+			const value = context.getValue(context.rows[i]);
+			sum += typeof value === "number" ? value : 0;
+		}
+		return sum;
+	},
+	merge: ({ childResults }) => {
+		let sum = 0;
+		for (let i = 0; i < childResults.length; i++) {
+			const value = childResults[i];
+			if (isNumber(value)) sum += value;
+		}
+		return sum;
+	}
+});
+/**
+* Finds the minimum numeric or Date value. Invalid value types are ignored;
+* `NaN` preserves the legacy numeric seeding behavior.
+*/
+const aggregationFn_min = constructAggregationFn({
+	aggregate: (context) => {
+		const values = collectRangeValues(context);
+		let result = values[0];
+		for (let i = 1; i < values.length; i++) if (compareRangeValues(values[i], result) < 0) result = values[i];
+		return result;
+	},
+	merge: ({ childResults }) => {
+		let result;
+		let kind;
+		for (let i = 0; i < childResults.length; i++) {
+			const value = childResults[i];
+			const valueKind = getRangeKind(value);
+			if (!valueKind) continue;
+			kind ??= valueKind;
+			if (kind !== valueKind) continue;
+			if (result === void 0 || compareRangeValues(value, result) < 0) result = value;
+		}
+		return result;
+	}
+});
+/**
+* Finds the maximum numeric or Date value. Invalid value types are ignored;
+* `NaN` preserves the legacy numeric seeding behavior.
+*/
+const aggregationFn_max = constructAggregationFn({
+	aggregate: (context) => {
+		const values = collectRangeValues(context);
+		let result = values[0];
+		for (let i = 1; i < values.length; i++) if (compareRangeValues(values[i], result) > 0) result = values[i];
+		return result;
+	},
+	merge: ({ childResults }) => {
+		let result;
+		let kind;
+		for (let i = 0; i < childResults.length; i++) {
+			const value = childResults[i];
+			const valueKind = getRangeKind(value);
+			if (!valueKind) continue;
+			kind ??= valueKind;
+			if (kind !== valueKind) continue;
+			if (result === void 0 || compareRangeValues(value, result) > 0) result = value;
+		}
+		return result;
+	}
+});
+/**
+* Finds the minimum and maximum numeric or Date values. Empty inputs return
+* `[undefined, undefined]`, preserving the previous built-in result shape.
+*/
+const aggregationFn_extent = constructAggregationFn({
+	aggregate: (context) => {
+		const values = collectRangeValues(context);
+		if (!values.length) return [void 0, void 0];
+		let min = values[0];
+		let max = values[0];
+		for (let i = 1; i < values.length; i++) {
+			const value = values[i];
+			if (compareRangeValues(value, min) < 0) min = value;
+			if (compareRangeValues(value, max) > 0) max = value;
+		}
+		return [min, max];
+	},
+	merge: ({ childResults }) => {
+		let result = [void 0, void 0];
+		let kind;
+		for (let i = 0; i < childResults.length; i++) {
+			const extent = childResults[i];
+			const valueKind = getRangeKind(extent[0]);
+			if (!valueKind) continue;
+			kind ??= valueKind;
+			if (kind !== valueKind) continue;
+			if (result[0] === void 0) result = [extent[0], extent[1]];
+			else {
+				if (compareRangeValues(extent[0], result[0]) < 0) result[0] = extent[0];
+				if (compareRangeValues(extent[1], result[1]) > 0) result[1] = extent[1];
+			}
+		}
+		return result;
+	}
+});
+/**
+* Averages number and number-like row values. Nullish and non-numeric values
+* are ignored; other values retain the legacy unary-plus coercion behavior.
+*/
+const aggregationFn_mean = constructAggregationFn({ aggregate: (context) => {
+	let count = 0;
+	let sum = 0;
+	for (let i = 0; i < context.rows.length; i++) {
+		const value = context.getValue(context.rows[i]);
+		if (value == null) continue;
+		const numberValue = typeof value === "number" ? value : +value;
+		if (!Number.isNaN(numberValue)) {
+			count++;
+			sum += numberValue;
+		}
+	}
+	return count ? sum / count : void 0;
+} });
+/**
+* Computes the median when every row value is a number. Returns `undefined`
+* for empty inputs or when any value is non-numeric.
+*/
+const aggregationFn_median = constructAggregationFn({ aggregate: (context) => {
+	if (!context.rows.length) return void 0;
+	const values = new Array(context.rows.length);
+	for (let i = 0; i < context.rows.length; i++) {
+		const value = context.getValue(context.rows[i]);
+		if (typeof value !== "number") return void 0;
+		values[i] = value;
+	}
+	values.sort((a, b) => a - b);
+	const mid = Math.floor(values.length / 2);
+	return values.length % 2 ? values[mid] : (values[mid - 1] + values[mid]) / 2;
+} });
+/** Collects distinct row values using JavaScript `Set` semantics. */
+const aggregationFn_unique = constructAggregationFn({ aggregate: (context) => {
+	const values = /* @__PURE__ */ new Set();
+	for (let i = 0; i < context.rows.length; i++) values.add(context.getValue(context.rows[i]));
+	return Array.from(values);
+} });
+/** Counts distinct row values using JavaScript `Set` semantics. */
+const aggregationFn_uniqueCount = constructAggregationFn({ aggregate: (context) => {
+	const values = /* @__PURE__ */ new Set();
+	for (let i = 0; i < context.rows.length; i++) values.add(context.getValue(context.rows[i]));
+	return values.size;
+} });
+/** Counts rows, independently of the column's values. */
+const aggregationFn_count = constructAggregationFn({
+	aggregate: ({ rows }) => rows.length,
+	merge: ({ childResults }) => {
+		let count = 0;
+		for (let i = 0; i < childResults.length; i++) {
+			const value = childResults[i];
+			if (isNumber(value)) count += value;
+		}
+		return count;
+	}
+});
+/** Returns the first row's value, including a nullish value. */
+const aggregationFn_first = constructAggregationFn({
+	aggregate: (context) => context.rows[0] ? context.getValue(context.rows[0]) : void 0,
+	merge: ({ childResults }) => childResults[0]
+});
+/** Returns the last row's value, including a nullish value. */
+const aggregationFn_last = constructAggregationFn({
+	aggregate: (context) => {
+		const row = context.rows[context.rows.length - 1];
+		return row ? context.getValue(row) : void 0;
+	},
+	merge: ({ childResults }) => childResults[childResults.length - 1]
+});
+/**
+* Full built-in registry. Register individual definitions for tree-shaking.
+*
+* @deprecated Import individual `aggregationFn_*` definitions instead for a
+* smaller bundle. This registry remains available for compatibility.
+*/
+const aggregationFns = {
+	sum: aggregationFn_sum,
+	min: aggregationFn_min,
+	max: aggregationFn_max,
+	extent: aggregationFn_extent,
+	mean: aggregationFn_mean,
+	median: aggregationFn_median,
+	unique: aggregationFn_unique,
+	uniqueCount: aggregationFn_uniqueCount,
+	count: aggregationFn_count,
+	first: aggregationFn_first,
+	last: aggregationFn_last
+};
+
+//#endregion
+export { aggregationFn_count, aggregationFn_extent, aggregationFn_first, aggregationFn_last, aggregationFn_max, aggregationFn_mean, aggregationFn_median, aggregationFn_min, aggregationFn_sum, aggregationFn_unique, aggregationFn_uniqueCount, aggregationFns };
+//# sourceMappingURL=aggregationFns.js.map

package/dist/features/aggregation/aggregationFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aggregationFns.js","names":[],"sources":["../../../src/features/aggregation/aggregationFns.ts"],"sourcesContent":["import { constructAggregationFn } from './aggregationFeature.types'\nimport type { AggregationContext } from './aggregationFeature.types'\n\ntype RangeValue = Date | number\n\nfunction isNumber(value: unknown): value is number {\n  return typeof value === 'number'\n}\n\nfunction isValidDate(value: unknown): value is Date {\n  return value instanceof Date && !Number.isNaN(value.getTime())\n}\n\nfunction getRangeKind(value: unknown): 'date' | 'number' | undefined {\n  if (isNumber(value)) return 'number'\n  if (isValidDate(value)) return 'date'\n  return undefined\n}\n\nfunction compareRangeValues(left: RangeValue, right: RangeValue) {\n  const leftValue = left instanceof Date ? left.getTime() : left\n  const rightValue = right instanceof Date ? right.getTime() : right\n  return leftValue - rightValue\n}\n\nfunction collectRangeValues(context: AggregationContext<any, any, unknown>) {\n  const values: Array<RangeValue> = []\n  let kind: 'date' | 'number' | undefined\n\n  for (let i = 0; i < context.rows.length; i++) {\n    const value = context.getValue(context.rows[i]!)\n    const valueKind = getRangeKind(value)\n    if (!valueKind) continue\n    kind ??= valueKind\n    if (valueKind === kind) values.push(value as RangeValue)\n  }\n\n  return values\n}\n\n/**\n * Sums numeric row values. Non-number values contribute zero. As in the\n * previous API, `NaN` is a number and therefore propagates through the sum.\n */\nexport const aggregationFn_sum = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  number\n>({\n  aggregate: (context) => {\n    let sum = 0\n    for (let i = 0; i < context.rows.length; i++) {\n      const value = context.getValue(context.rows[i]!)\n      sum += typeof value === 'number' ? value : 0\n    }\n    return sum\n  },\n  merge: ({ childResults }) => {\n    let sum = 0\n    for (let i = 0; i < childResults.length; i++) {\n      const value = childResults[i]\n      if (isNumber(value)) sum += value\n    }\n    return sum\n  },\n})\n\n/**\n * Finds the minimum numeric or Date value. Invalid value types are ignored;\n * `NaN` preserves the legacy numeric seeding behavior.\n */\nexport const aggregationFn_min = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  RangeValue | undefined\n>({\n  aggregate: (context) => {\n    const values = collectRangeValues(context)\n    let result = values[0]\n    for (let i = 1; i < values.length; i++) {\n      if (compareRangeValues(values[i]!, result!) < 0) result = values[i]\n    }\n    return result\n  },\n  merge: ({ childResults }) => {\n    let result: RangeValue | undefined\n    let kind: 'date' | 'number' | undefined\n    for (let i = 0; i < childResults.length; i++) {\n      const value = childResults[i]\n      const valueKind = getRangeKind(value)\n      if (!valueKind) continue\n      kind ??= valueKind\n      if (kind !== valueKind) continue\n      if (result === undefined || compareRangeValues(value!, result) < 0) {\n        result = value\n      }\n    }\n    return result\n  },\n})\n\n/**\n * Finds the maximum numeric or Date value. Invalid value types are ignored;\n * `NaN` preserves the legacy numeric seeding behavior.\n */\nexport const aggregationFn_max = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  RangeValue | undefined\n>({\n  aggregate: (context) => {\n    const values = collectRangeValues(context)\n    let result = values[0]\n    for (let i = 1; i < values.length; i++) {\n      if (compareRangeValues(values[i]!, result!) > 0) result = values[i]\n    }\n    return result\n  },\n  merge: ({ childResults }) => {\n    let result: RangeValue | undefined\n    let kind: 'date' | 'number' | undefined\n    for (let i = 0; i < childResults.length; i++) {\n      const value = childResults[i]\n      const valueKind = getRangeKind(value)\n      if (!valueKind) continue\n      kind ??= valueKind\n      if (kind !== valueKind) continue\n      if (result === undefined || compareRangeValues(value!, result) > 0) {\n        result = value\n      }\n    }\n    return result\n  },\n})\n\n/**\n * Finds the minimum and maximum numeric or Date values. Empty inputs return\n * `[undefined, undefined]`, preserving the previous built-in result shape.\n */\nexport const aggregationFn_extent = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  [RangeValue | undefined, RangeValue | undefined]\n>({\n  aggregate: (context) => {\n    const values = collectRangeValues(context)\n    if (!values.length) return [undefined, undefined]\n    let min = values[0]!\n    let max = values[0]!\n    for (let i = 1; i < values.length; i++) {\n      const value = values[i]!\n      if (compareRangeValues(value, min) < 0) min = value\n      if (compareRangeValues(value, max) > 0) max = value\n    }\n    return [min, max]\n  },\n  merge: ({ childResults }) => {\n    let result: [RangeValue | undefined, RangeValue | undefined] = [\n      undefined,\n      undefined,\n    ]\n    let kind: 'date' | 'number' | undefined\n    for (let i = 0; i < childResults.length; i++) {\n      const extent = childResults[i]!\n      const valueKind = getRangeKind(extent[0])\n      if (!valueKind) continue\n      kind ??= valueKind\n      if (kind !== valueKind) continue\n      if (result[0] === undefined) {\n        result = [extent[0], extent[1]]\n      } else {\n        if (compareRangeValues(extent[0]!, result[0]) < 0) {\n          result[0] = extent[0]\n        }\n        if (compareRangeValues(extent[1]!, result[1]!) > 0) {\n          result[1] = extent[1]\n        }\n      }\n    }\n    return result\n  },\n})\n\n/**\n * Averages number and number-like row values. Nullish and non-numeric values\n * are ignored; other values retain the legacy unary-plus coercion behavior.\n */\nexport const aggregationFn_mean = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  number | undefined\n>({\n  aggregate: (context) => {\n    let count = 0\n    let sum = 0\n    for (let i = 0; i < context.rows.length; i++) {\n      const value = context.getValue(context.rows[i]!)\n      if (value == null) continue\n      const numberValue = typeof value === 'number' ? value : +value\n      if (!Number.isNaN(numberValue)) {\n        count++\n        sum += numberValue\n      }\n    }\n    return count ? sum / count : undefined\n  },\n})\n\n/**\n * Computes the median when every row value is a number. Returns `undefined`\n * for empty inputs or when any value is non-numeric.\n */\nexport const aggregationFn_median = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  number | undefined\n>({\n  aggregate: (context) => {\n    if (!context.rows.length) return undefined\n    const values = new Array<number>(context.rows.length)\n    for (let i = 0; i < context.rows.length; i++) {\n      const value = context.getValue(context.rows[i]!)\n      if (typeof value !== 'number') return undefined\n      values[i] = value\n    }\n    values.sort((a, b) => a - b)\n    const mid = Math.floor(values.length / 2)\n    return values.length % 2\n      ? values[mid]\n      : (values[mid - 1]! + values[mid]!) / 2\n  },\n})\n\n/** Collects distinct row values using JavaScript `Set` semantics. */\nexport const aggregationFn_unique = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  Array<unknown>\n>({\n  aggregate: (context) => {\n    const values = new Set<unknown>()\n    for (let i = 0; i < context.rows.length; i++) {\n      values.add(context.getValue(context.rows[i]!))\n    }\n    return Array.from(values)\n  },\n})\n\n/** Counts distinct row values using JavaScript `Set` semantics. */\nexport const aggregationFn_uniqueCount = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  number\n>({\n  aggregate: (context) => {\n    const values = new Set<unknown>()\n    for (let i = 0; i < context.rows.length; i++) {\n      values.add(context.getValue(context.rows[i]!))\n    }\n    return values.size\n  },\n})\n\n/** Counts rows, independently of the column's values. */\nexport const aggregationFn_count = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  number\n>({\n  aggregate: ({ rows }) => rows.length,\n  merge: ({ childResults }) => {\n    let count = 0\n    for (let i = 0; i < childResults.length; i++) {\n      const value = childResults[i]\n      if (isNumber(value)) count += value\n    }\n    return count\n  },\n})\n\n/** Returns the first row's value, including a nullish value. */\nexport const aggregationFn_first = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  unknown\n>({\n  aggregate: (context) =>\n    context.rows[0] ? context.getValue(context.rows[0]) : undefined,\n  merge: ({ childResults }) => childResults[0],\n})\n\n/** Returns the last row's value, including a nullish value. */\nexport const aggregationFn_last = constructAggregationFn<\n  any,\n  any,\n  unknown,\n  unknown\n>({\n  aggregate: (context) => {\n    const row = context.rows[context.rows.length - 1]\n    return row ? context.getValue(row) : undefined\n  },\n  merge: ({ childResults }) => childResults[childResults.length - 1],\n})\n\n/**\n * Full built-in registry. Register individual definitions for tree-shaking.\n *\n * @deprecated Import individual `aggregationFn_*` definitions instead for a\n * smaller bundle. This registry remains available for compatibility.\n */\nexport const aggregationFns = {\n  sum: aggregationFn_sum,\n  min: aggregationFn_min,\n  max: aggregationFn_max,\n  extent: aggregationFn_extent,\n  mean: aggregationFn_mean,\n  median: aggregationFn_median,\n  unique: aggregationFn_unique,\n  uniqueCount: aggregationFn_uniqueCount,\n  count: aggregationFn_count,\n  first: aggregationFn_first,\n  last: aggregationFn_last,\n}\n\nexport type BuiltInAggregationFn = keyof typeof aggregationFns\n"],"mappings":";;;AAKA,SAAS,SAAS,OAAiC;CACjD,OAAO,OAAO,UAAU;AAC1B;AAEA,SAAS,YAAY,OAA+B;CAClD,OAAO,iBAAiB,QAAQ,CAAC,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC/D;AAEA,SAAS,aAAa,OAA+C;CACnE,IAAI,SAAS,KAAK,GAAG,OAAO;CAC5B,IAAI,YAAY,KAAK,GAAG,OAAO;AAEjC;AAEA,SAAS,mBAAmB,MAAkB,OAAmB;CAG/D,QAFkB,gBAAgB,OAAO,KAAK,QAAQ,IAAI,SACvC,iBAAiB,OAAO,MAAM,QAAQ,IAAI;AAE/D;AAEA,SAAS,mBAAmB,SAAgD;CAC1E,MAAM,SAA4B,CAAC;CACnC,IAAI;CAEJ,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KAAK;EAC5C,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,EAAG;EAC/C,MAAM,YAAY,aAAa,KAAK;EACpC,IAAI,CAAC,WAAW;EAChB,SAAS;EACT,IAAI,cAAc,MAAM,OAAO,KAAK,KAAmB;CACzD;CAEA,OAAO;AACT;;;;;AAMA,MAAa,oBAAoB,uBAK/B;CACA,YAAY,YAAY;EACtB,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KAAK;GAC5C,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,EAAG;GAC/C,OAAO,OAAO,UAAU,WAAW,QAAQ;EAC7C;EACA,OAAO;CACT;CACA,QAAQ,EAAE,mBAAmB;EAC3B,IAAI,MAAM;EACV,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,QAAQ,aAAa;GAC3B,IAAI,SAAS,KAAK,GAAG,OAAO;EAC9B;EACA,OAAO;CACT;AACF,CAAC;;;;;AAMD,MAAa,oBAAoB,uBAK/B;CACA,YAAY,YAAY;EACtB,MAAM,SAAS,mBAAmB,OAAO;EACzC,IAAI,SAAS,OAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KACjC,IAAI,mBAAmB,OAAO,IAAK,MAAO,IAAI,GAAG,SAAS,OAAO;EAEnE,OAAO;CACT;CACA,QAAQ,EAAE,mBAAmB;EAC3B,IAAI;EACJ,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,QAAQ,aAAa;GAC3B,MAAM,YAAY,aAAa,KAAK;GACpC,IAAI,CAAC,WAAW;GAChB,SAAS;GACT,IAAI,SAAS,WAAW;GACxB,IAAI,WAAW,UAAa,mBAAmB,OAAQ,MAAM,IAAI,GAC/D,SAAS;EAEb;EACA,OAAO;CACT;AACF,CAAC;;;;;AAMD,MAAa,oBAAoB,uBAK/B;CACA,YAAY,YAAY;EACtB,MAAM,SAAS,mBAAmB,OAAO;EACzC,IAAI,SAAS,OAAO;EACpB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KACjC,IAAI,mBAAmB,OAAO,IAAK,MAAO,IAAI,GAAG,SAAS,OAAO;EAEnE,OAAO;CACT;CACA,QAAQ,EAAE,mBAAmB;EAC3B,IAAI;EACJ,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,QAAQ,aAAa;GAC3B,MAAM,YAAY,aAAa,KAAK;GACpC,IAAI,CAAC,WAAW;GAChB,SAAS;GACT,IAAI,SAAS,WAAW;GACxB,IAAI,WAAW,UAAa,mBAAmB,OAAQ,MAAM,IAAI,GAC/D,SAAS;EAEb;EACA,OAAO;CACT;AACF,CAAC;;;;;AAMD,MAAa,uBAAuB,uBAKlC;CACA,YAAY,YAAY;EACtB,MAAM,SAAS,mBAAmB,OAAO;EACzC,IAAI,CAAC,OAAO,QAAQ,OAAO,CAAC,QAAW,MAAS;EAChD,IAAI,MAAM,OAAO;EACjB,IAAI,MAAM,OAAO;EACjB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;GACtC,MAAM,QAAQ,OAAO;GACrB,IAAI,mBAAmB,OAAO,GAAG,IAAI,GAAG,MAAM;GAC9C,IAAI,mBAAmB,OAAO,GAAG,IAAI,GAAG,MAAM;EAChD;EACA,OAAO,CAAC,KAAK,GAAG;CAClB;CACA,QAAQ,EAAE,mBAAmB;EAC3B,IAAI,SAA2D,CAC7D,QACA,MACF;EACA,IAAI;EACJ,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,SAAS,aAAa;GAC5B,MAAM,YAAY,aAAa,OAAO,EAAE;GACxC,IAAI,CAAC,WAAW;GAChB,SAAS;GACT,IAAI,SAAS,WAAW;GACxB,IAAI,OAAO,OAAO,QAChB,SAAS,CAAC,OAAO,IAAI,OAAO,EAAE;QACzB;IACL,IAAI,mBAAmB,OAAO,IAAK,OAAO,EAAE,IAAI,GAC9C,OAAO,KAAK,OAAO;IAErB,IAAI,mBAAmB,OAAO,IAAK,OAAO,EAAG,IAAI,GAC/C,OAAO,KAAK,OAAO;GAEvB;EACF;EACA,OAAO;CACT;AACF,CAAC;;;;;AAMD,MAAa,qBAAqB,uBAKhC,EACA,YAAY,YAAY;CACtB,IAAI,QAAQ;CACZ,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KAAK;EAC5C,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,EAAG;EAC/C,IAAI,SAAS,MAAM;EACnB,MAAM,cAAc,OAAO,UAAU,WAAW,QAAQ,CAAC;EACzD,IAAI,CAAC,OAAO,MAAM,WAAW,GAAG;GAC9B;GACA,OAAO;EACT;CACF;CACA,OAAO,QAAQ,MAAM,QAAQ;AAC/B,EACF,CAAC;;;;;AAMD,MAAa,uBAAuB,uBAKlC,EACA,YAAY,YAAY;CACtB,IAAI,CAAC,QAAQ,KAAK,QAAQ,OAAO;CACjC,MAAM,SAAS,IAAI,MAAc,QAAQ,KAAK,MAAM;CACpD,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KAAK;EAC5C,MAAM,QAAQ,QAAQ,SAAS,QAAQ,KAAK,EAAG;EAC/C,IAAI,OAAO,UAAU,UAAU,OAAO;EACtC,OAAO,KAAK;CACd;CACA,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;CAC3B,MAAM,MAAM,KAAK,MAAM,OAAO,SAAS,CAAC;CACxC,OAAO,OAAO,SAAS,IACnB,OAAO,QACN,OAAO,MAAM,KAAM,OAAO,QAAS;AAC1C,EACF,CAAC;;AAGD,MAAa,uBAAuB,uBAKlC,EACA,YAAY,YAAY;CACtB,MAAM,yBAAS,IAAI,IAAa;CAChC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KACvC,OAAO,IAAI,QAAQ,SAAS,QAAQ,KAAK,EAAG,CAAC;CAE/C,OAAO,MAAM,KAAK,MAAM;AAC1B,EACF,CAAC;;AAGD,MAAa,4BAA4B,uBAKvC,EACA,YAAY,YAAY;CACtB,MAAM,yBAAS,IAAI,IAAa;CAChC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK,QAAQ,KACvC,OAAO,IAAI,QAAQ,SAAS,QAAQ,KAAK,EAAG,CAAC;CAE/C,OAAO,OAAO;AAChB,EACF,CAAC;;AAGD,MAAa,sBAAsB,uBAKjC;CACA,YAAY,EAAE,WAAW,KAAK;CAC9B,QAAQ,EAAE,mBAAmB;EAC3B,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;GAC5C,MAAM,QAAQ,aAAa;GAC3B,IAAI,SAAS,KAAK,GAAG,SAAS;EAChC;EACA,OAAO;CACT;AACF,CAAC;;AAGD,MAAa,sBAAsB,uBAKjC;CACA,YAAY,YACV,QAAQ,KAAK,KAAK,QAAQ,SAAS,QAAQ,KAAK,EAAE,IAAI;CACxD,QAAQ,EAAE,mBAAmB,aAAa;AAC5C,CAAC;;AAGD,MAAa,qBAAqB,uBAKhC;CACA,YAAY,YAAY;EACtB,MAAM,MAAM,QAAQ,KAAK,QAAQ,KAAK,SAAS;EAC/C,OAAO,MAAM,QAAQ,SAAS,GAAG,IAAI;CACvC;CACA,QAAQ,EAAE,mBAAmB,aAAa,aAAa,SAAS;AAClE,CAAC;;;;;;;AAQD,MAAa,iBAAiB;CAC5B,KAAK;CACL,KAAK;CACL,KAAK;CACL,QAAQ;CACR,MAAM;CACN,QAAQ;CACR,QAAQ;CACR,aAAa;CACb,OAAO;CACP,OAAO;CACP,MAAM;AACR"}

package/dist/features/column-filtering/columnFilteringFeature.types.d.cts

@@ -1,5 +1,5 @@
 import { CellData, OnChangeFn, RowData, TransformDataValueFn, Updater } from "../../types/type-utils.cjs";
-import { BuiltInFilterFn } from "../../fns/filterFns.cjs";
+import { BuiltInFilterFn } from "./filterFns.cjs";
 import { Row } from "../../types/Row.cjs";
 import { RowModel } from "../../core/row-models/coreRowModelsFeature.types.cjs";
 import { Column } from "../../types/Column.cjs";

package/dist/features/column-filtering/columnFilteringFeature.types.d.ts

@@ -1,5 +1,5 @@
 import { CellData, OnChangeFn, RowData, TransformDataValueFn, Updater } from "../../types/type-utils.js";
-import { BuiltInFilterFn } from "../../fns/filterFns.js";
+import { BuiltInFilterFn } from "./filterFns.js";
 import { Row } from "../../types/Row.js";
 import { RowModel } from "../../core/row-models/coreRowModelsFeature.types.js";
 import { Column } from "../../types/Column.js";

package/dist/{fns → features/column-filtering}/filterFns.cjs

@@ -1,5 +1,5 @@
 
-//#region src/fns/filterFns.ts
+//#region src/features/column-filtering/filterFns.ts
 /**
 * Builds a `FilterFn` from a value-level comparator plus optional resolvers.
 *

package/dist/features/column-filtering/filterFns.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterFns.cjs","names":[],"sources":["../../../src/features/column-filtering/filterFns.ts"],"sourcesContent":["import type {\n  CreatedFilterFn,\n  ExtractFilterMeta,\n  FilterFnDef,\n} from './columnFilteringFeature.types'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Row } from '../../types/Row'\n\n/**\n * Builds a `FilterFn` from a value-level comparator plus optional resolvers.\n *\n * The `filter` comparator receives the row's data value (already passed\n * through `resolveDataValue` when one is defined) and the filter value\n * (already passed through `resolveFilterValue` by the table). Keeping\n * normalization in the resolvers means a variant of an existing filter\n * function only has to swap the resolvers, not re-implement the comparison.\n *\n * The definition is attached to the returned function, so a variant can be\n * created by spreading a built-in filter function and overriding what differs:\n *\n * ```ts\n * const normalize = (value: unknown) =>\n *   String(value ?? '')\n *     .toLowerCase()\n *     .normalize('NFD')\n *     .replace(/\\p{Diacritic}/gu, '')\n *\n * const includesStringIgnoreDiacritics = constructFilterFn({\n *   ...filterFn_includesString,\n *   resolveFilterValue: normalize,\n *   resolveDataValue: normalize,\n * })\n * ```\n *\n * Note: the table applies `resolveFilterValue` once per filter before any rows\n * are tested. When calling a filter function directly (outside of a table),\n * apply it yourself: `fn(row, columnId, fn.resolveFilterValue?.(value) ?? value)`.\n */\nexport function constructFilterFn<\n  TFeatures extends TableFeatures = any,\n  TData extends RowData = any,\n>(def: FilterFnDef<TFeatures, TData>): CreatedFilterFn<TFeatures, TData> {\n  const filterFn: CreatedFilterFn<TFeatures, TData> = Object.assign(\n    <TRowFeatures extends TableFeatures, TRowData extends RowData>(\n      row: Row<TRowFeatures, TRowData>,\n      columnId: string,\n      filterValue: any,\n      addMeta?: (meta: ExtractFilterMeta<TRowFeatures>) => void,\n    ): boolean => {\n      const rawValue = row.getValue(columnId)\n      const dataValue = filterFn.resolveDataValue\n        ? filterFn.resolveDataValue(rawValue)\n        : rawValue\n      // The def's comparator is typed against the factory's TFeatures/TData;\n      // the caller's row generics are erased at this boundary.\n      return filterFn.filter(\n        dataValue,\n        filterValue,\n        row as any,\n        columnId,\n        addMeta as any,\n      )\n    },\n    def,\n  )\n  return filterFn\n}\n\n// Basic filters\n\n/**\n * Keeps rows whose column value is strictly equal to the filter value.\n *\n * Uses JavaScript `===` comparison and auto-removes empty filter values.\n */\nexport const filterFn_equals = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose column value is loosely equal to the filter value.\n *\n * Uses JavaScript `==` comparison and auto-removes empty filter values. This is\n * useful for matching string input against numeric row values.\n */\nexport const filterFn_weakEquals = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue == filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n// String filters\n\n/**\n * Keeps rows whose stringified column value includes the filter text.\n *\n * Matching is case-sensitive and empty filter values are auto-removed.\n */\nexport const filterFn_includesStringSensitive = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.includes(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val),\n  resolveDataValue: (val: any) => (val == null ? undefined : String(val)),\n})\n\n/**\n * Keeps rows whose stringified column value includes the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_includesString = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.includes(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value equals the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_equalsString = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value exactly equals the filter text.\n *\n * Matching is case-sensitive and empty filter values are auto-removed.\n */\nexport const filterFn_equalsStringSensitive = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val),\n  resolveDataValue: (val: any) => (val == null ? undefined : String(val)),\n})\n\n/**\n * Keeps rows whose stringified column value starts with the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_startsWith = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    Boolean(dataValue?.startsWith(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value ends with the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_endsWith = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.endsWith(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n// Blank filters\n\n/**\n * Keeps rows whose column value is empty.\n *\n * A value is empty when it is nullish or stringifies to whitespace only. The\n * filter value acts as an on/off flag: `false` and blank values are\n * auto-removed.\n */\nexport const filterFn_empty = constructFilterFn({\n  filter: (dataValue) => testValueEmpty(dataValue),\n  autoRemove: (val: any) => testFalsy(val) || val === false,\n})\n\n/**\n * Keeps rows whose column value is not empty.\n *\n * A value is empty when it is nullish or stringifies to whitespace only. The\n * filter value acts as an on/off flag: `false` and blank values are\n * auto-removed.\n */\nexport const filterFn_notEmpty = constructFilterFn({\n  filter: (dataValue) => !testValueEmpty(dataValue),\n  autoRemove: (val: any) => testFalsy(val) || val === false,\n})\n\n// Number filters\n\n/**\n * Keeps rows whose value is greater than the filter value.\n *\n * Numeric values are compared numerically when both sides can be coerced to\n * numbers; otherwise normalized strings are compared.\n */\nexport const filterFn_greaterThan = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    compareGreaterThan(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is greater than or equal to the filter value.\n *\n * Delegates to the built-in greater-than and strict-equality comparisons.\n */\nexport const filterFn_greaterThanOrEqualTo = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    compareGreaterThanOrEqualTo(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is less than the filter value.\n *\n * This is implemented as the inverse of greater-than-or-equal comparison.\n */\nexport const filterFn_lessThan = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    !compareGreaterThanOrEqualTo(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is less than or equal to the filter value.\n *\n * This is implemented as the inverse of greater-than comparison.\n */\nexport const filterFn_lessThanOrEqualTo = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    !compareGreaterThan(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n// Range filters\n\n/**\n * Keeps rows whose value falls between an exclusive min/max pair.\n *\n * Blank range endpoints are treated as open-ended.\n */\nexport const filterFn_between = constructFilterFn({\n  filter: (dataValue, filterValues: [unknown, unknown]) =>\n    compareBetween(dataValue, filterValues, false),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n/**\n * Keeps rows whose value falls between an inclusive min/max pair.\n *\n * Blank range endpoints are treated as open-ended.\n */\nexport const filterFn_betweenInclusive = constructFilterFn({\n  filter: (dataValue, filterValues: [unknown, unknown]) =>\n    compareBetween(dataValue, filterValues, true),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n/**\n * Keeps rows whose numeric value is inside an inclusive `[min, max]` range.\n *\n * Filter values are normalized so blank endpoints become open-ended and\n * reversed endpoints are swapped.\n */\nexport const filterFn_inNumberRange = constructFilterFn({\n  filter: (dataValue: number, filterValue: [number, number]) => {\n    const [min, max] = filterValue\n    return dataValue >= min && dataValue <= max\n  },\n  resolveFilterValue: (val: [any, any]) => {\n    const [unsafeMin, unsafeMax] = val\n\n    const parsedMin =\n      typeof unsafeMin !== 'number' ? parseFloat(unsafeMin) : unsafeMin\n    const parsedMax =\n      typeof unsafeMax !== 'number' ? parseFloat(unsafeMax) : unsafeMax\n\n    let min =\n      unsafeMin === null || Number.isNaN(parsedMin) ? -Infinity : parsedMin\n    let max =\n      unsafeMax === null || Number.isNaN(parsedMax) ? Infinity : parsedMax\n\n    if (min > max) {\n      const temp = min\n      min = max\n      max = temp\n    }\n\n    return [min, max] as const\n  },\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n// Date filters\n\n/**\n * Keeps rows whose date value is inside an inclusive `[min, max]` date range.\n *\n * Row values and range endpoints may be `Date` objects, timestamps, or\n * parseable date strings. Blank or invalid endpoints become open-ended and\n * reversed endpoints are swapped. Rows without a valid date never match.\n */\nexport const filterFn_inDateRange = constructFilterFn({\n  filter: (dataValue: number, filterValue: [number, number]) => {\n    const [min, max] = filterValue\n    return dataValue >= min && dataValue <= max\n  },\n  resolveFilterValue: (val: [any, any]) => {\n    const [unsafeMin, unsafeMax] = val\n\n    const parsedMin = toDateTimestamp(unsafeMin)\n    const parsedMax = toDateTimestamp(unsafeMax)\n\n    let min = Number.isNaN(parsedMin) ? -Infinity : parsedMin\n    let max = Number.isNaN(parsedMax) ? Infinity : parsedMax\n\n    if (min > max) {\n      const temp = min\n      min = max\n      max = temp\n    }\n\n    return [min, max] as const\n  },\n  resolveDataValue: (val: any) => toDateTimestamp(val),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n// Array filters\n\n/**\n * Keeps rows whose scalar column value equals at least one filter value.\n */\nexport const filterFn_arrHas = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue === filterValue[i]) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array or string column value includes at least one filter value.\n */\nexport const filterFn_arrIncludes = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (typeof dataValue !== 'string' && !Array.isArray(dataValue)) {\n      return false\n    }\n\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue.includes(filterValue[i] as any)) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array column value includes every filter value.\n */\nexport const filterFn_arrIncludesAll = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (!Array.isArray(dataValue)) return false\n    for (let i = 0; i < filterValue.length; i++) {\n      if (!dataValue.includes(filterValue[i])) {\n        return false\n      }\n    }\n    return true\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array column value includes at least one filter value.\n */\nexport const filterFn_arrIncludesSome = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (!Array.isArray(dataValue)) return false\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue.includes(filterValue[i])) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n// Export\n\n/**\n * The built-in filter function registry.\n *\n * Registering this full object opts out of tree-shaking: every built-in\n * filter function ends up in your bundle. Prefer importing the `filterFn_*`\n * functions you actually use and registering just those in the `filterFns`\n * slot, or passing them directly to the `filterFn` column option.\n *\n * @deprecated Import individual `filterFn_*` functions instead for a smaller\n * bundle. This export still works and is not going away in v9, but built-in\n * name resolution (including `filterFn: 'auto'`) only finds functions you\n * register yourself.\n */\nexport const filterFns = {\n  arrIncludes: filterFn_arrIncludes,\n  arrIncludesAll: filterFn_arrIncludesAll,\n  arrHas: filterFn_arrHas,\n  arrIncludesSome: filterFn_arrIncludesSome,\n  between: filterFn_between,\n  betweenInclusive: filterFn_betweenInclusive,\n  empty: filterFn_empty,\n  endsWith: filterFn_endsWith,\n  equals: filterFn_equals,\n  equalsString: filterFn_equalsString,\n  equalsStringSensitive: filterFn_equalsStringSensitive,\n  inDateRange: filterFn_inDateRange,\n  inNumberRange: filterFn_inNumberRange,\n  includesString: filterFn_includesString,\n  includesStringSensitive: filterFn_includesStringSensitive,\n  notEmpty: filterFn_notEmpty,\n  startsWith: filterFn_startsWith,\n  weakEquals: filterFn_weakEquals,\n}\n\nexport type BuiltInFilterFn = keyof typeof filterFns\n\n// Utils\n\nfunction testFalsy(val: any) {\n  return val === undefined || val === null || val === ''\n}\n\nfunction testValueEmpty(dataValue: any) {\n  return dataValue == null || String(dataValue).trim() === ''\n}\n\nfunction toDateTimestamp(value: any): number {\n  if (value instanceof Date) {\n    return value.getTime()\n  }\n  if (typeof value === 'number') {\n    return value\n  }\n  // Guard nullish and blank values explicitly: `new Date(null)` is the epoch,\n  // not an invalid date.\n  if (value == null || value === '') {\n    return NaN\n  }\n  return new Date(value).getTime()\n}\n\nfunction compareGreaterThan(dataValue: any, filterValue: any): boolean {\n  const numericDataValue = dataValue == null ? 0 : +dataValue\n  const numericFilterValue = Number(filterValue)\n\n  if (!isNaN(numericFilterValue) && !isNaN(numericDataValue)) {\n    return numericDataValue > numericFilterValue\n  }\n\n  const stringDataValue = String(dataValue ?? '')\n    .toLowerCase()\n    .trim()\n  const stringFilterValue = String(filterValue).toLowerCase().trim()\n  return stringDataValue > stringFilterValue\n}\n\nfunction compareGreaterThanOrEqualTo(dataValue: any, filterValue: any) {\n  return dataValue === filterValue || compareGreaterThan(dataValue, filterValue)\n}\n\nfunction compareBetween(\n  dataValue: any,\n  filterValues: [unknown, unknown],\n  inclusive: boolean,\n): boolean {\n  const min = filterValues[0]\n  const hasMin = min !== '' && min !== undefined\n  if (hasMin) {\n    const passesMin = inclusive\n      ? compareGreaterThanOrEqualTo(dataValue, min)\n      : compareGreaterThan(dataValue, min)\n    if (!passesMin) {\n      return false\n    }\n  }\n\n  const max = filterValues[1]\n  if (max === '' || max === undefined) {\n    return true\n  }\n\n  if (hasMin) {\n    const numericMin = Number(min)\n    const numericMax = Number(max)\n    if (!isNaN(numericMin) && !isNaN(numericMax) && numericMin > numericMax) {\n      return true\n    }\n  }\n\n  return inclusive\n    ? !compareGreaterThan(dataValue, max)\n    : !compareGreaterThanOrEqualTo(dataValue, max)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,kBAGd,KAAuE;CACvE,MAAM,WAA8C,OAAO,QAEvD,KACA,UACA,aACA,YACY;EACZ,MAAM,WAAW,IAAI,SAAS,QAAQ;EACtC,MAAM,YAAY,SAAS,mBACvB,SAAS,iBAAiB,QAAQ,IAClC;EAGJ,OAAO,SAAS,OACd,WACA,aACA,KACA,UACA,OACF;CACF,GACA,GACF;CACA,OAAO;AACT;;;;;;AASA,MAAa,kBAAkB,kBAAkB;CAC/C,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;;AAQD,MAAa,sBAAsB,kBAAkB;CACnD,SAAS,WAAW,gBAAgB,aAAa;CACjD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AASD,MAAa,mCAAmC,kBAAkB;CAChE,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG;CAC5C,mBAAmB,QAAc,OAAO,OAAO,SAAY,OAAO,GAAG;AACvE,CAAC;;;;;;;AAQD,MAAa,0BAA0B,kBAAkB;CACvD,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;AAQD,MAAa,wBAAwB,kBAAkB;CACrD,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;AAOD,MAAa,iCAAiC,kBAAkB;CAC9D,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG;CAC5C,mBAAmB,QAAc,OAAO,OAAO,SAAY,OAAO,GAAG;AACvE,CAAC;;;;;;;AAQD,MAAa,sBAAsB,kBAAkB;CACnD,SAAS,WAAW,gBAClB,QAAQ,WAAW,WAAW,WAAW,CAAC;CAC5C,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;AAQD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;;AAWD,MAAa,iBAAiB,kBAAkB;CAC9C,SAAS,cAAc,eAAe,SAAS;CAC/C,aAAa,QAAa,UAAU,GAAG,KAAK,QAAQ;AACtD,CAAC;;;;;;;;AASD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,cAAc,CAAC,eAAe,SAAS;CAChD,aAAa,QAAa,UAAU,GAAG,KAAK,QAAQ;AACtD,CAAC;;;;;;;AAUD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAW,gBAClB,mBAAmB,WAAW,WAAW;CAC3C,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,gCAAgC,kBAAkB;CAC7D,SAAS,WAAW,gBAClB,4BAA4B,WAAW,WAAW;CACpD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,WAAW,gBAClB,CAAC,4BAA4B,WAAW,WAAW;CACrD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,6BAA6B,kBAAkB;CAC1D,SAAS,WAAW,gBAClB,CAAC,mBAAmB,WAAW,WAAW;CAC5C,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AASD,MAAa,mBAAmB,kBAAkB;CAChD,SAAS,WAAW,iBAClB,eAAe,WAAW,cAAc,KAAK;CAC/C,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;AAOD,MAAa,4BAA4B,kBAAkB;CACzD,SAAS,WAAW,iBAClB,eAAe,WAAW,cAAc,IAAI;CAC9C,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;;AAQD,MAAa,yBAAyB,kBAAkB;CACtD,SAAS,WAAmB,gBAAkC;EAC5D,MAAM,CAAC,KAAK,OAAO;EACnB,OAAO,aAAa,OAAO,aAAa;CAC1C;CACA,qBAAqB,QAAoB;EACvC,MAAM,CAAC,WAAW,aAAa;EAE/B,MAAM,YACJ,OAAO,cAAc,WAAW,WAAW,SAAS,IAAI;EAC1D,MAAM,YACJ,OAAO,cAAc,WAAW,WAAW,SAAS,IAAI;EAE1D,IAAI,MACF,cAAc,QAAQ,OAAO,MAAM,SAAS,IAAI,YAAY;EAC9D,IAAI,MACF,cAAc,QAAQ,OAAO,MAAM,SAAS,IAAI,WAAW;EAE7D,IAAI,MAAM,KAAK;GACb,MAAM,OAAO;GACb,MAAM;GACN,MAAM;EACR;EAEA,OAAO,CAAC,KAAK,GAAG;CAClB;CACA,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;;;AAWD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAmB,gBAAkC;EAC5D,MAAM,CAAC,KAAK,OAAO;EACnB,OAAO,aAAa,OAAO,aAAa;CAC1C;CACA,qBAAqB,QAAoB;EACvC,MAAM,CAAC,WAAW,aAAa;EAE/B,MAAM,YAAY,gBAAgB,SAAS;EAC3C,MAAM,YAAY,gBAAgB,SAAS;EAE3C,IAAI,MAAM,OAAO,MAAM,SAAS,IAAI,YAAY;EAChD,IAAI,MAAM,OAAO,MAAM,SAAS,IAAI,WAAW;EAE/C,IAAI,MAAM,KAAK;GACb,MAAM,OAAO;GACb,MAAM;GACN,MAAM;EACR;EAEA,OAAO,CAAC,KAAK,GAAG;CAClB;CACA,mBAAmB,QAAa,gBAAgB,GAAG;CACnD,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;AAOD,MAAa,kBAAkB,kBAAkB;CAC/C,SAAS,WAAW,gBAAgC;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,cAAc,YAAY,IAC5B,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAW,gBAAgC;EAClD,IAAI,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,SAAS,GAC3D,OAAO;EAGT,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,UAAU,SAAS,YAAY,EAAS,GAC1C,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,0BAA0B,kBAAkB;CACvD,SAAS,WAAW,gBAAgC;EAClD,IAAI,CAAC,MAAM,QAAQ,SAAS,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,CAAC,UAAU,SAAS,YAAY,EAAE,GACpC,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,2BAA2B,kBAAkB;CACxD,SAAS,WAAW,gBAAgC;EAClD,IAAI,CAAC,MAAM,QAAQ,SAAS,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,UAAU,SAAS,YAAY,EAAE,GACnC,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;;;;;;;;;;;AAiBD,MAAa,YAAY;CACvB,aAAa;CACb,gBAAgB;CAChB,QAAQ;CACR,iBAAiB;CACjB,SAAS;CACT,kBAAkB;CAClB,OAAO;CACP,UAAU;CACV,QAAQ;CACR,cAAc;CACd,uBAAuB;CACvB,aAAa;CACb,eAAe;CACf,gBAAgB;CAChB,yBAAyB;CACzB,UAAU;CACV,YAAY;CACZ,YAAY;AACd;AAMA,SAAS,UAAU,KAAU;CAC3B,OAAO,QAAQ,UAAa,QAAQ,QAAQ,QAAQ;AACtD;AAEA,SAAS,eAAe,WAAgB;CACtC,OAAO,aAAa,QAAQ,OAAO,SAAS,CAAC,CAAC,KAAK,MAAM;AAC3D;AAEA,SAAS,gBAAgB,OAAoB;CAC3C,IAAI,iBAAiB,MACnB,OAAO,MAAM,QAAQ;CAEvB,IAAI,OAAO,UAAU,UACnB,OAAO;CAIT,IAAI,SAAS,QAAQ,UAAU,IAC7B,OAAO;CAET,OAAO,IAAI,KAAK,KAAK,CAAC,CAAC,QAAQ;AACjC;AAEA,SAAS,mBAAmB,WAAgB,aAA2B;CACrE,MAAM,mBAAmB,aAAa,OAAO,IAAI,CAAC;CAClD,MAAM,qBAAqB,OAAO,WAAW;CAE7C,IAAI,CAAC,MAAM,kBAAkB,KAAK,CAAC,MAAM,gBAAgB,GACvD,OAAO,mBAAmB;CAO5B,OAJwB,OAAO,aAAa,EAAE,CAAC,CAC5C,YAAY,CAAC,CACb,KAEkB,IADK,OAAO,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,KACnB;AAC3C;AAEA,SAAS,4BAA4B,WAAgB,aAAkB;CACrE,OAAO,cAAc,eAAe,mBAAmB,WAAW,WAAW;AAC/E;AAEA,SAAS,eACP,WACA,cACA,WACS;CACT,MAAM,MAAM,aAAa;CACzB,MAAM,SAAS,QAAQ,MAAM,QAAQ;CACrC,IAAI,QAIF;MAAI,EAHc,YACd,4BAA4B,WAAW,GAAG,IAC1C,mBAAmB,WAAW,GAAG,IAEnC,OAAO;CACT;CAGF,MAAM,MAAM,aAAa;CACzB,IAAI,QAAQ,MAAM,QAAQ,QACxB,OAAO;CAGT,IAAI,QAAQ;EACV,MAAM,aAAa,OAAO,GAAG;EAC7B,MAAM,aAAa,OAAO,GAAG;EAC7B,IAAI,CAAC,MAAM,UAAU,KAAK,CAAC,MAAM,UAAU,KAAK,aAAa,YAC3D,OAAO;CAEX;CAEA,OAAO,YACH,CAAC,mBAAmB,WAAW,GAAG,IAClC,CAAC,4BAA4B,WAAW,GAAG;AACjD"}

package/dist/{fns → features/column-filtering}/filterFns.d.cts

@@ -1,8 +1,8 @@
-import { RowData } from "../types/type-utils.cjs";
-import { CreatedFilterFn, FilterFnDef } from "../features/column-filtering/columnFilteringFeature.types.cjs";
-import { TableFeatures } from "../types/TableFeatures.cjs";
+import { RowData } from "../../types/type-utils.cjs";
+import { CreatedFilterFn, FilterFnDef } from "./columnFilteringFeature.types.cjs";
+import { TableFeatures } from "../../types/TableFeatures.cjs";
 
-//#region src/fns/filterFns.d.ts
+//#region src/features/column-filtering/filterFns.d.ts
 /**
  * Builds a `FilterFn` from a value-level comparator plus optional resolvers.
  *

package/dist/{fns → features/column-filtering}/filterFns.d.ts

@@ -1,8 +1,8 @@
-import { RowData } from "../types/type-utils.js";
-import { CreatedFilterFn, FilterFnDef } from "../features/column-filtering/columnFilteringFeature.types.js";
-import { TableFeatures } from "../types/TableFeatures.js";
+import { RowData } from "../../types/type-utils.js";
+import { CreatedFilterFn, FilterFnDef } from "./columnFilteringFeature.types.js";
+import { TableFeatures } from "../../types/TableFeatures.js";
 
-//#region src/fns/filterFns.d.ts
+//#region src/features/column-filtering/filterFns.d.ts
 /**
  * Builds a `FilterFn` from a value-level comparator plus optional resolvers.
  *

package/dist/{fns → features/column-filtering}/filterFns.js

@@ -1,4 +1,4 @@
-//#region src/fns/filterFns.ts
+//#region src/features/column-filtering/filterFns.ts
 /**
 * Builds a `FilterFn` from a value-level comparator plus optional resolvers.
 *

package/dist/features/column-filtering/filterFns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filterFns.js","names":[],"sources":["../../../src/features/column-filtering/filterFns.ts"],"sourcesContent":["import type {\n  CreatedFilterFn,\n  ExtractFilterMeta,\n  FilterFnDef,\n} from './columnFilteringFeature.types'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Row } from '../../types/Row'\n\n/**\n * Builds a `FilterFn` from a value-level comparator plus optional resolvers.\n *\n * The `filter` comparator receives the row's data value (already passed\n * through `resolveDataValue` when one is defined) and the filter value\n * (already passed through `resolveFilterValue` by the table). Keeping\n * normalization in the resolvers means a variant of an existing filter\n * function only has to swap the resolvers, not re-implement the comparison.\n *\n * The definition is attached to the returned function, so a variant can be\n * created by spreading a built-in filter function and overriding what differs:\n *\n * ```ts\n * const normalize = (value: unknown) =>\n *   String(value ?? '')\n *     .toLowerCase()\n *     .normalize('NFD')\n *     .replace(/\\p{Diacritic}/gu, '')\n *\n * const includesStringIgnoreDiacritics = constructFilterFn({\n *   ...filterFn_includesString,\n *   resolveFilterValue: normalize,\n *   resolveDataValue: normalize,\n * })\n * ```\n *\n * Note: the table applies `resolveFilterValue` once per filter before any rows\n * are tested. When calling a filter function directly (outside of a table),\n * apply it yourself: `fn(row, columnId, fn.resolveFilterValue?.(value) ?? value)`.\n */\nexport function constructFilterFn<\n  TFeatures extends TableFeatures = any,\n  TData extends RowData = any,\n>(def: FilterFnDef<TFeatures, TData>): CreatedFilterFn<TFeatures, TData> {\n  const filterFn: CreatedFilterFn<TFeatures, TData> = Object.assign(\n    <TRowFeatures extends TableFeatures, TRowData extends RowData>(\n      row: Row<TRowFeatures, TRowData>,\n      columnId: string,\n      filterValue: any,\n      addMeta?: (meta: ExtractFilterMeta<TRowFeatures>) => void,\n    ): boolean => {\n      const rawValue = row.getValue(columnId)\n      const dataValue = filterFn.resolveDataValue\n        ? filterFn.resolveDataValue(rawValue)\n        : rawValue\n      // The def's comparator is typed against the factory's TFeatures/TData;\n      // the caller's row generics are erased at this boundary.\n      return filterFn.filter(\n        dataValue,\n        filterValue,\n        row as any,\n        columnId,\n        addMeta as any,\n      )\n    },\n    def,\n  )\n  return filterFn\n}\n\n// Basic filters\n\n/**\n * Keeps rows whose column value is strictly equal to the filter value.\n *\n * Uses JavaScript `===` comparison and auto-removes empty filter values.\n */\nexport const filterFn_equals = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose column value is loosely equal to the filter value.\n *\n * Uses JavaScript `==` comparison and auto-removes empty filter values. This is\n * useful for matching string input against numeric row values.\n */\nexport const filterFn_weakEquals = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue == filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n// String filters\n\n/**\n * Keeps rows whose stringified column value includes the filter text.\n *\n * Matching is case-sensitive and empty filter values are auto-removed.\n */\nexport const filterFn_includesStringSensitive = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.includes(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val),\n  resolveDataValue: (val: any) => (val == null ? undefined : String(val)),\n})\n\n/**\n * Keeps rows whose stringified column value includes the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_includesString = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.includes(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value equals the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_equalsString = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value exactly equals the filter text.\n *\n * Matching is case-sensitive and empty filter values are auto-removed.\n */\nexport const filterFn_equalsStringSensitive = constructFilterFn({\n  filter: (dataValue, filterValue) => dataValue === filterValue,\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val),\n  resolveDataValue: (val: any) => (val == null ? undefined : String(val)),\n})\n\n/**\n * Keeps rows whose stringified column value starts with the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_startsWith = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    Boolean(dataValue?.startsWith(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n/**\n * Keeps rows whose stringified column value ends with the filter text.\n *\n * Both values are lowercased before comparison, and empty filter values are\n * auto-removed.\n */\nexport const filterFn_endsWith = constructFilterFn({\n  filter: (dataValue, filterValue) => Boolean(dataValue?.endsWith(filterValue)),\n  autoRemove: (val: any) => testFalsy(val),\n  resolveFilterValue: (val: any) => String(val).toLowerCase(),\n  resolveDataValue: (val: any) =>\n    val == null ? undefined : String(val).toLowerCase(),\n})\n\n// Blank filters\n\n/**\n * Keeps rows whose column value is empty.\n *\n * A value is empty when it is nullish or stringifies to whitespace only. The\n * filter value acts as an on/off flag: `false` and blank values are\n * auto-removed.\n */\nexport const filterFn_empty = constructFilterFn({\n  filter: (dataValue) => testValueEmpty(dataValue),\n  autoRemove: (val: any) => testFalsy(val) || val === false,\n})\n\n/**\n * Keeps rows whose column value is not empty.\n *\n * A value is empty when it is nullish or stringifies to whitespace only. The\n * filter value acts as an on/off flag: `false` and blank values are\n * auto-removed.\n */\nexport const filterFn_notEmpty = constructFilterFn({\n  filter: (dataValue) => !testValueEmpty(dataValue),\n  autoRemove: (val: any) => testFalsy(val) || val === false,\n})\n\n// Number filters\n\n/**\n * Keeps rows whose value is greater than the filter value.\n *\n * Numeric values are compared numerically when both sides can be coerced to\n * numbers; otherwise normalized strings are compared.\n */\nexport const filterFn_greaterThan = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    compareGreaterThan(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is greater than or equal to the filter value.\n *\n * Delegates to the built-in greater-than and strict-equality comparisons.\n */\nexport const filterFn_greaterThanOrEqualTo = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    compareGreaterThanOrEqualTo(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is less than the filter value.\n *\n * This is implemented as the inverse of greater-than-or-equal comparison.\n */\nexport const filterFn_lessThan = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    !compareGreaterThanOrEqualTo(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n/**\n * Keeps rows whose value is less than or equal to the filter value.\n *\n * This is implemented as the inverse of greater-than comparison.\n */\nexport const filterFn_lessThanOrEqualTo = constructFilterFn({\n  filter: (dataValue, filterValue) =>\n    !compareGreaterThan(dataValue, filterValue),\n  autoRemove: (val: any) => testFalsy(val),\n})\n\n// Range filters\n\n/**\n * Keeps rows whose value falls between an exclusive min/max pair.\n *\n * Blank range endpoints are treated as open-ended.\n */\nexport const filterFn_between = constructFilterFn({\n  filter: (dataValue, filterValues: [unknown, unknown]) =>\n    compareBetween(dataValue, filterValues, false),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n/**\n * Keeps rows whose value falls between an inclusive min/max pair.\n *\n * Blank range endpoints are treated as open-ended.\n */\nexport const filterFn_betweenInclusive = constructFilterFn({\n  filter: (dataValue, filterValues: [unknown, unknown]) =>\n    compareBetween(dataValue, filterValues, true),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n/**\n * Keeps rows whose numeric value is inside an inclusive `[min, max]` range.\n *\n * Filter values are normalized so blank endpoints become open-ended and\n * reversed endpoints are swapped.\n */\nexport const filterFn_inNumberRange = constructFilterFn({\n  filter: (dataValue: number, filterValue: [number, number]) => {\n    const [min, max] = filterValue\n    return dataValue >= min && dataValue <= max\n  },\n  resolveFilterValue: (val: [any, any]) => {\n    const [unsafeMin, unsafeMax] = val\n\n    const parsedMin =\n      typeof unsafeMin !== 'number' ? parseFloat(unsafeMin) : unsafeMin\n    const parsedMax =\n      typeof unsafeMax !== 'number' ? parseFloat(unsafeMax) : unsafeMax\n\n    let min =\n      unsafeMin === null || Number.isNaN(parsedMin) ? -Infinity : parsedMin\n    let max =\n      unsafeMax === null || Number.isNaN(parsedMax) ? Infinity : parsedMax\n\n    if (min > max) {\n      const temp = min\n      min = max\n      max = temp\n    }\n\n    return [min, max] as const\n  },\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n// Date filters\n\n/**\n * Keeps rows whose date value is inside an inclusive `[min, max]` date range.\n *\n * Row values and range endpoints may be `Date` objects, timestamps, or\n * parseable date strings. Blank or invalid endpoints become open-ended and\n * reversed endpoints are swapped. Rows without a valid date never match.\n */\nexport const filterFn_inDateRange = constructFilterFn({\n  filter: (dataValue: number, filterValue: [number, number]) => {\n    const [min, max] = filterValue\n    return dataValue >= min && dataValue <= max\n  },\n  resolveFilterValue: (val: [any, any]) => {\n    const [unsafeMin, unsafeMax] = val\n\n    const parsedMin = toDateTimestamp(unsafeMin)\n    const parsedMax = toDateTimestamp(unsafeMax)\n\n    let min = Number.isNaN(parsedMin) ? -Infinity : parsedMin\n    let max = Number.isNaN(parsedMax) ? Infinity : parsedMax\n\n    if (min > max) {\n      const temp = min\n      min = max\n      max = temp\n    }\n\n    return [min, max] as const\n  },\n  resolveDataValue: (val: any) => toDateTimestamp(val),\n  autoRemove: (val: any) =>\n    testFalsy(val) ||\n    (Array.isArray(val) && testFalsy(val[0]) && testFalsy(val[1])),\n})\n\n// Array filters\n\n/**\n * Keeps rows whose scalar column value equals at least one filter value.\n */\nexport const filterFn_arrHas = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue === filterValue[i]) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array or string column value includes at least one filter value.\n */\nexport const filterFn_arrIncludes = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (typeof dataValue !== 'string' && !Array.isArray(dataValue)) {\n      return false\n    }\n\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue.includes(filterValue[i] as any)) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array column value includes every filter value.\n */\nexport const filterFn_arrIncludesAll = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (!Array.isArray(dataValue)) return false\n    for (let i = 0; i < filterValue.length; i++) {\n      if (!dataValue.includes(filterValue[i])) {\n        return false\n      }\n    }\n    return true\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n/**\n * Keeps rows whose array column value includes at least one filter value.\n */\nexport const filterFn_arrIncludesSome = constructFilterFn({\n  filter: (dataValue, filterValue: Array<unknown>) => {\n    if (!Array.isArray(dataValue)) return false\n    for (let i = 0; i < filterValue.length; i++) {\n      if (dataValue.includes(filterValue[i])) {\n        return true\n      }\n    }\n    return false\n  },\n  autoRemove: (val: any) => testFalsy(val) || !val?.length,\n})\n\n// Export\n\n/**\n * The built-in filter function registry.\n *\n * Registering this full object opts out of tree-shaking: every built-in\n * filter function ends up in your bundle. Prefer importing the `filterFn_*`\n * functions you actually use and registering just those in the `filterFns`\n * slot, or passing them directly to the `filterFn` column option.\n *\n * @deprecated Import individual `filterFn_*` functions instead for a smaller\n * bundle. This export still works and is not going away in v9, but built-in\n * name resolution (including `filterFn: 'auto'`) only finds functions you\n * register yourself.\n */\nexport const filterFns = {\n  arrIncludes: filterFn_arrIncludes,\n  arrIncludesAll: filterFn_arrIncludesAll,\n  arrHas: filterFn_arrHas,\n  arrIncludesSome: filterFn_arrIncludesSome,\n  between: filterFn_between,\n  betweenInclusive: filterFn_betweenInclusive,\n  empty: filterFn_empty,\n  endsWith: filterFn_endsWith,\n  equals: filterFn_equals,\n  equalsString: filterFn_equalsString,\n  equalsStringSensitive: filterFn_equalsStringSensitive,\n  inDateRange: filterFn_inDateRange,\n  inNumberRange: filterFn_inNumberRange,\n  includesString: filterFn_includesString,\n  includesStringSensitive: filterFn_includesStringSensitive,\n  notEmpty: filterFn_notEmpty,\n  startsWith: filterFn_startsWith,\n  weakEquals: filterFn_weakEquals,\n}\n\nexport type BuiltInFilterFn = keyof typeof filterFns\n\n// Utils\n\nfunction testFalsy(val: any) {\n  return val === undefined || val === null || val === ''\n}\n\nfunction testValueEmpty(dataValue: any) {\n  return dataValue == null || String(dataValue).trim() === ''\n}\n\nfunction toDateTimestamp(value: any): number {\n  if (value instanceof Date) {\n    return value.getTime()\n  }\n  if (typeof value === 'number') {\n    return value\n  }\n  // Guard nullish and blank values explicitly: `new Date(null)` is the epoch,\n  // not an invalid date.\n  if (value == null || value === '') {\n    return NaN\n  }\n  return new Date(value).getTime()\n}\n\nfunction compareGreaterThan(dataValue: any, filterValue: any): boolean {\n  const numericDataValue = dataValue == null ? 0 : +dataValue\n  const numericFilterValue = Number(filterValue)\n\n  if (!isNaN(numericFilterValue) && !isNaN(numericDataValue)) {\n    return numericDataValue > numericFilterValue\n  }\n\n  const stringDataValue = String(dataValue ?? '')\n    .toLowerCase()\n    .trim()\n  const stringFilterValue = String(filterValue).toLowerCase().trim()\n  return stringDataValue > stringFilterValue\n}\n\nfunction compareGreaterThanOrEqualTo(dataValue: any, filterValue: any) {\n  return dataValue === filterValue || compareGreaterThan(dataValue, filterValue)\n}\n\nfunction compareBetween(\n  dataValue: any,\n  filterValues: [unknown, unknown],\n  inclusive: boolean,\n): boolean {\n  const min = filterValues[0]\n  const hasMin = min !== '' && min !== undefined\n  if (hasMin) {\n    const passesMin = inclusive\n      ? compareGreaterThanOrEqualTo(dataValue, min)\n      : compareGreaterThan(dataValue, min)\n    if (!passesMin) {\n      return false\n    }\n  }\n\n  const max = filterValues[1]\n  if (max === '' || max === undefined) {\n    return true\n  }\n\n  if (hasMin) {\n    const numericMin = Number(min)\n    const numericMax = Number(max)\n    if (!isNaN(numericMin) && !isNaN(numericMax) && numericMin > numericMax) {\n      return true\n    }\n  }\n\n  return inclusive\n    ? !compareGreaterThan(dataValue, max)\n    : !compareGreaterThanOrEqualTo(dataValue, max)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,kBAGd,KAAuE;CACvE,MAAM,WAA8C,OAAO,QAEvD,KACA,UACA,aACA,YACY;EACZ,MAAM,WAAW,IAAI,SAAS,QAAQ;EACtC,MAAM,YAAY,SAAS,mBACvB,SAAS,iBAAiB,QAAQ,IAClC;EAGJ,OAAO,SAAS,OACd,WACA,aACA,KACA,UACA,OACF;CACF,GACA,GACF;CACA,OAAO;AACT;;;;;;AASA,MAAa,kBAAkB,kBAAkB;CAC/C,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;;AAQD,MAAa,sBAAsB,kBAAkB;CACnD,SAAS,WAAW,gBAAgB,aAAa;CACjD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AASD,MAAa,mCAAmC,kBAAkB;CAChE,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG;CAC5C,mBAAmB,QAAc,OAAO,OAAO,SAAY,OAAO,GAAG;AACvE,CAAC;;;;;;;AAQD,MAAa,0BAA0B,kBAAkB;CACvD,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;AAQD,MAAa,wBAAwB,kBAAkB;CACrD,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;AAOD,MAAa,iCAAiC,kBAAkB;CAC9D,SAAS,WAAW,gBAAgB,cAAc;CAClD,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG;CAC5C,mBAAmB,QAAc,OAAO,OAAO,SAAY,OAAO,GAAG;AACvE,CAAC;;;;;;;AAQD,MAAa,sBAAsB,kBAAkB;CACnD,SAAS,WAAW,gBAClB,QAAQ,WAAW,WAAW,WAAW,CAAC;CAC5C,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;AAQD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,WAAW,gBAAgB,QAAQ,WAAW,SAAS,WAAW,CAAC;CAC5E,aAAa,QAAa,UAAU,GAAG;CACvC,qBAAqB,QAAa,OAAO,GAAG,CAAC,CAAC,YAAY;CAC1D,mBAAmB,QACjB,OAAO,OAAO,SAAY,OAAO,GAAG,CAAC,CAAC,YAAY;AACtD,CAAC;;;;;;;;AAWD,MAAa,iBAAiB,kBAAkB;CAC9C,SAAS,cAAc,eAAe,SAAS;CAC/C,aAAa,QAAa,UAAU,GAAG,KAAK,QAAQ;AACtD,CAAC;;;;;;;;AASD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,cAAc,CAAC,eAAe,SAAS;CAChD,aAAa,QAAa,UAAU,GAAG,KAAK,QAAQ;AACtD,CAAC;;;;;;;AAUD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAW,gBAClB,mBAAmB,WAAW,WAAW;CAC3C,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,gCAAgC,kBAAkB;CAC7D,SAAS,WAAW,gBAClB,4BAA4B,WAAW,WAAW;CACpD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,oBAAoB,kBAAkB;CACjD,SAAS,WAAW,gBAClB,CAAC,4BAA4B,WAAW,WAAW;CACrD,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AAOD,MAAa,6BAA6B,kBAAkB;CAC1D,SAAS,WAAW,gBAClB,CAAC,mBAAmB,WAAW,WAAW;CAC5C,aAAa,QAAa,UAAU,GAAG;AACzC,CAAC;;;;;;AASD,MAAa,mBAAmB,kBAAkB;CAChD,SAAS,WAAW,iBAClB,eAAe,WAAW,cAAc,KAAK;CAC/C,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;AAOD,MAAa,4BAA4B,kBAAkB;CACzD,SAAS,WAAW,iBAClB,eAAe,WAAW,cAAc,IAAI;CAC9C,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;;AAQD,MAAa,yBAAyB,kBAAkB;CACtD,SAAS,WAAmB,gBAAkC;EAC5D,MAAM,CAAC,KAAK,OAAO;EACnB,OAAO,aAAa,OAAO,aAAa;CAC1C;CACA,qBAAqB,QAAoB;EACvC,MAAM,CAAC,WAAW,aAAa;EAE/B,MAAM,YACJ,OAAO,cAAc,WAAW,WAAW,SAAS,IAAI;EAC1D,MAAM,YACJ,OAAO,cAAc,WAAW,WAAW,SAAS,IAAI;EAE1D,IAAI,MACF,cAAc,QAAQ,OAAO,MAAM,SAAS,IAAI,YAAY;EAC9D,IAAI,MACF,cAAc,QAAQ,OAAO,MAAM,SAAS,IAAI,WAAW;EAE7D,IAAI,MAAM,KAAK;GACb,MAAM,OAAO;GACb,MAAM;GACN,MAAM;EACR;EAEA,OAAO,CAAC,KAAK,GAAG;CAClB;CACA,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;;;;;AAWD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAmB,gBAAkC;EAC5D,MAAM,CAAC,KAAK,OAAO;EACnB,OAAO,aAAa,OAAO,aAAa;CAC1C;CACA,qBAAqB,QAAoB;EACvC,MAAM,CAAC,WAAW,aAAa;EAE/B,MAAM,YAAY,gBAAgB,SAAS;EAC3C,MAAM,YAAY,gBAAgB,SAAS;EAE3C,IAAI,MAAM,OAAO,MAAM,SAAS,IAAI,YAAY;EAChD,IAAI,MAAM,OAAO,MAAM,SAAS,IAAI,WAAW;EAE/C,IAAI,MAAM,KAAK;GACb,MAAM,OAAO;GACb,MAAM;GACN,MAAM;EACR;EAEA,OAAO,CAAC,KAAK,GAAG;CAClB;CACA,mBAAmB,QAAa,gBAAgB,GAAG;CACnD,aAAa,QACX,UAAU,GAAG,KACZ,MAAM,QAAQ,GAAG,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE;AAChE,CAAC;;;;AAOD,MAAa,kBAAkB,kBAAkB;CAC/C,SAAS,WAAW,gBAAgC;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,cAAc,YAAY,IAC5B,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,uBAAuB,kBAAkB;CACpD,SAAS,WAAW,gBAAgC;EAClD,IAAI,OAAO,cAAc,YAAY,CAAC,MAAM,QAAQ,SAAS,GAC3D,OAAO;EAGT,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,UAAU,SAAS,YAAY,EAAS,GAC1C,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,0BAA0B,kBAAkB;CACvD,SAAS,WAAW,gBAAgC;EAClD,IAAI,CAAC,MAAM,QAAQ,SAAS,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,CAAC,UAAU,SAAS,YAAY,EAAE,GACpC,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;AAKD,MAAa,2BAA2B,kBAAkB;CACxD,SAAS,WAAW,gBAAgC;EAClD,IAAI,CAAC,MAAM,QAAQ,SAAS,GAAG,OAAO;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,IAAI,UAAU,SAAS,YAAY,EAAE,GACnC,OAAO;EAGX,OAAO;CACT;CACA,aAAa,QAAa,UAAU,GAAG,KAAK,CAAC,KAAK;AACpD,CAAC;;;;;;;;;;;;;;AAiBD,MAAa,YAAY;CACvB,aAAa;CACb,gBAAgB;CAChB,QAAQ;CACR,iBAAiB;CACjB,SAAS;CACT,kBAAkB;CAClB,OAAO;CACP,UAAU;CACV,QAAQ;CACR,cAAc;CACd,uBAAuB;CACvB,aAAa;CACb,eAAe;CACf,gBAAgB;CAChB,yBAAyB;CACzB,UAAU;CACV,YAAY;CACZ,YAAY;AACd;AAMA,SAAS,UAAU,KAAU;CAC3B,OAAO,QAAQ,UAAa,QAAQ,QAAQ,QAAQ;AACtD;AAEA,SAAS,eAAe,WAAgB;CACtC,OAAO,aAAa,QAAQ,OAAO,SAAS,CAAC,CAAC,KAAK,MAAM;AAC3D;AAEA,SAAS,gBAAgB,OAAoB;CAC3C,IAAI,iBAAiB,MACnB,OAAO,MAAM,QAAQ;CAEvB,IAAI,OAAO,UAAU,UACnB,OAAO;CAIT,IAAI,SAAS,QAAQ,UAAU,IAC7B,OAAO;CAET,OAAO,IAAI,KAAK,KAAK,CAAC,CAAC,QAAQ;AACjC;AAEA,SAAS,mBAAmB,WAAgB,aAA2B;CACrE,MAAM,mBAAmB,aAAa,OAAO,IAAI,CAAC;CAClD,MAAM,qBAAqB,OAAO,WAAW;CAE7C,IAAI,CAAC,MAAM,kBAAkB,KAAK,CAAC,MAAM,gBAAgB,GACvD,OAAO,mBAAmB;CAO5B,OAJwB,OAAO,aAAa,EAAE,CAAC,CAC5C,YAAY,CAAC,CACb,KAEkB,IADK,OAAO,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,KACnB;AAC3C;AAEA,SAAS,4BAA4B,WAAgB,aAAkB;CACrE,OAAO,cAAc,eAAe,mBAAmB,WAAW,WAAW;AAC/E;AAEA,SAAS,eACP,WACA,cACA,WACS;CACT,MAAM,MAAM,aAAa;CACzB,MAAM,SAAS,QAAQ,MAAM,QAAQ;CACrC,IAAI,QAIF;MAAI,EAHc,YACd,4BAA4B,WAAW,GAAG,IAC1C,mBAAmB,WAAW,GAAG,IAEnC,OAAO;CACT;CAGF,MAAM,MAAM,aAAa;CACzB,IAAI,QAAQ,MAAM,QAAQ,QACxB,OAAO;CAGT,IAAI,QAAQ;EACV,MAAM,aAAa,OAAO,GAAG;EAC7B,MAAM,aAAa,OAAO,GAAG;EAC7B,IAAI,CAAC,MAAM,UAAU,KAAK,CAAC,MAAM,UAAU,KAAK,aAAa,YAC3D,OAAO;CAEX;CAEA,OAAO,YACH,CAAC,mBAAmB,WAAW,GAAG,IAClC,CAAC,4BAA4B,WAAW,GAAG;AACjD"}

package/dist/features/column-grouping/columnGroupingFeature.cjs

@@ -3,7 +3,7 @@ const require_columnGroupingFeature_utils = require('./columnGroupingFeature.uti
 
 //#region src/features/column-grouping/columnGroupingFeature.ts
 /**
-* Feature that adds column grouping state, aggregation defaults, and grouped row APIs.
+* Feature that adds column grouping state and grouped row APIs.
 */
 const columnGroupingFeature = {
 	getInitialState: (initialState) => {
@@ -12,12 +12,6 @@ const columnGroupingFeature = {
 			...initialState
 		};
 	},
-	getDefaultColumnDef: () => {
-		return {
-			aggregatedCell: ({ getValue }) => getValue()?.toString?.() ?? null,
-			aggregationFn: "auto"
-		};
-	},
 	getDefaultTableOptions: (table) => {
 		return {
 			onGroupingChange: require_utils.makeStateUpdater("grouping", table),
@@ -27,8 +21,7 @@ const columnGroupingFeature = {
 	assignCellPrototype: (prototype, table) => {
 		require_utils.assignPrototypeAPIs("columnGroupingFeature", prototype, table, {
 			cell_getIsGrouped: { fn: (cell) => require_columnGroupingFeature_utils.cell_getIsGrouped(cell) },
-			cell_getIsPlaceholder: { fn: (cell) => require_columnGroupingFeature_utils.cell_getIsPlaceholder(cell) },
-			cell_getIsAggregated: { fn: (cell) => require_columnGroupingFeature_utils.cell_getIsAggregated(cell) }
+			cell_getIsPlaceholder: { fn: (cell) => require_columnGroupingFeature_utils.cell_getIsPlaceholder(cell) }
 		});
 	},
 	assignColumnPrototype: (prototype, table) => {
@@ -37,9 +30,7 @@ const columnGroupingFeature = {
 			column_getCanGroup: { fn: (column) => require_columnGroupingFeature_utils.column_getCanGroup(column) },
 			column_getIsGrouped: { fn: (column) => require_columnGroupingFeature_utils.column_getIsGrouped(column) },
 			column_getGroupedIndex: { fn: (column) => require_columnGroupingFeature_utils.column_getGroupedIndex(column) },
-			column_getToggleGroupingHandler: { fn: (column) => require_columnGroupingFeature_utils.column_getToggleGroupingHandler(column) },
-			column_getAutoAggregationFn: { fn: (column) => require_columnGroupingFeature_utils.column_getAutoAggregationFn(column) },
-			column_getAggregationFn: { fn: (column) => require_columnGroupingFeature_utils.column_getAggregationFn(column) }
+			column_getToggleGroupingHandler: { fn: (column) => require_columnGroupingFeature_utils.column_getToggleGroupingHandler(column) }
 		});
 	},
 	assignRowPrototype: (prototype, table) => {

package/dist/features/column-grouping/columnGroupingFeature.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"columnGroupingFeature.cjs","names":["getDefaultGroupingState","makeStateUpdater","cell_getIsGrouped","cell_getIsPlaceholder","cell_getIsAggregated","column_toggleGrouping","column_getCanGroup","column_getIsGrouped","column_getGroupedIndex","column_getToggleGroupingHandler","column_getAutoAggregationFn","column_getAggregationFn","row_getIsGrouped","row_getGroupingValue","makeObjectMap","table_setGrouping","table_resetGrouping"],"sources":["../../../src/features/column-grouping/columnGroupingFeature.ts"],"sourcesContent":["import {\n  assignPrototypeAPIs,\n  assignTableAPIs,\n  makeObjectMap,\n  makeStateUpdater,\n} from '../../utils'\nimport {\n  cell_getIsAggregated,\n  cell_getIsGrouped,\n  cell_getIsPlaceholder,\n  column_getAggregationFn,\n  column_getAutoAggregationFn,\n  column_getCanGroup,\n  column_getGroupedIndex,\n  column_getIsGrouped,\n  column_getToggleGroupingHandler,\n  column_toggleGrouping,\n  getDefaultGroupingState,\n  row_getGroupingValue,\n  row_getIsGrouped,\n  table_resetGrouping,\n  table_setGrouping,\n} from './columnGroupingFeature.utils'\nimport type { TableFeature } from '../../types/TableFeatures'\n\n/**\n * Feature that adds column grouping state, aggregation defaults, and grouped row APIs.\n */\nexport const columnGroupingFeature: TableFeature = {\n  getInitialState: (initialState) => {\n    return {\n      grouping: getDefaultGroupingState(),\n      ...initialState,\n    }\n  },\n\n  getDefaultColumnDef: () => {\n    return {\n      aggregatedCell: ({ getValue }: any) => getValue()?.toString?.() ?? null,\n      aggregationFn: 'auto',\n    }\n  },\n\n  getDefaultTableOptions: (table) => {\n    return {\n      onGroupingChange: makeStateUpdater('grouping', table),\n      groupedColumnMode: 'reorder',\n    }\n  },\n\n  assignCellPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      cell_getIsGrouped: {\n        fn: (cell) => cell_getIsGrouped(cell),\n      },\n      cell_getIsPlaceholder: {\n        fn: (cell) => cell_getIsPlaceholder(cell),\n      },\n      cell_getIsAggregated: {\n        fn: (cell) => cell_getIsAggregated(cell),\n      },\n    })\n  },\n\n  assignColumnPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      column_toggleGrouping: {\n        fn: (column) => column_toggleGrouping(column),\n      },\n      column_getCanGroup: {\n        fn: (column) => column_getCanGroup(column),\n      },\n      column_getIsGrouped: {\n        fn: (column) => column_getIsGrouped(column),\n      },\n      column_getGroupedIndex: {\n        fn: (column) => column_getGroupedIndex(column),\n      },\n      column_getToggleGroupingHandler: {\n        fn: (column) => column_getToggleGroupingHandler(column),\n      },\n      column_getAutoAggregationFn: {\n        fn: (column) => column_getAutoAggregationFn(column),\n      },\n      column_getAggregationFn: {\n        fn: (column) => column_getAggregationFn(column),\n      },\n    })\n  },\n\n  assignRowPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      row_getIsGrouped: {\n        fn: (row) => row_getIsGrouped(row),\n      },\n      row_getGroupingValue: {\n        fn: (row, columnId) => row_getGroupingValue(row, columnId),\n      },\n    })\n  },\n\n  initRowInstanceData: (row) => {\n    ;(row as any)._groupingValuesCache = makeObjectMap()\n  },\n\n  constructTableAPIs: (table) => {\n    assignTableAPIs('columnGroupingFeature', table, {\n      table_setGrouping: {\n        fn: (updater) => table_setGrouping(table, updater),\n      },\n      table_resetGrouping: {\n        fn: (defaultState) => table_resetGrouping(table, defaultState),\n      },\n    })\n  },\n}\n"],"mappings":";;;;;;;AA4BA,MAAa,wBAAsC;CACjD,kBAAkB,iBAAiB;EACjC,OAAO;GACL,UAAUA,4DAAwB;GAClC,GAAG;EACL;CACF;CAEA,2BAA2B;EACzB,OAAO;GACL,iBAAiB,EAAE,eAAoB,SAAS,CAAC,EAAE,WAAW,KAAK;GACnE,eAAe;EACjB;CACF;CAEA,yBAAyB,UAAU;EACjC,OAAO;GACL,kBAAkBC,+BAAiB,YAAY,KAAK;GACpD,mBAAmB;EACrB;CACF;CAEA,sBAAsB,WAAW,UAAU;EACzC,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,mBAAmB,EACjB,KAAK,SAASC,sDAAkB,IAAI,EACtC;GACA,uBAAuB,EACrB,KAAK,SAASC,0DAAsB,IAAI,EAC1C;GACA,sBAAsB,EACpB,KAAK,SAASC,yDAAqB,IAAI,EACzC;EACF,CAAC;CACH;CAEA,wBAAwB,WAAW,UAAU;EAC3C,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,uBAAuB,EACrB,KAAK,WAAWC,0DAAsB,MAAM,EAC9C;GACA,oBAAoB,EAClB,KAAK,WAAWC,uDAAmB,MAAM,EAC3C;GACA,qBAAqB,EACnB,KAAK,WAAWC,wDAAoB,MAAM,EAC5C;GACA,wBAAwB,EACtB,KAAK,WAAWC,2DAAuB,MAAM,EAC/C;GACA,iCAAiC,EAC/B,KAAK,WAAWC,oEAAgC,MAAM,EACxD;GACA,6BAA6B,EAC3B,KAAK,WAAWC,gEAA4B,MAAM,EACpD;GACA,yBAAyB,EACvB,KAAK,WAAWC,4DAAwB,MAAM,EAChD;EACF,CAAC;CACH;CAEA,qBAAqB,WAAW,UAAU;EACxC,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,kBAAkB,EAChB,KAAK,QAAQC,qDAAiB,GAAG,EACnC;GACA,sBAAsB,EACpB,KAAK,KAAK,aAAaC,yDAAqB,KAAK,QAAQ,EAC3D;EACF,CAAC;CACH;CAEA,sBAAsB,QAAQ;EAC3B,AAAC,IAAY,uBAAuBC,4BAAc;CACrD;CAEA,qBAAqB,UAAU;EAC7B,8BAAgB,yBAAyB,OAAO;GAC9C,mBAAmB,EACjB,KAAK,YAAYC,sDAAkB,OAAO,OAAO,EACnD;GACA,qBAAqB,EACnB,KAAK,iBAAiBC,wDAAoB,OAAO,YAAY,EAC/D;EACF,CAAC;CACH;AACF"}
+{"version":3,"file":"columnGroupingFeature.cjs","names":["getDefaultGroupingState","makeStateUpdater","cell_getIsGrouped","cell_getIsPlaceholder","column_toggleGrouping","column_getCanGroup","column_getIsGrouped","column_getGroupedIndex","column_getToggleGroupingHandler","row_getIsGrouped","row_getGroupingValue","makeObjectMap","table_setGrouping","table_resetGrouping"],"sources":["../../../src/features/column-grouping/columnGroupingFeature.ts"],"sourcesContent":["import {\n  assignPrototypeAPIs,\n  assignTableAPIs,\n  makeObjectMap,\n  makeStateUpdater,\n} from '../../utils'\nimport {\n  cell_getIsGrouped,\n  cell_getIsPlaceholder,\n  column_getCanGroup,\n  column_getGroupedIndex,\n  column_getIsGrouped,\n  column_getToggleGroupingHandler,\n  column_toggleGrouping,\n  getDefaultGroupingState,\n  row_getGroupingValue,\n  row_getIsGrouped,\n  table_resetGrouping,\n  table_setGrouping,\n} from './columnGroupingFeature.utils'\nimport type { TableFeature } from '../../types/TableFeatures'\n\n/**\n * Feature that adds column grouping state and grouped row APIs.\n */\nexport const columnGroupingFeature: TableFeature = {\n  getInitialState: (initialState) => {\n    return {\n      grouping: getDefaultGroupingState(),\n      ...initialState,\n    }\n  },\n\n  getDefaultTableOptions: (table) => {\n    return {\n      onGroupingChange: makeStateUpdater('grouping', table),\n      groupedColumnMode: 'reorder',\n    }\n  },\n\n  assignCellPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      cell_getIsGrouped: {\n        fn: (cell) => cell_getIsGrouped(cell),\n      },\n      cell_getIsPlaceholder: {\n        fn: (cell) => cell_getIsPlaceholder(cell),\n      },\n    })\n  },\n\n  assignColumnPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      column_toggleGrouping: {\n        fn: (column) => column_toggleGrouping(column),\n      },\n      column_getCanGroup: {\n        fn: (column) => column_getCanGroup(column),\n      },\n      column_getIsGrouped: {\n        fn: (column) => column_getIsGrouped(column),\n      },\n      column_getGroupedIndex: {\n        fn: (column) => column_getGroupedIndex(column),\n      },\n      column_getToggleGroupingHandler: {\n        fn: (column) => column_getToggleGroupingHandler(column),\n      },\n    })\n  },\n\n  assignRowPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      row_getIsGrouped: {\n        fn: (row) => row_getIsGrouped(row),\n      },\n      row_getGroupingValue: {\n        fn: (row, columnId) => row_getGroupingValue(row, columnId),\n      },\n    })\n  },\n\n  initRowInstanceData: (row) => {\n    ;(row as any)._groupingValuesCache = makeObjectMap()\n  },\n\n  constructTableAPIs: (table) => {\n    assignTableAPIs('columnGroupingFeature', table, {\n      table_setGrouping: {\n        fn: (updater) => table_setGrouping(table, updater),\n      },\n      table_resetGrouping: {\n        fn: (defaultState) => table_resetGrouping(table, defaultState),\n      },\n    })\n  },\n}\n"],"mappings":";;;;;;;AAyBA,MAAa,wBAAsC;CACjD,kBAAkB,iBAAiB;EACjC,OAAO;GACL,UAAUA,4DAAwB;GAClC,GAAG;EACL;CACF;CAEA,yBAAyB,UAAU;EACjC,OAAO;GACL,kBAAkBC,+BAAiB,YAAY,KAAK;GACpD,mBAAmB;EACrB;CACF;CAEA,sBAAsB,WAAW,UAAU;EACzC,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,mBAAmB,EACjB,KAAK,SAASC,sDAAkB,IAAI,EACtC;GACA,uBAAuB,EACrB,KAAK,SAASC,0DAAsB,IAAI,EAC1C;EACF,CAAC;CACH;CAEA,wBAAwB,WAAW,UAAU;EAC3C,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,uBAAuB,EACrB,KAAK,WAAWC,0DAAsB,MAAM,EAC9C;GACA,oBAAoB,EAClB,KAAK,WAAWC,uDAAmB,MAAM,EAC3C;GACA,qBAAqB,EACnB,KAAK,WAAWC,wDAAoB,MAAM,EAC5C;GACA,wBAAwB,EACtB,KAAK,WAAWC,2DAAuB,MAAM,EAC/C;GACA,iCAAiC,EAC/B,KAAK,WAAWC,oEAAgC,MAAM,EACxD;EACF,CAAC;CACH;CAEA,qBAAqB,WAAW,UAAU;EACxC,kCAAoB,yBAAyB,WAAW,OAAO;GAC7D,kBAAkB,EAChB,KAAK,QAAQC,qDAAiB,GAAG,EACnC;GACA,sBAAsB,EACpB,KAAK,KAAK,aAAaC,yDAAqB,KAAK,QAAQ,EAC3D;EACF,CAAC;CACH;CAEA,sBAAsB,QAAQ;EAC3B,AAAC,IAAY,uBAAuBC,4BAAc;CACrD;CAEA,qBAAqB,UAAU;EAC7B,8BAAgB,yBAAyB,OAAO;GAC9C,mBAAmB,EACjB,KAAK,YAAYC,sDAAkB,OAAO,OAAO,EACnD;GACA,qBAAqB,EACnB,KAAK,iBAAiBC,wDAAoB,OAAO,YAAY,EAC/D;EACF,CAAC;CACH;AACF"}

package/dist/features/column-grouping/columnGroupingFeature.d.cts

@@ -2,7 +2,7 @@ import { TableFeature } from "../../types/TableFeatures.cjs";
 
 //#region src/features/column-grouping/columnGroupingFeature.d.ts
 /**
- * Feature that adds column grouping state, aggregation defaults, and grouped row APIs.
+ * Feature that adds column grouping state and grouped row APIs.
  */
 declare const columnGroupingFeature: TableFeature;
 //#endregion

package/dist/features/column-grouping/columnGroupingFeature.d.ts

@@ -2,7 +2,7 @@ import { TableFeature } from "../../types/TableFeatures.js";
 
 //#region src/features/column-grouping/columnGroupingFeature.d.ts
 /**
- * Feature that adds column grouping state, aggregation defaults, and grouped row APIs.
+ * Feature that adds column grouping state and grouped row APIs.
  */
 declare const columnGroupingFeature: TableFeature;
 //#endregion

package/dist/features/column-grouping/columnGroupingFeature.js

@@ -1,9 +1,9 @@
 import { assignPrototypeAPIs, assignTableAPIs, makeObjectMap, makeStateUpdater } from "../../utils.js";
-import { cell_getIsAggregated, cell_getIsGrouped, cell_getIsPlaceholder, column_getAggregationFn, column_getAutoAggregationFn, column_getCanGroup, column_getGroupedIndex, column_getIsGrouped, column_getToggleGroupingHandler, column_toggleGrouping, getDefaultGroupingState, row_getGroupingValue, row_getIsGrouped, table_resetGrouping, table_setGrouping } from "./columnGroupingFeature.utils.js";
+import { cell_getIsGrouped, cell_getIsPlaceholder, column_getCanGroup, column_getGroupedIndex, column_getIsGrouped, column_getToggleGroupingHandler, column_toggleGrouping, getDefaultGroupingState, row_getGroupingValue, row_getIsGrouped, table_resetGrouping, table_setGrouping } from "./columnGroupingFeature.utils.js";
 
 //#region src/features/column-grouping/columnGroupingFeature.ts
 /**
-* Feature that adds column grouping state, aggregation defaults, and grouped row APIs.
+* Feature that adds column grouping state and grouped row APIs.
 */
 const columnGroupingFeature = {
 	getInitialState: (initialState) => {
@@ -12,12 +12,6 @@ const columnGroupingFeature = {
 			...initialState
 		};
 	},
-	getDefaultColumnDef: () => {
-		return {
-			aggregatedCell: ({ getValue }) => getValue()?.toString?.() ?? null,
-			aggregationFn: "auto"
-		};
-	},
 	getDefaultTableOptions: (table) => {
 		return {
 			onGroupingChange: makeStateUpdater("grouping", table),
@@ -27,8 +21,7 @@ const columnGroupingFeature = {
 	assignCellPrototype: (prototype, table) => {
 		assignPrototypeAPIs("columnGroupingFeature", prototype, table, {
 			cell_getIsGrouped: { fn: (cell) => cell_getIsGrouped(cell) },
-			cell_getIsPlaceholder: { fn: (cell) => cell_getIsPlaceholder(cell) },
-			cell_getIsAggregated: { fn: (cell) => cell_getIsAggregated(cell) }
+			cell_getIsPlaceholder: { fn: (cell) => cell_getIsPlaceholder(cell) }
 		});
 	},
 	assignColumnPrototype: (prototype, table) => {
@@ -37,9 +30,7 @@ const columnGroupingFeature = {
 			column_getCanGroup: { fn: (column) => column_getCanGroup(column) },
 			column_getIsGrouped: { fn: (column) => column_getIsGrouped(column) },
 			column_getGroupedIndex: { fn: (column) => column_getGroupedIndex(column) },
-			column_getToggleGroupingHandler: { fn: (column) => column_getToggleGroupingHandler(column) },
-			column_getAutoAggregationFn: { fn: (column) => column_getAutoAggregationFn(column) },
-			column_getAggregationFn: { fn: (column) => column_getAggregationFn(column) }
+			column_getToggleGroupingHandler: { fn: (column) => column_getToggleGroupingHandler(column) }
 		});
 	},
 	assignRowPrototype: (prototype, table) => {

package/dist/features/column-grouping/columnGroupingFeature.js.map

@@ -1 +1 @@
-{"version":3,"file":"columnGroupingFeature.js","names":[],"sources":["../../../src/features/column-grouping/columnGroupingFeature.ts"],"sourcesContent":["import {\n  assignPrototypeAPIs,\n  assignTableAPIs,\n  makeObjectMap,\n  makeStateUpdater,\n} from '../../utils'\nimport {\n  cell_getIsAggregated,\n  cell_getIsGrouped,\n  cell_getIsPlaceholder,\n  column_getAggregationFn,\n  column_getAutoAggregationFn,\n  column_getCanGroup,\n  column_getGroupedIndex,\n  column_getIsGrouped,\n  column_getToggleGroupingHandler,\n  column_toggleGrouping,\n  getDefaultGroupingState,\n  row_getGroupingValue,\n  row_getIsGrouped,\n  table_resetGrouping,\n  table_setGrouping,\n} from './columnGroupingFeature.utils'\nimport type { TableFeature } from '../../types/TableFeatures'\n\n/**\n * Feature that adds column grouping state, aggregation defaults, and grouped row APIs.\n */\nexport const columnGroupingFeature: TableFeature = {\n  getInitialState: (initialState) => {\n    return {\n      grouping: getDefaultGroupingState(),\n      ...initialState,\n    }\n  },\n\n  getDefaultColumnDef: () => {\n    return {\n      aggregatedCell: ({ getValue }: any) => getValue()?.toString?.() ?? null,\n      aggregationFn: 'auto',\n    }\n  },\n\n  getDefaultTableOptions: (table) => {\n    return {\n      onGroupingChange: makeStateUpdater('grouping', table),\n      groupedColumnMode: 'reorder',\n    }\n  },\n\n  assignCellPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      cell_getIsGrouped: {\n        fn: (cell) => cell_getIsGrouped(cell),\n      },\n      cell_getIsPlaceholder: {\n        fn: (cell) => cell_getIsPlaceholder(cell),\n      },\n      cell_getIsAggregated: {\n        fn: (cell) => cell_getIsAggregated(cell),\n      },\n    })\n  },\n\n  assignColumnPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      column_toggleGrouping: {\n        fn: (column) => column_toggleGrouping(column),\n      },\n      column_getCanGroup: {\n        fn: (column) => column_getCanGroup(column),\n      },\n      column_getIsGrouped: {\n        fn: (column) => column_getIsGrouped(column),\n      },\n      column_getGroupedIndex: {\n        fn: (column) => column_getGroupedIndex(column),\n      },\n      column_getToggleGroupingHandler: {\n        fn: (column) => column_getToggleGroupingHandler(column),\n      },\n      column_getAutoAggregationFn: {\n        fn: (column) => column_getAutoAggregationFn(column),\n      },\n      column_getAggregationFn: {\n        fn: (column) => column_getAggregationFn(column),\n      },\n    })\n  },\n\n  assignRowPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      row_getIsGrouped: {\n        fn: (row) => row_getIsGrouped(row),\n      },\n      row_getGroupingValue: {\n        fn: (row, columnId) => row_getGroupingValue(row, columnId),\n      },\n    })\n  },\n\n  initRowInstanceData: (row) => {\n    ;(row as any)._groupingValuesCache = makeObjectMap()\n  },\n\n  constructTableAPIs: (table) => {\n    assignTableAPIs('columnGroupingFeature', table, {\n      table_setGrouping: {\n        fn: (updater) => table_setGrouping(table, updater),\n      },\n      table_resetGrouping: {\n        fn: (defaultState) => table_resetGrouping(table, defaultState),\n      },\n    })\n  },\n}\n"],"mappings":";;;;;;;AA4BA,MAAa,wBAAsC;CACjD,kBAAkB,iBAAiB;EACjC,OAAO;GACL,UAAU,wBAAwB;GAClC,GAAG;EACL;CACF;CAEA,2BAA2B;EACzB,OAAO;GACL,iBAAiB,EAAE,eAAoB,SAAS,CAAC,EAAE,WAAW,KAAK;GACnE,eAAe;EACjB;CACF;CAEA,yBAAyB,UAAU;EACjC,OAAO;GACL,kBAAkB,iBAAiB,YAAY,KAAK;GACpD,mBAAmB;EACrB;CACF;CAEA,sBAAsB,WAAW,UAAU;EACzC,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,mBAAmB,EACjB,KAAK,SAAS,kBAAkB,IAAI,EACtC;GACA,uBAAuB,EACrB,KAAK,SAAS,sBAAsB,IAAI,EAC1C;GACA,sBAAsB,EACpB,KAAK,SAAS,qBAAqB,IAAI,EACzC;EACF,CAAC;CACH;CAEA,wBAAwB,WAAW,UAAU;EAC3C,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,uBAAuB,EACrB,KAAK,WAAW,sBAAsB,MAAM,EAC9C;GACA,oBAAoB,EAClB,KAAK,WAAW,mBAAmB,MAAM,EAC3C;GACA,qBAAqB,EACnB,KAAK,WAAW,oBAAoB,MAAM,EAC5C;GACA,wBAAwB,EACtB,KAAK,WAAW,uBAAuB,MAAM,EAC/C;GACA,iCAAiC,EAC/B,KAAK,WAAW,gCAAgC,MAAM,EACxD;GACA,6BAA6B,EAC3B,KAAK,WAAW,4BAA4B,MAAM,EACpD;GACA,yBAAyB,EACvB,KAAK,WAAW,wBAAwB,MAAM,EAChD;EACF,CAAC;CACH;CAEA,qBAAqB,WAAW,UAAU;EACxC,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,kBAAkB,EAChB,KAAK,QAAQ,iBAAiB,GAAG,EACnC;GACA,sBAAsB,EACpB,KAAK,KAAK,aAAa,qBAAqB,KAAK,QAAQ,EAC3D;EACF,CAAC;CACH;CAEA,sBAAsB,QAAQ;EAC3B,AAAC,IAAY,uBAAuB,cAAc;CACrD;CAEA,qBAAqB,UAAU;EAC7B,gBAAgB,yBAAyB,OAAO;GAC9C,mBAAmB,EACjB,KAAK,YAAY,kBAAkB,OAAO,OAAO,EACnD;GACA,qBAAqB,EACnB,KAAK,iBAAiB,oBAAoB,OAAO,YAAY,EAC/D;EACF,CAAC;CACH;AACF"}
+{"version":3,"file":"columnGroupingFeature.js","names":[],"sources":["../../../src/features/column-grouping/columnGroupingFeature.ts"],"sourcesContent":["import {\n  assignPrototypeAPIs,\n  assignTableAPIs,\n  makeObjectMap,\n  makeStateUpdater,\n} from '../../utils'\nimport {\n  cell_getIsGrouped,\n  cell_getIsPlaceholder,\n  column_getCanGroup,\n  column_getGroupedIndex,\n  column_getIsGrouped,\n  column_getToggleGroupingHandler,\n  column_toggleGrouping,\n  getDefaultGroupingState,\n  row_getGroupingValue,\n  row_getIsGrouped,\n  table_resetGrouping,\n  table_setGrouping,\n} from './columnGroupingFeature.utils'\nimport type { TableFeature } from '../../types/TableFeatures'\n\n/**\n * Feature that adds column grouping state and grouped row APIs.\n */\nexport const columnGroupingFeature: TableFeature = {\n  getInitialState: (initialState) => {\n    return {\n      grouping: getDefaultGroupingState(),\n      ...initialState,\n    }\n  },\n\n  getDefaultTableOptions: (table) => {\n    return {\n      onGroupingChange: makeStateUpdater('grouping', table),\n      groupedColumnMode: 'reorder',\n    }\n  },\n\n  assignCellPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      cell_getIsGrouped: {\n        fn: (cell) => cell_getIsGrouped(cell),\n      },\n      cell_getIsPlaceholder: {\n        fn: (cell) => cell_getIsPlaceholder(cell),\n      },\n    })\n  },\n\n  assignColumnPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      column_toggleGrouping: {\n        fn: (column) => column_toggleGrouping(column),\n      },\n      column_getCanGroup: {\n        fn: (column) => column_getCanGroup(column),\n      },\n      column_getIsGrouped: {\n        fn: (column) => column_getIsGrouped(column),\n      },\n      column_getGroupedIndex: {\n        fn: (column) => column_getGroupedIndex(column),\n      },\n      column_getToggleGroupingHandler: {\n        fn: (column) => column_getToggleGroupingHandler(column),\n      },\n    })\n  },\n\n  assignRowPrototype: (prototype, table) => {\n    assignPrototypeAPIs('columnGroupingFeature', prototype, table, {\n      row_getIsGrouped: {\n        fn: (row) => row_getIsGrouped(row),\n      },\n      row_getGroupingValue: {\n        fn: (row, columnId) => row_getGroupingValue(row, columnId),\n      },\n    })\n  },\n\n  initRowInstanceData: (row) => {\n    ;(row as any)._groupingValuesCache = makeObjectMap()\n  },\n\n  constructTableAPIs: (table) => {\n    assignTableAPIs('columnGroupingFeature', table, {\n      table_setGrouping: {\n        fn: (updater) => table_setGrouping(table, updater),\n      },\n      table_resetGrouping: {\n        fn: (defaultState) => table_resetGrouping(table, defaultState),\n      },\n    })\n  },\n}\n"],"mappings":";;;;;;;AAyBA,MAAa,wBAAsC;CACjD,kBAAkB,iBAAiB;EACjC,OAAO;GACL,UAAU,wBAAwB;GAClC,GAAG;EACL;CACF;CAEA,yBAAyB,UAAU;EACjC,OAAO;GACL,kBAAkB,iBAAiB,YAAY,KAAK;GACpD,mBAAmB;EACrB;CACF;CAEA,sBAAsB,WAAW,UAAU;EACzC,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,mBAAmB,EACjB,KAAK,SAAS,kBAAkB,IAAI,EACtC;GACA,uBAAuB,EACrB,KAAK,SAAS,sBAAsB,IAAI,EAC1C;EACF,CAAC;CACH;CAEA,wBAAwB,WAAW,UAAU;EAC3C,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,uBAAuB,EACrB,KAAK,WAAW,sBAAsB,MAAM,EAC9C;GACA,oBAAoB,EAClB,KAAK,WAAW,mBAAmB,MAAM,EAC3C;GACA,qBAAqB,EACnB,KAAK,WAAW,oBAAoB,MAAM,EAC5C;GACA,wBAAwB,EACtB,KAAK,WAAW,uBAAuB,MAAM,EAC/C;GACA,iCAAiC,EAC/B,KAAK,WAAW,gCAAgC,MAAM,EACxD;EACF,CAAC;CACH;CAEA,qBAAqB,WAAW,UAAU;EACxC,oBAAoB,yBAAyB,WAAW,OAAO;GAC7D,kBAAkB,EAChB,KAAK,QAAQ,iBAAiB,GAAG,EACnC;GACA,sBAAsB,EACpB,KAAK,KAAK,aAAa,qBAAqB,KAAK,QAAQ,EAC3D;EACF,CAAC;CACH;CAEA,sBAAsB,QAAQ;EAC3B,AAAC,IAAY,uBAAuB,cAAc;CACrD;CAEA,qBAAqB,UAAU;EAC7B,gBAAgB,yBAAyB,OAAO;GAC9C,mBAAmB,EACjB,KAAK,YAAY,kBAAkB,OAAO,OAAO,EACnD;GACA,qBAAqB,EACnB,KAAK,iBAAiB,oBAAoB,OAAO,YAAY,EAC/D;EACF,CAAC;CACH;AACF"}