@infinite-table/infinite-react 6.0.12 → 6.0.14

package/index.d.ts

@@ -2300,21 +2300,24 @@ declare class GroupRowsState<KeyType extends any = any> extends BooleanDeepColle
     toggleGroupRow(keys: KeyType[]): void;
 }
 
+declare type IndexerOptions<DataType, PrimaryKeyType> = {
+    toPrimaryKey: (data: DataType) => PrimaryKeyType;
+    cache?: DataSourceCache<DataType, PrimaryKeyType>;
+    getNodeChildren?: TreeParams<DataType, PrimaryKeyType>['getNodeChildren'];
+    isLeafNode?: TreeParams<DataType, PrimaryKeyType>['isLeafNode'];
+    nodesKey: string | undefined;
+};
 declare class Indexer<DataType, PrimaryKeyType = string> {
     primaryKeyToData: Map<PrimaryKeyType, DataType>;
     nodePathsToData: DeepMap<PrimaryKeyType, DataType>;
+    private removeNodePath;
+    private remove;
     private add;
     private addNodePath;
     clear: () => void;
     getDataForPrimaryKey: (primaryKey: PrimaryKeyType) => DataType | undefined;
     getDataForNodePath: (nodePath: NodePath$1<any>) => DataType | undefined;
-    indexArray: (arr: DataType[], options: {
-        toPrimaryKey: (data: DataType) => PrimaryKeyType;
-        cache?: DataSourceCache<DataType, PrimaryKeyType> | undefined;
-        getNodeChildren?: ((item: DataType) => DataType[] | null) | undefined;
-        isLeafNode?: ((item: DataType) => boolean) | undefined;
-        nodesKey: string | undefined;
-    }) => DataType[];
+    indexArray: (arr: DataType[], options: IndexerOptions<DataType, PrimaryKeyType>) => DataType[];
 }
 
 declare class RowDisabledState<KeyType = any> extends BooleanCollectionState<RowDisabledStateObject<KeyType>, KeyType> {
@@ -6023,6 +6026,12 @@ declare type PivotBy<DataType, KeyType> = Omit<GroupBy<DataType, KeyType>, 'colu
         columnGroup: InfiniteTablePivotFinalColumnGroup<DataType, KeyType>;
     }) => ColumnTypeWithInherit<Partial<InfiniteTablePivotFinalColumnGroup<DataType>>>);
 };
