@infinite-table/infinite-react 6.0.4 → 6.0.5

package/index.d.ts

@@ -89,6 +89,7 @@ declare class DeepMap<KeyType, ValueType> {
     fill(initial?: [KeyType[], ValueType][]): void;
     getValuesStartingWith(keys: KeyType[], excludeSelf?: boolean, depthLimit?: number): ValueType[];
     getEntriesStartingWith(keys: KeyType[], excludeSelf?: boolean, depthLimit?: number): [KeyType[], ValueType][];
+    getUnnestedKeysStartingWith(keys: KeyType[], excludeSelf?: boolean, depthLimit?: number): KeyType[][];
     getKeysStartingWith(keys: KeyType[], excludeSelf?: boolean, depthLimit?: number): KeyType[][];
     private getStartingWith;
     private getMapAt;

package/index.dev.js

@@ -215,7 +215,7 @@ var DeepMap = class {
           depthLimit !== void 0 ? depthLimit - 1 : void 0
         ) : void 0;
         if (pair.hasOwnProperty("value")) {
-          fn(pair.value, keys, i, next);
+          fn(pair.value, keys, i, next, pair);
           i++;
         } else {
           next?.();
@@ -269,6 +269,57 @@ var DeepMap = class {
     );
     return result;
   }
+  getUnnestedKeysStartingWith(keys, excludeSelf, depthLimit) {
+    const pairs = [];
+    const fn = (pair2) => {
+      pairs.push(pair2);
+    };
+    let currentMap = this.map;
+    let pair;
+    let stop = false;
+    if (keys.length) {
+      for (let i = 0, len = keys.length; i < len; i++) {
+        const key = keys[i];
+        pair = currentMap.get(key);
+        if (!pair || !pair.map) {
+          stop = true;
+          if (i === len - 1) {
+            stop = true;
+            break;
+          } else {
+            return [];
+          }
+        }
+        currentMap = pair.map;
+      }
+    } else {
+      if (!excludeSelf) {
+        const hasEmptyKey = currentMap.has(this.emptyKey);
+        if (hasEmptyKey) {
+          return [[]];
+        }
+      }
+    }
+    if (pair && pair.value !== void 0) {
+      if (!excludeSelf) {
+        fn({ ...pair, keys });
+        stop = true;
+      }
+    }
+    if (stop) {
+      return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+    }
+    this.visitWithNext(
+      keys,
+      (_value, keys2, _i, _next, pair2) => {
+        fn({ ...pair2, keys: keys2 });
+      },
+      currentMap,
+      depthLimit,
+      excludeSelf
+    );
+    return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+  }
   getKeysStartingWith(keys, excludeSelf, depthLimit) {
     const result = [];
     this.getStartingWith(
@@ -14618,7 +14669,7 @@ var TreeSelectionState = class {
     const leafCount = this.getLeafNodesCount(nodePath);
     let currentSelectionState = this.isSelfSelected(nodePath);
     const { selectionMap } = this;
-    const childPaths = selectionMap.getKeysStartingWith(nodePath, true).sort(shortestToLongest);
+    const childPaths = selectionMap.getUnnestedKeysStartingWith(nodePath, true).sort(shortestToLongest);
     if (!childPaths.length) {
       if (currentSelectionState !== null) {
         const res2 = leafCount ? currentSelectionState : (
@@ -22069,7 +22120,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.4"
+      version: "6.0.5"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.dev.mjs

@@ -145,7 +145,7 @@ var DeepMap = class {
           depthLimit !== void 0 ? depthLimit - 1 : void 0
         ) : void 0;
         if (pair.hasOwnProperty("value")) {
-          fn(pair.value, keys, i, next);
+          fn(pair.value, keys, i, next, pair);
           i++;
         } else {
           next?.();
@@ -199,6 +199,57 @@ var DeepMap = class {
     );
     return result;
   }
+  getUnnestedKeysStartingWith(keys, excludeSelf, depthLimit) {
+    const pairs = [];
+    const fn = (pair2) => {
+      pairs.push(pair2);
+    };
+    let currentMap = this.map;
+    let pair;
+    let stop = false;
+    if (keys.length) {
+      for (let i = 0, len = keys.length; i < len; i++) {
+        const key = keys[i];
+        pair = currentMap.get(key);
+        if (!pair || !pair.map) {
+          stop = true;
+          if (i === len - 1) {
+            stop = true;
+            break;
+          } else {
+            return [];
+          }
+        }
+        currentMap = pair.map;
+      }
+    } else {
+      if (!excludeSelf) {
+        const hasEmptyKey = currentMap.has(this.emptyKey);
+        if (hasEmptyKey) {
+          return [[]];
+        }
+      }
+    }
+    if (pair && pair.value !== void 0) {
+      if (!excludeSelf) {
+        fn({ ...pair, keys });
+        stop = true;
+      }
+    }
+    if (stop) {
+      return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+    }
+    this.visitWithNext(
+      keys,
+      (_value, keys2, _i, _next, pair2) => {
+        fn({ ...pair2, keys: keys2 });
+      },
+      currentMap,
+      depthLimit,
+      excludeSelf
+    );
+    return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+  }
   getKeysStartingWith(keys, excludeSelf, depthLimit) {
     const result = [];
     this.getStartingWith(
@@ -14567,7 +14618,7 @@ var TreeSelectionState = class {
     const leafCount = this.getLeafNodesCount(nodePath);
     let currentSelectionState = this.isSelfSelected(nodePath);
     const { selectionMap } = this;
-    const childPaths = selectionMap.getKeysStartingWith(nodePath, true).sort(shortestToLongest);
+    const childPaths = selectionMap.getUnnestedKeysStartingWith(nodePath, true).sort(shortestToLongest);
     if (!childPaths.length) {
       if (currentSelectionState !== null) {
         const res2 = leafCount ? currentSelectionState : (
@@ -22027,7 +22078,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.4"
+      version: "6.0.5"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.js

@@ -215,7 +215,7 @@ var DeepMap = class {
           depthLimit !== void 0 ? depthLimit - 1 : void 0
         ) : void 0;
         if (pair.hasOwnProperty("value")) {
-          fn(pair.value, keys, i, next);
+          fn(pair.value, keys, i, next, pair);
           i++;
         } else {
           next?.();
@@ -269,6 +269,57 @@ var DeepMap = class {
     );
     return result;
   }
+  getUnnestedKeysStartingWith(keys, excludeSelf, depthLimit) {
+    const pairs = [];
+    const fn = (pair2) => {
+      pairs.push(pair2);
+    };
+    let currentMap = this.map;
+    let pair;
+    let stop = false;
+    if (keys.length) {
+      for (let i = 0, len = keys.length; i < len; i++) {
+        const key = keys[i];
+        pair = currentMap.get(key);
+        if (!pair || !pair.map) {
+          stop = true;
+          if (i === len - 1) {
+            stop = true;
+            break;
+          } else {
+            return [];
+          }
+        }
+        currentMap = pair.map;
+      }
+    } else {
+      if (!excludeSelf) {
+        const hasEmptyKey = currentMap.has(this.emptyKey);
+        if (hasEmptyKey) {
+          return [[]];
+        }
+      }
+    }
+    if (pair && pair.value !== void 0) {
+      if (!excludeSelf) {
+        fn({ ...pair, keys });
+        stop = true;
+      }
+    }
+    if (stop) {
+      return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+    }
+    this.visitWithNext(
+      keys,
+      (_value, keys2, _i, _next, pair2) => {
+        fn({ ...pair2, keys: keys2 });
+      },
+      currentMap,
+      depthLimit,
+      excludeSelf
+    );
+    return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+  }
   getKeysStartingWith(keys, excludeSelf, depthLimit) {
     const result = [];
     this.getStartingWith(
@@ -14618,7 +14669,7 @@ var TreeSelectionState = class {
     const leafCount = this.getLeafNodesCount(nodePath);
     let currentSelectionState = this.isSelfSelected(nodePath);
     const { selectionMap } = this;
-    const childPaths = selectionMap.getKeysStartingWith(nodePath, true).sort(shortestToLongest);
+    const childPaths = selectionMap.getUnnestedKeysStartingWith(nodePath, true).sort(shortestToLongest);
     if (!childPaths.length) {
       if (currentSelectionState !== null) {
         const res2 = leafCount ? currentSelectionState : (
@@ -22069,7 +22120,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.4"
+      version: "6.0.5"
     });
     if (!licenseKey && !valid2 && isInsidePlayground) {
       return true;

package/index.mjs

@@ -145,7 +145,7 @@ var DeepMap = class {
           depthLimit !== void 0 ? depthLimit - 1 : void 0
         ) : void 0;
         if (pair.hasOwnProperty("value")) {
-          fn(pair.value, keys, i, next);
+          fn(pair.value, keys, i, next, pair);
           i++;
         } else {
           next?.();
@@ -199,6 +199,57 @@ var DeepMap = class {
     );
     return result;
   }
+  getUnnestedKeysStartingWith(keys, excludeSelf, depthLimit) {
+    const pairs = [];
+    const fn = (pair2) => {
+      pairs.push(pair2);
+    };
+    let currentMap = this.map;
+    let pair;
+    let stop = false;
+    if (keys.length) {
+      for (let i = 0, len = keys.length; i < len; i++) {
+        const key = keys[i];
+        pair = currentMap.get(key);
+        if (!pair || !pair.map) {
+          stop = true;
+          if (i === len - 1) {
+            stop = true;
+            break;
+          } else {
+            return [];
+          }
+        }
+        currentMap = pair.map;
+      }
+    } else {
+      if (!excludeSelf) {
+        const hasEmptyKey = currentMap.has(this.emptyKey);
+        if (hasEmptyKey) {
+          return [[]];
+        }
+      }
+    }
+    if (pair && pair.value !== void 0) {
+      if (!excludeSelf) {
+        fn({ ...pair, keys });
+        stop = true;
+      }
+    }
+    if (stop) {
+      return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+    }
+    this.visitWithNext(
+      keys,
+      (_value, keys2, _i, _next, pair2) => {
+        fn({ ...pair2, keys: keys2 });
+      },
+      currentMap,
+      depthLimit,
+      excludeSelf
+    );
+    return pairs.sort(SORT_ASC_REVISION).map((pair2) => pair2.keys);
+  }
   getKeysStartingWith(keys, excludeSelf, depthLimit) {
     const result = [];
     this.getStartingWith(
@@ -14567,7 +14618,7 @@ var TreeSelectionState = class {
     const leafCount = this.getLeafNodesCount(nodePath);
     let currentSelectionState = this.isSelfSelected(nodePath);
     const { selectionMap } = this;
-    const childPaths = selectionMap.getKeysStartingWith(nodePath, true).sort(shortestToLongest);
+    const childPaths = selectionMap.getUnnestedKeysStartingWith(nodePath, true).sort(shortestToLongest);
     if (!childPaths.length) {
       if (currentSelectionState !== null) {
         const res2 = leafCount ? currentSelectionState : (
@@ -22027,7 +22078,7 @@ var useLicense = (licenseKey = "") => {
     }
     let valid2 = isValidLicense(licenseKey, {
       publishedAt: 1624970570587,
-      version: "6.0.4"
+      version: "6.0.5"
     });
     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.4",
+  "version": "6.0.5",
   "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": 1730132637668
+  "publishedAt": 1730204782243
 }