@tanstack/table-core 9.0.0-beta.52 → 9.0.0-beta.53

package/dist/features/column-filtering/filterFns.d.cts

@@ -1,210 +0,0 @@
-import { RowData } from "../../types/type-utils.cjs";
-import { CreatedFilterFn, FilterFnDef } from "./columnFilteringFeature.types.cjs";
-import { TableFeatures } from "../../types/TableFeatures.cjs";
-
-//#region src/features/column-filtering/filterFns.d.ts
-/**
- * Builds a `FilterFn` from a value-level comparator plus optional resolvers.
- *
- * The `filter` comparator receives the row's data value (already passed
- * through `resolveDataValue` when one is defined) and the filter value
- * (already passed through `resolveFilterValue` by the table). Keeping
- * normalization in the resolvers means a variant of an existing filter
- * function only has to swap the resolvers, not re-implement the comparison.
- *
- * The definition is attached to the returned function, so a variant can be
- * created by spreading a built-in filter function and overriding what differs:
- *
- * ```ts
- * const normalize = (value: unknown) =>
- *   String(value ?? '')
- *     .toLowerCase()
- *     .normalize('NFD')
- *     .replace(/\p{Diacritic}/gu, '')
- *
- * const includesStringIgnoreDiacritics = constructFilterFn({
- *   ...filterFn_includesString,
- *   resolveFilterValue: normalize,
- *   resolveDataValue: normalize,
- * })
- * ```
- *
- * Note: the table applies `resolveFilterValue` once per filter before any rows
- * are tested. When calling a filter function directly (outside of a table),
- * apply it yourself: `fn(row, columnId, fn.resolveFilterValue?.(value) ?? value)`.
- */
-declare function constructFilterFn<TFeatures extends TableFeatures = any, TData extends RowData = any>(def: FilterFnDef<TFeatures, TData>): CreatedFilterFn<TFeatures, TData>;
-/**
- * Keeps rows whose column value is strictly equal to the filter value.
- *
- * Uses JavaScript `===` comparison and auto-removes empty filter values.
- */
-declare const filterFn_equals: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose column value is loosely equal to the filter value.
- *
- * Uses JavaScript `==` comparison and auto-removes empty filter values. This is
- * useful for matching string input against numeric row values.
- */
-declare const filterFn_weakEquals: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value includes the filter text.
- *
- * Matching is case-sensitive and empty filter values are auto-removed.
- */
-declare const filterFn_includesStringSensitive: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value includes the filter text.
- *
- * Both values are lowercased before comparison, and empty filter values are
- * auto-removed.
- */
-declare const filterFn_includesString: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value equals the filter text.
- *
- * Both values are lowercased before comparison, and empty filter values are
- * auto-removed.
- */
-declare const filterFn_equalsString: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value exactly equals the filter text.
- *
- * Matching is case-sensitive and empty filter values are auto-removed.
- */
-declare const filterFn_equalsStringSensitive: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value starts with the filter text.
- *
- * Both values are lowercased before comparison, and empty filter values are
- * auto-removed.
- */
-declare const filterFn_startsWith: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose stringified column value ends with the filter text.
- *
- * Both values are lowercased before comparison, and empty filter values are
- * auto-removed.
- */
-declare const filterFn_endsWith: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose column value is empty.
- *
- * A value is empty when it is nullish or stringifies to whitespace only. The
- * filter value acts as an on/off flag: `false` and blank values are
- * auto-removed.
- */
-declare const filterFn_empty: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose column value is not empty.
- *
- * A value is empty when it is nullish or stringifies to whitespace only. The
- * filter value acts as an on/off flag: `false` and blank values are
- * auto-removed.
- */
-declare const filterFn_notEmpty: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value is greater than the filter value.
- *
- * Numeric values are compared numerically when both sides can be coerced to
- * numbers; otherwise normalized strings are compared.
- */
-declare const filterFn_greaterThan: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value is greater than or equal to the filter value.
- *
- * Delegates to the built-in greater-than and strict-equality comparisons.
- */
-declare const filterFn_greaterThanOrEqualTo: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value is less than the filter value.
- *
- * This is implemented as the inverse of greater-than-or-equal comparison.
- */
-declare const filterFn_lessThan: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value is less than or equal to the filter value.
- *
- * This is implemented as the inverse of greater-than comparison.
- */
-declare const filterFn_lessThanOrEqualTo: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value falls between an exclusive min/max pair.
- *
- * Blank range endpoints are treated as open-ended.
- */
-declare const filterFn_between: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose value falls between an inclusive min/max pair.
- *
- * Blank range endpoints are treated as open-ended.
- */
-declare const filterFn_betweenInclusive: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose numeric value is inside an inclusive `[min, max]` range.
- *
- * Filter values are normalized so blank endpoints become open-ended and
- * reversed endpoints are swapped.
- */
-declare const filterFn_inNumberRange: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose date value is inside an inclusive `[min, max]` date range.
- *
- * Row values and range endpoints may be `Date` objects, timestamps, or
- * parseable date strings. Blank or invalid endpoints become open-ended and
- * reversed endpoints are swapped. Rows without a valid date never match.
- */
-declare const filterFn_inDateRange: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose scalar column value equals at least one filter value.
- */
-declare const filterFn_arrHas: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose array or string column value includes at least one filter value.
- */
-declare const filterFn_arrIncludes: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose array column value includes every filter value.
- */
-declare const filterFn_arrIncludesAll: CreatedFilterFn<any, any>;
-/**
- * Keeps rows whose array column value includes at least one filter value.
- */
-declare const filterFn_arrIncludesSome: CreatedFilterFn<any, any>;
-/**
- * The built-in filter function registry.
- *
- * Registering this full object opts out of tree-shaking: every built-in
- * filter function ends up in your bundle. Prefer importing the `filterFn_*`
- * functions you actually use and registering just those in the `filterFns`
- * slot, or passing them directly to the `filterFn` column option.
- *
- * @deprecated Import individual `filterFn_*` functions instead for a smaller
- * bundle. This export still works and is not going away in v9, but built-in
- * name resolution (including `filterFn: 'auto'`) only finds functions you
- * register yourself.
- */
-declare const filterFns: {
-  arrIncludes: CreatedFilterFn<any, any>;
-  arrIncludesAll: CreatedFilterFn<any, any>;
-  arrHas: CreatedFilterFn<any, any>;
-  arrIncludesSome: CreatedFilterFn<any, any>;
-  between: CreatedFilterFn<any, any>;
-  betweenInclusive: CreatedFilterFn<any, any>;
-  empty: CreatedFilterFn<any, any>;
-  endsWith: CreatedFilterFn<any, any>;
-  equals: CreatedFilterFn<any, any>;
-  equalsString: CreatedFilterFn<any, any>;
-  equalsStringSensitive: CreatedFilterFn<any, any>;
-  inDateRange: CreatedFilterFn<any, any>;
-  inNumberRange: CreatedFilterFn<any, any>;
-  includesString: CreatedFilterFn<any, any>;
-  includesStringSensitive: CreatedFilterFn<any, any>;
-  notEmpty: CreatedFilterFn<any, any>;
-  startsWith: CreatedFilterFn<any, any>;
-  weakEquals: CreatedFilterFn<any, any>;
-};
-type BuiltInFilterFn = keyof typeof filterFns;
-//#endregion
-export { BuiltInFilterFn, constructFilterFn, filterFn_arrHas, filterFn_arrIncludes, filterFn_arrIncludesAll, filterFn_arrIncludesSome, filterFn_between, filterFn_betweenInclusive, filterFn_empty, filterFn_endsWith, filterFn_equals, filterFn_equalsString, filterFn_equalsStringSensitive, filterFn_greaterThan, filterFn_greaterThanOrEqualTo, filterFn_inDateRange, filterFn_inNumberRange, filterFn_includesString, filterFn_includesStringSensitive, filterFn_lessThan, filterFn_lessThanOrEqualTo, filterFn_notEmpty, filterFn_startsWith, filterFn_weakEquals, filterFns };
-//# sourceMappingURL=filterFns.d.cts.map

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