+declare type TreeParams<DataType, _KeyType> = {
+    isLeafNode: (item: DataType) => boolean;
+    getNodeChildren: (item: DataType) => null | DataType[];
+    toKey: (item: DataType) => any;
+    reducers?: Record<string, DataSourceAggregationReducer<DataType, any>>;
+};
 declare type GroupParams<DataType, KeyType> = {
     groupBy: GroupBy<DataType, KeyType>[];
     defaultToKey?: (value: any, item: DataType) => GroupKeyType<KeyType>;

package/index.dev.js

@@ -13855,12 +13855,59 @@ var Indexer = class {
   constructor() {
     this.primaryKeyToData = /* @__PURE__ */ new Map();
     this.nodePathsToData = new DeepMap();
+    this.removeNodePath = (nodePath, options) => {
+      this.nodePathsToData.delete(nodePath);
+      this.remove(nodePath[nodePath.length - 1]);
+      if (!options) {
+        return;
+      }
+      const data = this.nodePathsToData.get(nodePath);
+      if (data) {
+        const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+          //@ts-ignore
+          data[options.nodesKey]
+        ) : null;
+        if (children && Array.isArray(children)) {
+          for (let i = 0, len = children.length; i < len; i++) {
+            const child = children[i];
+            const childPath = [...nodePath, options.toPrimaryKey(child)];
+            this.removeNodePath(childPath, options);
+          }
+        }
+      }
+    };
+    this.remove = (primaryKey) => {
+      this.primaryKeyToData.delete(primaryKey);
+    };
     this.add = (primaryKey, data) => {
       this.primaryKeyToData.set(primaryKey, data);
     };
-    this.addNodePath = (nodePath, data) => {
+    this.addNodePath = (nodePath, data, options) => {
+      if (false) {
+        if (this.nodePathsToData.has(nodePath)) {
+          console.warn(
+            `There is a problem! The node at path [${nodePath.join(
+              "/"
+            )}] is already in the indexer! You're doing too much work!`
+          );
+        }
+      }
       this.nodePathsToData.set(nodePath, data);
       this.add(nodePath[nodePath.length - 1], data);
+      if (!options) {
+        return;
+      }
+      const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+        //@ts-ignore
+        data[options.nodesKey]
+      ) : null;
+      if (children && Array.isArray(children)) {
+        for (let i = 0, len = children.length; i < len; i++) {
+          const child = children[i];
+          const childPath = [...nodePath, options.toPrimaryKey(child)];
+          this.addNodePath(childPath, child, options);
+        }
+      }
     };
     this.clear = () => {
       this.primaryKeyToData.clear();
@@ -13894,7 +13941,7 @@ var Indexer = class {
             if (info.type === "insert") {
               const insertPK = toPrimaryKey(info.data);
               if (isTree) {
-                this.addNodePath([insertPK], info.data);
+                this.addNodePath([insertPK], info.data, options);
               } else {
                 this.add(insertPK, info.data);
               }
@@ -13921,9 +13968,9 @@ var Indexer = class {
                   const info = cacheInfo[cacheIndex];
                   if (info.type === "delete" && !deleted) {
                     if (isTreeModeForNode) {
-                      this.nodePathsToData.delete(nodePath);
+                      this.removeNodePath(nodePath, options);
                     } else {
-                      this.primaryKeyToData.delete(pk);
+                      this.remove(pk);
                     }
                     deleted = true;
                     arr2.splice(i, 1);
@@ -13934,13 +13981,6 @@ var Indexer = class {
                     arr2[i] = item;
                   }
                   if (info.type === "insert") {
-                    const insertPK = toPrimaryKey(info.data);
-                    if (isTreeModeForNode) {
-                      const currentPath = [...parentPath, insertPK];
-                      this.addNodePath(currentPath, info.data);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13957,6 +13997,7 @@ var Indexer = class {
               }
               if (!deleted) {
                 if (isTreeModeForNode) {
+                  this.addNodePath(nodePath, item);
                   const isLeaf = isLeafNode(item);
                   let children = isLeaf ? null : getNodeChildren(item);
                   if (!isLeaf && Array.isArray(children)) {
@@ -13967,7 +14008,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item);
                 } else {
                   this.add(pk, item);
                 }
@@ -15326,7 +15366,16 @@ var DataSourceApiImpl = class {
     };
     this.getDataByNodePath = (nodePath) => {
       const { indexer } = this.getState();
-      return indexer.getDataForNodePath(nodePath) ?? null;
+      const data = indexer.getDataForNodePath(nodePath);
+      if (!data) {
+        console.warn(
+          `getDataByNodePath: no data found for nodePath: "${nodePath.join(
+            " / "
+          )}"`
+        );
+        return null;
+      }
+      return data;
     };
     /**
      * Replaces all data in the DataSource with the provided data.
@@ -22219,7 +22268,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.12"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.dev.mjs

@@ -13804,12 +13804,59 @@ var Indexer = class {
   constructor() {
     this.primaryKeyToData = /* @__PURE__ */ new Map();
     this.nodePathsToData = new DeepMap();
+    this.removeNodePath = (nodePath, options) => {
+      this.nodePathsToData.delete(nodePath);
+      this.remove(nodePath[nodePath.length - 1]);
+      if (!options) {
+        return;
+      }
+      const data = this.nodePathsToData.get(nodePath);
+      if (data) {
+        const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+          //@ts-ignore
+          data[options.nodesKey]
+        ) : null;
+        if (children && Array.isArray(children)) {
+          for (let i = 0, len = children.length; i < len; i++) {
+            const child = children[i];
+            const childPath = [...nodePath, options.toPrimaryKey(child)];
+            this.removeNodePath(childPath, options);
+          }
+        }
+      }
+    };
+    this.remove = (primaryKey) => {
+      this.primaryKeyToData.delete(primaryKey);
+    };
     this.add = (primaryKey, data) => {
       this.primaryKeyToData.set(primaryKey, data);
     };
-    this.addNodePath = (nodePath, data) => {
+    this.addNodePath = (nodePath, data, options) => {
+      if (false) {
+        if (this.nodePathsToData.has(nodePath)) {
+          console.warn(
+            `There is a problem! The node at path [${nodePath.join(
+              "/"
+            )}] is already in the indexer! You're doing too much work!`
+          );
+        }
+      }
       this.nodePathsToData.set(nodePath, data);
       this.add(nodePath[nodePath.length - 1], data);
+      if (!options) {
+        return;
+      }
+      const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+        //@ts-ignore
+        data[options.nodesKey]
+      ) : null;
+      if (children && Array.isArray(children)) {
+        for (let i = 0, len = children.length; i < len; i++) {
+          const child = children[i];
+          const childPath = [...nodePath, options.toPrimaryKey(child)];
+          this.addNodePath(childPath, child, options);
+        }
+      }
     };
     this.clear = () => {
       this.primaryKeyToData.clear();
@@ -13843,7 +13890,7 @@ var Indexer = class {
             if (info.type === "insert") {
               const insertPK = toPrimaryKey(info.data);
               if (isTree) {
-                this.addNodePath([insertPK], info.data);
+                this.addNodePath([insertPK], info.data, options);
               } else {
                 this.add(insertPK, info.data);
               }
@@ -13870,9 +13917,9 @@ var Indexer = class {
                   const info = cacheInfo[cacheIndex];
                   if (info.type === "delete" && !deleted) {
                     if (isTreeModeForNode) {
-                      this.nodePathsToData.delete(nodePath);
+                      this.removeNodePath(nodePath, options);
                     } else {
-                      this.primaryKeyToData.delete(pk);
+                      this.remove(pk);
                     }
                     deleted = true;
                     arr2.splice(i, 1);
@@ -13883,13 +13930,6 @@ var Indexer = class {
                     arr2[i] = item;
                   }
                   if (info.type === "insert") {
-                    const insertPK = toPrimaryKey(info.data);
-                    if (isTreeModeForNode) {
-                      const currentPath = [...parentPath, insertPK];
-                      this.addNodePath(currentPath, info.data);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13906,6 +13946,7 @@ var Indexer = class {
               }
               if (!deleted) {
                 if (isTreeModeForNode) {
+                  this.addNodePath(nodePath, item);
                   const isLeaf = isLeafNode(item);
                   let children = isLeaf ? null : getNodeChildren(item);
                   if (!isLeaf && Array.isArray(children)) {
@@ -13916,7 +13957,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item);
                 } else {
                   this.add(pk, item);
                 }
@@ -15275,7 +15315,16 @@ var DataSourceApiImpl = class {
     };
     this.getDataByNodePath = (nodePath) => {
       const { indexer } = this.getState();
-      return indexer.getDataForNodePath(nodePath) ?? null;
+      const data = indexer.getDataForNodePath(nodePath);
+      if (!data) {
+        console.warn(
+          `getDataByNodePath: no data found for nodePath: "${nodePath.join(
+            " / "
+          )}"`
+        );
+        return null;
+      }
+      return data;
     };
     /**
      * Replaces all data in the DataSource with the provided data.
@@ -22177,7 +22226,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.12"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.js

@@ -13855,12 +13855,59 @@ var Indexer = class {
   constructor() {
     this.primaryKeyToData = /* @__PURE__ */ new Map();
     this.nodePathsToData = new DeepMap();
+    this.removeNodePath = (nodePath, options) => {
+      this.nodePathsToData.delete(nodePath);
+      this.remove(nodePath[nodePath.length - 1]);
+      if (!options) {
+        return;
+      }
+      const data = this.nodePathsToData.get(nodePath);
+      if (data) {
+        const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+          //@ts-ignore
+          data[options.nodesKey]
+        ) : null;
+        if (children && Array.isArray(children)) {
+          for (let i = 0, len = children.length; i < len; i++) {
+            const child = children[i];
+            const childPath = [...nodePath, options.toPrimaryKey(child)];
+            this.removeNodePath(childPath, options);
+          }
+        }
+      }
+    };
+    this.remove = (primaryKey) => {
+      this.primaryKeyToData.delete(primaryKey);
+    };
     this.add = (primaryKey, data) => {
       this.primaryKeyToData.set(primaryKey, data);
     };
-    this.addNodePath = (nodePath, data) => {
+    this.addNodePath = (nodePath, data, options) => {
+      if (false) {
+        if (this.nodePathsToData.has(nodePath)) {
+          console.warn(
+            `There is a problem! The node at path [${nodePath.join(
+              "/"
+            )}] is already in the indexer! You're doing too much work!`
+          );
+        }
+      }
       this.nodePathsToData.set(nodePath, data);
       this.add(nodePath[nodePath.length - 1], data);
+      if (!options) {
+        return;
+      }
+      const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+        //@ts-ignore
+        data[options.nodesKey]
+      ) : null;
+      if (children && Array.isArray(children)) {
+        for (let i = 0, len = children.length; i < len; i++) {
+          const child = children[i];
+          const childPath = [...nodePath, options.toPrimaryKey(child)];
+          this.addNodePath(childPath, child, options);
+        }
+      }
     };
     this.clear = () => {
       this.primaryKeyToData.clear();
@@ -13894,7 +13941,7 @@ var Indexer = class {
             if (info.type === "insert") {
               const insertPK = toPrimaryKey(info.data);
               if (isTree) {
-                this.addNodePath([insertPK], info.data);
+                this.addNodePath([insertPK], info.data, options);
               } else {
                 this.add(insertPK, info.data);
               }
@@ -13921,9 +13968,9 @@ var Indexer = class {
                   const info = cacheInfo[cacheIndex];
                   if (info.type === "delete" && !deleted) {
                     if (isTreeModeForNode) {
-                      this.nodePathsToData.delete(nodePath);
+                      this.removeNodePath(nodePath, options);
                     } else {
-                      this.primaryKeyToData.delete(pk);
+                      this.remove(pk);
                     }
                     deleted = true;
                     arr2.splice(i, 1);
@@ -13934,13 +13981,6 @@ var Indexer = class {
                     arr2[i] = item;
                   }
                   if (info.type === "insert") {
-                    const insertPK = toPrimaryKey(info.data);
-                    if (isTreeModeForNode) {
-                      const currentPath = [...parentPath, insertPK];
-                      this.addNodePath(currentPath, info.data);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13957,6 +13997,7 @@ var Indexer = class {
               }
               if (!deleted) {
                 if (isTreeModeForNode) {
+                  this.addNodePath(nodePath, item);
                   const isLeaf = isLeafNode(item);
                   let children = isLeaf ? null : getNodeChildren(item);
                   if (!isLeaf && Array.isArray(children)) {
@@ -13967,7 +14008,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item);
                 } else {
                   this.add(pk, item);
                 }
@@ -15326,7 +15366,16 @@ var DataSourceApiImpl = class {
     };
     this.getDataByNodePath = (nodePath) => {
       const { indexer } = this.getState();
-      return indexer.getDataForNodePath(nodePath) ?? null;
+      const data = indexer.getDataForNodePath(nodePath);
+      if (!data) {
+        console.warn(
+          `getDataByNodePath: no data found for nodePath: "${nodePath.join(
+            " / "
+          )}"`
+        );
+        return null;
+      }
+      return data;
     };
     /**
      * Replaces all data in the DataSource with the provided data.
@@ -22219,7 +22268,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.12"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.mjs

@@ -13804,12 +13804,59 @@ var Indexer = class {
   constructor() {
     this.primaryKeyToData = /* @__PURE__ */ new Map();
     this.nodePathsToData = new DeepMap();
+    this.removeNodePath = (nodePath, options) => {
+      this.nodePathsToData.delete(nodePath);
+      this.remove(nodePath[nodePath.length - 1]);
+      if (!options) {
+        return;
+      }
+      const data = this.nodePathsToData.get(nodePath);
+      if (data) {
+        const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+          //@ts-ignore
+          data[options.nodesKey]
+        ) : null;
+        if (children && Array.isArray(children)) {
+          for (let i = 0, len = children.length; i < len; i++) {
+            const child = children[i];
+            const childPath = [...nodePath, options.toPrimaryKey(child)];
+            this.removeNodePath(childPath, options);
+          }
+        }
+      }
+    };
+    this.remove = (primaryKey) => {
+      this.primaryKeyToData.delete(primaryKey);
+    };
     this.add = (primaryKey, data) => {
       this.primaryKeyToData.set(primaryKey, data);
     };
-    this.addNodePath = (nodePath, data) => {
+    this.addNodePath = (nodePath, data, options) => {
+      if (false) {
+        if (this.nodePathsToData.has(nodePath)) {
+          console.warn(
+            `There is a problem! The node at path [${nodePath.join(
+              "/"
+            )}] is already in the indexer! You're doing too much work!`
+          );
+        }
+      }
       this.nodePathsToData.set(nodePath, data);
       this.add(nodePath[nodePath.length - 1], data);
+      if (!options) {
+        return;
+      }
+      const children = options.getNodeChildren ? options.getNodeChildren(data) : options.nodesKey ? (
+        //@ts-ignore
+        data[options.nodesKey]
+      ) : null;
+      if (children && Array.isArray(children)) {
+        for (let i = 0, len = children.length; i < len; i++) {
+          const child = children[i];
+          const childPath = [...nodePath, options.toPrimaryKey(child)];
+          this.addNodePath(childPath, child, options);
+        }
+      }
     };
     this.clear = () => {
       this.primaryKeyToData.clear();
@@ -13843,7 +13890,7 @@ var Indexer = class {
             if (info.type === "insert") {
               const insertPK = toPrimaryKey(info.data);
               if (isTree) {
-                this.addNodePath([insertPK], info.data);
+                this.addNodePath([insertPK], info.data, options);
               } else {
                 this.add(insertPK, info.data);
               }
@@ -13870,9 +13917,9 @@ var Indexer = class {
                   const info = cacheInfo[cacheIndex];
                   if (info.type === "delete" && !deleted) {
                     if (isTreeModeForNode) {
-                      this.nodePathsToData.delete(nodePath);
+                      this.removeNodePath(nodePath, options);
                     } else {
-                      this.primaryKeyToData.delete(pk);
+                      this.remove(pk);
                     }
                     deleted = true;
                     arr2.splice(i, 1);
@@ -13883,13 +13930,6 @@ var Indexer = class {
                     arr2[i] = item;
                   }
                   if (info.type === "insert") {
-                    const insertPK = toPrimaryKey(info.data);
-                    if (isTreeModeForNode) {
-                      const currentPath = [...parentPath, insertPK];
-                      this.addNodePath(currentPath, info.data);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13906,6 +13946,7 @@ var Indexer = class {
               }
               if (!deleted) {
                 if (isTreeModeForNode) {
+                  this.addNodePath(nodePath, item);
                   const isLeaf = isLeafNode(item);
                   let children = isLeaf ? null : getNodeChildren(item);
                   if (!isLeaf && Array.isArray(children)) {
@@ -13916,7 +13957,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item);
                 } else {
                   this.add(pk, item);
                 }
@@ -15275,7 +15315,16 @@ var DataSourceApiImpl = class {
     };
     this.getDataByNodePath = (nodePath) => {
       const { indexer } = this.getState();
-      return indexer.getDataForNodePath(nodePath) ?? null;
+      const data = indexer.getDataForNodePath(nodePath);
+      if (!data) {
+        console.warn(
+          `getDataByNodePath: no data found for nodePath: "${nodePath.join(
+            " / "
+          )}"`
+        );
+        return null;
+      }
+      return data;
     };
     /**
      * Replaces all data in the DataSource with the provided data.
@@ -22177,7 +22226,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.12"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/package.json

@@ -25,7 +25,7 @@
   "bugs": {
     "url": "https://github.com/infinite-table/infinite-react/issues"
   },
-  "version": "6.0.12",
+  "version": "6.0.14",
   "main": "index.js",
   "module": "index.mjs",
   "typings": "index.d.ts",
@@ -34,5 +34,5 @@
   },
   "license": "Commercial & Open Source",
   "//": "will be updated at build time",
-  "publishedAt": 1731321598951
+  "publishedAt": 1731510719445
 }