react-core-ts 2.1.24 → 2.1.25

package/dist/utilities/convertFlatArraytoTreeStructure.js

@@ -14,25 +14,22 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.buildTree = void 0;
 function buildTree(data, idField, parentField) {
     var nodeMap = new Map();
-    // Initialize all nodes
     data.forEach(function (node) {
-        node.children = [];
-        nodeMap.set(node[idField], node);
+        nodeMap.set(node[idField], __assign(__assign({}, node), { checked: false, children: [] }));
     });
-    // Build the tree structure
     var tree = [];
     data.forEach(function (node) {
-        if (node[parentField]) {
-            // Find the parent and add the node as a child
-            var parent_1 = nodeMap.get(node[parentField]);
-            if (parent_1) {
-                parent_1.children.push(__assign(__assign({}, node), { checked: false }));
+        var currentNode = nodeMap.get(node[idField]);
+        var parentId = node[parentField];
+        var hasParent = parentId !== null && parentId !== undefined && parentId !== '';
+        if (hasParent) {
+            var parentNode = nodeMap.get(parentId);
+            if (parentNode) {
+                parentNode.children.push(currentNode);
+                return;
             }
         }
-        else {
-            // No parentId means it's a root node
-            tree.push(__assign(__assign({}, node), { checked: false }));
-        }
+        tree.push(currentNode);
     });
     return tree;
 }

package/dist/utilities/convertFlatArraytoTreeStructure.js.map

@@ -1 +1 @@
-{"version":3,"file":"convertFlatArraytoTreeStructure.js","sourceRoot":"","sources":["../../src/utilities/convertFlatArraytoTreeStructure.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA,SAAgB,SAAS,CAAC,IAAW,EAAE,OAAe,EAAE,WAAmB;IACzE,IAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAE1B,uBAAuB;IACvB,IAAI,CAAC,OAAO,CAAC,UAAC,IAAI;QAChB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,2BAA2B;IAC3B,IAAM,IAAI,GAAU,EAAE,CAAC;IAEvB,IAAI,CAAC,OAAO,CAAC,UAAC,IAAI;QAChB,IAAI,IAAI,CAAC,WAAW,CAAC,EAAE;YACrB,8CAA8C;YAC9C,IAAM,QAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAC9C,IAAI,QAAM,EAAE;gBACV,QAAM,CAAC,QAAQ,CAAC,IAAI,uBAAM,IAAI,KAAE,OAAO,EAAE,KAAK,IAAG,CAAC;aACnD;SACF;aAAM;YACL,qCAAqC;YACrC,IAAI,CAAC,IAAI,uBAAM,IAAI,KAAE,OAAO,EAAE,KAAK,IAAG,CAAC;SACxC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACd,CAAC;AA1BD,8BA0BC"}
+{"version":3,"file":"convertFlatArraytoTreeStructure.js","sourceRoot":"","sources":["../../src/utilities/convertFlatArraytoTreeStructure.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA,SAAgB,SAAS,CAAC,IAAW,EAAE,OAAe,EAAE,WAAmB;IACzE,IAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;IAE1B,IAAI,CAAC,OAAO,CAAC,UAAC,IAAI;QAChB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,wBACpB,IAAI,KACP,OAAO,EAAE,KAAK,EACd,QAAQ,EAAE,EAAE,IACZ,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAM,IAAI,GAAU,EAAE,CAAC;IAEvB,IAAI,CAAC,OAAO,CAAC,UAAC,IAAI;QAChB,IAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC/C,IAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QACnC,IAAM,SAAS,GAAG,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,EAAE,CAAC;QAEjF,IAAI,SAAS,EAAE;YACb,IAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAEzC,IAAI,UAAU,EAAE;gBACd,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACtC,OAAO;aACR;SACF;QAED,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACd,CAAC;AA/BD,8BA+BC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "react-core-ts",
-  "version": "2.1.24",
+  "version": "2.1.25",
   "description": "React Components",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",

package/src/utilities/convertFlatArraytoTreeStructure.ts

@@ -1,26 +1,31 @@
 export function buildTree(data: any[], idField: string, parentField: string) {
   const nodeMap = new Map();
 
-  // Initialize all nodes
   data.forEach((node) => {
-    node.children = [];
-    nodeMap.set(node[idField], node);
+    nodeMap.set(node[idField], {
+      ...node,
+      checked: false,
+      children: [],
+    });
   });
 
-  // Build the tree structure
   const tree: any[] = [];
 
   data.forEach((node) => {
-    if (node[parentField]) {
-      // Find the parent and add the node as a child
-      const parent = nodeMap.get(node[parentField]);
-      if (parent) {
-        parent.children.push({ ...node, checked: false });
+    const currentNode = nodeMap.get(node[idField]);
+    const parentId = node[parentField];
+    const hasParent = parentId !== null && parentId !== undefined && parentId !== '';
+
+    if (hasParent) {
+      const parentNode = nodeMap.get(parentId);
+
+      if (parentNode) {
+        parentNode.children.push(currentNode);
+        return;
       }
-    } else {
-      // No parentId means it's a root node
-      tree.push({ ...node, checked: false });
     }
+
+    tree.push(currentNode);
   });
 
   return tree;