@tanstack/table-core 9.0.0-beta.37 → 9.0.0-beta.42

package/README.md

@@ -40,6 +40,7 @@
 > - [Svelte Table](https://tanstack.com/table/alpha/docs/framework/svelte/svelte-table)
 > - [Vue Table](https://tanstack.com/table/alpha/docs/framework/vue/vue-table)
 > - [Alpine Table](https://tanstack.com/table/alpha/docs/framework/alpine/alpine-table)
+> - [Ember Table](https://tanstack.com/table/alpha/docs/framework/ember/ember-table)
 
 A headless table library for building powerful datagrids with full control over markup, styles, and behavior.
 

package/dist/core/headers/buildHeaderGroups.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"buildHeaderGroups.cjs","names":["callMemoOrStaticFn","column_getIsVisible","constructHeader"],"sources":["../../../src/core/headers/buildHeaderGroups.ts"],"sourcesContent":["import { callMemoOrStaticFn } from '../../utils'\nimport { column_getIsVisible } from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { constructHeader } from './constructHeader'\nimport type { Table_Internal } from '../../types/Table'\nimport type { CellData, RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header } from '../../types/Header'\nimport type { HeaderGroup } from '../../types/HeaderGroup'\nimport type { Column } from '../../types/Column'\n\n/**\n * Builds the nested header group structure for a table.\n *\n * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.\n */\nexport function buildHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  allColumns: Array<Column<TFeatures, TData, TValue>>,\n  columnsToGroup: Array<Column<TFeatures, TData, TValue>>,\n  table: Table_Internal<TFeatures, TData>,\n  headerFamily?: 'center' | 'left' | 'right',\n) {\n  // Find the max depth of the columns:\n  // build the leaf column row\n  // build each buffer row going up\n  //    placeholder for non-existent level\n  //    real column for existing level\n\n  let maxDepth = 0\n\n  const findMaxDepth = (\n    columns: Array<Column<TFeatures, TData, TValue>>,\n    depth = 1,\n  ) => {\n    maxDepth = Math.max(maxDepth, depth)\n\n    for (let i = 0; i < columns.length; i++) {\n      const column = columns[i]!\n      if (callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)) {\n        if (column.columns.length) {\n          findMaxDepth(column.columns, depth + 1)\n        }\n      }\n    }\n  }\n\n  findMaxDepth(allColumns)\n\n  const headerGroups: Array<HeaderGroup<TFeatures, TData>> = []\n\n  const constructHeaderGroup = (\n    headersToGroup: Array<Header<TFeatures, TData, TValue>>,\n    depth: number,\n  ) => {\n    // The header group we are creating\n    const headerGroup: HeaderGroup<TFeatures, TData> = {\n      depth,\n      id: [headerFamily, `${depth}`].filter(Boolean).join('_'),\n      headers: [],\n    }\n\n    // The parent columns we're going to scan next\n    const pendingParentHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n    // Scan each column for parents\n    headersToGroup.forEach((headerToGroup) => {\n      // What is the latest (last) parent column?\n\n      const latestPendingParentHeader =\n        pendingParentHeaders[pendingParentHeaders.length - 1]\n\n      const isLeafHeader = headerToGroup.column.depth === headerGroup.depth\n\n      let column: Column<TFeatures, TData, TValue>\n      let isPlaceholder = false\n\n      if (isLeafHeader && headerToGroup.column.parent) {\n        // The parent header is new\n        column = headerToGroup.column.parent\n      } else {\n        // The parent header is repeated\n        column = headerToGroup.column\n        isPlaceholder = true\n      }\n\n      if (\n        latestPendingParentHeader &&\n        latestPendingParentHeader.column === column\n      ) {\n        // This column is repeated. Add it as a sub header to the next batch\n        latestPendingParentHeader.subHeaders.push(headerToGroup)\n      } else {\n        // This is a new header. Let's create it\n        const header = constructHeader(table, column, {\n          id: [headerFamily, depth, column.id, headerToGroup.id]\n            .filter(Boolean)\n            .join('_'),\n          isPlaceholder,\n          placeholderId: isPlaceholder\n            ? `${pendingParentHeaders.filter((d) => d.column === column).length}`\n            : undefined,\n          depth,\n          index: pendingParentHeaders.length,\n        })\n\n        // Add the headerToGroup as a subHeader of the new header\n        header.subHeaders.push(headerToGroup)\n        // Add the new header to the pendingParentHeaders to get grouped\n        // in the next batch\n        pendingParentHeaders.push(header)\n      }\n\n      headerGroup.headers.push(\n        headerToGroup as Header<TFeatures, TData, unknown>,\n      )\n      headerToGroup.headerGroup = headerGroup\n    })\n\n    headerGroups.push(headerGroup)\n\n    if (depth > 0) {\n      constructHeaderGroup(pendingParentHeaders, depth - 1)\n    }\n  }\n\n  const bottomHeaders = columnsToGroup.map((column, index) =>\n    constructHeader(table, column, {\n      depth: maxDepth,\n      index,\n    }),\n  )\n\n  constructHeaderGroup(bottomHeaders, maxDepth - 1)\n\n  headerGroups.reverse()\n\n  const recurseHeadersForSpans = (\n    headers: Array<Header<TFeatures, TData, TValue>>,\n  ): Array<{ colSpan: number; rowSpan: number }> => {\n    const results: Array<{ colSpan: number; rowSpan: number }> = []\n\n    for (let i = 0; i < headers.length; i++) {\n      const header = headers[i]!\n      if (\n        !callMemoOrStaticFn(header.column, 'getIsVisible', column_getIsVisible)\n      ) {\n        continue\n      }\n\n      let colSpan = 0\n      let minChildRowSpan = Infinity\n\n      if (header.subHeaders.length) {\n        const childSpans = recurseHeadersForSpans(header.subHeaders)\n        for (let j = 0; j < childSpans.length; j++) {\n          const child = childSpans[j]!\n          colSpan += child.colSpan\n          if (child.rowSpan < minChildRowSpan) {\n            minChildRowSpan = child.rowSpan\n          }\n        }\n      } else {\n        colSpan = 1\n        minChildRowSpan = 0\n      }\n\n      header.colSpan = colSpan\n      header.rowSpan = minChildRowSpan\n\n      results.push({ colSpan, rowSpan: header.rowSpan })\n    }\n\n    return results\n  }\n\n  recurseHeadersForSpans(\n    (headerGroups[0]?.headers ?? []) as Array<Header<TFeatures, TData, TValue>>,\n  )\n\n  return headerGroups\n}\n"],"mappings":";;;;;;;;;;AAeA,SAAgB,kBAKd,YACA,gBACA,OACA,cACA;CAOA,IAAI,WAAW;CAEf,MAAM,gBACJ,SACA,QAAQ,MACL;EACH,WAAW,KAAK,IAAI,UAAU,KAAK;EAEnC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IAAIA,iCAAmB,QAAQ,gBAAgBC,yDAAmB,GAChE;QAAI,OAAO,QAAQ,QACjB,aAAa,OAAO,SAAS,QAAQ,CAAC;GACxC;EAEJ;CACF;CAEA,aAAa,UAAU;CAEvB,MAAM,eAAqD,CAAC;CAE5D,MAAM,wBACJ,gBACA,UACG;EAEH,MAAM,cAA6C;GACjD;GACA,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG;GACvD,SAAS,CAAC;EACZ;EAGA,MAAM,uBAAgE,CAAC;EAGvE,eAAe,SAAS,kBAAkB;GAGxC,MAAM,4BACJ,qBAAqB,qBAAqB,SAAS;GAErD,MAAM,eAAe,cAAc,OAAO,UAAU,YAAY;GAEhE,IAAI;GACJ,IAAI,gBAAgB;GAEpB,IAAI,gBAAgB,cAAc,OAAO,QAEvC,SAAS,cAAc,OAAO;QACzB;IAEL,SAAS,cAAc;IACvB,gBAAgB;GAClB;GAEA,IACE,6BACA,0BAA0B,WAAW,QAGrC,0BAA0B,WAAW,KAAK,aAAa;QAClD;IAEL,MAAM,SAASC,wCAAgB,OAAO,QAAQ;KAC5C,IAAI;MAAC;MAAc;MAAO,OAAO;MAAI,cAAc;KAAE,CAAC,CACnD,OAAO,OAAO,CAAC,CACf,KAAK,GAAG;KACX;KACA,eAAe,gBACX,GAAG,qBAAqB,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC,WAC3D;KACJ;KACA,OAAO,qBAAqB;IAC9B,CAAC;IAGD,OAAO,WAAW,KAAK,aAAa;IAGpC,qBAAqB,KAAK,MAAM;GAClC;GAEA,YAAY,QAAQ,KAClB,aACF;GACA,cAAc,cAAc;EAC9B,CAAC;EAED,aAAa,KAAK,WAAW;EAE7B,IAAI,QAAQ,GACV,qBAAqB,sBAAsB,QAAQ,CAAC;CAExD;CASA,qBAPsB,eAAe,KAAK,QAAQ,UAChDA,wCAAgB,OAAO,QAAQ;EAC7B,OAAO;EACP;CACF,CAAC,CAG8B,GAAG,WAAW,CAAC;CAEhD,aAAa,QAAQ;CAErB,MAAM,0BACJ,YACgD;EAChD,MAAM,UAAuD,CAAC;EAE9D,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IACE,CAACF,iCAAmB,OAAO,QAAQ,gBAAgBC,yDAAmB,GAEtE;GAGF,IAAI,UAAU;GACd,IAAI,kBAAkB;GAEtB,IAAI,OAAO,WAAW,QAAQ;IAC5B,MAAM,aAAa,uBAAuB,OAAO,UAAU;IAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;KAC1C,MAAM,QAAQ,WAAW;KACzB,WAAW,MAAM;KACjB,IAAI,MAAM,UAAU,iBAClB,kBAAkB,MAAM;IAE5B;GACF,OAAO;IACL,UAAU;IACV,kBAAkB;GACpB;GAEA,OAAO,UAAU;GACjB,OAAO,UAAU;GAEjB,QAAQ,KAAK;IAAE;IAAS,SAAS,OAAO;GAAQ,CAAC;EACnD;EAEA,OAAO;CACT;CAEA,uBACG,aAAa,EAAE,EAAE,WAAW,CAAC,CAChC;CAEA,OAAO;AACT"}
+{"version":3,"file":"buildHeaderGroups.cjs","names":["callMemoOrStaticFn","column_getIsVisible","constructHeader"],"sources":["../../../src/core/headers/buildHeaderGroups.ts"],"sourcesContent":["import { callMemoOrStaticFn } from '../../utils'\nimport { column_getIsVisible } from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { constructHeader } from './constructHeader'\nimport type { Table_Internal } from '../../types/Table'\nimport type { CellData, RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header } from '../../types/Header'\nimport type { HeaderGroup } from '../../types/HeaderGroup'\nimport type { Column } from '../../types/Column'\n\n/**\n * Builds the nested header group structure for a table.\n *\n * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.\n */\nexport function buildHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  allColumns: Array<Column<TFeatures, TData, TValue>>,\n  columnsToGroup: Array<Column<TFeatures, TData, TValue>>,\n  table: Table_Internal<TFeatures, TData>,\n  headerFamily?: 'center' | 'start' | 'end',\n) {\n  // Find the max depth of the columns:\n  // build the leaf column row\n  // build each buffer row going up\n  //    placeholder for non-existent level\n  //    real column for existing level\n\n  let maxDepth = 0\n\n  const findMaxDepth = (\n    columns: Array<Column<TFeatures, TData, TValue>>,\n    depth = 1,\n  ) => {\n    maxDepth = Math.max(maxDepth, depth)\n\n    for (let i = 0; i < columns.length; i++) {\n      const column = columns[i]!\n      if (callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)) {\n        if (column.columns.length) {\n          findMaxDepth(column.columns, depth + 1)\n        }\n      }\n    }\n  }\n\n  findMaxDepth(allColumns)\n\n  const headerGroups: Array<HeaderGroup<TFeatures, TData>> = []\n\n  const constructHeaderGroup = (\n    headersToGroup: Array<Header<TFeatures, TData, TValue>>,\n    depth: number,\n  ) => {\n    // The header group we are creating\n    const headerGroup: HeaderGroup<TFeatures, TData> = {\n      depth,\n      id: [headerFamily, `${depth}`].filter(Boolean).join('_'),\n      headers: [],\n    }\n\n    // The parent columns we're going to scan next\n    const pendingParentHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n    // Scan each column for parents\n    headersToGroup.forEach((headerToGroup) => {\n      // What is the latest (last) parent column?\n\n      const latestPendingParentHeader =\n        pendingParentHeaders[pendingParentHeaders.length - 1]\n\n      const isLeafHeader = headerToGroup.column.depth === headerGroup.depth\n\n      let column: Column<TFeatures, TData, TValue>\n      let isPlaceholder = false\n\n      if (isLeafHeader && headerToGroup.column.parent) {\n        // The parent header is new\n        column = headerToGroup.column.parent\n      } else {\n        // The parent header is repeated\n        column = headerToGroup.column\n        isPlaceholder = true\n      }\n\n      if (\n        latestPendingParentHeader &&\n        latestPendingParentHeader.column === column\n      ) {\n        // This column is repeated. Add it as a sub header to the next batch\n        latestPendingParentHeader.subHeaders.push(headerToGroup)\n      } else {\n        // This is a new header. Let's create it\n        const header = constructHeader(table, column, {\n          id: [headerFamily, depth, column.id, headerToGroup.id]\n            .filter(Boolean)\n            .join('_'),\n          isPlaceholder,\n          placeholderId: isPlaceholder\n            ? `${pendingParentHeaders.filter((d) => d.column === column).length}`\n            : undefined,\n          depth,\n          index: pendingParentHeaders.length,\n        })\n\n        // Add the headerToGroup as a subHeader of the new header\n        header.subHeaders.push(headerToGroup)\n        // Add the new header to the pendingParentHeaders to get grouped\n        // in the next batch\n        pendingParentHeaders.push(header)\n      }\n\n      headerGroup.headers.push(\n        headerToGroup as Header<TFeatures, TData, unknown>,\n      )\n      headerToGroup.headerGroup = headerGroup\n    })\n\n    headerGroups.push(headerGroup)\n\n    if (depth > 0) {\n      constructHeaderGroup(pendingParentHeaders, depth - 1)\n    }\n  }\n\n  const bottomHeaders = columnsToGroup.map((column, index) =>\n    constructHeader(table, column, {\n      depth: maxDepth,\n      index,\n    }),\n  )\n\n  constructHeaderGroup(bottomHeaders, maxDepth - 1)\n\n  headerGroups.reverse()\n\n  const recurseHeadersForSpans = (\n    headers: Array<Header<TFeatures, TData, TValue>>,\n  ): Array<{ colSpan: number; rowSpan: number }> => {\n    const results: Array<{ colSpan: number; rowSpan: number }> = []\n\n    for (let i = 0; i < headers.length; i++) {\n      const header = headers[i]!\n      if (\n        !callMemoOrStaticFn(header.column, 'getIsVisible', column_getIsVisible)\n      ) {\n        continue\n      }\n\n      let colSpan = 0\n      let minChildRowSpan = Infinity\n\n      if (header.subHeaders.length) {\n        const childSpans = recurseHeadersForSpans(header.subHeaders)\n        for (let j = 0; j < childSpans.length; j++) {\n          const child = childSpans[j]!\n          colSpan += child.colSpan\n          if (child.rowSpan < minChildRowSpan) {\n            minChildRowSpan = child.rowSpan\n          }\n        }\n      } else {\n        colSpan = 1\n        minChildRowSpan = 0\n      }\n\n      header.colSpan = colSpan\n      header.rowSpan = minChildRowSpan\n\n      results.push({ colSpan, rowSpan: header.rowSpan })\n    }\n\n    return results\n  }\n\n  recurseHeadersForSpans(\n    (headerGroups[0]?.headers ?? []) as Array<Header<TFeatures, TData, TValue>>,\n  )\n\n  return headerGroups\n}\n"],"mappings":";;;;;;;;;;AAeA,SAAgB,kBAKd,YACA,gBACA,OACA,cACA;CAOA,IAAI,WAAW;CAEf,MAAM,gBACJ,SACA,QAAQ,MACL;EACH,WAAW,KAAK,IAAI,UAAU,KAAK;EAEnC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IAAIA,iCAAmB,QAAQ,gBAAgBC,yDAAmB,GAChE;QAAI,OAAO,QAAQ,QACjB,aAAa,OAAO,SAAS,QAAQ,CAAC;GACxC;EAEJ;CACF;CAEA,aAAa,UAAU;CAEvB,MAAM,eAAqD,CAAC;CAE5D,MAAM,wBACJ,gBACA,UACG;EAEH,MAAM,cAA6C;GACjD;GACA,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG;GACvD,SAAS,CAAC;EACZ;EAGA,MAAM,uBAAgE,CAAC;EAGvE,eAAe,SAAS,kBAAkB;GAGxC,MAAM,4BACJ,qBAAqB,qBAAqB,SAAS;GAErD,MAAM,eAAe,cAAc,OAAO,UAAU,YAAY;GAEhE,IAAI;GACJ,IAAI,gBAAgB;GAEpB,IAAI,gBAAgB,cAAc,OAAO,QAEvC,SAAS,cAAc,OAAO;QACzB;IAEL,SAAS,cAAc;IACvB,gBAAgB;GAClB;GAEA,IACE,6BACA,0BAA0B,WAAW,QAGrC,0BAA0B,WAAW,KAAK,aAAa;QAClD;IAEL,MAAM,SAASC,wCAAgB,OAAO,QAAQ;KAC5C,IAAI;MAAC;MAAc;MAAO,OAAO;MAAI,cAAc;KAAE,CAAC,CACnD,OAAO,OAAO,CAAC,CACf,KAAK,GAAG;KACX;KACA,eAAe,gBACX,GAAG,qBAAqB,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC,WAC3D;KACJ;KACA,OAAO,qBAAqB;IAC9B,CAAC;IAGD,OAAO,WAAW,KAAK,aAAa;IAGpC,qBAAqB,KAAK,MAAM;GAClC;GAEA,YAAY,QAAQ,KAClB,aACF;GACA,cAAc,cAAc;EAC9B,CAAC;EAED,aAAa,KAAK,WAAW;EAE7B,IAAI,QAAQ,GACV,qBAAqB,sBAAsB,QAAQ,CAAC;CAExD;CASA,qBAPsB,eAAe,KAAK,QAAQ,UAChDA,wCAAgB,OAAO,QAAQ;EAC7B,OAAO;EACP;CACF,CAAC,CAG8B,GAAG,WAAW,CAAC;CAEhD,aAAa,QAAQ;CAErB,MAAM,0BACJ,YACgD;EAChD,MAAM,UAAuD,CAAC;EAE9D,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IACE,CAACF,iCAAmB,OAAO,QAAQ,gBAAgBC,yDAAmB,GAEtE;GAGF,IAAI,UAAU;GACd,IAAI,kBAAkB;GAEtB,IAAI,OAAO,WAAW,QAAQ;IAC5B,MAAM,aAAa,uBAAuB,OAAO,UAAU;IAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;KAC1C,MAAM,QAAQ,WAAW;KACzB,WAAW,MAAM;KACjB,IAAI,MAAM,UAAU,iBAClB,kBAAkB,MAAM;IAE5B;GACF,OAAO;IACL,UAAU;IACV,kBAAkB;GACpB;GAEA,OAAO,UAAU;GACjB,OAAO,UAAU;GAEjB,QAAQ,KAAK;IAAE;IAAS,SAAS,OAAO;GAAQ,CAAC;EACnD;EAEA,OAAO;CACT;CAEA,uBACG,aAAa,EAAE,EAAE,WAAW,CAAC,CAChC;CAEA,OAAO;AACT"}

package/dist/core/headers/buildHeaderGroups.d.cts

@@ -10,7 +10,7 @@ import { TableFeatures } from "../../types/TableFeatures.cjs";
  *
  * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.
  */
-declare function buildHeaderGroups<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(allColumns: Array<Column<TFeatures, TData, TValue>>, columnsToGroup: Array<Column<TFeatures, TData, TValue>>, table: Table<TFeatures, TData>, headerFamily?: 'center' | 'left' | 'right'): HeaderGroup<TFeatures, TData>[];
+declare function buildHeaderGroups<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(allColumns: Array<Column<TFeatures, TData, TValue>>, columnsToGroup: Array<Column<TFeatures, TData, TValue>>, table: Table<TFeatures, TData>, headerFamily?: 'center' | 'start' | 'end'): HeaderGroup<TFeatures, TData>[];
 //#endregion
 export { buildHeaderGroups };
 //# sourceMappingURL=buildHeaderGroups.d.cts.map

package/dist/core/headers/buildHeaderGroups.d.ts

@@ -10,7 +10,7 @@ import { TableFeatures } from "../../types/TableFeatures.js";
  *
  * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.
  */
-declare function buildHeaderGroups<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(allColumns: Array<Column<TFeatures, TData, TValue>>, columnsToGroup: Array<Column<TFeatures, TData, TValue>>, table: Table<TFeatures, TData>, headerFamily?: 'center' | 'left' | 'right'): HeaderGroup<TFeatures, TData>[];
+declare function buildHeaderGroups<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(allColumns: Array<Column<TFeatures, TData, TValue>>, columnsToGroup: Array<Column<TFeatures, TData, TValue>>, table: Table<TFeatures, TData>, headerFamily?: 'center' | 'start' | 'end'): HeaderGroup<TFeatures, TData>[];
 //#endregion
 export { buildHeaderGroups };
 //# sourceMappingURL=buildHeaderGroups.d.ts.map

package/dist/core/headers/buildHeaderGroups.js.map

@@ -1 +1 @@
-{"version":3,"file":"buildHeaderGroups.js","names":[],"sources":["../../../src/core/headers/buildHeaderGroups.ts"],"sourcesContent":["import { callMemoOrStaticFn } from '../../utils'\nimport { column_getIsVisible } from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { constructHeader } from './constructHeader'\nimport type { Table_Internal } from '../../types/Table'\nimport type { CellData, RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header } from '../../types/Header'\nimport type { HeaderGroup } from '../../types/HeaderGroup'\nimport type { Column } from '../../types/Column'\n\n/**\n * Builds the nested header group structure for a table.\n *\n * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.\n */\nexport function buildHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  allColumns: Array<Column<TFeatures, TData, TValue>>,\n  columnsToGroup: Array<Column<TFeatures, TData, TValue>>,\n  table: Table_Internal<TFeatures, TData>,\n  headerFamily?: 'center' | 'left' | 'right',\n) {\n  // Find the max depth of the columns:\n  // build the leaf column row\n  // build each buffer row going up\n  //    placeholder for non-existent level\n  //    real column for existing level\n\n  let maxDepth = 0\n\n  const findMaxDepth = (\n    columns: Array<Column<TFeatures, TData, TValue>>,\n    depth = 1,\n  ) => {\n    maxDepth = Math.max(maxDepth, depth)\n\n    for (let i = 0; i < columns.length; i++) {\n      const column = columns[i]!\n      if (callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)) {\n        if (column.columns.length) {\n          findMaxDepth(column.columns, depth + 1)\n        }\n      }\n    }\n  }\n\n  findMaxDepth(allColumns)\n\n  const headerGroups: Array<HeaderGroup<TFeatures, TData>> = []\n\n  const constructHeaderGroup = (\n    headersToGroup: Array<Header<TFeatures, TData, TValue>>,\n    depth: number,\n  ) => {\n    // The header group we are creating\n    const headerGroup: HeaderGroup<TFeatures, TData> = {\n      depth,\n      id: [headerFamily, `${depth}`].filter(Boolean).join('_'),\n      headers: [],\n    }\n\n    // The parent columns we're going to scan next\n    const pendingParentHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n    // Scan each column for parents\n    headersToGroup.forEach((headerToGroup) => {\n      // What is the latest (last) parent column?\n\n      const latestPendingParentHeader =\n        pendingParentHeaders[pendingParentHeaders.length - 1]\n\n      const isLeafHeader = headerToGroup.column.depth === headerGroup.depth\n\n      let column: Column<TFeatures, TData, TValue>\n      let isPlaceholder = false\n\n      if (isLeafHeader && headerToGroup.column.parent) {\n        // The parent header is new\n        column = headerToGroup.column.parent\n      } else {\n        // The parent header is repeated\n        column = headerToGroup.column\n        isPlaceholder = true\n      }\n\n      if (\n        latestPendingParentHeader &&\n        latestPendingParentHeader.column === column\n      ) {\n        // This column is repeated. Add it as a sub header to the next batch\n        latestPendingParentHeader.subHeaders.push(headerToGroup)\n      } else {\n        // This is a new header. Let's create it\n        const header = constructHeader(table, column, {\n          id: [headerFamily, depth, column.id, headerToGroup.id]\n            .filter(Boolean)\n            .join('_'),\n          isPlaceholder,\n          placeholderId: isPlaceholder\n            ? `${pendingParentHeaders.filter((d) => d.column === column).length}`\n            : undefined,\n          depth,\n          index: pendingParentHeaders.length,\n        })\n\n        // Add the headerToGroup as a subHeader of the new header\n        header.subHeaders.push(headerToGroup)\n        // Add the new header to the pendingParentHeaders to get grouped\n        // in the next batch\n        pendingParentHeaders.push(header)\n      }\n\n      headerGroup.headers.push(\n        headerToGroup as Header<TFeatures, TData, unknown>,\n      )\n      headerToGroup.headerGroup = headerGroup\n    })\n\n    headerGroups.push(headerGroup)\n\n    if (depth > 0) {\n      constructHeaderGroup(pendingParentHeaders, depth - 1)\n    }\n  }\n\n  const bottomHeaders = columnsToGroup.map((column, index) =>\n    constructHeader(table, column, {\n      depth: maxDepth,\n      index,\n    }),\n  )\n\n  constructHeaderGroup(bottomHeaders, maxDepth - 1)\n\n  headerGroups.reverse()\n\n  const recurseHeadersForSpans = (\n    headers: Array<Header<TFeatures, TData, TValue>>,\n  ): Array<{ colSpan: number; rowSpan: number }> => {\n    const results: Array<{ colSpan: number; rowSpan: number }> = []\n\n    for (let i = 0; i < headers.length; i++) {\n      const header = headers[i]!\n      if (\n        !callMemoOrStaticFn(header.column, 'getIsVisible', column_getIsVisible)\n      ) {\n        continue\n      }\n\n      let colSpan = 0\n      let minChildRowSpan = Infinity\n\n      if (header.subHeaders.length) {\n        const childSpans = recurseHeadersForSpans(header.subHeaders)\n        for (let j = 0; j < childSpans.length; j++) {\n          const child = childSpans[j]!\n          colSpan += child.colSpan\n          if (child.rowSpan < minChildRowSpan) {\n            minChildRowSpan = child.rowSpan\n          }\n        }\n      } else {\n        colSpan = 1\n        minChildRowSpan = 0\n      }\n\n      header.colSpan = colSpan\n      header.rowSpan = minChildRowSpan\n\n      results.push({ colSpan, rowSpan: header.rowSpan })\n    }\n\n    return results\n  }\n\n  recurseHeadersForSpans(\n    (headerGroups[0]?.headers ?? []) as Array<Header<TFeatures, TData, TValue>>,\n  )\n\n  return headerGroups\n}\n"],"mappings":";;;;;;;;;;AAeA,SAAgB,kBAKd,YACA,gBACA,OACA,cACA;CAOA,IAAI,WAAW;CAEf,MAAM,gBACJ,SACA,QAAQ,MACL;EACH,WAAW,KAAK,IAAI,UAAU,KAAK;EAEnC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IAAI,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAChE;QAAI,OAAO,QAAQ,QACjB,aAAa,OAAO,SAAS,QAAQ,CAAC;GACxC;EAEJ;CACF;CAEA,aAAa,UAAU;CAEvB,MAAM,eAAqD,CAAC;CAE5D,MAAM,wBACJ,gBACA,UACG;EAEH,MAAM,cAA6C;GACjD;GACA,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG;GACvD,SAAS,CAAC;EACZ;EAGA,MAAM,uBAAgE,CAAC;EAGvE,eAAe,SAAS,kBAAkB;GAGxC,MAAM,4BACJ,qBAAqB,qBAAqB,SAAS;GAErD,MAAM,eAAe,cAAc,OAAO,UAAU,YAAY;GAEhE,IAAI;GACJ,IAAI,gBAAgB;GAEpB,IAAI,gBAAgB,cAAc,OAAO,QAEvC,SAAS,cAAc,OAAO;QACzB;IAEL,SAAS,cAAc;IACvB,gBAAgB;GAClB;GAEA,IACE,6BACA,0BAA0B,WAAW,QAGrC,0BAA0B,WAAW,KAAK,aAAa;QAClD;IAEL,MAAM,SAAS,gBAAgB,OAAO,QAAQ;KAC5C,IAAI;MAAC;MAAc;MAAO,OAAO;MAAI,cAAc;KAAE,CAAC,CACnD,OAAO,OAAO,CAAC,CACf,KAAK,GAAG;KACX;KACA,eAAe,gBACX,GAAG,qBAAqB,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC,WAC3D;KACJ;KACA,OAAO,qBAAqB;IAC9B,CAAC;IAGD,OAAO,WAAW,KAAK,aAAa;IAGpC,qBAAqB,KAAK,MAAM;GAClC;GAEA,YAAY,QAAQ,KAClB,aACF;GACA,cAAc,cAAc;EAC9B,CAAC;EAED,aAAa,KAAK,WAAW;EAE7B,IAAI,QAAQ,GACV,qBAAqB,sBAAsB,QAAQ,CAAC;CAExD;CASA,qBAPsB,eAAe,KAAK,QAAQ,UAChD,gBAAgB,OAAO,QAAQ;EAC7B,OAAO;EACP;CACF,CAAC,CAG8B,GAAG,WAAW,CAAC;CAEhD,aAAa,QAAQ;CAErB,MAAM,0BACJ,YACgD;EAChD,MAAM,UAAuD,CAAC;EAE9D,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IACE,CAAC,mBAAmB,OAAO,QAAQ,gBAAgB,mBAAmB,GAEtE;GAGF,IAAI,UAAU;GACd,IAAI,kBAAkB;GAEtB,IAAI,OAAO,WAAW,QAAQ;IAC5B,MAAM,aAAa,uBAAuB,OAAO,UAAU;IAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;KAC1C,MAAM,QAAQ,WAAW;KACzB,WAAW,MAAM;KACjB,IAAI,MAAM,UAAU,iBAClB,kBAAkB,MAAM;IAE5B;GACF,OAAO;IACL,UAAU;IACV,kBAAkB;GACpB;GAEA,OAAO,UAAU;GACjB,OAAO,UAAU;GAEjB,QAAQ,KAAK;IAAE;IAAS,SAAS,OAAO;GAAQ,CAAC;EACnD;EAEA,OAAO;CACT;CAEA,uBACG,aAAa,EAAE,EAAE,WAAW,CAAC,CAChC;CAEA,OAAO;AACT"}
+{"version":3,"file":"buildHeaderGroups.js","names":[],"sources":["../../../src/core/headers/buildHeaderGroups.ts"],"sourcesContent":["import { callMemoOrStaticFn } from '../../utils'\nimport { column_getIsVisible } from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { constructHeader } from './constructHeader'\nimport type { Table_Internal } from '../../types/Table'\nimport type { CellData, RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header } from '../../types/Header'\nimport type { HeaderGroup } from '../../types/HeaderGroup'\nimport type { Column } from '../../types/Column'\n\n/**\n * Builds the nested header group structure for a table.\n *\n * The result accounts for visible leaf columns, pinned column groups, and placeholder headers needed to render multi-level headers.\n */\nexport function buildHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  allColumns: Array<Column<TFeatures, TData, TValue>>,\n  columnsToGroup: Array<Column<TFeatures, TData, TValue>>,\n  table: Table_Internal<TFeatures, TData>,\n  headerFamily?: 'center' | 'start' | 'end',\n) {\n  // Find the max depth of the columns:\n  // build the leaf column row\n  // build each buffer row going up\n  //    placeholder for non-existent level\n  //    real column for existing level\n\n  let maxDepth = 0\n\n  const findMaxDepth = (\n    columns: Array<Column<TFeatures, TData, TValue>>,\n    depth = 1,\n  ) => {\n    maxDepth = Math.max(maxDepth, depth)\n\n    for (let i = 0; i < columns.length; i++) {\n      const column = columns[i]!\n      if (callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)) {\n        if (column.columns.length) {\n          findMaxDepth(column.columns, depth + 1)\n        }\n      }\n    }\n  }\n\n  findMaxDepth(allColumns)\n\n  const headerGroups: Array<HeaderGroup<TFeatures, TData>> = []\n\n  const constructHeaderGroup = (\n    headersToGroup: Array<Header<TFeatures, TData, TValue>>,\n    depth: number,\n  ) => {\n    // The header group we are creating\n    const headerGroup: HeaderGroup<TFeatures, TData> = {\n      depth,\n      id: [headerFamily, `${depth}`].filter(Boolean).join('_'),\n      headers: [],\n    }\n\n    // The parent columns we're going to scan next\n    const pendingParentHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n    // Scan each column for parents\n    headersToGroup.forEach((headerToGroup) => {\n      // What is the latest (last) parent column?\n\n      const latestPendingParentHeader =\n        pendingParentHeaders[pendingParentHeaders.length - 1]\n\n      const isLeafHeader = headerToGroup.column.depth === headerGroup.depth\n\n      let column: Column<TFeatures, TData, TValue>\n      let isPlaceholder = false\n\n      if (isLeafHeader && headerToGroup.column.parent) {\n        // The parent header is new\n        column = headerToGroup.column.parent\n      } else {\n        // The parent header is repeated\n        column = headerToGroup.column\n        isPlaceholder = true\n      }\n\n      if (\n        latestPendingParentHeader &&\n        latestPendingParentHeader.column === column\n      ) {\n        // This column is repeated. Add it as a sub header to the next batch\n        latestPendingParentHeader.subHeaders.push(headerToGroup)\n      } else {\n        // This is a new header. Let's create it\n        const header = constructHeader(table, column, {\n          id: [headerFamily, depth, column.id, headerToGroup.id]\n            .filter(Boolean)\n            .join('_'),\n          isPlaceholder,\n          placeholderId: isPlaceholder\n            ? `${pendingParentHeaders.filter((d) => d.column === column).length}`\n            : undefined,\n          depth,\n          index: pendingParentHeaders.length,\n        })\n\n        // Add the headerToGroup as a subHeader of the new header\n        header.subHeaders.push(headerToGroup)\n        // Add the new header to the pendingParentHeaders to get grouped\n        // in the next batch\n        pendingParentHeaders.push(header)\n      }\n\n      headerGroup.headers.push(\n        headerToGroup as Header<TFeatures, TData, unknown>,\n      )\n      headerToGroup.headerGroup = headerGroup\n    })\n\n    headerGroups.push(headerGroup)\n\n    if (depth > 0) {\n      constructHeaderGroup(pendingParentHeaders, depth - 1)\n    }\n  }\n\n  const bottomHeaders = columnsToGroup.map((column, index) =>\n    constructHeader(table, column, {\n      depth: maxDepth,\n      index,\n    }),\n  )\n\n  constructHeaderGroup(bottomHeaders, maxDepth - 1)\n\n  headerGroups.reverse()\n\n  const recurseHeadersForSpans = (\n    headers: Array<Header<TFeatures, TData, TValue>>,\n  ): Array<{ colSpan: number; rowSpan: number }> => {\n    const results: Array<{ colSpan: number; rowSpan: number }> = []\n\n    for (let i = 0; i < headers.length; i++) {\n      const header = headers[i]!\n      if (\n        !callMemoOrStaticFn(header.column, 'getIsVisible', column_getIsVisible)\n      ) {\n        continue\n      }\n\n      let colSpan = 0\n      let minChildRowSpan = Infinity\n\n      if (header.subHeaders.length) {\n        const childSpans = recurseHeadersForSpans(header.subHeaders)\n        for (let j = 0; j < childSpans.length; j++) {\n          const child = childSpans[j]!\n          colSpan += child.colSpan\n          if (child.rowSpan < minChildRowSpan) {\n            minChildRowSpan = child.rowSpan\n          }\n        }\n      } else {\n        colSpan = 1\n        minChildRowSpan = 0\n      }\n\n      header.colSpan = colSpan\n      header.rowSpan = minChildRowSpan\n\n      results.push({ colSpan, rowSpan: header.rowSpan })\n    }\n\n    return results\n  }\n\n  recurseHeadersForSpans(\n    (headerGroups[0]?.headers ?? []) as Array<Header<TFeatures, TData, TValue>>,\n  )\n\n  return headerGroups\n}\n"],"mappings":";;;;;;;;;;AAeA,SAAgB,kBAKd,YACA,gBACA,OACA,cACA;CAOA,IAAI,WAAW;CAEf,MAAM,gBACJ,SACA,QAAQ,MACL;EACH,WAAW,KAAK,IAAI,UAAU,KAAK;EAEnC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IAAI,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAChE;QAAI,OAAO,QAAQ,QACjB,aAAa,OAAO,SAAS,QAAQ,CAAC;GACxC;EAEJ;CACF;CAEA,aAAa,UAAU;CAEvB,MAAM,eAAqD,CAAC;CAE5D,MAAM,wBACJ,gBACA,UACG;EAEH,MAAM,cAA6C;GACjD;GACA,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,KAAK,GAAG;GACvD,SAAS,CAAC;EACZ;EAGA,MAAM,uBAAgE,CAAC;EAGvE,eAAe,SAAS,kBAAkB;GAGxC,MAAM,4BACJ,qBAAqB,qBAAqB,SAAS;GAErD,MAAM,eAAe,cAAc,OAAO,UAAU,YAAY;GAEhE,IAAI;GACJ,IAAI,gBAAgB;GAEpB,IAAI,gBAAgB,cAAc,OAAO,QAEvC,SAAS,cAAc,OAAO;QACzB;IAEL,SAAS,cAAc;IACvB,gBAAgB;GAClB;GAEA,IACE,6BACA,0BAA0B,WAAW,QAGrC,0BAA0B,WAAW,KAAK,aAAa;QAClD;IAEL,MAAM,SAAS,gBAAgB,OAAO,QAAQ;KAC5C,IAAI;MAAC;MAAc;MAAO,OAAO;MAAI,cAAc;KAAE,CAAC,CACnD,OAAO,OAAO,CAAC,CACf,KAAK,GAAG;KACX;KACA,eAAe,gBACX,GAAG,qBAAqB,QAAQ,MAAM,EAAE,WAAW,MAAM,CAAC,CAAC,WAC3D;KACJ;KACA,OAAO,qBAAqB;IAC9B,CAAC;IAGD,OAAO,WAAW,KAAK,aAAa;IAGpC,qBAAqB,KAAK,MAAM;GAClC;GAEA,YAAY,QAAQ,KAClB,aACF;GACA,cAAc,cAAc;EAC9B,CAAC;EAED,aAAa,KAAK,WAAW;EAE7B,IAAI,QAAQ,GACV,qBAAqB,sBAAsB,QAAQ,CAAC;CAExD;CASA,qBAPsB,eAAe,KAAK,QAAQ,UAChD,gBAAgB,OAAO,QAAQ;EAC7B,OAAO;EACP;CACF,CAAC,CAG8B,GAAG,WAAW,CAAC;CAEhD,aAAa,QAAQ;CAErB,MAAM,0BACJ,YACgD;EAChD,MAAM,UAAuD,CAAC;EAE9D,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;GACvB,IACE,CAAC,mBAAmB,OAAO,QAAQ,gBAAgB,mBAAmB,GAEtE;GAGF,IAAI,UAAU;GACd,IAAI,kBAAkB;GAEtB,IAAI,OAAO,WAAW,QAAQ;IAC5B,MAAM,aAAa,uBAAuB,OAAO,UAAU;IAC3D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;KAC1C,MAAM,QAAQ,WAAW;KACzB,WAAW,MAAM;KACjB,IAAI,MAAM,UAAU,iBAClB,kBAAkB,MAAM;IAE5B;GACF,OAAO;IACL,UAAU;IACV,kBAAkB;GACpB;GAEA,OAAO,UAAU;GACjB,OAAO,UAAU;GAEjB,QAAQ,KAAK;IAAE;IAAS,SAAS,OAAO;GAAQ,CAAC;EACnD;EAEA,OAAO;CACT;CAEA,uBACG,aAAa,EAAE,EAAE,WAAW,CAAC,CAChC;CAEA,OAAO;AACT"}

package/dist/core/headers/coreHeadersFeature.utils.cjs

@@ -53,22 +53,22 @@ function header_getContext(header) {
 * ```
 */
 function table_getHeaderGroups(table) {
-	const { left, right } = table.atoms.columnPinning?.get() ?? require_columnPinningFeature_utils.getDefaultColumnPinningState();
+	const { start, end } = table.atoms.columnPinning?.get() ?? require_columnPinningFeature_utils.getDefaultColumnPinningState();
 	const allColumns = table.getAllColumns();
 	const leafColumns = require_utils.callMemoOrStaticFn(table, "getVisibleLeafColumns", require_columnVisibilityFeature_utils.table_getVisibleLeafColumns);
-	if (!left.length && !right.length) return require_buildHeaderGroups.buildHeaderGroups(allColumns, leafColumns, table);
+	if (!start.length && !end.length) return require_buildHeaderGroups.buildHeaderGroups(allColumns, leafColumns, table);
 	const leafColumnsById = table.getAllLeafColumnsById();
 	const leftColumns = [];
-	for (let i = 0; i < left.length; i++) {
-		const column = leafColumnsById[left[i]];
+	for (let i = 0; i < start.length; i++) {
+		const column = leafColumnsById[start[i]];
 		if (column && require_utils.callMemoOrStaticFn(column, "getIsVisible", require_columnVisibilityFeature_utils.column_getIsVisible)) leftColumns.push(column);
 	}
 	const rightColumns = [];
-	for (let i = 0; i < right.length; i++) {
-		const column = leafColumnsById[right[i]];
+	for (let i = 0; i < end.length; i++) {
+		const column = leafColumnsById[end[i]];
 		if (column && require_utils.callMemoOrStaticFn(column, "getIsVisible", require_columnVisibilityFeature_utils.column_getIsVisible)) rightColumns.push(column);
 	}
-	const centerColumns = leafColumns.filter((column) => !left.includes(column.id) && !right.includes(column.id));
+	const centerColumns = leafColumns.filter((column) => !start.includes(column.id) && !end.includes(column.id));
 	return require_buildHeaderGroups.buildHeaderGroups(allColumns, [
 		...leftColumns,
 		...centerColumns,

package/dist/core/headers/coreHeadersFeature.utils.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"coreHeadersFeature.utils.cjs","names":["getDefaultColumnPinningState","callMemoOrStaticFn","table_getVisibleLeafColumns","buildHeaderGroups","column_getIsVisible"],"sources":["../../../src/core/headers/coreHeadersFeature.utils.ts"],"sourcesContent":["import { getDefaultColumnPinningState } from '../../features/column-pinning/columnPinningFeature.utils'\nimport {\n  column_getIsVisible,\n  table_getVisibleLeafColumns,\n} from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { callMemoOrStaticFn } from '../../utils'\nimport { buildHeaderGroups } from './buildHeaderGroups'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Header } from '../../types/Header'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header_Header } from './coreHeadersFeature.types'\n\n/**\n * Walks a header tree and collects all descendant leaf headers.\n *\n * The header itself is included after its descendants, matching the recursive\n * shape used by nested header groups.\n *\n * @example\n * ```ts\n * const leafHeaders = header_getLeafHeaders(header)\n * ```\n */\nexport function header_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  const leafHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n  const recurseHeader = (h: Header_Header<TFeatures, TData, TValue>) => {\n    if (h.subHeaders.length) {\n      h.subHeaders.map(recurseHeader)\n    }\n    leafHeaders.push(h as Header<TFeatures, TData, TValue>)\n  }\n\n  recurseHeader(header)\n\n  return leafHeaders\n}\n\n/**\n * Builds the render context passed to a column's `header` or `footer` template.\n *\n * The context contains the header, its column, and the owning table instance.\n *\n * @example\n * ```ts\n * const context = header_getContext(header)\n * ```\n */\nexport function header_getContext<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  return {\n    column: header.column,\n    header,\n    table: header.column.table,\n  }\n}\n\n/**\n * Builds visible header groups for the current column tree.\n *\n * Column visibility and pinning are applied before groups are built. When no\n * columns are pinned, the fast path skips pin partitioning.\n *\n * @example\n * ```ts\n * const headerGroups = table_getHeaderGroups(table)\n * ```\n */\nexport function table_getHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const { left, right } =\n    table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState()\n  const allColumns = table.getAllColumns()\n  const leafColumns = callMemoOrStaticFn(\n    table,\n    'getVisibleLeafColumns',\n    table_getVisibleLeafColumns,\n  )\n\n  // Fast path: no columns are pinned — skip per-side lookups, partition, and spread.\n  if (!left.length && !right.length) {\n    return buildHeaderGroups(allColumns, leafColumns, table)\n  }\n\n  const leafColumnsById = table.getAllLeafColumnsById()\n\n  const leftColumns: typeof leafColumns = []\n  for (let i = 0; i < left.length; i++) {\n    const column = leafColumnsById[left[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      leftColumns.push(column)\n    }\n  }\n\n  const rightColumns: typeof leafColumns = []\n  for (let i = 0; i < right.length; i++) {\n    const column = leafColumnsById[right[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      rightColumns.push(column)\n    }\n  }\n\n  const centerColumns = leafColumns.filter(\n    (column) => !left.includes(column.id) && !right.includes(column.id),\n  )\n\n  return buildHeaderGroups(\n    allColumns,\n    [...leftColumns, ...centerColumns, ...rightColumns],\n    table,\n  )\n}\n\n/**\n * Builds footer groups by reversing the current header groups.\n *\n * Footer rendering uses the same header objects and grouping structure, but\n * renders them from leaf level back toward the root.\n *\n * @example\n * ```ts\n * const footerGroups = table_getFooterGroups(table)\n * ```\n */\nexport function table_getFooterGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  return [...headerGroups].reverse()\n}\n\n/**\n * Flattens every header from every header group into one array.\n *\n * The result includes parent headers and placeholder headers, in header-group\n * order from top to bottom.\n *\n * @example\n * ```ts\n * const flatHeaders = table_getFlatHeaders(table)\n * ```\n */\nexport function table_getFlatHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < headerGroups.length; i++) {\n    const headers = headerGroups[i]!.headers\n    for (let j = 0; j < headers.length; j++) {\n      result.push(headers[j]!)\n    }\n  }\n  return result\n}\n\n/**\n * Collects only the leaf headers from the current header tree.\n *\n * Parent/group headers are skipped, making the result suitable for rendering\n * one header per visible leaf column.\n *\n * @example\n * ```ts\n * const leafHeaders = table_getLeafHeaders(table)\n * ```\n */\nexport function table_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const topHeaders = table.getHeaderGroups()[0]?.headers ?? []\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < topHeaders.length; i++) {\n    const leafHeaders = topHeaders[i]!.getLeafHeaders()\n    for (let j = 0; j < leafHeaders.length; j++) {\n      result.push(leafHeaders[j]!)\n    }\n  }\n  return result\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwBA,SAAgB,sBAId,QAA0C;CAC1C,MAAM,cAAuD,CAAC;CAE9D,MAAM,iBAAiB,MAA+C;EACpE,IAAI,EAAE,WAAW,QACf,EAAE,WAAW,IAAI,aAAa;EAEhC,YAAY,KAAK,CAAqC;CACxD;CAEA,cAAc,MAAM;CAEpB,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,kBAId,QAA0C;CAC1C,OAAO;EACL,QAAQ,OAAO;EACf;EACA,OAAO,OAAO,OAAO;CACvB;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CACzC,MAAM,EAAE,MAAM,UACZ,MAAM,MAAM,eAAe,IAAI,KAAKA,gEAA6B;CACnE,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,cAAcC,iCAClB,OACA,yBACAC,iEACF;CAGA,IAAI,CAAC,KAAK,UAAU,CAAC,MAAM,QACzB,OAAOC,4CAAkB,YAAY,aAAa,KAAK;CAGzD,MAAM,kBAAkB,MAAM,sBAAsB;CAEpD,MAAM,cAAkC,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,SAAS,gBAAgB,KAAK;EACpC,IACE,UACAF,iCAAmB,QAAQ,gBAAgBG,yDAAmB,GAE9D,YAAY,KAAK,MAAM;CAE3B;CAEA,MAAM,eAAmC,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,SAAS,gBAAgB,MAAM;EACrC,IACE,UACAH,iCAAmB,QAAQ,gBAAgBG,yDAAmB,GAE9D,aAAa,KAAK,MAAM;CAE5B;CAEA,MAAM,gBAAgB,YAAY,QAC/B,WAAW,CAAC,KAAK,SAAS,OAAO,EAAE,KAAK,CAAC,MAAM,SAAS,OAAO,EAAE,CACpE;CAEA,OAAOD,4CACL,YACA;EAAC,GAAG;EAAa,GAAG;EAAe,GAAG;CAAY,GAClD,KACF;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CAEzC,OAAO,CAAC,GADa,MAAM,gBACL,CAAC,CAAC,CAAC,QAAQ;AACnC;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,eAAe,MAAM,gBAAgB;CAC3C,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,UAAU,aAAa,EAAE,CAAE;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,OAAO,KAAK,QAAQ,EAAG;CAE3B;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,aAAa,MAAM,gBAAgB,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC;CAC3D,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,cAAc,WAAW,EAAE,CAAE,eAAe;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,OAAO,KAAK,YAAY,EAAG;CAE/B;CACA,OAAO;AACT"}
+{"version":3,"file":"coreHeadersFeature.utils.cjs","names":["getDefaultColumnPinningState","callMemoOrStaticFn","table_getVisibleLeafColumns","buildHeaderGroups","column_getIsVisible"],"sources":["../../../src/core/headers/coreHeadersFeature.utils.ts"],"sourcesContent":["import { getDefaultColumnPinningState } from '../../features/column-pinning/columnPinningFeature.utils'\nimport {\n  column_getIsVisible,\n  table_getVisibleLeafColumns,\n} from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { callMemoOrStaticFn } from '../../utils'\nimport { buildHeaderGroups } from './buildHeaderGroups'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Header } from '../../types/Header'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header_Header } from './coreHeadersFeature.types'\n\n/**\n * Walks a header tree and collects all descendant leaf headers.\n *\n * The header itself is included after its descendants, matching the recursive\n * shape used by nested header groups.\n *\n * @example\n * ```ts\n * const leafHeaders = header_getLeafHeaders(header)\n * ```\n */\nexport function header_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  const leafHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n  const recurseHeader = (h: Header_Header<TFeatures, TData, TValue>) => {\n    if (h.subHeaders.length) {\n      h.subHeaders.map(recurseHeader)\n    }\n    leafHeaders.push(h as Header<TFeatures, TData, TValue>)\n  }\n\n  recurseHeader(header)\n\n  return leafHeaders\n}\n\n/**\n * Builds the render context passed to a column's `header` or `footer` template.\n *\n * The context contains the header, its column, and the owning table instance.\n *\n * @example\n * ```ts\n * const context = header_getContext(header)\n * ```\n */\nexport function header_getContext<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  return {\n    column: header.column,\n    header,\n    table: header.column.table,\n  }\n}\n\n/**\n * Builds visible header groups for the current column tree.\n *\n * Column visibility and pinning are applied before groups are built. When no\n * columns are pinned, the fast path skips pin partitioning.\n *\n * @example\n * ```ts\n * const headerGroups = table_getHeaderGroups(table)\n * ```\n */\nexport function table_getHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const { start, end } =\n    table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState()\n  const allColumns = table.getAllColumns()\n  const leafColumns = callMemoOrStaticFn(\n    table,\n    'getVisibleLeafColumns',\n    table_getVisibleLeafColumns,\n  )\n\n  // Fast path: no columns are pinned — skip per-side lookups, partition, and spread.\n  if (!start.length && !end.length) {\n    return buildHeaderGroups(allColumns, leafColumns, table)\n  }\n\n  const leafColumnsById = table.getAllLeafColumnsById()\n\n  const leftColumns: typeof leafColumns = []\n  for (let i = 0; i < start.length; i++) {\n    const column = leafColumnsById[start[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      leftColumns.push(column)\n    }\n  }\n\n  const rightColumns: typeof leafColumns = []\n  for (let i = 0; i < end.length; i++) {\n    const column = leafColumnsById[end[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      rightColumns.push(column)\n    }\n  }\n\n  const centerColumns = leafColumns.filter(\n    (column) => !start.includes(column.id) && !end.includes(column.id),\n  )\n\n  return buildHeaderGroups(\n    allColumns,\n    [...leftColumns, ...centerColumns, ...rightColumns],\n    table,\n  )\n}\n\n/**\n * Builds footer groups by reversing the current header groups.\n *\n * Footer rendering uses the same header objects and grouping structure, but\n * renders them from leaf level back toward the root.\n *\n * @example\n * ```ts\n * const footerGroups = table_getFooterGroups(table)\n * ```\n */\nexport function table_getFooterGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  return [...headerGroups].reverse()\n}\n\n/**\n * Flattens every header from every header group into one array.\n *\n * The result includes parent headers and placeholder headers, in header-group\n * order from top to bottom.\n *\n * @example\n * ```ts\n * const flatHeaders = table_getFlatHeaders(table)\n * ```\n */\nexport function table_getFlatHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < headerGroups.length; i++) {\n    const headers = headerGroups[i]!.headers\n    for (let j = 0; j < headers.length; j++) {\n      result.push(headers[j]!)\n    }\n  }\n  return result\n}\n\n/**\n * Collects only the leaf headers from the current header tree.\n *\n * Parent/group headers are skipped, making the result suitable for rendering\n * one header per visible leaf column.\n *\n * @example\n * ```ts\n * const leafHeaders = table_getLeafHeaders(table)\n * ```\n */\nexport function table_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const topHeaders = table.getHeaderGroups()[0]?.headers ?? []\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < topHeaders.length; i++) {\n    const leafHeaders = topHeaders[i]!.getLeafHeaders()\n    for (let j = 0; j < leafHeaders.length; j++) {\n      result.push(leafHeaders[j]!)\n    }\n  }\n  return result\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwBA,SAAgB,sBAId,QAA0C;CAC1C,MAAM,cAAuD,CAAC;CAE9D,MAAM,iBAAiB,MAA+C;EACpE,IAAI,EAAE,WAAW,QACf,EAAE,WAAW,IAAI,aAAa;EAEhC,YAAY,KAAK,CAAqC;CACxD;CAEA,cAAc,MAAM;CAEpB,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,kBAId,QAA0C;CAC1C,OAAO;EACL,QAAQ,OAAO;EACf;EACA,OAAO,OAAO,OAAO;CACvB;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CACzC,MAAM,EAAE,OAAO,QACb,MAAM,MAAM,eAAe,IAAI,KAAKA,gEAA6B;CACnE,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,cAAcC,iCAClB,OACA,yBACAC,iEACF;CAGA,IAAI,CAAC,MAAM,UAAU,CAAC,IAAI,QACxB,OAAOC,4CAAkB,YAAY,aAAa,KAAK;CAGzD,MAAM,kBAAkB,MAAM,sBAAsB;CAEpD,MAAM,cAAkC,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,SAAS,gBAAgB,MAAM;EACrC,IACE,UACAF,iCAAmB,QAAQ,gBAAgBG,yDAAmB,GAE9D,YAAY,KAAK,MAAM;CAE3B;CAEA,MAAM,eAAmC,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,SAAS,gBAAgB,IAAI;EACnC,IACE,UACAH,iCAAmB,QAAQ,gBAAgBG,yDAAmB,GAE9D,aAAa,KAAK,MAAM;CAE5B;CAEA,MAAM,gBAAgB,YAAY,QAC/B,WAAW,CAAC,MAAM,SAAS,OAAO,EAAE,KAAK,CAAC,IAAI,SAAS,OAAO,EAAE,CACnE;CAEA,OAAOD,4CACL,YACA;EAAC,GAAG;EAAa,GAAG;EAAe,GAAG;CAAY,GAClD,KACF;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CAEzC,OAAO,CAAC,GADa,MAAM,gBACL,CAAC,CAAC,CAAC,QAAQ;AACnC;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,eAAe,MAAM,gBAAgB;CAC3C,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,UAAU,aAAa,EAAE,CAAE;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,OAAO,KAAK,QAAQ,EAAG;CAE3B;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,aAAa,MAAM,gBAAgB,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC;CAC3D,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,cAAc,WAAW,EAAE,CAAE,eAAe;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,OAAO,KAAK,YAAY,EAAG;CAE/B;CACA,OAAO;AACT"}

package/dist/core/headers/coreHeadersFeature.utils.js

@@ -53,22 +53,22 @@ function header_getContext(header) {
 * ```
 */
 function table_getHeaderGroups(table) {
-	const { left, right } = table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState();
+	const { start, end } = table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState();
 	const allColumns = table.getAllColumns();
 	const leafColumns = callMemoOrStaticFn(table, "getVisibleLeafColumns", table_getVisibleLeafColumns);
-	if (!left.length && !right.length) return buildHeaderGroups(allColumns, leafColumns, table);
+	if (!start.length && !end.length) return buildHeaderGroups(allColumns, leafColumns, table);
 	const leafColumnsById = table.getAllLeafColumnsById();
 	const leftColumns = [];
-	for (let i = 0; i < left.length; i++) {
-		const column = leafColumnsById[left[i]];
+	for (let i = 0; i < start.length; i++) {
+		const column = leafColumnsById[start[i]];
 		if (column && callMemoOrStaticFn(column, "getIsVisible", column_getIsVisible)) leftColumns.push(column);
 	}
 	const rightColumns = [];
-	for (let i = 0; i < right.length; i++) {
-		const column = leafColumnsById[right[i]];
+	for (let i = 0; i < end.length; i++) {
+		const column = leafColumnsById[end[i]];
 		if (column && callMemoOrStaticFn(column, "getIsVisible", column_getIsVisible)) rightColumns.push(column);
 	}
-	const centerColumns = leafColumns.filter((column) => !left.includes(column.id) && !right.includes(column.id));
+	const centerColumns = leafColumns.filter((column) => !start.includes(column.id) && !end.includes(column.id));
 	return buildHeaderGroups(allColumns, [
 		...leftColumns,
 		...centerColumns,

package/dist/core/headers/coreHeadersFeature.utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"coreHeadersFeature.utils.js","names":[],"sources":["../../../src/core/headers/coreHeadersFeature.utils.ts"],"sourcesContent":["import { getDefaultColumnPinningState } from '../../features/column-pinning/columnPinningFeature.utils'\nimport {\n  column_getIsVisible,\n  table_getVisibleLeafColumns,\n} from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { callMemoOrStaticFn } from '../../utils'\nimport { buildHeaderGroups } from './buildHeaderGroups'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Header } from '../../types/Header'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header_Header } from './coreHeadersFeature.types'\n\n/**\n * Walks a header tree and collects all descendant leaf headers.\n *\n * The header itself is included after its descendants, matching the recursive\n * shape used by nested header groups.\n *\n * @example\n * ```ts\n * const leafHeaders = header_getLeafHeaders(header)\n * ```\n */\nexport function header_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  const leafHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n  const recurseHeader = (h: Header_Header<TFeatures, TData, TValue>) => {\n    if (h.subHeaders.length) {\n      h.subHeaders.map(recurseHeader)\n    }\n    leafHeaders.push(h as Header<TFeatures, TData, TValue>)\n  }\n\n  recurseHeader(header)\n\n  return leafHeaders\n}\n\n/**\n * Builds the render context passed to a column's `header` or `footer` template.\n *\n * The context contains the header, its column, and the owning table instance.\n *\n * @example\n * ```ts\n * const context = header_getContext(header)\n * ```\n */\nexport function header_getContext<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  return {\n    column: header.column,\n    header,\n    table: header.column.table,\n  }\n}\n\n/**\n * Builds visible header groups for the current column tree.\n *\n * Column visibility and pinning are applied before groups are built. When no\n * columns are pinned, the fast path skips pin partitioning.\n *\n * @example\n * ```ts\n * const headerGroups = table_getHeaderGroups(table)\n * ```\n */\nexport function table_getHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const { left, right } =\n    table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState()\n  const allColumns = table.getAllColumns()\n  const leafColumns = callMemoOrStaticFn(\n    table,\n    'getVisibleLeafColumns',\n    table_getVisibleLeafColumns,\n  )\n\n  // Fast path: no columns are pinned — skip per-side lookups, partition, and spread.\n  if (!left.length && !right.length) {\n    return buildHeaderGroups(allColumns, leafColumns, table)\n  }\n\n  const leafColumnsById = table.getAllLeafColumnsById()\n\n  const leftColumns: typeof leafColumns = []\n  for (let i = 0; i < left.length; i++) {\n    const column = leafColumnsById[left[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      leftColumns.push(column)\n    }\n  }\n\n  const rightColumns: typeof leafColumns = []\n  for (let i = 0; i < right.length; i++) {\n    const column = leafColumnsById[right[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      rightColumns.push(column)\n    }\n  }\n\n  const centerColumns = leafColumns.filter(\n    (column) => !left.includes(column.id) && !right.includes(column.id),\n  )\n\n  return buildHeaderGroups(\n    allColumns,\n    [...leftColumns, ...centerColumns, ...rightColumns],\n    table,\n  )\n}\n\n/**\n * Builds footer groups by reversing the current header groups.\n *\n * Footer rendering uses the same header objects and grouping structure, but\n * renders them from leaf level back toward the root.\n *\n * @example\n * ```ts\n * const footerGroups = table_getFooterGroups(table)\n * ```\n */\nexport function table_getFooterGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  return [...headerGroups].reverse()\n}\n\n/**\n * Flattens every header from every header group into one array.\n *\n * The result includes parent headers and placeholder headers, in header-group\n * order from top to bottom.\n *\n * @example\n * ```ts\n * const flatHeaders = table_getFlatHeaders(table)\n * ```\n */\nexport function table_getFlatHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < headerGroups.length; i++) {\n    const headers = headerGroups[i]!.headers\n    for (let j = 0; j < headers.length; j++) {\n      result.push(headers[j]!)\n    }\n  }\n  return result\n}\n\n/**\n * Collects only the leaf headers from the current header tree.\n *\n * Parent/group headers are skipped, making the result suitable for rendering\n * one header per visible leaf column.\n *\n * @example\n * ```ts\n * const leafHeaders = table_getLeafHeaders(table)\n * ```\n */\nexport function table_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const topHeaders = table.getHeaderGroups()[0]?.headers ?? []\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < topHeaders.length; i++) {\n    const leafHeaders = topHeaders[i]!.getLeafHeaders()\n    for (let j = 0; j < leafHeaders.length; j++) {\n      result.push(leafHeaders[j]!)\n    }\n  }\n  return result\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwBA,SAAgB,sBAId,QAA0C;CAC1C,MAAM,cAAuD,CAAC;CAE9D,MAAM,iBAAiB,MAA+C;EACpE,IAAI,EAAE,WAAW,QACf,EAAE,WAAW,IAAI,aAAa;EAEhC,YAAY,KAAK,CAAqC;CACxD;CAEA,cAAc,MAAM;CAEpB,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,kBAId,QAA0C;CAC1C,OAAO;EACL,QAAQ,OAAO;EACf;EACA,OAAO,OAAO,OAAO;CACvB;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CACzC,MAAM,EAAE,MAAM,UACZ,MAAM,MAAM,eAAe,IAAI,KAAK,6BAA6B;CACnE,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,cAAc,mBAClB,OACA,yBACA,2BACF;CAGA,IAAI,CAAC,KAAK,UAAU,CAAC,MAAM,QACzB,OAAO,kBAAkB,YAAY,aAAa,KAAK;CAGzD,MAAM,kBAAkB,MAAM,sBAAsB;CAEpD,MAAM,cAAkC,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;EACpC,MAAM,SAAS,gBAAgB,KAAK;EACpC,IACE,UACA,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAE9D,YAAY,KAAK,MAAM;CAE3B;CAEA,MAAM,eAAmC,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,SAAS,gBAAgB,MAAM;EACrC,IACE,UACA,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAE9D,aAAa,KAAK,MAAM;CAE5B;CAEA,MAAM,gBAAgB,YAAY,QAC/B,WAAW,CAAC,KAAK,SAAS,OAAO,EAAE,KAAK,CAAC,MAAM,SAAS,OAAO,EAAE,CACpE;CAEA,OAAO,kBACL,YACA;EAAC,GAAG;EAAa,GAAG;EAAe,GAAG;CAAY,GAClD,KACF;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CAEzC,OAAO,CAAC,GADa,MAAM,gBACL,CAAC,CAAC,CAAC,QAAQ;AACnC;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,eAAe,MAAM,gBAAgB;CAC3C,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,UAAU,aAAa,EAAE,CAAE;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,OAAO,KAAK,QAAQ,EAAG;CAE3B;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,aAAa,MAAM,gBAAgB,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC;CAC3D,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,cAAc,WAAW,EAAE,CAAE,eAAe;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,OAAO,KAAK,YAAY,EAAG;CAE/B;CACA,OAAO;AACT"}
+{"version":3,"file":"coreHeadersFeature.utils.js","names":[],"sources":["../../../src/core/headers/coreHeadersFeature.utils.ts"],"sourcesContent":["import { getDefaultColumnPinningState } from '../../features/column-pinning/columnPinningFeature.utils'\nimport {\n  column_getIsVisible,\n  table_getVisibleLeafColumns,\n} from '../../features/column-visibility/columnVisibilityFeature.utils'\nimport { callMemoOrStaticFn } from '../../utils'\nimport { buildHeaderGroups } from './buildHeaderGroups'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Header } from '../../types/Header'\nimport type { RowData } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Header_Header } from './coreHeadersFeature.types'\n\n/**\n * Walks a header tree and collects all descendant leaf headers.\n *\n * The header itself is included after its descendants, matching the recursive\n * shape used by nested header groups.\n *\n * @example\n * ```ts\n * const leafHeaders = header_getLeafHeaders(header)\n * ```\n */\nexport function header_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  const leafHeaders: Array<Header<TFeatures, TData, TValue>> = []\n\n  const recurseHeader = (h: Header_Header<TFeatures, TData, TValue>) => {\n    if (h.subHeaders.length) {\n      h.subHeaders.map(recurseHeader)\n    }\n    leafHeaders.push(h as Header<TFeatures, TData, TValue>)\n  }\n\n  recurseHeader(header)\n\n  return leafHeaders\n}\n\n/**\n * Builds the render context passed to a column's `header` or `footer` template.\n *\n * The context contains the header, its column, and the owning table instance.\n *\n * @example\n * ```ts\n * const context = header_getContext(header)\n * ```\n */\nexport function header_getContext<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue,\n>(header: Header<TFeatures, TData, TValue>) {\n  return {\n    column: header.column,\n    header,\n    table: header.column.table,\n  }\n}\n\n/**\n * Builds visible header groups for the current column tree.\n *\n * Column visibility and pinning are applied before groups are built. When no\n * columns are pinned, the fast path skips pin partitioning.\n *\n * @example\n * ```ts\n * const headerGroups = table_getHeaderGroups(table)\n * ```\n */\nexport function table_getHeaderGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const { start, end } =\n    table.atoms.columnPinning?.get() ?? getDefaultColumnPinningState()\n  const allColumns = table.getAllColumns()\n  const leafColumns = callMemoOrStaticFn(\n    table,\n    'getVisibleLeafColumns',\n    table_getVisibleLeafColumns,\n  )\n\n  // Fast path: no columns are pinned — skip per-side lookups, partition, and spread.\n  if (!start.length && !end.length) {\n    return buildHeaderGroups(allColumns, leafColumns, table)\n  }\n\n  const leafColumnsById = table.getAllLeafColumnsById()\n\n  const leftColumns: typeof leafColumns = []\n  for (let i = 0; i < start.length; i++) {\n    const column = leafColumnsById[start[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      leftColumns.push(column)\n    }\n  }\n\n  const rightColumns: typeof leafColumns = []\n  for (let i = 0; i < end.length; i++) {\n    const column = leafColumnsById[end[i]!]\n    if (\n      column &&\n      callMemoOrStaticFn(column, 'getIsVisible', column_getIsVisible)\n    ) {\n      rightColumns.push(column)\n    }\n  }\n\n  const centerColumns = leafColumns.filter(\n    (column) => !start.includes(column.id) && !end.includes(column.id),\n  )\n\n  return buildHeaderGroups(\n    allColumns,\n    [...leftColumns, ...centerColumns, ...rightColumns],\n    table,\n  )\n}\n\n/**\n * Builds footer groups by reversing the current header groups.\n *\n * Footer rendering uses the same header objects and grouping structure, but\n * renders them from leaf level back toward the root.\n *\n * @example\n * ```ts\n * const footerGroups = table_getFooterGroups(table)\n * ```\n */\nexport function table_getFooterGroups<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  return [...headerGroups].reverse()\n}\n\n/**\n * Flattens every header from every header group into one array.\n *\n * The result includes parent headers and placeholder headers, in header-group\n * order from top to bottom.\n *\n * @example\n * ```ts\n * const flatHeaders = table_getFlatHeaders(table)\n * ```\n */\nexport function table_getFlatHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const headerGroups = table.getHeaderGroups()\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < headerGroups.length; i++) {\n    const headers = headerGroups[i]!.headers\n    for (let j = 0; j < headers.length; j++) {\n      result.push(headers[j]!)\n    }\n  }\n  return result\n}\n\n/**\n * Collects only the leaf headers from the current header tree.\n *\n * Parent/group headers are skipped, making the result suitable for rendering\n * one header per visible leaf column.\n *\n * @example\n * ```ts\n * const leafHeaders = table_getLeafHeaders(table)\n * ```\n */\nexport function table_getLeafHeaders<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const topHeaders = table.getHeaderGroups()[0]?.headers ?? []\n  const result: Array<Header<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < topHeaders.length; i++) {\n    const leafHeaders = topHeaders[i]!.getLeafHeaders()\n    for (let j = 0; j < leafHeaders.length; j++) {\n      result.push(leafHeaders[j]!)\n    }\n  }\n  return result\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AAwBA,SAAgB,sBAId,QAA0C;CAC1C,MAAM,cAAuD,CAAC;CAE9D,MAAM,iBAAiB,MAA+C;EACpE,IAAI,EAAE,WAAW,QACf,EAAE,WAAW,IAAI,aAAa;EAEhC,YAAY,KAAK,CAAqC;CACxD;CAEA,cAAc,MAAM;CAEpB,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,kBAId,QAA0C;CAC1C,OAAO;EACL,QAAQ,OAAO;EACf;EACA,OAAO,OAAO,OAAO;CACvB;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CACzC,MAAM,EAAE,OAAO,QACb,MAAM,MAAM,eAAe,IAAI,KAAK,6BAA6B;CACnE,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,cAAc,mBAClB,OACA,yBACA,2BACF;CAGA,IAAI,CAAC,MAAM,UAAU,CAAC,IAAI,QACxB,OAAO,kBAAkB,YAAY,aAAa,KAAK;CAGzD,MAAM,kBAAkB,MAAM,sBAAsB;CAEpD,MAAM,cAAkC,CAAC;CACzC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,SAAS,gBAAgB,MAAM;EACrC,IACE,UACA,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAE9D,YAAY,KAAK,MAAM;CAE3B;CAEA,MAAM,eAAmC,CAAC;CAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,SAAS,gBAAgB,IAAI;EACnC,IACE,UACA,mBAAmB,QAAQ,gBAAgB,mBAAmB,GAE9D,aAAa,KAAK,MAAM;CAE5B;CAEA,MAAM,gBAAgB,YAAY,QAC/B,WAAW,CAAC,MAAM,SAAS,OAAO,EAAE,KAAK,CAAC,IAAI,SAAS,OAAO,EAAE,CACnE;CAEA,OAAO,kBACL,YACA;EAAC,GAAG;EAAa,GAAG;EAAe,GAAG;CAAY,GAClD,KACF;AACF;;;;;;;;;;;;AAaA,SAAgB,sBAGd,OAAyC;CAEzC,OAAO,CAAC,GADa,MAAM,gBACL,CAAC,CAAC,CAAC,QAAQ;AACnC;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,eAAe,MAAM,gBAAgB;CAC3C,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;EAC5C,MAAM,UAAU,aAAa,EAAE,CAAE;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,OAAO,KAAK,QAAQ,EAAG;CAE3B;CACA,OAAO;AACT;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC;CACzC,MAAM,aAAa,MAAM,gBAAgB,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC;CAC3D,MAAM,SAAmD,CAAC;CAC1D,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;EAC1C,MAAM,cAAc,WAAW,EAAE,CAAE,eAAe;EAClD,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KACtC,OAAO,KAAK,YAAY,EAAG;CAE/B;CACA,OAAO;AACT"}

package/dist/core/table/coreTablesFeature.utils.cjs

@@ -20,7 +20,7 @@ function table_syncExternalStateToBaseAtoms(table) {
 			const baseAtom = table.baseAtoms[key];
 			if (!baseAtom) continue;
 			const externalState = state[key];
-			if (externalState !== baseAtom.get()) baseAtom.set(() => externalState);
+			if (externalState !== table._reactivity.untrack(() => baseAtom.get())) baseAtom.set(() => externalState);
 		}
 	});
 }

package/dist/core/table/coreTablesFeature.utils.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"coreTablesFeature.utils.cjs","names":["cloneState","functionalUpdate"],"sources":["../../../src/core/table/coreTablesFeature.utils.ts"],"sourcesContent":["import { cloneState, functionalUpdate } from '../../utils'\nimport type { RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableOptions } from '../../types/TableOptions'\n\n/**\n * Synchronizes externally controlled state slices into the table's base atoms.\n *\n * This keeps legacy `options.state` values reflected in the atom graph so\n * derived atoms, stores, and table APIs read a consistent snapshot.\n *\n * @example\n * ```ts\n * table_syncExternalStateToBaseAtoms(table)\n * ```\n */\nexport function table_syncExternalStateToBaseAtoms<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const state = table.options.state\n  if (!state) {\n    return\n  }\n\n  table._reactivity.batch(() => {\n    for (const key in state) {\n      const baseAtom = (table.baseAtoms as Record<string, any>)[key]\n      if (!baseAtom) {\n        continue\n      }\n\n      const externalState = state[key as keyof typeof state]\n      if (externalState !== baseAtom.get()) {\n        baseAtom.set(() => externalState)\n      }\n    }\n  })\n}\n\n/**\n * Resets all internal table base atoms to `table.initialState`.\n *\n * This resets internally owned state slices in a single reactivity batch. Use\n * feature-specific reset APIs when a slice may be externally owned.\n *\n * @example\n * ```ts\n * table_reset(table)\n * ```\n */\nexport function table_reset<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const snap = cloneState(table.initialState)\n  table._reactivity.batch(() => {\n    const keys = Object.keys(snap) as Array<keyof typeof snap>\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]!\n      ;(table.baseAtoms as any)[key].set(snap[key])\n    }\n  })\n}\n\n/**\n * Merges new table options with the current resolved options.\n *\n * If `options.mergeOptions` is provided, it owns the merge behavior; otherwise\n * options are shallow-merged. Static options that should never change after\n * initialization are restored on a fresh object so framework merge helpers may\n * return readonly getter/proxy objects.\n *\n * @example\n * ```ts\n * const options = table_mergeOptions(table, nextOptions)\n * ```\n */\nexport function table_mergeOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  newOptions: TableOptions<TFeatures, TData>,\n) {\n  const { features, atoms, initialState } = table.options\n\n  // simple merge if no mergeOptions is provided - performant\n  if (!table.options.mergeOptions) {\n    return {\n      ...table.options,\n      ...newOptions,\n      features,\n      atoms,\n      initialState,\n    }\n  }\n\n  // else use the mergeOptions function and preserve getters/setters\n  const mergedOptions = table.options.mergeOptions(\n    table.options as TableOptions<TFeatures, TData>,\n    newOptions,\n  )\n  const descriptors: PropertyDescriptorMap = {\n    ...Object.getOwnPropertyDescriptors(mergedOptions),\n  }\n\n  return Object.defineProperties(\n    Object.create(Object.getPrototypeOf(mergedOptions)),\n    {\n      ...descriptors,\n      features: {\n        value: features,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      atoms: {\n        value: atoms,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      initialState: {\n        value: initialState,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n    },\n  ) as TableOptions<TFeatures, TData>\n}\n\n/**\n * Updates the table options object.\n *\n * The updater receives the current resolved options and the merged result is\n * immediately assigned to the table instance.\n *\n * @example\n * ```ts\n * table_setOptions(table, (old) => old)\n * ```\n */\nexport function table_setOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  updater: Updater<TableOptions<TFeatures, TData>>,\n): void {\n  const newOptions = functionalUpdate(\n    updater,\n    table.options as TableOptions<TFeatures, TData>,\n  )\n  const mergedOptions = table_mergeOptions(table, newOptions)\n\n  if (table.optionsStore) {\n    table.optionsStore.set(() => mergedOptions)\n  } else {\n    table.options = mergedOptions\n  }\n  table_syncExternalStateToBaseAtoms(table)\n}\n"],"mappings":";;;;;;;;;;;;;;AAiBA,SAAgB,mCAGd,OAA+C;CAC/C,MAAM,QAAQ,MAAM,QAAQ;CAC5B,IAAI,CAAC,OACH;CAGF,MAAM,YAAY,YAAY;EAC5B,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,WAAY,MAAM,UAAkC;GAC1D,IAAI,CAAC,UACH;GAGF,MAAM,gBAAgB,MAAM;GAC5B,IAAI,kBAAkB,SAAS,IAAI,GACjC,SAAS,UAAU,aAAa;EAEpC;CACF,CAAC;AACH;;;;;;;;;;;;AAaA,SAAgB,YAGd,OAA+C;CAC/C,MAAM,OAAOA,yBAAW,MAAM,YAAY;CAC1C,MAAM,YAAY,YAAY;EAC5B,MAAM,OAAO,OAAO,KAAK,IAAI;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,MAAM,KAAK;GAChB,AAAC,MAAM,UAAkB,IAAI,CAAC,IAAI,KAAK,IAAI;EAC9C;CACF,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAgB,mBAId,OACA,YACA;CACA,MAAM,EAAE,UAAU,OAAO,iBAAiB,MAAM;CAGhD,IAAI,CAAC,MAAM,QAAQ,cACjB,OAAO;EACL,GAAG,MAAM;EACT,GAAG;EACH;EACA;EACA;CACF;CAIF,MAAM,gBAAgB,MAAM,QAAQ,aAClC,MAAM,SACN,UACF;CACA,MAAM,cAAqC,EACzC,GAAG,OAAO,0BAA0B,aAAa,EACnD;CAEA,OAAO,OAAO,iBACZ,OAAO,OAAO,OAAO,eAAe,aAAa,CAAC,GAClD;EACE,GAAG;EACH,UAAU;GACR,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,OAAO;GACL,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,cAAc;GACZ,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;CACF,CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,iBAId,OACA,SACM;CAKN,MAAM,gBAAgB,mBAAmB,OAJtBC,+BACjB,SACA,MAAM,OAEiD,CAAC;CAE1D,IAAI,MAAM,cACR,MAAM,aAAa,UAAU,aAAa;MAE1C,MAAM,UAAU;CAElB,mCAAmC,KAAK;AAC1C"}
+{"version":3,"file":"coreTablesFeature.utils.cjs","names":["cloneState","functionalUpdate"],"sources":["../../../src/core/table/coreTablesFeature.utils.ts"],"sourcesContent":["import { cloneState, functionalUpdate } from '../../utils'\nimport type { RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableOptions } from '../../types/TableOptions'\n\n/**\n * Synchronizes externally controlled state slices into the table's base atoms.\n *\n * This keeps legacy `options.state` values reflected in the atom graph so\n * derived atoms, stores, and table APIs read a consistent snapshot.\n *\n * @example\n * ```ts\n * table_syncExternalStateToBaseAtoms(table)\n * ```\n */\nexport function table_syncExternalStateToBaseAtoms<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const state = table.options.state\n  if (!state) {\n    return\n  }\n\n  table._reactivity.batch(() => {\n    for (const key in state) {\n      const baseAtom = (table.baseAtoms as Record<string, any>)[key]\n      if (!baseAtom) {\n        continue\n      }\n\n      const externalState = state[key as keyof typeof state]\n      if (externalState !== table._reactivity.untrack(() => baseAtom.get())) {\n        baseAtom.set(() => externalState)\n      }\n    }\n  })\n}\n\n/**\n * Resets all internal table base atoms to `table.initialState`.\n *\n * This resets internally owned state slices in a single reactivity batch. Use\n * feature-specific reset APIs when a slice may be externally owned.\n *\n * @example\n * ```ts\n * table_reset(table)\n * ```\n */\nexport function table_reset<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const snap = cloneState(table.initialState)\n  table._reactivity.batch(() => {\n    const keys = Object.keys(snap) as Array<keyof typeof snap>\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]!\n      ;(table.baseAtoms as any)[key].set(snap[key])\n    }\n  })\n}\n\n/**\n * Merges new table options with the current resolved options.\n *\n * If `options.mergeOptions` is provided, it owns the merge behavior; otherwise\n * options are shallow-merged. Static options that should never change after\n * initialization are restored on a fresh object so framework merge helpers may\n * return readonly getter/proxy objects.\n *\n * @example\n * ```ts\n * const options = table_mergeOptions(table, nextOptions)\n * ```\n */\nexport function table_mergeOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  newOptions: TableOptions<TFeatures, TData>,\n) {\n  const { features, atoms, initialState } = table.options\n\n  // simple merge if no mergeOptions is provided - performant\n  if (!table.options.mergeOptions) {\n    return {\n      ...table.options,\n      ...newOptions,\n      features,\n      atoms,\n      initialState,\n    }\n  }\n\n  // else use the mergeOptions function and preserve getters/setters\n  const mergedOptions = table.options.mergeOptions(\n    table.options as TableOptions<TFeatures, TData>,\n    newOptions,\n  )\n  const descriptors: PropertyDescriptorMap = {\n    ...Object.getOwnPropertyDescriptors(mergedOptions),\n  }\n\n  return Object.defineProperties(\n    Object.create(Object.getPrototypeOf(mergedOptions)),\n    {\n      ...descriptors,\n      features: {\n        value: features,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      atoms: {\n        value: atoms,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      initialState: {\n        value: initialState,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n    },\n  ) as TableOptions<TFeatures, TData>\n}\n\n/**\n * Updates the table options object.\n *\n * The updater receives the current resolved options and the merged result is\n * immediately assigned to the table instance.\n *\n * @example\n * ```ts\n * table_setOptions(table, (old) => old)\n * ```\n */\nexport function table_setOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  updater: Updater<TableOptions<TFeatures, TData>>,\n): void {\n  const newOptions = functionalUpdate(\n    updater,\n    table.options as TableOptions<TFeatures, TData>,\n  )\n  const mergedOptions = table_mergeOptions(table, newOptions)\n\n  if (table.optionsStore) {\n    table.optionsStore.set(() => mergedOptions)\n  } else {\n    table.options = mergedOptions\n  }\n  table_syncExternalStateToBaseAtoms(table)\n}\n"],"mappings":";;;;;;;;;;;;;;AAiBA,SAAgB,mCAGd,OAA+C;CAC/C,MAAM,QAAQ,MAAM,QAAQ;CAC5B,IAAI,CAAC,OACH;CAGF,MAAM,YAAY,YAAY;EAC5B,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,WAAY,MAAM,UAAkC;GAC1D,IAAI,CAAC,UACH;GAGF,MAAM,gBAAgB,MAAM;GAC5B,IAAI,kBAAkB,MAAM,YAAY,cAAc,SAAS,IAAI,CAAC,GAClE,SAAS,UAAU,aAAa;EAEpC;CACF,CAAC;AACH;;;;;;;;;;;;AAaA,SAAgB,YAGd,OAA+C;CAC/C,MAAM,OAAOA,yBAAW,MAAM,YAAY;CAC1C,MAAM,YAAY,YAAY;EAC5B,MAAM,OAAO,OAAO,KAAK,IAAI;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,MAAM,KAAK;GAChB,AAAC,MAAM,UAAkB,IAAI,CAAC,IAAI,KAAK,IAAI;EAC9C;CACF,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAgB,mBAId,OACA,YACA;CACA,MAAM,EAAE,UAAU,OAAO,iBAAiB,MAAM;CAGhD,IAAI,CAAC,MAAM,QAAQ,cACjB,OAAO;EACL,GAAG,MAAM;EACT,GAAG;EACH;EACA;EACA;CACF;CAIF,MAAM,gBAAgB,MAAM,QAAQ,aAClC,MAAM,SACN,UACF;CACA,MAAM,cAAqC,EACzC,GAAG,OAAO,0BAA0B,aAAa,EACnD;CAEA,OAAO,OAAO,iBACZ,OAAO,OAAO,OAAO,eAAe,aAAa,CAAC,GAClD;EACE,GAAG;EACH,UAAU;GACR,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,OAAO;GACL,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,cAAc;GACZ,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;CACF,CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,iBAId,OACA,SACM;CAKN,MAAM,gBAAgB,mBAAmB,OAJtBC,+BACjB,SACA,MAAM,OAEiD,CAAC;CAE1D,IAAI,MAAM,cACR,MAAM,aAAa,UAAU,aAAa;MAE1C,MAAM,UAAU;CAElB,mCAAmC,KAAK;AAC1C"}

package/dist/core/table/coreTablesFeature.utils.js

@@ -20,7 +20,7 @@ function table_syncExternalStateToBaseAtoms(table) {
 			const baseAtom = table.baseAtoms[key];
 			if (!baseAtom) continue;
 			const externalState = state[key];
-			if (externalState !== baseAtom.get()) baseAtom.set(() => externalState);
+			if (externalState !== table._reactivity.untrack(() => baseAtom.get())) baseAtom.set(() => externalState);
 		}
 	});
 }

package/dist/core/table/coreTablesFeature.utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"coreTablesFeature.utils.js","names":[],"sources":["../../../src/core/table/coreTablesFeature.utils.ts"],"sourcesContent":["import { cloneState, functionalUpdate } from '../../utils'\nimport type { RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableOptions } from '../../types/TableOptions'\n\n/**\n * Synchronizes externally controlled state slices into the table's base atoms.\n *\n * This keeps legacy `options.state` values reflected in the atom graph so\n * derived atoms, stores, and table APIs read a consistent snapshot.\n *\n * @example\n * ```ts\n * table_syncExternalStateToBaseAtoms(table)\n * ```\n */\nexport function table_syncExternalStateToBaseAtoms<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const state = table.options.state\n  if (!state) {\n    return\n  }\n\n  table._reactivity.batch(() => {\n    for (const key in state) {\n      const baseAtom = (table.baseAtoms as Record<string, any>)[key]\n      if (!baseAtom) {\n        continue\n      }\n\n      const externalState = state[key as keyof typeof state]\n      if (externalState !== baseAtom.get()) {\n        baseAtom.set(() => externalState)\n      }\n    }\n  })\n}\n\n/**\n * Resets all internal table base atoms to `table.initialState`.\n *\n * This resets internally owned state slices in a single reactivity batch. Use\n * feature-specific reset APIs when a slice may be externally owned.\n *\n * @example\n * ```ts\n * table_reset(table)\n * ```\n */\nexport function table_reset<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const snap = cloneState(table.initialState)\n  table._reactivity.batch(() => {\n    const keys = Object.keys(snap) as Array<keyof typeof snap>\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]!\n      ;(table.baseAtoms as any)[key].set(snap[key])\n    }\n  })\n}\n\n/**\n * Merges new table options with the current resolved options.\n *\n * If `options.mergeOptions` is provided, it owns the merge behavior; otherwise\n * options are shallow-merged. Static options that should never change after\n * initialization are restored on a fresh object so framework merge helpers may\n * return readonly getter/proxy objects.\n *\n * @example\n * ```ts\n * const options = table_mergeOptions(table, nextOptions)\n * ```\n */\nexport function table_mergeOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  newOptions: TableOptions<TFeatures, TData>,\n) {\n  const { features, atoms, initialState } = table.options\n\n  // simple merge if no mergeOptions is provided - performant\n  if (!table.options.mergeOptions) {\n    return {\n      ...table.options,\n      ...newOptions,\n      features,\n      atoms,\n      initialState,\n    }\n  }\n\n  // else use the mergeOptions function and preserve getters/setters\n  const mergedOptions = table.options.mergeOptions(\n    table.options as TableOptions<TFeatures, TData>,\n    newOptions,\n  )\n  const descriptors: PropertyDescriptorMap = {\n    ...Object.getOwnPropertyDescriptors(mergedOptions),\n  }\n\n  return Object.defineProperties(\n    Object.create(Object.getPrototypeOf(mergedOptions)),\n    {\n      ...descriptors,\n      features: {\n        value: features,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      atoms: {\n        value: atoms,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      initialState: {\n        value: initialState,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n    },\n  ) as TableOptions<TFeatures, TData>\n}\n\n/**\n * Updates the table options object.\n *\n * The updater receives the current resolved options and the merged result is\n * immediately assigned to the table instance.\n *\n * @example\n * ```ts\n * table_setOptions(table, (old) => old)\n * ```\n */\nexport function table_setOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  updater: Updater<TableOptions<TFeatures, TData>>,\n): void {\n  const newOptions = functionalUpdate(\n    updater,\n    table.options as TableOptions<TFeatures, TData>,\n  )\n  const mergedOptions = table_mergeOptions(table, newOptions)\n\n  if (table.optionsStore) {\n    table.optionsStore.set(() => mergedOptions)\n  } else {\n    table.options = mergedOptions\n  }\n  table_syncExternalStateToBaseAtoms(table)\n}\n"],"mappings":";;;;;;;;;;;;;;AAiBA,SAAgB,mCAGd,OAA+C;CAC/C,MAAM,QAAQ,MAAM,QAAQ;CAC5B,IAAI,CAAC,OACH;CAGF,MAAM,YAAY,YAAY;EAC5B,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,WAAY,MAAM,UAAkC;GAC1D,IAAI,CAAC,UACH;GAGF,MAAM,gBAAgB,MAAM;GAC5B,IAAI,kBAAkB,SAAS,IAAI,GACjC,SAAS,UAAU,aAAa;EAEpC;CACF,CAAC;AACH;;;;;;;;;;;;AAaA,SAAgB,YAGd,OAA+C;CAC/C,MAAM,OAAO,WAAW,MAAM,YAAY;CAC1C,MAAM,YAAY,YAAY;EAC5B,MAAM,OAAO,OAAO,KAAK,IAAI;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,MAAM,KAAK;GAChB,AAAC,MAAM,UAAkB,IAAI,CAAC,IAAI,KAAK,IAAI;EAC9C;CACF,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAgB,mBAId,OACA,YACA;CACA,MAAM,EAAE,UAAU,OAAO,iBAAiB,MAAM;CAGhD,IAAI,CAAC,MAAM,QAAQ,cACjB,OAAO;EACL,GAAG,MAAM;EACT,GAAG;EACH;EACA;EACA;CACF;CAIF,MAAM,gBAAgB,MAAM,QAAQ,aAClC,MAAM,SACN,UACF;CACA,MAAM,cAAqC,EACzC,GAAG,OAAO,0BAA0B,aAAa,EACnD;CAEA,OAAO,OAAO,iBACZ,OAAO,OAAO,OAAO,eAAe,aAAa,CAAC,GAClD;EACE,GAAG;EACH,UAAU;GACR,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,OAAO;GACL,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,cAAc;GACZ,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;CACF,CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,iBAId,OACA,SACM;CAKN,MAAM,gBAAgB,mBAAmB,OAJtB,iBACjB,SACA,MAAM,OAEiD,CAAC;CAE1D,IAAI,MAAM,cACR,MAAM,aAAa,UAAU,aAAa;MAE1C,MAAM,UAAU;CAElB,mCAAmC,KAAK;AAC1C"}
+{"version":3,"file":"coreTablesFeature.utils.js","names":[],"sources":["../../../src/core/table/coreTablesFeature.utils.ts"],"sourcesContent":["import { cloneState, functionalUpdate } from '../../utils'\nimport type { RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { TableOptions } from '../../types/TableOptions'\n\n/**\n * Synchronizes externally controlled state slices into the table's base atoms.\n *\n * This keeps legacy `options.state` values reflected in the atom graph so\n * derived atoms, stores, and table APIs read a consistent snapshot.\n *\n * @example\n * ```ts\n * table_syncExternalStateToBaseAtoms(table)\n * ```\n */\nexport function table_syncExternalStateToBaseAtoms<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const state = table.options.state\n  if (!state) {\n    return\n  }\n\n  table._reactivity.batch(() => {\n    for (const key in state) {\n      const baseAtom = (table.baseAtoms as Record<string, any>)[key]\n      if (!baseAtom) {\n        continue\n      }\n\n      const externalState = state[key as keyof typeof state]\n      if (externalState !== table._reactivity.untrack(() => baseAtom.get())) {\n        baseAtom.set(() => externalState)\n      }\n    }\n  })\n}\n\n/**\n * Resets all internal table base atoms to `table.initialState`.\n *\n * This resets internally owned state slices in a single reactivity batch. Use\n * feature-specific reset APIs when a slice may be externally owned.\n *\n * @example\n * ```ts\n * table_reset(table)\n * ```\n */\nexport function table_reset<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): void {\n  const snap = cloneState(table.initialState)\n  table._reactivity.batch(() => {\n    const keys = Object.keys(snap) as Array<keyof typeof snap>\n    for (let i = 0; i < keys.length; i++) {\n      const key = keys[i]!\n      ;(table.baseAtoms as any)[key].set(snap[key])\n    }\n  })\n}\n\n/**\n * Merges new table options with the current resolved options.\n *\n * If `options.mergeOptions` is provided, it owns the merge behavior; otherwise\n * options are shallow-merged. Static options that should never change after\n * initialization are restored on a fresh object so framework merge helpers may\n * return readonly getter/proxy objects.\n *\n * @example\n * ```ts\n * const options = table_mergeOptions(table, nextOptions)\n * ```\n */\nexport function table_mergeOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  newOptions: TableOptions<TFeatures, TData>,\n) {\n  const { features, atoms, initialState } = table.options\n\n  // simple merge if no mergeOptions is provided - performant\n  if (!table.options.mergeOptions) {\n    return {\n      ...table.options,\n      ...newOptions,\n      features,\n      atoms,\n      initialState,\n    }\n  }\n\n  // else use the mergeOptions function and preserve getters/setters\n  const mergedOptions = table.options.mergeOptions(\n    table.options as TableOptions<TFeatures, TData>,\n    newOptions,\n  )\n  const descriptors: PropertyDescriptorMap = {\n    ...Object.getOwnPropertyDescriptors(mergedOptions),\n  }\n\n  return Object.defineProperties(\n    Object.create(Object.getPrototypeOf(mergedOptions)),\n    {\n      ...descriptors,\n      features: {\n        value: features,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      atoms: {\n        value: atoms,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n      initialState: {\n        value: initialState,\n        enumerable: true,\n        configurable: true,\n        writable: true,\n      },\n    },\n  ) as TableOptions<TFeatures, TData>\n}\n\n/**\n * Updates the table options object.\n *\n * The updater receives the current resolved options and the merged result is\n * immediately assigned to the table instance.\n *\n * @example\n * ```ts\n * table_setOptions(table, (old) => old)\n * ```\n */\nexport function table_setOptions<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  updater: Updater<TableOptions<TFeatures, TData>>,\n): void {\n  const newOptions = functionalUpdate(\n    updater,\n    table.options as TableOptions<TFeatures, TData>,\n  )\n  const mergedOptions = table_mergeOptions(table, newOptions)\n\n  if (table.optionsStore) {\n    table.optionsStore.set(() => mergedOptions)\n  } else {\n    table.options = mergedOptions\n  }\n  table_syncExternalStateToBaseAtoms(table)\n}\n"],"mappings":";;;;;;;;;;;;;;AAiBA,SAAgB,mCAGd,OAA+C;CAC/C,MAAM,QAAQ,MAAM,QAAQ;CAC5B,IAAI,CAAC,OACH;CAGF,MAAM,YAAY,YAAY;EAC5B,KAAK,MAAM,OAAO,OAAO;GACvB,MAAM,WAAY,MAAM,UAAkC;GAC1D,IAAI,CAAC,UACH;GAGF,MAAM,gBAAgB,MAAM;GAC5B,IAAI,kBAAkB,MAAM,YAAY,cAAc,SAAS,IAAI,CAAC,GAClE,SAAS,UAAU,aAAa;EAEpC;CACF,CAAC;AACH;;;;;;;;;;;;AAaA,SAAgB,YAGd,OAA+C;CAC/C,MAAM,OAAO,WAAW,MAAM,YAAY;CAC1C,MAAM,YAAY,YAAY;EAC5B,MAAM,OAAO,OAAO,KAAK,IAAI;EAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,MAAM,KAAK;GAChB,AAAC,MAAM,UAAkB,IAAI,CAAC,IAAI,KAAK,IAAI;EAC9C;CACF,CAAC;AACH;;;;;;;;;;;;;;AAeA,SAAgB,mBAId,OACA,YACA;CACA,MAAM,EAAE,UAAU,OAAO,iBAAiB,MAAM;CAGhD,IAAI,CAAC,MAAM,QAAQ,cACjB,OAAO;EACL,GAAG,MAAM;EACT,GAAG;EACH;EACA;EACA;CACF;CAIF,MAAM,gBAAgB,MAAM,QAAQ,aAClC,MAAM,SACN,UACF;CACA,MAAM,cAAqC,EACzC,GAAG,OAAO,0BAA0B,aAAa,EACnD;CAEA,OAAO,OAAO,iBACZ,OAAO,OAAO,OAAO,eAAe,aAAa,CAAC,GAClD;EACE,GAAG;EACH,UAAU;GACR,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,OAAO;GACL,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;EACA,cAAc;GACZ,OAAO;GACP,YAAY;GACZ,cAAc;GACd,UAAU;EACZ;CACF,CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,iBAId,OACA,SACM;CAKN,MAAM,gBAAgB,mBAAmB,OAJtB,iBACjB,SACA,MAAM,OAEiD,CAAC;CAE1D,IAAI,MAAM,cACR,MAAM,aAAa,UAAU,aAAa;MAE1C,MAAM,UAAU;CAElB,mCAAmC,KAAK;AAC1C"}

package/dist/features/column-ordering/columnOrderingFeature.types.d.cts

@@ -14,13 +14,13 @@ interface ColumnIndexes {
    */
   center: Record<string, number>;
   /**
-   * Maps each left-pinned visible leaf column id to its index within the left region.
+   * Maps each start-pinned visible leaf column id to its index within the start region.
    */
-  left: Record<string, number>;
+  start: Record<string, number>;
   /**
-   * Maps each right-pinned visible leaf column id to its index within the right region.
+   * Maps each end-pinned visible leaf column id to its index within the end region.
    */
-  right: Record<string, number>;
+  end: Record<string, number>;
 }
 interface TableState_ColumnOrdering {
   columnOrder: ColumnOrderState;
@@ -37,7 +37,7 @@ interface Column_ColumnOrdering {
   /**
    * Finds this column's zero-based index among visible columns.
    *
-   * Pass `'left'`, `'center'`, or `'right'` to measure within that pinned
+   * Pass `'start'`, `'center'`, or `'end'` to measure within that pinned
    * region instead of the full visible leaf order.
    */
   getIndex: (position?: ColumnPinningPosition | 'center') => number;

package/dist/features/column-ordering/columnOrderingFeature.types.d.ts

@@ -14,13 +14,13 @@ interface ColumnIndexes {
    */
   center: Record<string, number>;
   /**
-   * Maps each left-pinned visible leaf column id to its index within the left region.
+   * Maps each start-pinned visible leaf column id to its index within the start region.
    */
-  left: Record<string, number>;
+  start: Record<string, number>;
   /**
-   * Maps each right-pinned visible leaf column id to its index within the right region.
+   * Maps each end-pinned visible leaf column id to its index within the end region.
    */
-  right: Record<string, number>;
+  end: Record<string, number>;
 }
 interface TableState_ColumnOrdering {
   columnOrder: ColumnOrderState;
@@ -37,7 +37,7 @@ interface Column_ColumnOrdering {
   /**
    * Finds this column's zero-based index among visible columns.
    *
-   * Pass `'left'`, `'center'`, or `'right'` to measure within that pinned
+   * Pass `'start'`, `'center'`, or `'end'` to measure within that pinned
    * region instead of the full visible leaf order.
    */
   getIndex: (position?: ColumnPinningPosition | 'center') => number;

package/dist/features/column-ordering/columnOrderingFeature.utils.cjs

@@ -36,14 +36,14 @@ function table_getColumnIndexes(table) {
 	return {
 		all: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table)),
 		center: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table, "center")),
-		left: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table, "left")),
-		right: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table, "right"))
+		start: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table, "start")),
+		end: buildIndexes(require_columnPinningFeature_utils.table_getPinnedVisibleLeafColumns(table, "end"))
 	};
 }
 /**
 * Finds this column's index within a visible pinning region.
 *
-* Pass `'left'`, `'center'`, or `'right'` to search that region; omit the
+* Pass `'start'`, `'center'`, or `'end'` to search that region; omit the
 * position to search the full visible leaf column list.
 *
 * @example
@@ -52,7 +52,7 @@ function table_getColumnIndexes(table) {
 * ```
 */
 function column_getIndex(column, position) {
-	return require_utils.callMemoOrStaticFn(column.table, "getColumnIndexes", table_getColumnIndexes)[position === "left" ? "left" : position === "right" ? "right" : position === "center" ? "center" : "all"][column.id] ?? -1;
+	return require_utils.callMemoOrStaticFn(column.table, "getColumnIndexes", table_getColumnIndexes)[position === "start" ? "start" : position === "end" ? "end" : position === "center" ? "center" : "all"][column.id] ?? -1;
 }
 /**
 * Checks whether this column is the first visible column in a pinning region.
@@ -61,7 +61,7 @@ function column_getIndex(column, position) {
 *
 * @example
 * ```ts
-* const isFirst = column_getIsFirstColumn(column, 'left')
+* const isFirst = column_getIsFirstColumn(column, 'start')
 * ```
 */
 function column_getIsFirstColumn(column, position) {
@@ -74,7 +74,7 @@ function column_getIsFirstColumn(column, position) {
 *
 * @example
 * ```ts
-* const isLast = column_getIsLastColumn(column, 'right')
+* const isLast = column_getIsLastColumn(column, 'end')
 * ```
 */
 function column_getIsLastColumn(column, position) {

package/dist/features/column-ordering/columnOrderingFeature.utils.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"columnOrderingFeature.utils.cjs","names":["makeObjectMap","table_getPinnedVisibleLeafColumns","callMemoOrStaticFn","cloneState"],"sources":["../../../src/features/column-ordering/columnOrderingFeature.utils.ts"],"sourcesContent":["import { table_getPinnedVisibleLeafColumns } from '../column-pinning/columnPinningFeature.utils'\nimport { callMemoOrStaticFn, cloneState, makeObjectMap } from '../../utils'\nimport type { GroupingState } from '../column-grouping/columnGroupingFeature.types'\nimport type { CellData, RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Column, Column_Internal } from '../../types/Column'\nimport type { ColumnPinningPosition } from '../column-pinning/columnPinningFeature.types'\nimport type {\n  ColumnIndexes,\n  ColumnOrderState,\n} from './columnOrderingFeature.types'\n\n/**\n * Creates the default column order state.\n *\n * The feature default is an empty array, meaning leaf columns keep their natural\n * definition order. Reset APIs use this value when `defaultState` is `true`.\n *\n * @example\n * ```ts\n * const order = getDefaultColumnOrderState()\n * ```\n */\nexport function getDefaultColumnOrderState(): ColumnOrderState {\n  return []\n}\n\n/**\n * Builds column-id to index records for each visible pinning region.\n *\n * All four regions are built in one pass so a single memo entry serves every\n * `column_getIndex` lookup without per-column scans.\n *\n * @example\n * ```ts\n * const indexes = table_getColumnIndexes(table)\n * ```\n */\nexport function table_getColumnIndexes<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): ColumnIndexes {\n  const buildIndexes = (\n    columns: ReadonlyArray<\n      | Column<TFeatures, TData, unknown>\n      | Column_Internal<TFeatures, TData, unknown>\n    >,\n  ): Record<string, number> => {\n    const indexes = makeObjectMap<number>()\n    for (let i = 0; i < columns.length; i++) {\n      indexes[columns[i]!.id] = i\n    }\n    return indexes\n  }\n\n  return {\n    all: buildIndexes(table_getPinnedVisibleLeafColumns(table)),\n    center: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'center')),\n    left: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'left')),\n    right: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'right')),\n  }\n}\n\n/**\n * Finds this column's index within a visible pinning region.\n *\n * Pass `'left'`, `'center'`, or `'right'` to search that region; omit the\n * position to search the full visible leaf column list.\n *\n * @example\n * ```ts\n * const index = column_getIndex(column, 'center')\n * ```\n */\nexport function column_getIndex<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const indexes = callMemoOrStaticFn(\n    column.table,\n    'getColumnIndexes',\n    table_getColumnIndexes,\n  )\n  const key =\n    position === 'left'\n      ? 'left'\n      : position === 'right'\n        ? 'right'\n        : position === 'center'\n          ? 'center'\n          : 'all'\n  return indexes[key][column.id] ?? -1\n}\n\n/**\n * Checks whether this column is the first visible column in a pinning region.\n *\n * The same `position` semantics as `column_getIndex` apply.\n *\n * @example\n * ```ts\n * const isFirst = column_getIsFirstColumn(column, 'left')\n * ```\n */\nexport function column_getIsFirstColumn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const columns = table_getPinnedVisibleLeafColumns(column.table, position)\n  return columns[0]?.id === column.id\n}\n\n/**\n * Checks whether this column is the last visible column in a pinning region.\n *\n * The same `position` semantics as `column_getIndex` apply.\n *\n * @example\n * ```ts\n * const isLast = column_getIsLastColumn(column, 'right')\n * ```\n */\nexport function column_getIsLastColumn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const columns = table_getPinnedVisibleLeafColumns(column.table, position)\n  return columns[columns.length - 1]?.id === column.id\n}\n\n/**\n * Routes a column order updater through the table's column-order change handler.\n *\n * The updater may be a next ordered id array or a function of the previous\n * array, matching the instance `table.setColumnOrder` behavior.\n *\n * @example\n * ```ts\n * table_setColumnOrder(table, ['firstName', 'lastName', 'age'])\n * ```\n */\nexport function table_setColumnOrder<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>, updater: Updater<ColumnOrderState>) {\n  table.options.onColumnOrderChange?.(updater)\n}\n\n/**\n * Resets `columnOrder` to the configured initial state or feature default.\n *\n * With no argument, the reset clones `table.initialState.columnOrder` when it\n * exists. Passing `true` ignores initial state and resets to `[]`.\n *\n * @example\n * ```ts\n * table_resetColumnOrder(table)\n * table_resetColumnOrder(table, true)\n * ```\n */\nexport function table_resetColumnOrder<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>, defaultState?: boolean) {\n  table_setColumnOrder(\n    table,\n    defaultState ? [] : cloneState(table.initialState.columnOrder ?? []),\n  )\n}\n\n/**\n * Creates the ordering function used to arrange leaf columns.\n *\n * The returned function applies `state.columnOrder`, preserves unspecified\n * columns in their original order, then delegates to grouping rules.\n *\n * @example\n * ```ts\n * const orderColumnsForTable = table_getOrderColumnsFn(table)\n * ```\n */\nexport function table_getOrderColumnsFn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const columnOrder = table.atoms.columnOrder?.get()\n\n  return (columns: Array<Column_Internal<TFeatures, TData, unknown>>) => {\n    // Sort grouped columns to the start of the column list\n    // before the headers are built\n    let orderedColumns: Array<Column_Internal<TFeatures, TData, unknown>> = []\n\n    // If there is no order, return the normal columns\n    if (!columnOrder?.length) {\n      orderedColumns = columns\n    } else {\n      // Index columns by id for O(1) lookup\n      const remaining = new Map<\n        string,\n        Column_Internal<TFeatures, TData, unknown>\n      >()\n      for (let i = 0; i < columns.length; i++) {\n        const column = columns[i]!\n        remaining.set(column.id, column)\n      }\n\n      // Place columns in the requested order, removing each as it's used\n      // (handles duplicates and unknown ids in columnOrder)\n      for (let i = 0; i < columnOrder.length; i++) {\n        const id = columnOrder[i]!\n        const column = remaining.get(id)\n        if (column) {\n          orderedColumns.push(column)\n          remaining.delete(id)\n        }\n      }\n\n      // Append leftover columns in their original order\n      for (let i = 0; i < columns.length; i++) {\n        const column = columns[i]!\n        if (remaining.has(column.id)) orderedColumns.push(column)\n      }\n    }\n\n    return orderColumns(table, orderedColumns)\n  }\n}\n\n/**\n * Applies grouped-column placement rules to an already ordered leaf-column list.\n *\n * `groupedColumnMode: 'remove'` drops grouped columns from the list.\n * `groupedColumnMode: 'reorder'` moves grouped columns to the front in grouping\n * state order.\n *\n * @example\n * ```ts\n * const orderedColumns = orderColumns(table, leafColumns)\n * ```\n */\nexport function orderColumns<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  leafColumns: Array<Column_Internal<TFeatures, TData, unknown>>,\n) {\n  const grouping = table.atoms.grouping?.get() ?? ([] as GroupingState)\n  const { groupedColumnMode } = table.options\n\n  if (!grouping.length || !groupedColumnMode) {\n    return leafColumns\n  }\n\n  const nonGroupingColumns = leafColumns.filter(\n    (col) => !grouping.includes(col.id),\n  )\n\n  if (groupedColumnMode === 'remove') {\n    return nonGroupingColumns\n  }\n\n  const leafColumnsById = new Map<\n    string,\n    Column_Internal<TFeatures, TData, unknown>\n  >()\n  for (let i = 0; i < leafColumns.length; i++) {\n    const col = leafColumns[i]!\n    leafColumnsById.set(col.id, col)\n  }\n\n  const groupingColumns: Array<Column_Internal<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < grouping.length; i++) {\n    const col = leafColumnsById.get(grouping[i]!)\n    if (col) groupingColumns.push(col)\n  }\n\n  return [...groupingColumns, ...nonGroupingColumns]\n}\n"],"mappings":";;;;;;;;;;;;;;;AAwBA,SAAgB,6BAA+C;CAC7D,OAAO,CAAC;AACV;;;;;;;;;;;;AAaA,SAAgB,uBAGd,OAAwD;CACxD,MAAM,gBACJ,YAI2B;EAC3B,MAAM,UAAUA,4BAAsB;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,QAAQ,QAAQ,EAAE,CAAE,MAAM;EAE5B,OAAO;CACT;CAEA,OAAO;EACL,KAAK,aAAaC,qEAAkC,KAAK,CAAC;EAC1D,QAAQ,aAAaA,qEAAkC,OAAO,QAAQ,CAAC;EACvE,MAAM,aAAaA,qEAAkC,OAAO,MAAM,CAAC;EACnE,OAAO,aAAaA,qEAAkC,OAAO,OAAO,CAAC;CACvE;AACF;;;;;;;;;;;;AAaA,SAAgB,gBAKd,QACA,UACA;CAcA,OAbgBC,iCACd,OAAO,OACP,oBACA,sBAUW,CAAC,CAPZ,aAAa,SACT,SACA,aAAa,UACX,UACA,aAAa,WACX,WACA,MACS,CAAC,OAAO,OAAO;AACpC;;;;;;;;;;;AAYA,SAAgB,wBAKd,QACA,UACA;CAEA,OADgBD,qEAAkC,OAAO,OAAO,QACnD,CAAC,CAAC,EAAE,EAAE,OAAO,OAAO;AACnC;;;;;;;;;;;AAYA,SAAgB,uBAKd,QACA,UACA;CACA,MAAM,UAAUA,qEAAkC,OAAO,OAAO,QAAQ;CACxE,OAAO,QAAQ,QAAQ,SAAS,EAAE,EAAE,OAAO,OAAO;AACpD;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC,SAAoC;CAC7E,MAAM,QAAQ,sBAAsB,OAAO;AAC7C;;;;;;;;;;;;;AAcA,SAAgB,uBAGd,OAAyC,cAAwB;CACjE,qBACE,OACA,eAAe,CAAC,IAAIE,yBAAW,MAAM,aAAa,eAAe,CAAC,CAAC,CACrE;AACF;;;;;;;;;;;;AAaA,SAAgB,wBAGd,OAAyC;CACzC,MAAM,cAAc,MAAM,MAAM,aAAa,IAAI;CAEjD,QAAQ,YAA+D;EAGrE,IAAI,iBAAoE,CAAC;EAGzE,IAAI,CAAC,aAAa,QAChB,iBAAiB;OACZ;GAEL,MAAM,4BAAY,IAAI,IAGpB;GACF,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,SAAS,QAAQ;IACvB,UAAU,IAAI,OAAO,IAAI,MAAM;GACjC;GAIA,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;IAC3C,MAAM,KAAK,YAAY;IACvB,MAAM,SAAS,UAAU,IAAI,EAAE;IAC/B,IAAI,QAAQ;KACV,eAAe,KAAK,MAAM;KAC1B,UAAU,OAAO,EAAE;IACrB;GACF;GAGA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,SAAS,QAAQ;IACvB,IAAI,UAAU,IAAI,OAAO,EAAE,GAAG,eAAe,KAAK,MAAM;GAC1D;EACF;EAEA,OAAO,aAAa,OAAO,cAAc;CAC3C;AACF;;;;;;;;;;;;;AAcA,SAAgB,aAId,OACA,aACA;CACA,MAAM,WAAW,MAAM,MAAM,UAAU,IAAI,KAAM,CAAC;CAClD,MAAM,EAAE,sBAAsB,MAAM;CAEpC,IAAI,CAAC,SAAS,UAAU,CAAC,mBACvB,OAAO;CAGT,MAAM,qBAAqB,YAAY,QACpC,QAAQ,CAAC,SAAS,SAAS,IAAI,EAAE,CACpC;CAEA,IAAI,sBAAsB,UACxB,OAAO;CAGT,MAAM,kCAAkB,IAAI,IAG1B;CACF,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;EAC3C,MAAM,MAAM,YAAY;EACxB,gBAAgB,IAAI,IAAI,IAAI,GAAG;CACjC;CAEA,MAAM,kBAAqE,CAAC;CAC5E,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,gBAAgB,IAAI,SAAS,EAAG;EAC5C,IAAI,KAAK,gBAAgB,KAAK,GAAG;CACnC;CAEA,OAAO,CAAC,GAAG,iBAAiB,GAAG,kBAAkB;AACnD"}
+{"version":3,"file":"columnOrderingFeature.utils.cjs","names":["makeObjectMap","table_getPinnedVisibleLeafColumns","callMemoOrStaticFn","cloneState"],"sources":["../../../src/features/column-ordering/columnOrderingFeature.utils.ts"],"sourcesContent":["import { table_getPinnedVisibleLeafColumns } from '../column-pinning/columnPinningFeature.utils'\nimport { callMemoOrStaticFn, cloneState, makeObjectMap } from '../../utils'\nimport type { GroupingState } from '../column-grouping/columnGroupingFeature.types'\nimport type { CellData, RowData, Updater } from '../../types/type-utils'\nimport type { TableFeatures } from '../../types/TableFeatures'\nimport type { Table_Internal } from '../../types/Table'\nimport type { Column, Column_Internal } from '../../types/Column'\nimport type { ColumnPinningPosition } from '../column-pinning/columnPinningFeature.types'\nimport type {\n  ColumnIndexes,\n  ColumnOrderState,\n} from './columnOrderingFeature.types'\n\n/**\n * Creates the default column order state.\n *\n * The feature default is an empty array, meaning leaf columns keep their natural\n * definition order. Reset APIs use this value when `defaultState` is `true`.\n *\n * @example\n * ```ts\n * const order = getDefaultColumnOrderState()\n * ```\n */\nexport function getDefaultColumnOrderState(): ColumnOrderState {\n  return []\n}\n\n/**\n * Builds column-id to index records for each visible pinning region.\n *\n * All four regions are built in one pass so a single memo entry serves every\n * `column_getIndex` lookup without per-column scans.\n *\n * @example\n * ```ts\n * const indexes = table_getColumnIndexes(table)\n * ```\n */\nexport function table_getColumnIndexes<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>): ColumnIndexes {\n  const buildIndexes = (\n    columns: ReadonlyArray<\n      | Column<TFeatures, TData, unknown>\n      | Column_Internal<TFeatures, TData, unknown>\n    >,\n  ): Record<string, number> => {\n    const indexes = makeObjectMap<number>()\n    for (let i = 0; i < columns.length; i++) {\n      indexes[columns[i]!.id] = i\n    }\n    return indexes\n  }\n\n  return {\n    all: buildIndexes(table_getPinnedVisibleLeafColumns(table)),\n    center: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'center')),\n    start: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'start')),\n    end: buildIndexes(table_getPinnedVisibleLeafColumns(table, 'end')),\n  }\n}\n\n/**\n * Finds this column's index within a visible pinning region.\n *\n * Pass `'start'`, `'center'`, or `'end'` to search that region; omit the\n * position to search the full visible leaf column list.\n *\n * @example\n * ```ts\n * const index = column_getIndex(column, 'center')\n * ```\n */\nexport function column_getIndex<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const indexes = callMemoOrStaticFn(\n    column.table,\n    'getColumnIndexes',\n    table_getColumnIndexes,\n  )\n  const key =\n    position === 'start'\n      ? 'start'\n      : position === 'end'\n        ? 'end'\n        : position === 'center'\n          ? 'center'\n          : 'all'\n  return indexes[key][column.id] ?? -1\n}\n\n/**\n * Checks whether this column is the first visible column in a pinning region.\n *\n * The same `position` semantics as `column_getIndex` apply.\n *\n * @example\n * ```ts\n * const isFirst = column_getIsFirstColumn(column, 'start')\n * ```\n */\nexport function column_getIsFirstColumn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const columns = table_getPinnedVisibleLeafColumns(column.table, position)\n  return columns[0]?.id === column.id\n}\n\n/**\n * Checks whether this column is the last visible column in a pinning region.\n *\n * The same `position` semantics as `column_getIndex` apply.\n *\n * @example\n * ```ts\n * const isLast = column_getIsLastColumn(column, 'end')\n * ```\n */\nexport function column_getIsLastColumn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n  TValue extends CellData = CellData,\n>(\n  column: Column_Internal<TFeatures, TData, TValue>,\n  position?: ColumnPinningPosition | 'center',\n) {\n  const columns = table_getPinnedVisibleLeafColumns(column.table, position)\n  return columns[columns.length - 1]?.id === column.id\n}\n\n/**\n * Routes a column order updater through the table's column-order change handler.\n *\n * The updater may be a next ordered id array or a function of the previous\n * array, matching the instance `table.setColumnOrder` behavior.\n *\n * @example\n * ```ts\n * table_setColumnOrder(table, ['firstName', 'lastName', 'age'])\n * ```\n */\nexport function table_setColumnOrder<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>, updater: Updater<ColumnOrderState>) {\n  table.options.onColumnOrderChange?.(updater)\n}\n\n/**\n * Resets `columnOrder` to the configured initial state or feature default.\n *\n * With no argument, the reset clones `table.initialState.columnOrder` when it\n * exists. Passing `true` ignores initial state and resets to `[]`.\n *\n * @example\n * ```ts\n * table_resetColumnOrder(table)\n * table_resetColumnOrder(table, true)\n * ```\n */\nexport function table_resetColumnOrder<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>, defaultState?: boolean) {\n  table_setColumnOrder(\n    table,\n    defaultState ? [] : cloneState(table.initialState.columnOrder ?? []),\n  )\n}\n\n/**\n * Creates the ordering function used to arrange leaf columns.\n *\n * The returned function applies `state.columnOrder`, preserves unspecified\n * columns in their original order, then delegates to grouping rules.\n *\n * @example\n * ```ts\n * const orderColumnsForTable = table_getOrderColumnsFn(table)\n * ```\n */\nexport function table_getOrderColumnsFn<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(table: Table_Internal<TFeatures, TData>) {\n  const columnOrder = table.atoms.columnOrder?.get()\n\n  return (columns: Array<Column_Internal<TFeatures, TData, unknown>>) => {\n    // Sort grouped columns to the start of the column list\n    // before the headers are built\n    let orderedColumns: Array<Column_Internal<TFeatures, TData, unknown>> = []\n\n    // If there is no order, return the normal columns\n    if (!columnOrder?.length) {\n      orderedColumns = columns\n    } else {\n      // Index columns by id for O(1) lookup\n      const remaining = new Map<\n        string,\n        Column_Internal<TFeatures, TData, unknown>\n      >()\n      for (let i = 0; i < columns.length; i++) {\n        const column = columns[i]!\n        remaining.set(column.id, column)\n      }\n\n      // Place columns in the requested order, removing each as it's used\n      // (handles duplicates and unknown ids in columnOrder)\n      for (let i = 0; i < columnOrder.length; i++) {\n        const id = columnOrder[i]!\n        const column = remaining.get(id)\n        if (column) {\n          orderedColumns.push(column)\n          remaining.delete(id)\n        }\n      }\n\n      // Append leftover columns in their original order\n      for (let i = 0; i < columns.length; i++) {\n        const column = columns[i]!\n        if (remaining.has(column.id)) orderedColumns.push(column)\n      }\n    }\n\n    return orderColumns(table, orderedColumns)\n  }\n}\n\n/**\n * Applies grouped-column placement rules to an already ordered leaf-column list.\n *\n * `groupedColumnMode: 'remove'` drops grouped columns from the list.\n * `groupedColumnMode: 'reorder'` moves grouped columns to the front in grouping\n * state order.\n *\n * @example\n * ```ts\n * const orderedColumns = orderColumns(table, leafColumns)\n * ```\n */\nexport function orderColumns<\n  TFeatures extends TableFeatures,\n  TData extends RowData,\n>(\n  table: Table_Internal<TFeatures, TData>,\n  leafColumns: Array<Column_Internal<TFeatures, TData, unknown>>,\n) {\n  const grouping = table.atoms.grouping?.get() ?? ([] as GroupingState)\n  const { groupedColumnMode } = table.options\n\n  if (!grouping.length || !groupedColumnMode) {\n    return leafColumns\n  }\n\n  const nonGroupingColumns = leafColumns.filter(\n    (col) => !grouping.includes(col.id),\n  )\n\n  if (groupedColumnMode === 'remove') {\n    return nonGroupingColumns\n  }\n\n  const leafColumnsById = new Map<\n    string,\n    Column_Internal<TFeatures, TData, unknown>\n  >()\n  for (let i = 0; i < leafColumns.length; i++) {\n    const col = leafColumns[i]!\n    leafColumnsById.set(col.id, col)\n  }\n\n  const groupingColumns: Array<Column_Internal<TFeatures, TData, unknown>> = []\n  for (let i = 0; i < grouping.length; i++) {\n    const col = leafColumnsById.get(grouping[i]!)\n    if (col) groupingColumns.push(col)\n  }\n\n  return [...groupingColumns, ...nonGroupingColumns]\n}\n"],"mappings":";;;;;;;;;;;;;;;AAwBA,SAAgB,6BAA+C;CAC7D,OAAO,CAAC;AACV;;;;;;;;;;;;AAaA,SAAgB,uBAGd,OAAwD;CACxD,MAAM,gBACJ,YAI2B;EAC3B,MAAM,UAAUA,4BAAsB;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAClC,QAAQ,QAAQ,EAAE,CAAE,MAAM;EAE5B,OAAO;CACT;CAEA,OAAO;EACL,KAAK,aAAaC,qEAAkC,KAAK,CAAC;EAC1D,QAAQ,aAAaA,qEAAkC,OAAO,QAAQ,CAAC;EACvE,OAAO,aAAaA,qEAAkC,OAAO,OAAO,CAAC;EACrE,KAAK,aAAaA,qEAAkC,OAAO,KAAK,CAAC;CACnE;AACF;;;;;;;;;;;;AAaA,SAAgB,gBAKd,QACA,UACA;CAcA,OAbgBC,iCACd,OAAO,OACP,oBACA,sBAUW,CAAC,CAPZ,aAAa,UACT,UACA,aAAa,QACX,QACA,aAAa,WACX,WACA,MACS,CAAC,OAAO,OAAO;AACpC;;;;;;;;;;;AAYA,SAAgB,wBAKd,QACA,UACA;CAEA,OADgBD,qEAAkC,OAAO,OAAO,QACnD,CAAC,CAAC,EAAE,EAAE,OAAO,OAAO;AACnC;;;;;;;;;;;AAYA,SAAgB,uBAKd,QACA,UACA;CACA,MAAM,UAAUA,qEAAkC,OAAO,OAAO,QAAQ;CACxE,OAAO,QAAQ,QAAQ,SAAS,EAAE,EAAE,OAAO,OAAO;AACpD;;;;;;;;;;;;AAaA,SAAgB,qBAGd,OAAyC,SAAoC;CAC7E,MAAM,QAAQ,sBAAsB,OAAO;AAC7C;;;;;;;;;;;;;AAcA,SAAgB,uBAGd,OAAyC,cAAwB;CACjE,qBACE,OACA,eAAe,CAAC,IAAIE,yBAAW,MAAM,aAAa,eAAe,CAAC,CAAC,CACrE;AACF;;;;;;;;;;;;AAaA,SAAgB,wBAGd,OAAyC;CACzC,MAAM,cAAc,MAAM,MAAM,aAAa,IAAI;CAEjD,QAAQ,YAA+D;EAGrE,IAAI,iBAAoE,CAAC;EAGzE,IAAI,CAAC,aAAa,QAChB,iBAAiB;OACZ;GAEL,MAAM,4BAAY,IAAI,IAGpB;GACF,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,SAAS,QAAQ;IACvB,UAAU,IAAI,OAAO,IAAI,MAAM;GACjC;GAIA,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;IAC3C,MAAM,KAAK,YAAY;IACvB,MAAM,SAAS,UAAU,IAAI,EAAE;IAC/B,IAAI,QAAQ;KACV,eAAe,KAAK,MAAM;KAC1B,UAAU,OAAO,EAAE;IACrB;GACF;GAGA,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IACvC,MAAM,SAAS,QAAQ;IACvB,IAAI,UAAU,IAAI,OAAO,EAAE,GAAG,eAAe,KAAK,MAAM;GAC1D;EACF;EAEA,OAAO,aAAa,OAAO,cAAc;CAC3C;AACF;;;;;;;;;;;;;AAcA,SAAgB,aAId,OACA,aACA;CACA,MAAM,WAAW,MAAM,MAAM,UAAU,IAAI,KAAM,CAAC;CAClD,MAAM,EAAE,sBAAsB,MAAM;CAEpC,IAAI,CAAC,SAAS,UAAU,CAAC,mBACvB,OAAO;CAGT,MAAM,qBAAqB,YAAY,QACpC,QAAQ,CAAC,SAAS,SAAS,IAAI,EAAE,CACpC;CAEA,IAAI,sBAAsB,UACxB,OAAO;CAGT,MAAM,kCAAkB,IAAI,IAG1B;CACF,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;EAC3C,MAAM,MAAM,YAAY;EACxB,gBAAgB,IAAI,IAAI,IAAI,GAAG;CACjC;CAEA,MAAM,kBAAqE,CAAC;CAC5E,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;EACxC,MAAM,MAAM,gBAAgB,IAAI,SAAS,EAAG;EAC5C,IAAI,KAAK,gBAAgB,KAAK,GAAG;CACnC;CAEA,OAAO,CAAC,GAAG,iBAAiB,GAAG,kBAAkB;AACnD"}

package/dist/features/column-ordering/columnOrderingFeature.utils.d.cts

@@ -33,7 +33,7 @@ declare function table_getColumnIndexes<TFeatures extends TableFeatures, TData e
 /**
  * Finds this column's index within a visible pinning region.
  *
- * Pass `'left'`, `'center'`, or `'right'` to search that region; omit the
+ * Pass `'start'`, `'center'`, or `'end'` to search that region; omit the
  * position to search the full visible leaf column list.
  *
  * @example
@@ -49,7 +49,7 @@ declare function column_getIndex<TFeatures extends TableFeatures, TData extends
  *
  * @example
  * ```ts
- * const isFirst = column_getIsFirstColumn(column, 'left')
+ * const isFirst = column_getIsFirstColumn(column, 'start')
  * ```
  */
 declare function column_getIsFirstColumn<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(column: Column<TFeatures, TData, TValue>, position?: ColumnPinningPosition | 'center'): boolean;
@@ -60,7 +60,7 @@ declare function column_getIsFirstColumn<TFeatures extends TableFeatures, TData
  *
  * @example
  * ```ts
- * const isLast = column_getIsLastColumn(column, 'right')
+ * const isLast = column_getIsLastColumn(column, 'end')
  * ```
  */
 declare function column_getIsLastColumn<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(column: Column<TFeatures, TData, TValue>, position?: ColumnPinningPosition | 'center'): boolean;

package/dist/features/column-ordering/columnOrderingFeature.utils.d.ts

@@ -33,7 +33,7 @@ declare function table_getColumnIndexes<TFeatures extends TableFeatures, TData e
 /**
  * Finds this column's index within a visible pinning region.
  *
- * Pass `'left'`, `'center'`, or `'right'` to search that region; omit the
+ * Pass `'start'`, `'center'`, or `'end'` to search that region; omit the
  * position to search the full visible leaf column list.
  *
  * @example
@@ -49,7 +49,7 @@ declare function column_getIndex<TFeatures extends TableFeatures, TData extends
  *
  * @example
  * ```ts
- * const isFirst = column_getIsFirstColumn(column, 'left')
+ * const isFirst = column_getIsFirstColumn(column, 'start')
  * ```
  */
 declare function column_getIsFirstColumn<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(column: Column<TFeatures, TData, TValue>, position?: ColumnPinningPosition | 'center'): boolean;
@@ -60,7 +60,7 @@ declare function column_getIsFirstColumn<TFeatures extends TableFeatures, TData
  *
  * @example
  * ```ts
- * const isLast = column_getIsLastColumn(column, 'right')
+ * const isLast = column_getIsLastColumn(column, 'end')
  * ```
  */
 declare function column_getIsLastColumn<TFeatures extends TableFeatures, TData extends RowData, TValue extends CellData = CellData>(column: Column<TFeatures, TData, TValue>, position?: ColumnPinningPosition | 'center'): boolean;