@tanstack/svelte-table 8.0.0-beta.7 → 8.0.3

package/build/esm/index.js

@@ -982,38 +982,54 @@ const Expanding = {
 };
 
 const includesString = (row, columnId, filterValue) => {
+  var _row$getValue;
+
   const search = filterValue.toLowerCase();
-  return row.getValue(columnId).toLowerCase().includes(search);
+  return (_row$getValue = row.getValue(columnId)) == null ? void 0 : _row$getValue.toLowerCase().includes(search);
 };
 
 includesString.autoRemove = val => testFalsey(val);
 
 const includesStringSensitive = (row, columnId, filterValue) => {
-  return row.getValue(columnId).includes(filterValue);
+  var _row$getValue2;
+
+  return (_row$getValue2 = row.getValue(columnId)) == null ? void 0 : _row$getValue2.includes(filterValue);
 };
 
 includesStringSensitive.autoRemove = val => testFalsey(val);
 
 const equalsString = (row, columnId, filterValue) => {
-  return row.getValue(columnId).toLowerCase() === filterValue.toLowerCase();
+  var _row$getValue3;
+
+  return ((_row$getValue3 = row.getValue(columnId)) == null ? void 0 : _row$getValue3.toLowerCase()) === filterValue.toLowerCase();
 };
 
 equalsString.autoRemove = val => testFalsey(val);
 
 const arrIncludes = (row, columnId, filterValue) => {
-  return row.getValue(columnId).includes(filterValue);
+  var _row$getValue4;
+
+  return (_row$getValue4 = row.getValue(columnId)) == null ? void 0 : _row$getValue4.includes(filterValue);
 };
 
 arrIncludes.autoRemove = val => testFalsey(val) || !(val != null && val.length);
 
 const arrIncludesAll = (row, columnId, filterValue) => {
-  return !filterValue.some(val => !row.getValue(columnId).includes(val));
+  return !filterValue.some(val => {
+    var _row$getValue5;
+
+    return !((_row$getValue5 = row.getValue(columnId)) != null && _row$getValue5.includes(val));
+  });
 };
 
 arrIncludesAll.autoRemove = val => testFalsey(val) || !(val != null && val.length);
 
 const arrIncludesSome = (row, columnId, filterValue) => {
-  return filterValue.some(val => row.getValue(columnId).includes(val));
+  return filterValue.some(val => {
+    var _row$getValue6;
+
+    return (_row$getValue6 = row.getValue(columnId)) == null ? void 0 : _row$getValue6.includes(val);
+  });
 };
 
 arrIncludesSome.autoRemove = val => testFalsey(val) || !(val != null && val.length);