@@ -1 +0,0 @@
-{"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-filtering/filterRowsUtils.cjs

@@ -1,82 +0,0 @@
-const require_utils = require('../../utils.cjs');
-const require_constructRow = require('../../core/rows/constructRow.cjs');
-
-//#region src/features/column-filtering/filterRowsUtils.ts
-/**
-* Filters a row model with the supplied row predicate.
-*
-* The helper supports both filtering from leaf rows upward and filtering parents before descendants, depending on table options.
-*/
-function filterRows(rows, filterRowImpl, table) {
-	if (table.options.filterFromLeafRows) return filterRowModelFromLeafs(rows, filterRowImpl, table);
-	return filterRowModelFromRoot(rows, filterRowImpl, table);
-}
-function filterRowModelFromLeafs(rowsToFilter, filterRow, table) {
-	const newFilteredFlatRows = [];
-	const newFilteredRowsById = require_utils.makeObjectMap();
-	const maxDepth = table.options.maxLeafRowFilterDepth ?? 100;
-	const recurseFilterRows = (rowsToFilter, depth = 0) => {
-		const filteredRows = [];
-		for (let row of rowsToFilter) {
-			const newRow = require_constructRow.constructRow(table, row.id, row.original, row.index, row.depth, void 0, row.parentId);
-			newRow.columnFilters = row.columnFilters;
-			if (row.subRows.length && depth < maxDepth) {
-				newRow.subRows = recurseFilterRows(row.subRows, depth + 1);
-				row = newRow;
-				if (filterRow(row) && !newRow.subRows.length) {
-					filteredRows.push(row);
-					newFilteredRowsById[row.id] = row;
-					newFilteredFlatRows.push(row);
-					continue;
-				}
-				if (filterRow(row) || newRow.subRows.length) {
-					filteredRows.push(row);
-					newFilteredRowsById[row.id] = row;
-					newFilteredFlatRows.push(row);
-					continue;
-				}
-			} else {
-				row = newRow;
-				if (filterRow(row)) {
-					filteredRows.push(row);
-					newFilteredRowsById[row.id] = row;
-					newFilteredFlatRows.push(row);
-				}
-			}
-		}
-		return filteredRows;
-	};
-	return {
-		rows: recurseFilterRows(rowsToFilter),
-		flatRows: newFilteredFlatRows,
-		rowsById: newFilteredRowsById
-	};
-}
-function filterRowModelFromRoot(rowsToFilter, filterRow, table) {
-	const newFilteredFlatRows = [];
-	const newFilteredRowsById = require_utils.makeObjectMap();
-	const maxDepth = table.options.maxLeafRowFilterDepth ?? 100;
-	const recurseFilterRows = (rowsToFilter, depth = 0) => {
-		const filteredRows = [];
-		for (let row of rowsToFilter) if (filterRow(row)) {
-			if (row.subRows.length && depth < maxDepth) {
-				const newRow = require_constructRow.constructRow(table, row.id, row.original, row.index, row.depth, void 0, row.parentId);
-				newRow.subRows = recurseFilterRows(row.subRows, depth + 1);
-				row = newRow;
-			}
-			filteredRows.push(row);
-			newFilteredFlatRows.push(row);
-			newFilteredRowsById[row.id] = row;
-		}
-		return filteredRows;
-	};
-	return {
-		rows: recurseFilterRows(rowsToFilter),
-		flatRows: newFilteredFlatRows,
-		rowsById: newFilteredRowsById
-	};
-}
-
-//#endregion
-exports.filterRows = filterRows;
-//# sourceMappingURL=filterRowsUtils.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"filterRowsUtils.cjs","names":["makeObjectMap","constructRow"],"sources":["../../../src/features/column-filtering/filterRowsUtils.ts"],"sourcesContent":["import { constructRow } from '../../core/rows/constructRow'\nimport { makeObjectMap } from '../../utils'\nimport type { Row_ColumnFiltering } from './columnFilteringFeature.types'\nimport type { RowModel } from '../../core/row-models/coreRowModelsFeature.types'\nimport type { Row } from '../../types/Row'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { RowData } from '../../types/type-utils'\n\n/**\n * Filters a row model with the supplied row predicate.\n *\n * The helper supports both filtering from leaf rows upward and filtering parents before descendants, depending on table options.\n */\nexport function filterRows<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rows: Array<Row<TFeatures, TData>>,\n  filterRowImpl: (row: Row<TFeatures, TData>) => any,\n  table: Table_Internal<TFeatures, TData>,\n) {\n  if (table.options.filterFromLeafRows) {\n    return filterRowModelFromLeafs(rows, filterRowImpl, table)\n  }\n\n  return filterRowModelFromRoot(rows, filterRowImpl, table)\n}\n\nfunction filterRowModelFromLeafs<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rowsToFilter: Array<Row<TFeatures, TData>>,\n  filterRow: (\n    row: Row<TFeatures, TData>,\n  ) => Array<Row<TFeatures, TData>> | undefined,\n  table: Table_Internal<TFeatures, TData>,\n): RowModel<TFeatures, TData> {\n  const newFilteredFlatRows: Array<Row<TFeatures, TData>> = []\n  const newFilteredRowsById = makeObjectMap<Row<TFeatures, TData>>()\n  const maxDepth = table.options.maxLeafRowFilterDepth ?? 100\n\n  const recurseFilterRows = (\n    rowsToFilter: Array<\n      Row<TFeatures, TData> & Partial<Row_ColumnFiltering<TFeatures, TData>>\n    >,\n    depth = 0,\n  ) => {\n    const filteredRows: Array<Row<TFeatures, TData>> &\n      Partial<Row_ColumnFiltering<TFeatures, TData>> = []\n\n    // Filter from children up first\n    for (let row of rowsToFilter) {\n      const newRow = constructRow(\n        table,\n        row.id,\n        row.original,\n        row.index,\n        row.depth,\n        undefined,\n        row.parentId,\n      ) as Row<TFeatures, TData> &\n        Partial<Row_ColumnFiltering<TFeatures, TData>>\n      newRow.columnFilters = row.columnFilters\n\n      if (row.subRows.length && depth < maxDepth) {\n        newRow.subRows = recurseFilterRows(row.subRows, depth + 1)\n        row = newRow\n\n        if (filterRow(row) && !newRow.subRows.length) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n          continue\n        }\n\n        if (filterRow(row) || newRow.subRows.length) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n          continue\n        }\n      } else {\n        row = newRow\n        if (filterRow(row)) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n        }\n      }\n    }\n\n    return filteredRows\n  }\n\n  return {\n    rows: recurseFilterRows(rowsToFilter),\n    flatRows: newFilteredFlatRows,\n    rowsById: newFilteredRowsById,\n  }\n}\n\nfunction filterRowModelFromRoot<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rowsToFilter: Array<Row<TFeatures, TData>>,\n  filterRow: (row: Row<TFeatures, TData>) => any,\n  table: Table_Internal<TFeatures, TData>,\n): RowModel<TFeatures, TData> {\n  const newFilteredFlatRows: Array<Row<TFeatures, TData>> = []\n  const newFilteredRowsById = makeObjectMap<Row<TFeatures, TData>>()\n  const maxDepth = table.options.maxLeafRowFilterDepth ?? 100\n\n  // Filters top level and nested rows\n  const recurseFilterRows = (\n    rowsToFilter: Array<Row<TFeatures, TData>>,\n    depth = 0,\n  ) => {\n    // Filter from parents downward first\n\n    const filteredRows: Array<Row<TFeatures, TData>> = []\n\n    // Apply the filter to any subRows\n    for (let row of rowsToFilter) {\n      const pass = filterRow(row)\n\n      if (pass) {\n        if (row.subRows.length && depth < maxDepth) {\n          const newRow = constructRow(\n            table,\n            row.id,\n            row.original,\n            row.index,\n            row.depth,\n            undefined,\n            row.parentId,\n          )\n          newRow.subRows = recurseFilterRows(row.subRows, depth + 1)\n          row = newRow\n        }\n\n        filteredRows.push(row)\n        newFilteredFlatRows.push(row)\n        newFilteredRowsById[row.id] = row\n      }\n    }\n\n    return filteredRows\n  }\n\n  return {\n    rows: recurseFilterRows(rowsToFilter),\n    flatRows: newFilteredFlatRows,\n    rowsById: newFilteredRowsById,\n  }\n}\n"],"mappings":";;;;;;;;;AAcA,SAAgB,WAId,MACA,eACA,OACA;CACA,IAAI,MAAM,QAAQ,oBAChB,OAAO,wBAAwB,MAAM,eAAe,KAAK;CAG3D,OAAO,uBAAuB,MAAM,eAAe,KAAK;AAC1D;AAEA,SAAS,wBAIP,cACA,WAGA,OAC4B;CAC5B,MAAM,sBAAoD,CAAC;CAC3D,MAAM,sBAAsBA,4BAAqC;CACjE,MAAM,WAAW,MAAM,QAAQ,yBAAyB;CAExD,MAAM,qBACJ,cAGA,QAAQ,MACL;EACH,MAAM,eAC6C,CAAC;EAGpD,KAAK,IAAI,OAAO,cAAc;GAC5B,MAAM,SAASC,kCACb,OACA,IAAI,IACJ,IAAI,UACJ,IAAI,OACJ,IAAI,OACJ,QACA,IAAI,QACN;GAEA,OAAO,gBAAgB,IAAI;GAE3B,IAAI,IAAI,QAAQ,UAAU,QAAQ,UAAU;IAC1C,OAAO,UAAU,kBAAkB,IAAI,SAAS,QAAQ,CAAC;IACzD,MAAM;IAEN,IAAI,UAAU,GAAG,KAAK,CAAC,OAAO,QAAQ,QAAQ;KAC5C,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;KAC5B;IACF;IAEA,IAAI,UAAU,GAAG,KAAK,OAAO,QAAQ,QAAQ;KAC3C,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;KAC5B;IACF;GACF,OAAO;IACL,MAAM;IACN,IAAI,UAAU,GAAG,GAAG;KAClB,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;IAC9B;GACF;EACF;EAEA,OAAO;CACT;CAEA,OAAO;EACL,MAAM,kBAAkB,YAAY;EACpC,UAAU;EACV,UAAU;CACZ;AACF;AAEA,SAAS,uBAIP,cACA,WACA,OAC4B;CAC5B,MAAM,sBAAoD,CAAC;CAC3D,MAAM,sBAAsBD,4BAAqC;CACjE,MAAM,WAAW,MAAM,QAAQ,yBAAyB;CAGxD,MAAM,qBACJ,cACA,QAAQ,MACL;EAGH,MAAM,eAA6C,CAAC;EAGpD,KAAK,IAAI,OAAO,cAGd,IAFa,UAAU,GAEhB,GAAG;GACR,IAAI,IAAI,QAAQ,UAAU,QAAQ,UAAU;IAC1C,MAAM,SAASC,kCACb,OACA,IAAI,IACJ,IAAI,UACJ,IAAI,OACJ,IAAI,OACJ,QACA,IAAI,QACN;IACA,OAAO,UAAU,kBAAkB,IAAI,SAAS,QAAQ,CAAC;IACzD,MAAM;GACR;GAEA,aAAa,KAAK,GAAG;GACrB,oBAAoB,KAAK,GAAG;GAC5B,oBAAoB,IAAI,MAAM;EAChC;EAGF,OAAO;CACT;CAEA,OAAO;EACL,MAAM,kBAAkB,YAAY;EACpC,UAAU;EACV,UAAU;CACZ;AACF"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"filterRowsUtils.js","names":[],"sources":["../../../src/features/column-filtering/filterRowsUtils.ts"],"sourcesContent":["import { constructRow } from '../../core/rows/constructRow'\nimport { makeObjectMap } from '../../utils'\nimport type { Row_ColumnFiltering } from './columnFilteringFeature.types'\nimport type { RowModel } from '../../core/row-models/coreRowModelsFeature.types'\nimport type { Row } from '../../types/Row'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { RowData } from '../../types/type-utils'\n\n/**\n * Filters a row model with the supplied row predicate.\n *\n * The helper supports both filtering from leaf rows upward and filtering parents before descendants, depending on table options.\n */\nexport function filterRows<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rows: Array<Row<TFeatures, TData>>,\n  filterRowImpl: (row: Row<TFeatures, TData>) => any,\n  table: Table_Internal<TFeatures, TData>,\n) {\n  if (table.options.filterFromLeafRows) {\n    return filterRowModelFromLeafs(rows, filterRowImpl, table)\n  }\n\n  return filterRowModelFromRoot(rows, filterRowImpl, table)\n}\n\nfunction filterRowModelFromLeafs<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rowsToFilter: Array<Row<TFeatures, TData>>,\n  filterRow: (\n    row: Row<TFeatures, TData>,\n  ) => Array<Row<TFeatures, TData>> | undefined,\n  table: Table_Internal<TFeatures, TData>,\n): RowModel<TFeatures, TData> {\n  const newFilteredFlatRows: Array<Row<TFeatures, TData>> = []\n  const newFilteredRowsById = makeObjectMap<Row<TFeatures, TData>>()\n  const maxDepth = table.options.maxLeafRowFilterDepth ?? 100\n\n  const recurseFilterRows = (\n    rowsToFilter: Array<\n      Row<TFeatures, TData> & Partial<Row_ColumnFiltering<TFeatures, TData>>\n    >,\n    depth = 0,\n  ) => {\n    const filteredRows: Array<Row<TFeatures, TData>> &\n      Partial<Row_ColumnFiltering<TFeatures, TData>> = []\n\n    // Filter from children up first\n    for (let row of rowsToFilter) {\n      const newRow = constructRow(\n        table,\n        row.id,\n        row.original,\n        row.index,\n        row.depth,\n        undefined,\n        row.parentId,\n      ) as Row<TFeatures, TData> &\n        Partial<Row_ColumnFiltering<TFeatures, TData>>\n      newRow.columnFilters = row.columnFilters\n\n      if (row.subRows.length && depth < maxDepth) {\n        newRow.subRows = recurseFilterRows(row.subRows, depth + 1)\n        row = newRow\n\n        if (filterRow(row) && !newRow.subRows.length) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n          continue\n        }\n\n        if (filterRow(row) || newRow.subRows.length) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n          continue\n        }\n      } else {\n        row = newRow\n        if (filterRow(row)) {\n          filteredRows.push(row)\n          newFilteredRowsById[row.id] = row\n          newFilteredFlatRows.push(row)\n        }\n      }\n    }\n\n    return filteredRows\n  }\n\n  return {\n    rows: recurseFilterRows(rowsToFilter),\n    flatRows: newFilteredFlatRows,\n    rowsById: newFilteredRowsById,\n  }\n}\n\nfunction filterRowModelFromRoot<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  rowsToFilter: Array<Row<TFeatures, TData>>,\n  filterRow: (row: Row<TFeatures, TData>) => any,\n  table: Table_Internal<TFeatures, TData>,\n): RowModel<TFeatures, TData> {\n  const newFilteredFlatRows: Array<Row<TFeatures, TData>> = []\n  const newFilteredRowsById = makeObjectMap<Row<TFeatures, TData>>()\n  const maxDepth = table.options.maxLeafRowFilterDepth ?? 100\n\n  // Filters top level and nested rows\n  const recurseFilterRows = (\n    rowsToFilter: Array<Row<TFeatures, TData>>,\n    depth = 0,\n  ) => {\n    // Filter from parents downward first\n\n    const filteredRows: Array<Row<TFeatures, TData>> = []\n\n    // Apply the filter to any subRows\n    for (let row of rowsToFilter) {\n      const pass = filterRow(row)\n\n      if (pass) {\n        if (row.subRows.length && depth < maxDepth) {\n          const newRow = constructRow(\n            table,\n            row.id,\n            row.original,\n            row.index,\n            row.depth,\n            undefined,\n            row.parentId,\n          )\n          newRow.subRows = recurseFilterRows(row.subRows, depth + 1)\n          row = newRow\n        }\n\n        filteredRows.push(row)\n        newFilteredFlatRows.push(row)\n        newFilteredRowsById[row.id] = row\n      }\n    }\n\n    return filteredRows\n  }\n\n  return {\n    rows: recurseFilterRows(rowsToFilter),\n    flatRows: newFilteredFlatRows,\n    rowsById: newFilteredRowsById,\n  }\n}\n"],"mappings":";;;;;;;;;AAcA,SAAgB,WAId,MACA,eACA,OACA;CACA,IAAI,MAAM,QAAQ,oBAChB,OAAO,wBAAwB,MAAM,eAAe,KAAK;CAG3D,OAAO,uBAAuB,MAAM,eAAe,KAAK;AAC1D;AAEA,SAAS,wBAIP,cACA,WAGA,OAC4B;CAC5B,MAAM,sBAAoD,CAAC;CAC3D,MAAM,sBAAsB,cAAqC;CACjE,MAAM,WAAW,MAAM,QAAQ,yBAAyB;CAExD,MAAM,qBACJ,cAGA,QAAQ,MACL;EACH,MAAM,eAC6C,CAAC;EAGpD,KAAK,IAAI,OAAO,cAAc;GAC5B,MAAM,SAAS,aACb,OACA,IAAI,IACJ,IAAI,UACJ,IAAI,OACJ,IAAI,OACJ,QACA,IAAI,QACN;GAEA,OAAO,gBAAgB,IAAI;GAE3B,IAAI,IAAI,QAAQ,UAAU,QAAQ,UAAU;IAC1C,OAAO,UAAU,kBAAkB,IAAI,SAAS,QAAQ,CAAC;IACzD,MAAM;IAEN,IAAI,UAAU,GAAG,KAAK,CAAC,OAAO,QAAQ,QAAQ;KAC5C,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;KAC5B;IACF;IAEA,IAAI,UAAU,GAAG,KAAK,OAAO,QAAQ,QAAQ;KAC3C,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;KAC5B;IACF;GACF,OAAO;IACL,MAAM;IACN,IAAI,UAAU,GAAG,GAAG;KAClB,aAAa,KAAK,GAAG;KACrB,oBAAoB,IAAI,MAAM;KAC9B,oBAAoB,KAAK,GAAG;IAC9B;GACF;EACF;EAEA,OAAO;CACT;CAEA,OAAO;EACL,MAAM,kBAAkB,YAAY;EACpC,UAAU;EACV,UAAU;CACZ;AACF;AAEA,SAAS,uBAIP,cACA,WACA,OAC4B;CAC5B,MAAM,sBAAoD,CAAC;CAC3D,MAAM,sBAAsB,cAAqC;CACjE,MAAM,WAAW,MAAM,QAAQ,yBAAyB;CAGxD,MAAM,qBACJ,cACA,QAAQ,MACL;EAGH,MAAM,eAA6C,CAAC;EAGpD,KAAK,IAAI,OAAO,cAGd,IAFa,UAAU,GAEhB,GAAG;GACR,IAAI,IAAI,QAAQ,UAAU,QAAQ,UAAU;IAC1C,MAAM,SAAS,aACb,OACA,IAAI,IACJ,IAAI,UACJ,IAAI,OACJ,IAAI,OACJ,QACA,IAAI,QACN;IACA,OAAO,UAAU,kBAAkB,IAAI,SAAS,QAAQ,CAAC;IACzD,MAAM;GACR;GAEA,aAAa,KAAK,GAAG;GACrB,oBAAoB,KAAK,GAAG;GAC5B,oBAAoB,IAAI,MAAM;EAChC;EAGF,OAAO;CACT;CAEA,OAAO;EACL,MAAM,kBAAkB,YAAY;EACpC,UAAU;EACV,UAAU;CACZ;AACF"}

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

@@ -1,55 +0,0 @@
-const require_utils = require('../../utils.cjs');
-const require_columnGroupingFeature_utils = require('./columnGroupingFeature.utils.cjs');
-
-//#region src/features/column-grouping/columnGroupingFeature.ts
-/**
-* Feature that adds column grouping state and grouped row APIs.
-*/
-const columnGroupingFeature = {
-	getInitialState: (initialState) => {
-		return {
-			grouping: require_columnGroupingFeature_utils.getDefaultGroupingState(),
-			...initialState
-		};
-	},
-	getDefaultTableOptions: (table) => {
-		return {
-			onGroupingChange: require_utils.makeStateUpdater("grouping", table),
-			groupedColumnMode: "reorder"
-		};
-	},
-	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) }
-		});
-	},
-	assignColumnPrototype: (prototype, table) => {
-		require_utils.assignPrototypeAPIs("columnGroupingFeature", prototype, table, {
-			column_toggleGrouping: { fn: (column) => require_columnGroupingFeature_utils.column_toggleGrouping(column) },
-			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) }
-		});
-	},
-	assignRowPrototype: (prototype, table) => {
-		require_utils.assignPrototypeAPIs("columnGroupingFeature", prototype, table, {
-			row_getIsGrouped: { fn: (row) => require_columnGroupingFeature_utils.row_getIsGrouped(row) },
-			row_getGroupingValue: { fn: (row, columnId) => require_columnGroupingFeature_utils.row_getGroupingValue(row, columnId) }
-		});
-	},
-	initRowInstanceData: (row) => {
-		row._groupingValuesCache = require_utils.makeObjectMap();
-	},
-	constructTableAPIs: (table) => {
-		require_utils.assignTableAPIs("columnGroupingFeature", table, {
-			table_setGrouping: { fn: (updater) => require_columnGroupingFeature_utils.table_setGrouping(table, updater) },
-			table_resetGrouping: { fn: (defaultState) => require_columnGroupingFeature_utils.table_resetGrouping(table, defaultState) }
-		});
-	}
-};
-
-//#endregion
-exports.columnGroupingFeature = columnGroupingFeature;
-//# sourceMappingURL=columnGroupingFeature.cjs.map

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

