k-vtable 1.0.3 → 1.0.5

package/cjs/data/DataSource.js

@@ -108,14 +108,17 @@ class DataSource extends EventTarget_1.EventTarget {
         this.rowHierarchyType = rowHierarchyType, this.updatePagerData();
     }
     initTreeHierarchyState() {
-        var _a, _b;
+        var _a, _b, _c;
         this._sourceLength = (null === (_a = this._source) || void 0 === _a ? void 0 : _a.length) || 0, 
+        this._sourceLength = (null === (_b = this._source) || void 0 === _b ? void 0 : _b.length) || 0, 
         this.currentIndexedData = Array.from({
             length: this._sourceLength
         }, ((_, i) => i));
         let nodeLength = this._sourceLength;
         for (let i = 0; i < nodeLength; i++) {
-            const indexKey = this.currentIndexedData[i], nodeData = this.getOriginalRecord(indexKey), children = null !== (_b = nodeData.filteredChildren) && void 0 !== _b ? _b : nodeData.children;
+            const indexKey = this.currentIndexedData[i], nodeData = this.getOriginalRecord(indexKey);
+            if (!nodeData) continue;
+            const children = null !== (_c = nodeData.filteredChildren) && void 0 !== _c ? _c : nodeData.children;
             if ((null == children ? void 0 : children.length) > 0) {
                 if (this.hierarchyExpandLevel > 1 ? !nodeData.hierarchyState && (nodeData.hierarchyState = ts_types_1.HierarchyState.expand) : !nodeData.hierarchyState && (nodeData.hierarchyState = ts_types_1.HierarchyState.collapse), 
                 this.hasHierarchyStateExpand = !0, nodeData.hierarchyState === ts_types_1.HierarchyState.collapse) continue;
@@ -558,8 +561,8 @@ class DataSource extends EventTarget_1.EventTarget {
         this._sourceLength = (null === (_c = this._source) || void 0 === _c ? void 0 : _c.length) || 0, 
         this.sortedIndexMap.clear(), this.currentIndexedData = Array.from({
             length: this._sourceLength
-        }, ((_, i) => i)), this.userPagination || (this.pagination.perPageCount = this._sourceLength, 
-        this.pagination.totalCount = this._sourceLength);
+        }, ((_, i) => i)), "tree" === this.rowHierarchyType && this.initTreeHierarchyState(), 
+        this.userPagination || (this.pagination.perPageCount = this._sourceLength, this.pagination.totalCount = this._sourceLength);
     }
     updateFilterRules(filterRules) {
         var _a, _b, _c;
@@ -679,8 +682,11 @@ class DataSource extends EventTarget_1.EventTarget {
                 }
                 if (sourceI = sourceIndexs.splice(sourceIndexs.length - 1, 1)[0], targetI = targetIndexs.splice(targetIndexs.length - 1, 1)[0], 
                 sourceIndexs.length >= 1) {
-                    const parent = this.getOriginalRecord(sourceIndexs), sourceIds = parent.filteredChildren ? parent.filteredChildren.splice(sourceI, 1) : parent.children.splice(sourceI, 1);
-                    sourceIds.unshift(targetI, 0), Array.prototype.splice.apply(null !== (_c = parent.filteredChildren) && void 0 !== _c ? _c : parent.children, sourceIds);
+                    const parent = this.getOriginalRecord(sourceIndexs);
+                    if (parent) {
+                        const sourceIds = parent.filteredChildren ? parent.filteredChildren.splice(sourceI, 1) : parent.children.splice(sourceI, 1);
+                        sourceIds.unshift(targetI, 0), Array.prototype.splice.apply(null !== (_c = parent.filteredChildren) && void 0 !== _c ? _c : parent.children, sourceIds);
+                    }
                 } else {
                     const sourceIds = this.records.splice(sourceI, 1);
                     sourceIds.unshift(targetI, 0), Array.prototype.splice.apply(this.records, sourceIds);
@@ -701,6 +707,7 @@ class DataSource extends EventTarget_1.EventTarget {
         if (this.hierarchyExpandLevel) {
             for (let i = 0; i < this._sourceLength; i++) {
                 const nodeData = this.getOriginalRecord(i);
+                if (!nodeData) continue;
                 (null !== (_a = nodeData.filteredChildren) && void 0 !== _a ? _a : nodeData.children) && !nodeData.hierarchyState && (nodeData.hierarchyState = ts_types_1.HierarchyState.collapse);
             }
             this.currentIndexedData = Array.from({
@@ -708,7 +715,9 @@ class DataSource extends EventTarget_1.EventTarget {
             }, ((_, i) => i));
             let nodeLength = this._sourceLength;
             for (let i = 0; i < nodeLength; i++) {
-                const indexKey = this.currentIndexedData[i], nodeData = this.getOriginalRecord(indexKey), children = null !== (_b = nodeData.filteredChildren) && void 0 !== _b ? _b : nodeData.children;
+                const indexKey = this.currentIndexedData[i], nodeData = this.getOriginalRecord(indexKey);
+                if (!nodeData) continue;
+                const children = null !== (_b = nodeData.filteredChildren) && void 0 !== _b ? _b : nodeData.children;
                 if ((null == children ? void 0 : children.length) > 0 && nodeData.hierarchyState === ts_types_1.HierarchyState.expand) {
                     this.hasHierarchyStateExpand = !0;
                     const childrenLength = this.restoreChildrenNodeHierarchy(indexKey, nodeData);
@@ -729,6 +738,26 @@ class DataSource extends EventTarget_1.EventTarget {
         }
         return childTotalLength;
     }
+    _setNodeStateRecursive(node, targetState) {
+        var _a;
+        if (!node) return;
+        const children = null !== (_a = node.filteredChildren) && void 0 !== _a ? _a : node.children;
+        if (children && (Array.isArray(children) ? children.length > 0 : !0 === children) && (node.hierarchyState = targetState), 
+        children && Array.isArray(children)) for (const child of children) this._setNodeStateRecursive(child, targetState);
+    }
+    expandAllNodes() {
+        if (Array.isArray(this._source)) {
+            for (const rootNode of this._source) this._setNodeStateRecursive(rootNode, ts_types_1.HierarchyState.expand);
+            this.hasHierarchyStateExpand = !0, this.clearSortedIndexMap(), this.restoreTreeHierarchyState(), 
+            this.lastSortStates && this.lastSortStates.length > 0 ? this.sort(this.lastSortStates) : this.updatePagerData();
+        }
+    }
+    collapseAllNodes() {
+        if (Array.isArray(this._source)) {
+            for (const rootNode of this._source) this._setNodeStateRecursive(rootNode, ts_types_1.HierarchyState.collapse);
+            this.clearSortedIndexMap(), this.restoreTreeHierarchyState(), this.lastSortStates && this.lastSortStates.length > 0 ? this.sort(this.lastSortStates) : this.updatePagerData();
+        }
+    }
 }
 
 function getValueFromDeepArray(array, index) {