@tanstack/table-core 8.0.0-alpha.28 → 8.0.0-alpha.34

package/build/cjs/utils/getGroupedRowModel.js

@@ -0,0 +1,176 @@
+/**
+ * table-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var utils = require('../utils.js');
+
+function getGroupedRowModelSync() {
+  return function (instance) {
+    return utils.memo(function () {
+      return [instance.getState().grouping, instance.getSortedRowModel()];
+    }, function (grouping, rowModel) {
+      if (!rowModel.rows.length || !grouping.length) {
+        return rowModel;
+      } // Filter the grouping list down to columns that exist
+
+
+      var existingGrouping = grouping.filter(function (columnId) {
+        return instance.getColumn(columnId);
+      }); // Find the columns that can or are aggregating
+      // Uses each column to aggregate rows into a single value
+
+      var aggregateRowsToValues = function aggregateRowsToValues(leafRows, groupedRows, depth) {
+        var values = {};
+        instance.getAllLeafColumns().forEach(function (column) {
+          // Don't aggregate columns that are in the grouping
+          if (existingGrouping.includes(column.id)) {
+            values[column.id] = groupedRows[0] ? groupedRows[0].values[column.id] : null;
+            return;
+          } // Aggregate the values
+
+
+          var aggregateFn = instance.getColumnAggregationFn(column.id);
+
+          if (aggregateFn) {
+            values[column.id] = aggregateFn(function () {
+              return leafRows.map(function (row) {
+                var columnValue = row.values[column.id];
+
+                if (!depth && column.aggregateValue) {
+                  columnValue = column.aggregateValue(columnValue);
+                }
+
+                return columnValue;
+              });
+            }, function () {
+              return groupedRows.map(function (row) {
+                return row.values[column.id];
+              });
+            });
+          } else if (column.aggregationType) {
+            console.info({
+              column: column
+            });
+            throw new Error(process.env.NODE_ENV !== 'production' ? "Table: Invalid column.aggregateType option for column listed above" : '');
+          } else {
+            values[column.id] = null;
+          }
+        });
+        return values;
+      };
+
+      var groupedFlatRows = [];
+      var groupedRowsById = {}; // const onlyGroupedFlatRows: Row[] = [];
+      // const onlyGroupedRowsById: Record<RowId, Row> = {};
+      // const nonGroupedFlatRows: Row[] = [];
+      // const nonGroupedRowsById: Record<RowId, Row> = {};
+      // Recursively group the data
+
+      var groupUpRecursively = function groupUpRecursively(rows, depth, parentId) {
+        if (depth === void 0) {
+          depth = 0;
+        }
+
+        // This is the last level, just return the rows
+        if (depth === existingGrouping.length) {
+          return rows;
+        }
+
+        var columnId = existingGrouping[depth]; // Group the rows together for this level
+
+        var rowGroupsMap = groupBy(rows, columnId); // Peform aggregations for each group
+
+        var aggregatedGroupedRows = Array.from(rowGroupsMap.entries()).map(function (_ref, index) {
+          var groupingValue = _ref[0],
+              groupedRows = _ref[1];
+          var id = columnId + ":" + groupingValue;
+          id = parentId ? parentId + ">" + id : id; // First, Recurse to group sub rows before aggregation
+
+          var subRows = groupUpRecursively(groupedRows, depth + 1, id); // Flatten the leaf rows of the rows in this group
+
+          var leafRows = depth ? utils.flattenBy(groupedRows, function (row) {
+            return row.subRows;
+          }) : groupedRows;
+          var values = aggregateRowsToValues(leafRows, groupedRows, depth);
+          var row = instance.createRow(id, undefined, index, depth, values);
+          Object.assign(row, {
+            groupingColumnId: columnId,
+            groupingValue: groupingValue,
+            subRows: subRows,
+            leafRows: leafRows
+          });
+          subRows.forEach(function (subRow) {
+            groupedFlatRows.push(subRow);
+            groupedRowsById[subRow.id] = subRow; // if (subRow.getIsGrouped?.()) {
+            //   onlyGroupedFlatRows.push(subRow);
+            //   onlyGroupedRowsById[subRow.id] = subRow;
+            // } else {
+            //   nonGroupedFlatRows.push(subRow);
+            //   nonGroupedRowsById[subRow.id] = subRow;
+            // }
+          });
+          return row;
+        });
+        return aggregatedGroupedRows;
+      };
+
+      var groupedRows = groupUpRecursively(rowModel.rows, 0, '');
+      groupedRows.forEach(function (subRow) {
+        groupedFlatRows.push(subRow);
+        groupedRowsById[subRow.id] = subRow; // if (subRow.getIsGrouped?.()) {
+        //   onlyGroupedFlatRows.push(subRow);
+        //   onlyGroupedRowsById[subRow.id] = subRow;
+        // } else {
+        //   nonGroupedFlatRows.push(subRow);
+        //   nonGroupedRowsById[subRow.id] = subRow;
+        // }
+      });
+      return {
+        rows: groupedRows,
+        flatRows: groupedFlatRows,
+        rowsById: groupedRowsById
+      };
+    }, {
+      key: 'getGroupedRowModel',
+      debug: function debug() {
+        var _instance$options$deb;
+
+        return (_instance$options$deb = instance.options.debugAll) != null ? _instance$options$deb : instance.options.debugTable;
+      },
+      onChange: function onChange() {
+        instance.queue(function () {
+          instance._notifyExpandedReset();
+        });
+      }
+    });
+  };
+}
+
+function groupBy(rows, columnId) {
+  var groupMap = new Map();
+  return rows.reduce(function (map, row) {
+    var resKey = "" + row.values[columnId];
+    var previous = map.get(resKey);
+
+    if (!previous) {
+      map.set(resKey, [row]);
+    } else {
+      map.set(resKey, [].concat(previous, [row]));
+    }
+
+    return map;
+  }, groupMap);
+}
+
+exports.getGroupedRowModelSync = getGroupedRowModelSync;
+//# sourceMappingURL=getGroupedRowModel.js.map

package/build/cjs/utils/getGroupedRowModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getGroupedRowModel.js","sources":["../../../src/utils/getGroupedRowModel.ts"],"sourcesContent":["import { TableInstance, Row, RowModel, AnyGenerics } from '../types'\nimport { flattenBy, memo } from '../utils'\n\nexport function getGroupedRowModelSync<TGenerics extends AnyGenerics>(): (\n  instance: TableInstance<TGenerics>\n) => () => RowModel<TGenerics> {\n  return instance =>\n    memo(\n      () => [instance.getState().grouping, instance.getSortedRowModel()],\n      (grouping, rowModel) => {\n        if (!rowModel.rows.length || !grouping.length) {\n          return rowModel\n        }\n\n        // Filter the grouping list down to columns that exist\n        const existingGrouping = grouping.filter(columnId =>\n          instance.getColumn(columnId)\n        )\n\n        // Find the columns that can or are aggregating\n        // Uses each column to aggregate rows into a single value\n        const aggregateRowsToValues = (\n          leafRows: Row<TGenerics>[],\n          groupedRows: Row<TGenerics>[],\n          depth: number\n        ) => {\n          const values: Record<string, unknown> = {}\n\n          instance.getAllLeafColumns().forEach(column => {\n            // Don't aggregate columns that are in the grouping\n            if (existingGrouping.includes(column.id)) {\n              values[column.id] = groupedRows[0]\n                ? groupedRows[0].values[column.id]\n                : null\n              return\n            }\n\n            // Aggregate the values\n            const aggregateFn = instance.getColumnAggregationFn(column.id)\n\n            if (aggregateFn) {\n              values[column.id] = aggregateFn(\n                () =>\n                  leafRows.map(row => {\n                    let columnValue = row.values[column.id]\n\n                    if (!depth && column.aggregateValue) {\n                      columnValue = column.aggregateValue(columnValue)\n                    }\n\n                    return columnValue\n                  }),\n                () => groupedRows.map(row => row.values[column.id])\n              )\n            } else if (column.aggregationType) {\n              console.info({ column })\n              throw new Error(\n                process.env.NODE_ENV !== 'production'\n                  ? `Table: Invalid column.aggregateType option for column listed above`\n                  : ''\n              )\n            } else {\n              values[column.id] = null\n            }\n          })\n\n          return values\n        }\n\n        const groupedFlatRows: Row<TGenerics>[] = []\n        const groupedRowsById: Record<string, Row<TGenerics>> = {}\n        // const onlyGroupedFlatRows: Row[] = [];\n        // const onlyGroupedRowsById: Record<RowId, Row> = {};\n        // const nonGroupedFlatRows: Row[] = [];\n        // const nonGroupedRowsById: Record<RowId, Row> = {};\n\n        // Recursively group the data\n        const groupUpRecursively = (\n          rows: Row<TGenerics>[],\n          depth = 0,\n          parentId: string\n        ) => {\n          // This is the last level, just return the rows\n          if (depth === existingGrouping.length) {\n            return rows\n          }\n\n          const columnId = existingGrouping[depth]!\n\n          // Group the rows together for this level\n          const rowGroupsMap = groupBy(rows, columnId)\n\n          // Peform aggregations for each group\n          const aggregatedGroupedRows = Array.from(rowGroupsMap.entries()).map(\n            ([groupingValue, groupedRows], index) => {\n              let id = `${columnId}:${groupingValue}`\n              id = parentId ? `${parentId}>${id}` : id\n\n              // First, Recurse to group sub rows before aggregation\n              const subRows = groupUpRecursively(groupedRows, depth + 1, id)\n\n              // Flatten the leaf rows of the rows in this group\n              const leafRows = depth\n                ? flattenBy(groupedRows, row => row.subRows)\n                : groupedRows\n\n              const values = aggregateRowsToValues(leafRows, groupedRows, depth)\n\n              const row = instance.createRow(\n                id,\n                undefined,\n                index,\n                depth,\n                values\n              )\n\n              Object.assign(row, {\n                groupingColumnId: columnId,\n                groupingValue,\n                subRows,\n                leafRows,\n              })\n\n              subRows.forEach(subRow => {\n                groupedFlatRows.push(subRow)\n                groupedRowsById[subRow.id] = subRow\n                // if (subRow.getIsGrouped?.()) {\n                //   onlyGroupedFlatRows.push(subRow);\n                //   onlyGroupedRowsById[subRow.id] = subRow;\n                // } else {\n                //   nonGroupedFlatRows.push(subRow);\n                //   nonGroupedRowsById[subRow.id] = subRow;\n                // }\n              })\n\n              return row\n            }\n          )\n\n          return aggregatedGroupedRows\n        }\n\n        const groupedRows = groupUpRecursively(rowModel.rows, 0, '')\n\n        groupedRows.forEach(subRow => {\n          groupedFlatRows.push(subRow)\n          groupedRowsById[subRow.id] = subRow\n          // if (subRow.getIsGrouped?.()) {\n          //   onlyGroupedFlatRows.push(subRow);\n          //   onlyGroupedRowsById[subRow.id] = subRow;\n          // } else {\n          //   nonGroupedFlatRows.push(subRow);\n          //   nonGroupedRowsById[subRow.id] = subRow;\n          // }\n        })\n\n        return {\n          rows: groupedRows,\n          flatRows: groupedFlatRows,\n          rowsById: groupedRowsById,\n        }\n      },\n      {\n        key: 'getGroupedRowModel',\n        debug: () => instance.options.debugAll ?? instance.options.debugTable,\n        onChange: () => {\n          instance.queue(() => {\n            instance._notifyExpandedReset()\n          })\n        },\n      }\n    )\n}\n\nfunction groupBy<TGenerics extends AnyGenerics>(\n  rows: Row<TGenerics>[],\n  columnId: string\n) {\n  const groupMap = new Map<any, Row<TGenerics>[]>()\n\n  return rows.reduce((map, row) => {\n    const resKey = `${row.values[columnId]}`\n    const previous = map.get(resKey)\n    if (!previous) {\n      map.set(resKey, [row])\n    } else {\n      map.set(resKey, [...previous, row])\n    }\n    return map\n  }, groupMap)\n}\n"],"names":["getGroupedRowModelSync","instance","memo","getState","grouping","getSortedRowModel","rowModel","rows","length","existingGrouping","filter","columnId","getColumn","aggregateRowsToValues","leafRows","groupedRows","depth","values","getAllLeafColumns","forEach","column","includes","id","aggregateFn","getColumnAggregationFn","map","row","columnValue","aggregateValue","aggregationType","console","info","Error","process","env","NODE_ENV","groupedFlatRows","groupedRowsById","groupUpRecursively","parentId","rowGroupsMap","groupBy","aggregatedGroupedRows","Array","from","entries","index","groupingValue","subRows","flattenBy","createRow","undefined","Object","assign","groupingColumnId","subRow","push","flatRows","rowsById","key","debug","options","debugAll","debugTable","onChange","queue","_notifyExpandedReset","groupMap","Map","reduce","resKey","previous","get","set"],"mappings":";;;;;;;;;;;;;;;;AAGO,SAASA,sBAAT,GAEwB;AAC7B,EAAA,OAAO,UAAAC,QAAQ,EAAA;AAAA,IAAA,OACbC,UAAI,CACF,YAAA;AAAA,MAAM,OAAA,CAACD,QAAQ,CAACE,QAAT,EAAA,CAAoBC,QAArB,EAA+BH,QAAQ,CAACI,iBAAT,EAA/B,CAAN,CAAA;AAAA,KADE,EAEF,UAACD,QAAD,EAAWE,QAAX,EAAwB;AACtB,MAAI,IAAA,CAACA,QAAQ,CAACC,IAAT,CAAcC,MAAf,IAAyB,CAACJ,QAAQ,CAACI,MAAvC,EAA+C;AAC7C,QAAA,OAAOF,QAAP,CAAA;AACD,OAHqB;;;AAMtB,MAAA,IAAMG,gBAAgB,GAAGL,QAAQ,CAACM,MAAT,CAAgB,UAAAC,QAAQ,EAAA;AAAA,QAAA,OAC/CV,QAAQ,CAACW,SAAT,CAAmBD,QAAnB,CAD+C,CAAA;AAAA,OAAxB,CAAzB,CANsB;AAWtB;;AACA,MAAME,IAAAA,qBAAqB,GAAG,SAAxBA,qBAAwB,CAC5BC,QAD4B,EAE5BC,WAF4B,EAG5BC,KAH4B,EAIzB;AACH,QAAMC,IAAAA,MAA+B,GAAG,EAAxC,CAAA;AAEAhB,QAAAA,QAAQ,CAACiB,iBAAT,EAAA,CAA6BC,OAA7B,CAAqC,UAAAC,MAAM,EAAI;AAC7C;AACA,UAAIX,IAAAA,gBAAgB,CAACY,QAAjB,CAA0BD,MAAM,CAACE,EAAjC,CAAJ,EAA0C;AACxCL,YAAAA,MAAM,CAACG,MAAM,CAACE,EAAR,CAAN,GAAoBP,WAAW,CAAC,CAAD,CAAX,GAChBA,WAAW,CAAC,CAAD,CAAX,CAAeE,MAAf,CAAsBG,MAAM,CAACE,EAA7B,CADgB,GAEhB,IAFJ,CAAA;AAGA,YAAA,OAAA;AACD,WAP4C;;;AAU7C,UAAMC,IAAAA,WAAW,GAAGtB,QAAQ,CAACuB,sBAAT,CAAgCJ,MAAM,CAACE,EAAvC,CAApB,CAAA;;AAEA,UAAA,IAAIC,WAAJ,EAAiB;AACfN,YAAAA,MAAM,CAACG,MAAM,CAACE,EAAR,CAAN,GAAoBC,WAAW,CAC7B,YAAA;AAAA,cAAA,OACET,QAAQ,CAACW,GAAT,CAAa,UAAAC,GAAG,EAAI;AAClB,gBAAIC,IAAAA,WAAW,GAAGD,GAAG,CAACT,MAAJ,CAAWG,MAAM,CAACE,EAAlB,CAAlB,CAAA;;AAEA,gBAAA,IAAI,CAACN,KAAD,IAAUI,MAAM,CAACQ,cAArB,EAAqC;AACnCD,kBAAAA,WAAW,GAAGP,MAAM,CAACQ,cAAP,CAAsBD,WAAtB,CAAd,CAAA;AACD,iBAAA;;AAED,gBAAA,OAAOA,WAAP,CAAA;AACD,eARD,CADF,CAAA;AAAA,aAD6B,EAW7B,YAAA;AAAA,cAAA,OAAMZ,WAAW,CAACU,GAAZ,CAAgB,UAAAC,GAAG,EAAA;AAAA,gBAAA,OAAIA,GAAG,CAACT,MAAJ,CAAWG,MAAM,CAACE,EAAlB,CAAJ,CAAA;AAAA,eAAnB,CAAN,CAAA;AAAA,aAX6B,CAA/B,CAAA;AAaD,WAdD,MAcO,IAAIF,MAAM,CAACS,eAAX,EAA4B;AACjCC,YAAAA,OAAO,CAACC,IAAR,CAAa;AAAEX,cAAAA,MAAM,EAANA,MAAAA;AAAF,aAAb,CAAA,CAAA;AACA,YAAA,MAAM,IAAIY,KAAJ,CACJC,OAAO,CAACC,GAAR,CAAYC,QAAZ,KAAyB,YAAzB,GAEI,oEAAA,GAAA,EAHA,CAAN,CAAA;AAKD,WAPM,MAOA;AACLlB,YAAAA,MAAM,CAACG,MAAM,CAACE,EAAR,CAAN,GAAoB,IAApB,CAAA;AACD,WAAA;AACF,SApCD,CAAA,CAAA;AAsCA,QAAA,OAAOL,MAAP,CAAA;AACD,OA9CD,CAAA;;AAgDA,MAAMmB,IAAAA,eAAiC,GAAG,EAA1C,CAAA;AACA,MAAA,IAAMC,eAA+C,GAAG,EAAxD,CA7DsB;AA+DtB;AACA;AACA;AAEA;;AACA,MAAMC,IAAAA,kBAAkB,GAAG,SAArBA,kBAAqB,CACzB/B,IADyB,EAEzBS,KAFyB,EAGzBuB,QAHyB,EAItB;AAAA,QAAA,IAFHvB,KAEG,KAAA,KAAA,CAAA,EAAA;AAFHA,UAAAA,KAEG,GAFK,CAEL,CAAA;AAAA,SAAA;;AACH;AACA,QAAA,IAAIA,KAAK,KAAKP,gBAAgB,CAACD,MAA/B,EAAuC;AACrC,UAAA,OAAOD,IAAP,CAAA;AACD,SAAA;;AAED,QAAA,IAAMI,QAAQ,GAAGF,gBAAgB,CAACO,KAAD,CAAjC,CANG;;AASH,QAAMwB,IAAAA,YAAY,GAAGC,OAAO,CAAClC,IAAD,EAAOI,QAAP,CAA5B,CATG;;AAYH,QAAA,IAAM+B,qBAAqB,GAAGC,KAAK,CAACC,IAAN,CAAWJ,YAAY,CAACK,OAAb,EAAX,CAAmCpB,CAAAA,GAAnC,CAC5B,UAAA,IAAA,EAA+BqB,KAA/B,EAAyC;AAAA,UAAA,IAAvCC,aAAuC,GAAA,IAAA,CAAA,CAAA,CAAA;AAAA,cAAxBhC,WAAwB,GAAA,IAAA,CAAA,CAAA,CAAA,CAAA;AACvC,UAAA,IAAIO,EAAE,GAAMX,QAAN,GAAA,GAAA,GAAkBoC,aAAxB,CAAA;AACAzB,UAAAA,EAAE,GAAGiB,QAAQ,GAAMA,QAAN,SAAkBjB,EAAlB,GAAyBA,EAAtC,CAFuC;;AAKvC,UAAA,IAAM0B,OAAO,GAAGV,kBAAkB,CAACvB,WAAD,EAAcC,KAAK,GAAG,CAAtB,EAAyBM,EAAzB,CAAlC,CALuC;;AAQvC,UAAMR,IAAAA,QAAQ,GAAGE,KAAK,GAClBiC,eAAS,CAAClC,WAAD,EAAc,UAAAW,GAAG,EAAA;AAAA,YAAIA,OAAAA,GAAG,CAACsB,OAAR,CAAA;AAAA,WAAjB,CADS,GAElBjC,WAFJ,CAAA;AAIA,UAAME,IAAAA,MAAM,GAAGJ,qBAAqB,CAACC,QAAD,EAAWC,WAAX,EAAwBC,KAAxB,CAApC,CAAA;AAEA,UAAA,IAAMU,GAAG,GAAGzB,QAAQ,CAACiD,SAAT,CACV5B,EADU,EAEV6B,SAFU,EAGVL,KAHU,EAIV9B,KAJU,EAKVC,MALU,CAAZ,CAAA;AAQAmC,UAAAA,MAAM,CAACC,MAAP,CAAc3B,GAAd,EAAmB;AACjB4B,YAAAA,gBAAgB,EAAE3C,QADD;AAEjBoC,YAAAA,aAAa,EAAbA,aAFiB;AAGjBC,YAAAA,OAAO,EAAPA,OAHiB;AAIjBlC,YAAAA,QAAQ,EAARA,QAAAA;AAJiB,WAAnB,CAAA,CAAA;AAOAkC,UAAAA,OAAO,CAAC7B,OAAR,CAAgB,UAAAoC,MAAM,EAAI;AACxBnB,YAAAA,eAAe,CAACoB,IAAhB,CAAqBD,MAArB,CAAA,CAAA;AACAlB,YAAAA,eAAe,CAACkB,MAAM,CAACjC,EAAR,CAAf,GAA6BiC,MAA7B,CAFwB;AAIxB;AACA;AACA;AACA;AACA;AACA;AACD,WAVD,CAAA,CAAA;AAYA,UAAA,OAAO7B,GAAP,CAAA;AACD,SA3C2B,CAA9B,CAAA;AA8CA,QAAA,OAAOgB,qBAAP,CAAA;AACD,OA/DD,CAAA;;AAiEA,MAAM3B,IAAAA,WAAW,GAAGuB,kBAAkB,CAAChC,QAAQ,CAACC,IAAV,EAAgB,CAAhB,EAAmB,EAAnB,CAAtC,CAAA;AAEAQ,MAAAA,WAAW,CAACI,OAAZ,CAAoB,UAAAoC,MAAM,EAAI;AAC5BnB,QAAAA,eAAe,CAACoB,IAAhB,CAAqBD,MAArB,CAAA,CAAA;AACAlB,QAAAA,eAAe,CAACkB,MAAM,CAACjC,EAAR,CAAf,GAA6BiC,MAA7B,CAF4B;AAI5B;AACA;AACA;AACA;AACA;AACA;AACD,OAVD,CAAA,CAAA;AAYA,MAAO,OAAA;AACLhD,QAAAA,IAAI,EAAEQ,WADD;AAEL0C,QAAAA,QAAQ,EAAErB,eAFL;AAGLsB,QAAAA,QAAQ,EAAErB,eAAAA;AAHL,OAAP,CAAA;AAKD,KA1JC,EA2JF;AACEsB,MAAAA,GAAG,EAAE,oBADP;AAEEC,MAAAA,KAAK,EAAE,SAAA,KAAA,GAAA;AAAA,QAAA,IAAA,qBAAA,CAAA;;AAAA,QAAM3D,OAAAA,CAAAA,qBAAAA,GAAAA,QAAQ,CAAC4D,OAAT,CAAiBC,QAAvB,oCAAmC7D,QAAQ,CAAC4D,OAAT,CAAiBE,UAApD,CAAA;AAAA,OAFT;AAGEC,MAAAA,QAAQ,EAAE,SAAM,QAAA,GAAA;AACd/D,QAAAA,QAAQ,CAACgE,KAAT,CAAe,YAAM;AACnBhE,UAAAA,QAAQ,CAACiE,oBAAT,EAAA,CAAA;AACD,SAFD,CAAA,CAAA;AAGD,OAAA;AAPH,KA3JE,CADS,CAAA;AAAA,GAAf,CAAA;AAsKD,CAAA;;AAED,SAASzB,OAAT,CACElC,IADF,EAEEI,QAFF,EAGE;AACA,EAAA,IAAMwD,QAAQ,GAAG,IAAIC,GAAJ,EAAjB,CAAA;AAEA,EAAO7D,OAAAA,IAAI,CAAC8D,MAAL,CAAY,UAAC5C,GAAD,EAAMC,GAAN,EAAc;AAC/B,IAAA,IAAM4C,MAAM,GAAM5C,EAAAA,GAAAA,GAAG,CAACT,MAAJ,CAAWN,QAAX,CAAlB,CAAA;AACA,IAAA,IAAM4D,QAAQ,GAAG9C,GAAG,CAAC+C,GAAJ,CAAQF,MAAR,CAAjB,CAAA;;AACA,IAAI,IAAA,CAACC,QAAL,EAAe;AACb9C,MAAAA,GAAG,CAACgD,GAAJ,CAAQH,MAAR,EAAgB,CAAC5C,GAAD,CAAhB,CAAA,CAAA;AACD,KAFD,MAEO;AACLD,MAAAA,GAAG,CAACgD,GAAJ,CAAQH,MAAR,EAAoBC,EAAAA,CAAAA,MAAAA,CAAAA,QAApB,GAA8B7C,GAA9B,CAAA,CAAA,CAAA,CAAA;AACD,KAAA;;AACD,IAAA,OAAOD,GAAP,CAAA;AACD,GATM,EASJ0C,QATI,CAAP,CAAA;AAUD;;;;"}

package/build/cjs/utils/getPaginationRowModel.js

@@ -0,0 +1,61 @@
+/**
+ * table-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var utils = require('../utils.js');
+var getExpandedRowModel = require('./getExpandedRowModel.js');
+
+function getPaginationRowModel(opts) {
+  return function (instance) {
+    return utils.memo(function () {
+      return [instance.getState().pagination, instance.getExpandedRowModel()];
+    }, function (pagination, rowModel) {
+      if (!rowModel.rows.length) {
+        return rowModel;
+      }
+
+      var pageSize = pagination.pageSize,
+          pageIndex = pagination.pageIndex;
+      var rows = rowModel.rows,
+          flatRows = rowModel.flatRows,
+          rowsById = rowModel.rowsById;
+      var pageStart = pageSize * pageIndex;
+      var pageEnd = pageStart + pageSize;
+      rows = rows.slice(pageStart, pageEnd);
+
+      if (!instance.options.paginateExpandedRows) {
+        return getExpandedRowModel.expandRows({
+          rows: rows,
+          flatRows: flatRows,
+          rowsById: rowsById
+        }, instance);
+      }
+
+      return {
+        rows: rows,
+        flatRows: flatRows,
+        rowsById: rowsById
+      };
+    }, {
+      key: 'getPaginationRowModel',
+      debug: function debug() {
+        var _instance$options$deb;
+
+        return (_instance$options$deb = instance.options.debugAll) != null ? _instance$options$deb : instance.options.debugTable;
+      }
+    });
+  };
+}
+
+exports.getPaginationRowModel = getPaginationRowModel;
+//# sourceMappingURL=getPaginationRowModel.js.map

package/build/cjs/utils/getPaginationRowModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getPaginationRowModel.js","sources":["../../../src/utils/getPaginationRowModel.ts"],"sourcesContent":["import { TableInstance, RowModel, AnyGenerics } from '../types'\nimport { memo } from '../utils'\nimport { expandRows } from './getExpandedRowModel'\n\nexport function getPaginationRowModel<TGenerics extends AnyGenerics>(opts?: {\n  initialSync: boolean\n}): (instance: TableInstance<TGenerics>) => () => RowModel<TGenerics> {\n  return instance =>\n    memo(\n      () => [instance.getState().pagination, instance.getExpandedRowModel()],\n      (pagination, rowModel) => {\n        if (!rowModel.rows.length) {\n          return rowModel\n        }\n\n        const { pageSize, pageIndex } = pagination\n        let { rows, flatRows, rowsById } = rowModel\n        const pageStart = pageSize * pageIndex\n        const pageEnd = pageStart + pageSize\n\n        rows = rows.slice(pageStart, pageEnd)\n\n        if (!instance.options.paginateExpandedRows) {\n          return expandRows(\n            {\n              rows,\n              flatRows,\n              rowsById,\n            },\n            instance\n          )\n        }\n\n        return {\n          rows,\n          flatRows,\n          rowsById,\n        }\n      },\n      {\n        key: 'getPaginationRowModel',\n        debug: () => instance.options.debugAll ?? instance.options.debugTable,\n      }\n    )\n}\n"],"names":["getPaginationRowModel","opts","instance","memo","getState","pagination","getExpandedRowModel","rowModel","rows","length","pageSize","pageIndex","flatRows","rowsById","pageStart","pageEnd","slice","options","paginateExpandedRows","expandRows","key","debug","debugAll","debugTable"],"mappings":";;;;;;;;;;;;;;;;;AAIO,SAASA,qBAAT,CAA8DC,IAA9D,EAE+D;AACpE,EAAA,OAAO,UAAAC,QAAQ,EAAA;AAAA,IAAA,OACbC,UAAI,CACF,YAAA;AAAA,MAAM,OAAA,CAACD,QAAQ,CAACE,QAAT,EAAA,CAAoBC,UAArB,EAAiCH,QAAQ,CAACI,mBAAT,EAAjC,CAAN,CAAA;AAAA,KADE,EAEF,UAACD,UAAD,EAAaE,QAAb,EAA0B;AACxB,MAAA,IAAI,CAACA,QAAQ,CAACC,IAAT,CAAcC,MAAnB,EAA2B;AACzB,QAAA,OAAOF,QAAP,CAAA;AACD,OAAA;;AAED,MAAA,IAAQG,QAAR,GAAgCL,UAAhC,CAAQK,QAAR;AAAA,UAAkBC,SAAlB,GAAgCN,UAAhC,CAAkBM,SAAlB,CAAA;AACA,MAAA,IAAMH,IAAN,GAAmCD,QAAnC,CAAMC,IAAN;AAAA,UAAYI,QAAZ,GAAmCL,QAAnC,CAAYK,QAAZ;AAAA,UAAsBC,QAAtB,GAAmCN,QAAnC,CAAsBM,QAAtB,CAAA;AACA,MAAA,IAAMC,SAAS,GAAGJ,QAAQ,GAAGC,SAA7B,CAAA;AACA,MAAA,IAAMI,OAAO,GAAGD,SAAS,GAAGJ,QAA5B,CAAA;AAEAF,MAAAA,IAAI,GAAGA,IAAI,CAACQ,KAAL,CAAWF,SAAX,EAAsBC,OAAtB,CAAP,CAAA;;AAEA,MAAA,IAAI,CAACb,QAAQ,CAACe,OAAT,CAAiBC,oBAAtB,EAA4C;AAC1C,QAAA,OAAOC,8BAAU,CACf;AACEX,UAAAA,IAAI,EAAJA,IADF;AAEEI,UAAAA,QAAQ,EAARA,QAFF;AAGEC,UAAAA,QAAQ,EAARA,QAAAA;AAHF,SADe,EAMfX,QANe,CAAjB,CAAA;AAQD,OAAA;;AAED,MAAO,OAAA;AACLM,QAAAA,IAAI,EAAJA,IADK;AAELI,QAAAA,QAAQ,EAARA,QAFK;AAGLC,QAAAA,QAAQ,EAARA,QAAAA;AAHK,OAAP,CAAA;AAKD,KA9BC,EA+BF;AACEO,MAAAA,GAAG,EAAE,uBADP;AAEEC,MAAAA,KAAK,EAAE,SAAA,KAAA,GAAA;AAAA,QAAA,IAAA,qBAAA,CAAA;;AAAA,QAAMnB,OAAAA,CAAAA,qBAAAA,GAAAA,QAAQ,CAACe,OAAT,CAAiBK,QAAvB,oCAAmCpB,QAAQ,CAACe,OAAT,CAAiBM,UAApD,CAAA;AAAA,OAAA;AAFT,KA/BE,CADS,CAAA;AAAA,GAAf,CAAA;AAqCD;;;;"}

package/build/cjs/utils/getSortedRowModelSync.js

@@ -0,0 +1,118 @@
+/**
+ * table-core
+ *
+ * Copyright (c) TanStack
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE.md file in the root directory of this source tree.
+ *
+ * @license MIT
+ */
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var utils = require('../utils.js');
+
+function getSortedRowModelSync() {
+  return function (instance) {
+    return utils.memo(function () {
+      return [instance.getState().sorting, instance.getGlobalFilteredRowModel()];
+    }, function (sorting, rowModel) {
+      if (!rowModel.rows.length || !(sorting != null && sorting.length)) {
+        return rowModel;
+      }
+
+      var sortingState = instance.getState().sorting;
+      var sortedFlatRows = []; // Filter out sortings that correspond to non existing columns
+
+      var availableSorting = sortingState.filter(function (sort) {
+        return instance.getColumnCanSort(sort.id);
+      });
+      var columnInfoById = {};
+      availableSorting.forEach(function (sortEntry) {
+        var column = instance.getColumn(sortEntry.id);
+        columnInfoById[sortEntry.id] = {
+          sortUndefined: column.sortUndefined,
+          invertSorting: column.invertSorting,
+          sortingFn: instance.getColumnSortingFn(sortEntry.id)
+        };
+      });
+
+      var sortData = function sortData(rows) {
+        // This will also perform a stable sorting using the row index
+        // if needed.
+        var sortedData = rows.slice();
+        sortedData.sort(function (rowA, rowB) {
+          for (var i = 0; i < availableSorting.length; i += 1) {
+            var _sortEntry$desc;
+
+            var sortEntry = availableSorting[i];
+            var columnInfo = columnInfoById[sortEntry.id];
+            var isDesc = (_sortEntry$desc = sortEntry == null ? void 0 : sortEntry.desc) != null ? _sortEntry$desc : false;
+
+            if (columnInfo.sortUndefined) {
+              var aValue = rowA.values[sortEntry.id];
+              var bValue = rowB.values[sortEntry.id];
+              var aUndefined = typeof aValue === 'undefined';
+              var bUndefined = typeof bValue === 'undefined';
+
+              if (aUndefined || bUndefined) {
+                return aUndefined && bUndefined ? 0 : aUndefined ? columnInfo.sortUndefined : -columnInfo.sortUndefined;
+              }
+            } // This function should always return in ascending order
+
+
+            var sortInt = columnInfo.sortingFn(rowA, rowB, sortEntry.id);
+
+            if (sortInt !== 0) {
+              if (isDesc) {
+                sortInt *= -1;
+              }
+
+              if (columnInfo.invertSorting) {
+                sortInt *= -1;
+              }
+
+              return sortInt;
+            }
+          }
+
+          return rowA.index - rowB.index;
+        }); // If there are sub-rows, sort them
+
+        sortedData.forEach(function (row) {
+          sortedFlatRows.push(row);
+
+          if (!row.subRows || row.subRows.length <= 1) {
+            return;
+          }
+
+          row.subRows = sortData(row.subRows);
+        });
+        return sortedData;
+      };
+
+      return {
+        rows: sortData(rowModel.rows),
+        flatRows: sortedFlatRows,
+        rowsById: rowModel.rowsById
+      };
+    }, {
+      key: 'getSortedRowModel',
+      debug: function debug() {
+        var _instance$options$deb;
+
+        return (_instance$options$deb = instance.options.debugAll) != null ? _instance$options$deb : instance.options.debugTable;
+      },
+      onChange: function onChange() {
+        instance.queue(function () {
+          instance._notifyGroupingReset();
+        });
+      }
+    });
+  };
+}
+
+exports.getSortedRowModelSync = getSortedRowModelSync;
+//# sourceMappingURL=getSortedRowModelSync.js.map