@@ -1 +0,0 @@
-{"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

@@ -1,10 +0,0 @@
-import { TableFeature } from "../../types/TableFeatures.cjs";
-
-//#region src/features/column-grouping/columnGroupingFeature.d.ts
-/**
- * Feature that adds column grouping state and grouped row APIs.
- */
-declare const columnGroupingFeature: TableFeature;
-//#endregion
-export { columnGroupingFeature };
-//# sourceMappingURL=columnGroupingFeature.d.cts.map

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

@@ -1 +0,0 @@
-{"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"}

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

@@ -1,129 +0,0 @@
-import { OnChangeFn, RowData, Updater } from "../../types/type-utils.cjs";
-import { Row } from "../../types/Row.cjs";
-import { RowModel } from "../../core/row-models/coreRowModelsFeature.types.cjs";
-import { TableFeatures } from "../../types/TableFeatures.cjs";
-
-//#region src/features/column-grouping/columnGroupingFeature.types.d.ts
-type GroupingState = Array<string>;
-interface TableState_ColumnGrouping {
-  grouping: GroupingState;
-}
-interface ColumnDef_ColumnGrouping<in out TFeatures extends TableFeatures, in out TData extends RowData> {
-  /**
-   * Allows this column to be added to grouping state.
-   *
-   * Defaults to `true`; table-level `enableGrouping` must also allow grouping.
-   */
-  enableGrouping?: boolean;
-  /**
-   * Returns the value used to group rows for this column.
-   *
-   * When omitted, grouping uses the value derived from this column's
-   * `accessorKey` or `accessorFn`.
-   */
-  getGroupingValue?: (originalRow: TData, index: number, row: Row<TFeatures, TData>) => any;
-}
-interface Column_ColumnGrouping {
-  /**
-   * Checks whether this column can currently be grouped.
-   */
-  getCanGroup: () => boolean;
-  /**
-   * Finds this column's position in the ordered grouping state.
-   */
-  getGroupedIndex: () => number;
-  /**
-   * Checks whether this column id is present in grouping state.
-   */
-  getIsGrouped: () => boolean;
-  /**
-   * Returns a function that toggles the grouping state of the column. This is useful for passing to the `onClick` prop of a button.
-   */
-  getToggleGroupingHandler: () => () => void;
-  /**
-   * Toggles the grouping state of the column.
-   */
-  toggleGrouping: () => void;
-}
-interface Row_ColumnGrouping {
-  _groupingValuesCache: Record<string, any>;
-  /**
-   * Reads the value used to group this row for a column id.
-   */
-  getGroupingValue: (columnId: string) => unknown;
-  /**
-   * Checks whether this row represents a grouped row.
-   */
-  getIsGrouped: () => boolean;
-  /**
-   * If this row is grouped, this is the id of the column that this row is grouped by.
-   */
-  groupingColumnId?: string;
-  /**
-   * If this row is grouped, this is the unique/shared value for the `groupingColumnId` for all of the rows in this group.
-   */
-  groupingValue?: unknown;
-}
-interface Cell_ColumnGrouping {
-  /**
-   * Checks whether this cell represents the active grouping column.
-   */
-  getIsGrouped: () => boolean;
-  /**
-   * Checks whether this cell is hidden as a grouping placeholder.
-   */
-  getIsPlaceholder: () => boolean;
-}
-interface ColumnDefaultOptions {
-  enableGrouping: boolean;
-  onGroupingChange: OnChangeFn<GroupingState>;
-}
-interface TableOptions_ColumnGrouping {
-  /**
-   * Allows columns to be grouped for this table.
-   */
-  enableGrouping?: boolean;
-  /**
-   * Grouping columns are automatically reordered by default to the start of the columns list. If you would rather remove them or leave them as-is, set the appropriate mode here.
-   */
-  groupedColumnMode?: false | 'reorder' | 'remove';
-  /**
-   * Enables manual grouping. If this option is set to `true`, the table will not automatically group rows using `getGroupedRowModel()` and instead will expect you to manually group the rows before passing them to the table. This is useful if you are doing server-side grouping and aggregation.
-   */
-  manualGrouping?: boolean;
-  /**
-   * Called with an updater when grouping state changes. Pair this with
-   * `state.grouping` when using external state; external atoms can own the
-   * slice without this callback.
-   */
-  onGroupingChange?: OnChangeFn<GroupingState>;
-}
-type GroupingColumnMode = false | 'reorder' | 'remove';
-interface Table_ColumnGrouping<in out _TFeatures extends TableFeatures, in out _TData extends RowData> {
-  /**
-   * Resets `grouping` to `initialState.grouping`.
-   *
-   * Pass `true` to ignore initial state and reset to `[]`.
-   */
-  resetGrouping: (defaultState?: boolean) => void;
-  /**
-   * Updates grouping state with a next ordered id array or updater function.
-   */
-  setGrouping: (updater: Updater<GroupingState>) => void;
-}
-interface Table_RowModels_Grouped<in out TFeatures extends TableFeatures, in out TData extends RowData> {
-  /**
-   * Resolves the row model after grouping has been applied.
-   */
-  getGroupedRowModel: () => RowModel<TFeatures, TData>;
-  /**
-   * Reads the row model immediately before grouping.
-   */
-  getPreGroupedRowModel: () => RowModel<TFeatures, TData>;
-}
-interface CachedRowModel_Grouped<in out TFeatures extends TableFeatures, in out TData extends RowData> {
-  groupedRowModel: () => RowModel<TFeatures, TData>;
-}
-//#endregion
-export { CachedRowModel_Grouped, Cell_ColumnGrouping, ColumnDef_ColumnGrouping, ColumnDefaultOptions, Column_ColumnGrouping, GroupingColumnMode, GroupingState, Row_ColumnGrouping, TableOptions_ColumnGrouping, TableState_ColumnGrouping, Table_ColumnGrouping, Table_RowModels_Grouped };
-//# sourceMappingURL=columnGroupingFeature.types.d.cts.map