@@ -1318,7 +1334,10 @@ function shouldAutoRemoveFilter(filterFn, value, column) {
 const sum = (columnId, _leafRows, childRows) => {
   // It's faster to just add the aggregations together instead of
   // process leaf nodes individually
-  return childRows.reduce((sum, next) => sum + (typeof next === 'number' ? next : 0), 0);
+  return childRows.reduce((sum, next) => {
+    const nextValue = next.getValue(columnId);
+    return sum + (typeof nextValue === 'number' ? nextValue : 0);
+  }, 0);
 };
 
 const min = (columnId, _leafRows, childRows) => {
@@ -1698,7 +1717,7 @@ const Pagination = {
       setPageIndex: updater => {
         instance.setPagination(old => {
           let pageIndex = functionalUpdate(updater, old.pageIndex);
-          const maxPageIndex = typeof old.pageCount !== 'undefined' ? old.pageCount - 1 : Number.MAX_SAFE_INTEGER;
+          const maxPageIndex = typeof instance.options.pageCount === 'undefined' || instance.options.pageCount === -1 ? Number.MAX_SAFE_INTEGER : instance.options.pageCount - 1;
           pageIndex = Math.min(Math.max(0, pageIndex), maxPageIndex);
           return { ...old,
             pageIndex
@@ -1727,9 +1746,9 @@ const Pagination = {
         });
       },
       setPageCount: updater => instance.setPagination(old => {
-        var _old$pageCount;
+        var _instance$options$pag;
 
-        let newPageCount = functionalUpdate(updater, (_old$pageCount = old.pageCount) != null ? _old$pageCount : -1);
+        let newPageCount = functionalUpdate(updater, (_instance$options$pag = instance.options.pageCount) != null ? _instance$options$pag : -1);
 
         if (typeof newPageCount === 'number') {
           newPageCount = Math.max(-1, newPageCount);
@@ -1739,7 +1758,7 @@ const Pagination = {
           pageCount: newPageCount
         };
       }),
-      getPageOptions: memo(() => [instance.getState().pagination.pageSize, instance.getState().pagination.pageCount], (pageSize, pageCount) => {
+      getPageOptions: memo(() => [instance.getPageCount()], pageCount => {
         let pageOptions = [];
 
         if (pageCount && pageCount > 0) {
@@ -1793,15 +1812,9 @@ const Pagination = {
         return instance._getPaginationRowModel();
       },
       getPageCount: () => {
-        const {
-          pageCount
-        } = instance.getState().pagination;
+        var _instance$options$pag2;
 
-        if (typeof pageCount !== 'undefined') {
-          return pageCount;
-        }
-
-        return Math.ceil(instance.getPrePaginationRowModel().rows.length / instance.getState().pagination.pageSize);
+        return (_instance$options$pag2 = instance.options.pageCount) != null ? _instance$options$pag2 : Math.ceil(instance.getPrePaginationRowModel().rows.length / instance.getState().pagination.pageSize);
       }
     };
   }
@@ -2297,9 +2310,6 @@ function selectRowsFn(instance, rowModel) {
   const newSelectedRowsById = {}; // Filters top level and nested rows
 
   const recurseRows = function (rows, depth) {
-    if (depth === void 0) {
-      depth = 0;
-    }
 
     return rows.map(row => {
       var _row$subRows2;
@@ -2313,7 +2323,7 @@ function selectRowsFn(instance, rowModel) {
 
       if ((_row$subRows2 = row.subRows) != null && _row$subRows2.length) {
         row = { ...row,
-          subRows: recurseRows(row.subRows, depth + 1)
+          subRows: recurseRows(row.subRows)
         };
       }
 
@@ -3236,25 +3246,20 @@ function filterRows(rows, filterRowImpl, instance) {
 function filterRowModelFromLeafs(rowsToFilter, filterRow, instance) {
   const newFilteredFlatRows = [];
   const newFilteredRowsById = {};
-  let row;
-  let newRow;
 
   const recurseFilterRows = function (rowsToFilter, depth) {
-    if (depth === void 0) {
-      depth = 0;
-    }
 
     const rows = []; // Filter from children up first
 
     for (let i = 0; i < rowsToFilter.length; i++) {
       var _row$subRows;
 
-      row = rowsToFilter[i];
+      let row = rowsToFilter[i];
 
       if ((_row$subRows = row.subRows) != null && _row$subRows.length) {
-        newRow = createRow(instance, row.id, row.original, row.index, row.depth);
+        const newRow = createRow(instance, row.id, row.original, row.index, row.depth);
         newRow.columnFilters = row.columnFilters;
-        newRow.subRows = recurseFilterRows(row.subRows, depth + 1);
+        newRow.subRows = recurseFilterRows(row.subRows);
 
         if (!newRow.subRows.length) {
           continue;
@@ -3281,29 +3286,23 @@ function filterRowModelFromLeafs(rowsToFilter, filterRow, instance) {
 }
 function filterRowModelFromRoot(rowsToFilter, filterRow, instance) {
   const newFilteredFlatRows = [];
-  const newFilteredRowsById = {};
-  let rows;
-  let row;
-  let newRow; // Filters top level and nested rows
+  const newFilteredRowsById = {}; // Filters top level and nested rows
 
   const recurseFilterRows = function (rowsToFilter, depth) {
-    if (depth === void 0) {
-      depth = 0;
-    }
 
     // Filter from parents downward first
-    rows = []; // Apply the filter to any subRows
+    const rows = []; // Apply the filter to any subRows
 
     for (let i = 0; i < rowsToFilter.length; i++) {
-      row = rowsToFilter[i];
+      let row = rowsToFilter[i];
       const pass = filterRow(row);
 
       if (pass) {
         var _row$subRows2;
 
         if ((_row$subRows2 = row.subRows) != null && _row$subRows2.length) {
-          newRow = createRow(instance, row.id, row.original, row.index, row.depth);
-          newRow.subRows = recurseFilterRows(row.subRows, depth + 1);
+          const newRow = createRow(instance, row.id, row.original, row.index, row.depth);
+          newRow.subRows = recurseFilterRows(row.subRows);
           row = newRow;
         }