package/build/cjs/utils/getSortedRowModelSync.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getSortedRowModelSync.js","sources":["../../../src/utils/getSortedRowModelSync.ts"],"sourcesContent":["import { TableInstance, Row, RowModel, AnyGenerics } from '../types'\nimport { SortingFn } from '../features/Sorting'\nimport { memo } from '../utils'\n\nexport function getSortedRowModelSync<TGenerics extends AnyGenerics>(): (\n  instance: TableInstance<TGenerics>\n) => () => RowModel<TGenerics> {\n  return instance =>\n    memo(\n      () => [instance.getState().sorting, instance.getGlobalFilteredRowModel()],\n      (sorting, rowModel) => {\n        if (!rowModel.rows.length || !sorting?.length) {\n          return rowModel\n        }\n\n        const sortingState = instance.getState().sorting\n\n        const sortedFlatRows: Row<TGenerics>[] = []\n\n        // Filter out sortings that correspond to non existing columns\n        const availableSorting = sortingState.filter(sort =>\n          instance.getColumnCanSort(sort.id)\n        )\n\n        const columnInfoById: Record<\n          string,\n          {\n            sortUndefined?: false | -1 | 1\n            invertSorting?: boolean\n            sortingFn: SortingFn<TGenerics>\n          }\n        > = {}\n\n        availableSorting.forEach(sortEntry => {\n          const column = instance.getColumn(sortEntry.id)!\n\n          columnInfoById[sortEntry.id] = {\n            sortUndefined: column.sortUndefined,\n            invertSorting: column.invertSorting,\n            sortingFn: instance.getColumnSortingFn(sortEntry.id)!,\n          }\n        })\n\n        const sortData = (rows: Row<TGenerics>[]) => {\n          // This will also perform a stable sorting using the row index\n          // if needed.\n          const sortedData = rows.slice()\n\n          sortedData.sort((rowA, rowB) => {\n            for (let i = 0; i < availableSorting.length; i += 1) {\n              const sortEntry = availableSorting[i]!\n              const columnInfo = columnInfoById[sortEntry.id]!\n              const isDesc = sortEntry?.desc ?? false\n\n              if (columnInfo.sortUndefined) {\n                const aValue = rowA.values[sortEntry.id]\n                const bValue = rowB.values[sortEntry.id]\n\n                const aUndefined = typeof aValue === 'undefined'\n                const bUndefined = typeof bValue === 'undefined'\n\n                if (aUndefined || bUndefined) {\n                  return aUndefined && bUndefined\n                    ? 0\n                    : aUndefined\n                    ? columnInfo.sortUndefined\n                    : -columnInfo.sortUndefined\n                }\n              }\n\n              // This function should always return in ascending order\n              let sortInt = columnInfo.sortingFn(rowA, rowB, sortEntry.id)\n\n              if (sortInt !== 0) {\n                if (isDesc) {\n                  sortInt *= -1\n                }\n\n                if (columnInfo.invertSorting) {\n                  sortInt *= -1\n                }\n\n                return sortInt\n              }\n            }\n\n            return rowA.index - rowB.index\n          })\n\n          // If there are sub-rows, sort them\n          sortedData.forEach(row => {\n            sortedFlatRows.push(row)\n            if (!row.subRows || row.subRows.length <= 1) {\n              return\n            }\n            row.subRows = sortData(row.subRows)\n          })\n\n          return sortedData\n        }\n\n        return {\n          rows: sortData(rowModel.rows),\n          flatRows: sortedFlatRows,\n          rowsById: rowModel.rowsById,\n        }\n      },\n      {\n        key: 'getSortedRowModel',\n        debug: () => instance.options.debugAll ?? instance.options.debugTable,\n        onChange: () => {\n          instance.queue(() => {\n            instance._notifyGroupingReset()\n          })\n        },\n      }\n    )\n}\n"],"names":["getSortedRowModelSync","instance","memo","getState","sorting","getGlobalFilteredRowModel","rowModel","rows","length","sortingState","sortedFlatRows","availableSorting","filter","sort","getColumnCanSort","id","columnInfoById","forEach","sortEntry","column","getColumn","sortUndefined","invertSorting","sortingFn","getColumnSortingFn","sortData","sortedData","slice","rowA","rowB","i","columnInfo","isDesc","desc","aValue","values","bValue","aUndefined","bUndefined","sortInt","index","row","push","subRows","flatRows","rowsById","key","debug","options","debugAll","debugTable","onChange","queue","_notifyGroupingReset"],"mappings":";;;;;;;;;;;;;;;;AAIO,SAASA,qBAAT,GAEwB;AAC7B,EAAA,OAAO,UAAAC,QAAQ,EAAA;AAAA,IAAA,OACbC,UAAI,CACF,YAAA;AAAA,MAAM,OAAA,CAACD,QAAQ,CAACE,QAAT,EAAA,CAAoBC,OAArB,EAA8BH,QAAQ,CAACI,yBAAT,EAA9B,CAAN,CAAA;AAAA,KADE,EAEF,UAACD,OAAD,EAAUE,QAAV,EAAuB;AACrB,MAAA,IAAI,CAACA,QAAQ,CAACC,IAAT,CAAcC,MAAf,IAAyB,EAACJ,OAAD,IAACA,IAAAA,IAAAA,OAAO,CAAEI,MAAV,CAA7B,EAA+C;AAC7C,QAAA,OAAOF,QAAP,CAAA;AACD,OAAA;;AAED,MAAA,IAAMG,YAAY,GAAGR,QAAQ,CAACE,QAAT,GAAoBC,OAAzC,CAAA;AAEA,MAAA,IAAMM,cAAgC,GAAG,EAAzC,CAPqB;;AAUrB,MAAA,IAAMC,gBAAgB,GAAGF,YAAY,CAACG,MAAb,CAAoB,UAAAC,IAAI,EAAA;AAAA,QAAA,OAC/CZ,QAAQ,CAACa,gBAAT,CAA0BD,IAAI,CAACE,EAA/B,CAD+C,CAAA;AAAA,OAAxB,CAAzB,CAAA;AAIA,MAAMC,IAAAA,cAOL,GAAG,EAPJ,CAAA;AASAL,MAAAA,gBAAgB,CAACM,OAAjB,CAAyB,UAAAC,SAAS,EAAI;AACpC,QAAMC,IAAAA,MAAM,GAAGlB,QAAQ,CAACmB,SAAT,CAAmBF,SAAS,CAACH,EAA7B,CAAf,CAAA;AAEAC,QAAAA,cAAc,CAACE,SAAS,CAACH,EAAX,CAAd,GAA+B;AAC7BM,UAAAA,aAAa,EAAEF,MAAM,CAACE,aADO;AAE7BC,UAAAA,aAAa,EAAEH,MAAM,CAACG,aAFO;AAG7BC,UAAAA,SAAS,EAAEtB,QAAQ,CAACuB,kBAAT,CAA4BN,SAAS,CAACH,EAAtC,CAAA;AAHkB,SAA/B,CAAA;AAKD,OARD,CAAA,CAAA;;AAUA,MAAA,IAAMU,QAAQ,GAAG,SAAXA,QAAW,CAAClB,IAAD,EAA4B;AAC3C;AACA;AACA,QAAA,IAAMmB,UAAU,GAAGnB,IAAI,CAACoB,KAAL,EAAnB,CAAA;AAEAD,QAAAA,UAAU,CAACb,IAAX,CAAgB,UAACe,IAAD,EAAOC,IAAP,EAAgB;AAC9B,UAAA,KAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGnB,gBAAgB,CAACH,MAArC,EAA6CsB,CAAC,IAAI,CAAlD,EAAqD;AAAA,YAAA,IAAA,eAAA,CAAA;;AACnD,YAAA,IAAMZ,SAAS,GAAGP,gBAAgB,CAACmB,CAAD,CAAlC,CAAA;AACA,YAAA,IAAMC,UAAU,GAAGf,cAAc,CAACE,SAAS,CAACH,EAAX,CAAjC,CAAA;AACA,YAAMiB,IAAAA,MAAM,sBAAGd,SAAH,IAAA,IAAA,GAAA,KAAA,CAAA,GAAGA,SAAS,CAAEe,IAAd,8BAAsB,KAAlC,CAAA;;AAEA,YAAIF,IAAAA,UAAU,CAACV,aAAf,EAA8B;AAC5B,cAAMa,IAAAA,MAAM,GAAGN,IAAI,CAACO,MAAL,CAAYjB,SAAS,CAACH,EAAtB,CAAf,CAAA;AACA,cAAMqB,IAAAA,MAAM,GAAGP,IAAI,CAACM,MAAL,CAAYjB,SAAS,CAACH,EAAtB,CAAf,CAAA;AAEA,cAAA,IAAMsB,UAAU,GAAG,OAAOH,MAAP,KAAkB,WAArC,CAAA;AACA,cAAA,IAAMI,UAAU,GAAG,OAAOF,MAAP,KAAkB,WAArC,CAAA;;AAEA,cAAIC,IAAAA,UAAU,IAAIC,UAAlB,EAA8B;AAC5B,gBAAA,OAAOD,UAAU,IAAIC,UAAd,GACH,CADG,GAEHD,UAAU,GACVN,UAAU,CAACV,aADD,GAEV,CAACU,UAAU,CAACV,aAJhB,CAAA;AAKD,eAAA;AACF,aAnBkD;;;AAsBnD,YAAA,IAAIkB,OAAO,GAAGR,UAAU,CAACR,SAAX,CAAqBK,IAArB,EAA2BC,IAA3B,EAAiCX,SAAS,CAACH,EAA3C,CAAd,CAAA;;AAEA,YAAIwB,IAAAA,OAAO,KAAK,CAAhB,EAAmB;AACjB,cAAA,IAAIP,MAAJ,EAAY;AACVO,gBAAAA,OAAO,IAAI,CAAC,CAAZ,CAAA;AACD,eAAA;;AAED,cAAIR,IAAAA,UAAU,CAACT,aAAf,EAA8B;AAC5BiB,gBAAAA,OAAO,IAAI,CAAC,CAAZ,CAAA;AACD,eAAA;;AAED,cAAA,OAAOA,OAAP,CAAA;AACD,aAAA;AACF,WAAA;;AAED,UAAA,OAAOX,IAAI,CAACY,KAAL,GAAaX,IAAI,CAACW,KAAzB,CAAA;AACD,SAvCD,EAL2C;;AA+C3Cd,QAAAA,UAAU,CAACT,OAAX,CAAmB,UAAAwB,GAAG,EAAI;AACxB/B,UAAAA,cAAc,CAACgC,IAAf,CAAoBD,GAApB,CAAA,CAAA;;AACA,UAAA,IAAI,CAACA,GAAG,CAACE,OAAL,IAAgBF,GAAG,CAACE,OAAJ,CAAYnC,MAAZ,IAAsB,CAA1C,EAA6C;AAC3C,YAAA,OAAA;AACD,WAAA;;AACDiC,UAAAA,GAAG,CAACE,OAAJ,GAAclB,QAAQ,CAACgB,GAAG,CAACE,OAAL,CAAtB,CAAA;AACD,SAND,CAAA,CAAA;AAQA,QAAA,OAAOjB,UAAP,CAAA;AACD,OAxDD,CAAA;;AA0DA,MAAO,OAAA;AACLnB,QAAAA,IAAI,EAAEkB,QAAQ,CAACnB,QAAQ,CAACC,IAAV,CADT;AAELqC,QAAAA,QAAQ,EAAElC,cAFL;AAGLmC,QAAAA,QAAQ,EAAEvC,QAAQ,CAACuC,QAAAA;AAHd,OAAP,CAAA;AAKD,KAlGC,EAmGF;AACEC,MAAAA,GAAG,EAAE,mBADP;AAEEC,MAAAA,KAAK,EAAE,SAAA,KAAA,GAAA;AAAA,QAAA,IAAA,qBAAA,CAAA;;AAAA,QAAM9C,OAAAA,CAAAA,qBAAAA,GAAAA,QAAQ,CAAC+C,OAAT,CAAiBC,QAAvB,oCAAmChD,QAAQ,CAAC+C,OAAT,CAAiBE,UAApD,CAAA;AAAA,OAFT;AAGEC,MAAAA,QAAQ,EAAE,SAAM,QAAA,GAAA;AACdlD,QAAAA,QAAQ,CAACmD,KAAT,CAAe,YAAM;AACnBnD,UAAAA,QAAQ,CAACoD,oBAAT,EAAA,CAAA;AACD,SAFD,CAAA,CAAA;AAGD,OAAA;AAPH,KAnGE,CADS,CAAA;AAAA,GAAf,CAAA;AA8GD;;;;"}

package/build/cjs/utils.js

@@ -19,6 +19,32 @@ function functionalUpdate(updater, input) {
 }
 function noop() {//
 }
+function getBatchGroups(arr, count) {
+  var groups = [{
+    start: 0,
+    end: count - 1,
+    items: []
+  }];
+  var groupIndex = 0;
+  var group = groups[groupIndex];
+
+  for (var i = 0; i < arr.length; i++) {
+    if (i > group.end) {
+      groupIndex++;
+      groups[groupIndex] = {
+        start: i,
+        end: i + count - 1,
+        items: []
+      };
+    }
+
+    group = groups[groupIndex];
+    var _item = arr[i];
+    group.items.push(_item);
+  }
+
+  return groups;
+}
 function makeStateUpdater(key, instance) {
   return function (updater) {
     instance.setState(function (old) {
@@ -61,7 +87,7 @@ function memo(getDeps, fn, opts) {
   var result;
   return function () {
     var depTime;
-    if (opts.key && opts.debug) depTime = performance.now();
+    if (opts.key && opts.debug) depTime = Date.now();
     var newDeps = getDeps();
     var depsChanged = newDeps.length !== deps.length || newDeps.some(function (dep, index) {
       return deps[index] !== dep;
@@ -70,15 +96,15 @@ function memo(getDeps, fn, opts) {
     if (depsChanged) {
       var oldResult = result;
       var resultTime;
-      if (opts.key && opts.debug) resultTime = performance.now();
+      if (opts.key && opts.debug) resultTime = Date.now();
       result = fn.apply(void 0, newDeps);
       deps = newDeps;
       opts == null ? void 0 : opts.onChange == null ? void 0 : opts.onChange(result, oldResult);
 
       if (opts.key && opts.debug) {
         if (opts != null && opts.debug()) {
-          var depEndTime = Math.round((performance.now() - depTime) * 100) / 100;
-          var resultEndTime = Math.round((performance.now() - resultTime) * 100) / 100;
+          var depEndTime = Math.round((Date.now() - depTime) * 100) / 100;
+          var resultEndTime = Math.round((Date.now() - resultTime) * 100) / 100;
           var resultFpsPercentage = resultEndTime / 16;
 
           var pad = function pad(str, num) {
@@ -116,25 +142,138 @@ function memo(getDeps, fn, opts) {
 
     return result;
   };
-} // export function hashString(str: string, seed = 0): string {
-//   let h1 = 0xdeadbeef ^ seed,
-//     h2 = 0x41c6ce57 ^ seed
-//   for (let i = 0, ch; i < str.length; i++) {
-//     ch = str.charCodeAt(i)
-//     h1 = Math.imul(h1 ^ ch, 2654435761)
-//     h2 = Math.imul(h2 ^ ch, 1597334677)
-//   }
-//   h1 =
-//     Math.imul(h1 ^ (h1 >>> 16), 2246822507) ^
-//     Math.imul(h2 ^ (h2 >>> 13), 3266489909)
-//   h2 =
-//     Math.imul(h2 ^ (h2 >>> 16), 2246822507) ^
-//     Math.imul(h1 ^ (h1 >>> 13), 3266489909)
-//   return (4294967296 * (2097151 & h2) + (h1 >>> 0)).toString()
-// }
+}
+function incrementalMemo(getDeps, getInitialValue, schedule, opts) {
+  var _opts$timeout;
+
+  var oldDeps;
+  var deps;
+  var result;
+  var nextResultRef;
+  var tasks = [];
+  var totalTaskCount = 0;
+  var resultStartTime;
+  var batchIndex = 0;
+  var progress = 0;
+  var working = false;
+  var callback;
+  var timeout = (_opts$timeout = opts.timeout) != null ? _opts$timeout : 100;
+
+  var onProgress = function onProgress(latestResult, previousResult) {
+    progress = 1 - tasks.length / totalTaskCount;
+    opts.onProgress(progress, latestResult, previousResult);
+  };
+
+  return function () {
+    var scheduleFn = function scheduleFn(workFn) {
+      totalTaskCount++;
+      tasks.push(workFn);
+    };
+
+    var newDeps = getDeps();
+    var first = false;
+
+    if (!deps) {
+      first = true;
+      deps = [];
+      result = getInitialValue.apply(void 0, newDeps);
+    }
+
+    var depsChanged = newDeps.length !== deps.length || newDeps.some(function (dep, index) {
+      return deps[index] !== dep;
+    });
+
+    if (depsChanged) {
+      cancelIdleCallback(callback);
+      oldDeps = deps;
+      deps = newDeps;
+      totalTaskCount = 0;
+      tasks = [];
+      nextResultRef = {
+        current: getInitialValue.apply(void 0, newDeps)
+      };
+      resultStartTime = Date.now();
+      schedule.apply(void 0, newDeps)(nextResultRef)(scheduleFn);
+    }
+
+    var commitResult = function commitResult() {
+      cancelIdleCallback(callback);
+
+      if (opts.key && opts.debug) {
+        if (opts != null && opts.debug()) {
+          var resultEndTime = Math.round((Date.now() - resultStartTime) * 100) / 100;
+          var resultFpsPercentage = resultEndTime / batchIndex / 16;
+          console.info("%c\u23F1 " + resultEndTime + " ms / " + batchIndex + " tasks = " + Math.round(resultEndTime / batchIndex) + " ms/task", "\n      font-size: .6rem;\n      font-weight: bold;\n      color: hsl(" + Math.max(0, Math.min(120 - 120 * resultFpsPercentage, 120)) + "deg 100% 31%);", opts == null ? void 0 : opts.key, _rollupPluginBabelHelpers["extends"]({
+            length: oldDeps.length + " -> " + deps.length
+          }, deps.map(function (_, index) {
+            if (oldDeps[index] !== deps[index]) {
+              return [index, oldDeps[index], deps[index]];
+            }
+
+            return false;
+          }).filter(Boolean).reduce(function (accu, _ref2) {
+            var _extends4;
+
+            var a = _ref2[0],
+                b = _ref2[1];
+            return _rollupPluginBabelHelpers["extends"]({}, accu, (_extends4 = {}, _extends4[a] = b, _extends4));
+          }, {}), {
+            parent: parent
+          }));
+        }
+      }
+
+      working = false;
+      var previousResult = result;
+      result = nextResultRef.current;
+      onProgress(result, previousResult);
+      opts.onChange(result, previousResult);
+    };
+
+    if (opts.initialSync && first) {
+      batchIndex = 1;
+      first = false;
+
+      for (var i = 0; i < tasks.length; i++) {
+        tasks[i]();
+      }
+
+      tasks = [];
+      commitResult();
+    } else if (!working && tasks.length) {
+      cancelIdleCallback(callback);
+      working = true;
+      batchIndex = 0;
+
+      var workLoop = function workLoop(deadline) {
+        while (tasks.length && deadline.timeRemaining() > 0) {
+          tasks.shift()();
+        }
+
+        if (!tasks.length) {
+          commitResult();
+        } else {
+          ++batchIndex;
+          onProgress(nextResultRef.current, result);
+          callback = requestIdleCallback(workLoop, {
+            timeout: timeout
+          });
+        }
+      };
+
+      callback = requestIdleCallback(workLoop, {
+        timeout: timeout
+      });
+    }
+
+    return result;
+  };
+} // opts?.onChange?.(result, oldResult)
 
 exports.flattenBy = flattenBy;
 exports.functionalUpdate = functionalUpdate;
+exports.getBatchGroups = getBatchGroups;
+exports.incrementalMemo = incrementalMemo;
 exports.isFunction = isFunction;
 exports.makeStateUpdater = makeStateUpdater;
 exports.memo = memo;