@infinite-table/infinite-react 6.0.13 → 6.0.14

package/index.d.ts

@@ -2310,6 +2310,8 @@ declare type IndexerOptions<DataType, PrimaryKeyType> = {
 declare class Indexer<DataType, PrimaryKeyType = string> {
     primaryKeyToData: Map<PrimaryKeyType, DataType>;
     nodePathsToData: DeepMap<PrimaryKeyType, DataType>;
+    private removeNodePath;
+    private remove;
     private add;
     private addNodePath;
     clear: () => void;

package/index.dev.js

@@ -13855,12 +13855,48 @@ 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, 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]
@@ -13932,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);
@@ -13945,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, options);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13968,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)) {
@@ -13978,7 +14008,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item, options);
                 } else {
                   this.add(pk, item);
                 }
@@ -15410,7 +15439,6 @@ var DataSourceApiImpl = class {
       }
       const nodesKey = this.getState().nodesKey;
       const dataChildren = data[nodesKey];
-      debugger;
       const children = typeof childrenOrFn === "function" ? childrenOrFn(dataChildren, data) : childrenOrFn;
       return this.updateDataByNodePath(
         {
@@ -22240,7 +22268,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.13"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.dev.mjs

@@ -13804,12 +13804,48 @@ 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, 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]
@@ -13881,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);
@@ -13894,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, options);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13917,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)) {
@@ -13927,7 +13957,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item, options);
                 } else {
                   this.add(pk, item);
                 }
@@ -15359,7 +15388,6 @@ var DataSourceApiImpl = class {
       }
       const nodesKey = this.getState().nodesKey;
       const dataChildren = data[nodesKey];
-      debugger;
       const children = typeof childrenOrFn === "function" ? childrenOrFn(dataChildren, data) : childrenOrFn;
       return this.updateDataByNodePath(
         {
@@ -22198,7 +22226,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.13"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.js

@@ -13855,12 +13855,48 @@ 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, 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]
@@ -13932,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);
@@ -13945,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, options);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13968,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)) {
@@ -13978,7 +14008,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item, options);
                 } else {
                   this.add(pk, item);
                 }
@@ -15410,7 +15439,6 @@ var DataSourceApiImpl = class {
       }
       const nodesKey = this.getState().nodesKey;
       const dataChildren = data[nodesKey];
-      debugger;
       const children = typeof childrenOrFn === "function" ? childrenOrFn(dataChildren, data) : childrenOrFn;
       return this.updateDataByNodePath(
         {
@@ -22240,7 +22268,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.13"
+      version: "6.0.14"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.mjs

@@ -13804,12 +13804,48 @@ 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, 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]
@@ -13881,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);
@@ -13894,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, options);
-                    } else {
-                      this.add(insertPK, info.data);
-                    }
                     if (info.position === "before") {
                       arr2.splice(i, 0, info.data);
                       i--;
@@ -13917,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)) {
@@ -13927,7 +13957,6 @@ var Indexer = class {
                     indexArray(children, parentPath);
                     parentPath.pop();
                   }
-                  this.addNodePath(nodePath, item, options);
                 } else {
                   this.add(pk, item);
                 }
@@ -15359,7 +15388,6 @@ var DataSourceApiImpl = class {
       }
       const nodesKey = this.getState().nodesKey;
       const dataChildren = data[nodesKey];
-      debugger;
       const children = typeof childrenOrFn === "function" ? childrenOrFn(dataChildren, data) : childrenOrFn;
       return this.updateDataByNodePath(
         {
@@ -22198,7 +22226,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.13"
+      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.13",
+  "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": 1731357157760
+  "publishedAt": 1731510719445
 }