react-native-tree-multi-select 1.6.0 → 1.6.1

package/lib/commonjs/helpers/flattenTree.helper.js

@@ -14,18 +14,50 @@ exports.getFlattenedTreeData = getFlattenedTreeData;
  * @param __level__ - (optional) for internal recursive use only
  * @returns Flattened tree data with expanded ids only
  */
-function getFlattenedTreeData(nodes, expandedIds, __level__ = 0) {
-  let flattened = [];
-  for (let node of nodes) {
+function getFlattenedTreeData(nodes, expandedIds) {
+  const flattened = [];
+  const stack = [];
+
+  // Initialize stack with the root nodes and level 0
+  for (let i = nodes.length - 1; i >= 0; i--) {
+    const node = nodes[i];
+    if (node) {
+      // Ensure node is not undefined
+      stack.push({
+        node,
+        level: 0
+      });
+    }
+  }
+  while (stack.length > 0) {
+    const item = stack.pop();
+    if (!item) continue; // Safety check
+
+    const {
+      node,
+      level
+    } = item;
+
+    // Push current node into the flattened array
     flattened.push({
       ...node,
-      level: __level__
+      level
     });
+
+    // Add children nodes to the stack if the node is expanded
     if (node.children && expandedIds.has(node.id)) {
-      flattened = [...flattened, ...getFlattenedTreeData(node.children, expandedIds, __level__ + 1)];
+      for (let i = node.children.length - 1; i >= 0; i--) {
+        const childNode = node.children[i];
+        if (childNode) {
+          // Ensure childNode is not undefined
+          stack.push({
+            node: childNode,
+            level: level + 1
+          });
+        }
+      }
     }
   }
   return flattened;
 }
-;
 //# sourceMappingURL=flattenTree.helper.js.map

package/lib/commonjs/helpers/flattenTree.helper.js.map

@@ -1 +1 @@
-{"version":3,"names":["getFlattenedTreeData","nodes","expandedIds","__level__","flattened","node","push","level","children","has","id"],"sourceRoot":"../../../src","sources":["helpers/flattenTree.helper.ts"],"mappings":";;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,oBAAoBA,CAChCC,KAAiB,EACjBC,WAAwB,EACxBC,SAAiB,GAAG,CAAC,EACE;EACvB,IAAIC,SAAkC,GAAG,EAAE;EAC3C,KAAK,IAAIC,IAAI,IAAIJ,KAAK,EAAE;IACpBG,SAAS,CAACE,IAAI,CAAC;MAAE,GAAGD,IAAI;MAAEE,KAAK,EAAEJ;IAAU,CAAC,CAAC;IAC7C,IAAIE,IAAI,CAACG,QAAQ,IAAIN,WAAW,CAACO,GAAG,CAACJ,IAAI,CAACK,EAAE,CAAC,EAAE;MAC3CN,SAAS,GAAG,CACR,GAAGA,SAAS,EACZ,GAAGJ,oBAAoB,CAACK,IAAI,CAACG,QAAQ,EAAEN,WAAW,EAAEC,SAAS,GAAG,CAAC,CAAC,CACrE;IACL;EACJ;EACA,OAAOC,SAAS;AACpB;AAAC","ignoreList":[]}
+{"version":3,"names":["getFlattenedTreeData","nodes","expandedIds","flattened","stack","i","length","node","push","level","item","pop","children","has","id","childNode"],"sourceRoot":"../../../src","sources":["helpers/flattenTree.helper.ts"],"mappings":";;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,oBAAoBA,CAChCC,KAAiB,EACjBC,WAAwB,EACD;EACvB,MAAMC,SAAkC,GAAG,EAAE;EAC7C,MAAMC,KAA2C,GAAG,EAAE;;EAEtD;EACA,KAAK,IAAIC,CAAC,GAAGJ,KAAK,CAACK,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;IACxC,MAAME,IAAI,GAAGN,KAAK,CAACI,CAAC,CAAC;IACrB,IAAIE,IAAI,EAAE;MAAE;MACRH,KAAK,CAACI,IAAI,CAAC;QAAED,IAAI;QAAEE,KAAK,EAAE;MAAE,CAAC,CAAC;IAClC;EACJ;EAEA,OAAOL,KAAK,CAACE,MAAM,GAAG,CAAC,EAAE;IACrB,MAAMI,IAAI,GAAGN,KAAK,CAACO,GAAG,CAAC,CAAC;IACxB,IAAI,CAACD,IAAI,EAAE,SAAS,CAAC;;IAErB,MAAM;MAAEH,IAAI;MAAEE;IAAM,CAAC,GAAGC,IAAI;;IAE5B;IACAP,SAAS,CAACK,IAAI,CAAC;MAAE,GAAGD,IAAI;MAAEE;IAAM,CAAC,CAAC;;IAElC;IACA,IAAIF,IAAI,CAACK,QAAQ,IAAIV,WAAW,CAACW,GAAG,CAACN,IAAI,CAACO,EAAE,CAAC,EAAE;MAC3C,KAAK,IAAIT,CAAC,GAAGE,IAAI,CAACK,QAAQ,CAACN,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;QAChD,MAAMU,SAAS,GAAGR,IAAI,CAACK,QAAQ,CAACP,CAAC,CAAC;QAClC,IAAIU,SAAS,EAAE;UAAE;UACbX,KAAK,CAACI,IAAI,CAAC;YAAED,IAAI,EAAEQ,SAAS;YAAEN,KAAK,EAAEA,KAAK,GAAG;UAAE,CAAC,CAAC;QACrD;MACJ;IACJ;EACJ;EAEA,OAAON,SAAS;AACpB","ignoreList":[]}

package/lib/module/helpers/flattenTree.helper.js

@@ -10,18 +10,50 @@
  * @param __level__ - (optional) for internal recursive use only
  * @returns Flattened tree data with expanded ids only
  */
-export function getFlattenedTreeData(nodes, expandedIds, __level__ = 0) {
-  let flattened = [];
-  for (let node of nodes) {
+export function getFlattenedTreeData(nodes, expandedIds) {
+  const flattened = [];
+  const stack = [];
+
+  // Initialize stack with the root nodes and level 0
+  for (let i = nodes.length - 1; i >= 0; i--) {
+    const node = nodes[i];
+    if (node) {
+      // Ensure node is not undefined
+      stack.push({
+        node,
+        level: 0
+      });
+    }
+  }
+  while (stack.length > 0) {
+    const item = stack.pop();
+    if (!item) continue; // Safety check
+
+    const {
+      node,
+      level
+    } = item;
+
+    // Push current node into the flattened array
     flattened.push({
       ...node,
-      level: __level__
+      level
     });
+
+    // Add children nodes to the stack if the node is expanded
     if (node.children && expandedIds.has(node.id)) {
-      flattened = [...flattened, ...getFlattenedTreeData(node.children, expandedIds, __level__ + 1)];
+      for (let i = node.children.length - 1; i >= 0; i--) {
+        const childNode = node.children[i];
+        if (childNode) {
+          // Ensure childNode is not undefined
+          stack.push({
+            node: childNode,
+            level: level + 1
+          });
+        }
+      }
     }
   }
   return flattened;
 }
-;
 //# sourceMappingURL=flattenTree.helper.js.map

package/lib/module/helpers/flattenTree.helper.js.map

@@ -1 +1 @@
-{"version":3,"names":["getFlattenedTreeData","nodes","expandedIds","__level__","flattened","node","push","level","children","has","id"],"sourceRoot":"../../../src","sources":["helpers/flattenTree.helper.ts"],"mappings":";;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,oBAAoBA,CAChCC,KAAiB,EACjBC,WAAwB,EACxBC,SAAiB,GAAG,CAAC,EACE;EACvB,IAAIC,SAAkC,GAAG,EAAE;EAC3C,KAAK,IAAIC,IAAI,IAAIJ,KAAK,EAAE;IACpBG,SAAS,CAACE,IAAI,CAAC;MAAE,GAAGD,IAAI;MAAEE,KAAK,EAAEJ;IAAU,CAAC,CAAC;IAC7C,IAAIE,IAAI,CAACG,QAAQ,IAAIN,WAAW,CAACO,GAAG,CAACJ,IAAI,CAACK,EAAE,CAAC,EAAE;MAC3CN,SAAS,GAAG,CACR,GAAGA,SAAS,EACZ,GAAGJ,oBAAoB,CAACK,IAAI,CAACG,QAAQ,EAAEN,WAAW,EAAEC,SAAS,GAAG,CAAC,CAAC,CACrE;IACL;EACJ;EACA,OAAOC,SAAS;AACpB;AAAC","ignoreList":[]}
+{"version":3,"names":["getFlattenedTreeData","nodes","expandedIds","flattened","stack","i","length","node","push","level","item","pop","children","has","id","childNode"],"sourceRoot":"../../../src","sources":["helpers/flattenTree.helper.ts"],"mappings":";;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,oBAAoBA,CAChCC,KAAiB,EACjBC,WAAwB,EACD;EACvB,MAAMC,SAAkC,GAAG,EAAE;EAC7C,MAAMC,KAA2C,GAAG,EAAE;;EAEtD;EACA,KAAK,IAAIC,CAAC,GAAGJ,KAAK,CAACK,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;IACxC,MAAME,IAAI,GAAGN,KAAK,CAACI,CAAC,CAAC;IACrB,IAAIE,IAAI,EAAE;MAAE;MACRH,KAAK,CAACI,IAAI,CAAC;QAAED,IAAI;QAAEE,KAAK,EAAE;MAAE,CAAC,CAAC;IAClC;EACJ;EAEA,OAAOL,KAAK,CAACE,MAAM,GAAG,CAAC,EAAE;IACrB,MAAMI,IAAI,GAAGN,KAAK,CAACO,GAAG,CAAC,CAAC;IACxB,IAAI,CAACD,IAAI,EAAE,SAAS,CAAC;;IAErB,MAAM;MAAEH,IAAI;MAAEE;IAAM,CAAC,GAAGC,IAAI;;IAE5B;IACAP,SAAS,CAACK,IAAI,CAAC;MAAE,GAAGD,IAAI;MAAEE;IAAM,CAAC,CAAC;;IAElC;IACA,IAAIF,IAAI,CAACK,QAAQ,IAAIV,WAAW,CAACW,GAAG,CAACN,IAAI,CAACO,EAAE,CAAC,EAAE;MAC3C,KAAK,IAAIT,CAAC,GAAGE,IAAI,CAACK,QAAQ,CAACN,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;QAChD,MAAMU,SAAS,GAAGR,IAAI,CAACK,QAAQ,CAACP,CAAC,CAAC;QAClC,IAAIU,SAAS,EAAE;UAAE;UACbX,KAAK,CAACI,IAAI,CAAC;YAAED,IAAI,EAAEQ,SAAS;YAAEN,KAAK,EAAEA,KAAK,GAAG;UAAE,CAAC,CAAC;QACrD;MACJ;IACJ;EACJ;EAEA,OAAON,SAAS;AACpB","ignoreList":[]}

package/lib/typescript/helpers/flattenTree.helper.d.ts

@@ -9,5 +9,5 @@ import { TreeNode, __FlattenedTreeNode__ } from "../types/treeView.types";
  * @param __level__ - (optional) for internal recursive use only
  * @returns Flattened tree data with expanded ids only
  */
-export declare function getFlattenedTreeData(nodes: TreeNode[], expandedIds: Set<string>, __level__?: number): __FlattenedTreeNode__[];
+export declare function getFlattenedTreeData(nodes: TreeNode[], expandedIds: Set<string>): __FlattenedTreeNode__[];
 //# sourceMappingURL=flattenTree.helper.d.ts.map

package/lib/typescript/helpers/flattenTree.helper.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"flattenTree.helper.d.ts","sourceRoot":"","sources":["../../../src/helpers/flattenTree.helper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAE1E;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,QAAQ,EAAE,EACjB,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EACxB,SAAS,GAAE,MAAU,GACtB,qBAAqB,EAAE,CAYzB"}
+{"version":3,"file":"flattenTree.helper.d.ts","sourceRoot":"","sources":["../../../src/helpers/flattenTree.helper.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAE1E;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAChC,KAAK,EAAE,QAAQ,EAAE,EACjB,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,GACzB,qBAAqB,EAAE,CAiCzB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "react-native-tree-multi-select",
-  "version": "1.6.0",
+  "version": "1.6.1",
   "description": "A super-fast, customizable tree view component for React Native with multi-selection, checkboxes, and search filtering capabilities.",
   "main": "lib/commonjs/index.js",
   "module": "lib/module/index.js",

package/src/helpers/flattenTree.helper.ts

@@ -13,17 +13,37 @@ import { TreeNode, __FlattenedTreeNode__ } from "../types/treeView.types";
 export function getFlattenedTreeData(
     nodes: TreeNode[],
     expandedIds: Set<string>,
-    __level__: number = 0,
 ): __FlattenedTreeNode__[] {
-    let flattened: __FlattenedTreeNode__[] = [];
-    for (let node of nodes) {
-        flattened.push({ ...node, level: __level__ });
+    const flattened: __FlattenedTreeNode__[] = [];
+    const stack: { node: TreeNode; level: number; }[] = [];
+
+    // Initialize stack with the root nodes and level 0
+    for (let i = nodes.length - 1; i >= 0; i--) {
+        const node = nodes[i];
+        if (node) { // Ensure node is not undefined
+            stack.push({ node, level: 0 });
+        }
+    }
+
+    while (stack.length > 0) {
+        const item = stack.pop();
+        if (!item) continue; // Safety check
+
+        const { node, level } = item;
+
+        // Push current node into the flattened array
+        flattened.push({ ...node, level });
+
+        // Add children nodes to the stack if the node is expanded
         if (node.children && expandedIds.has(node.id)) {
-            flattened = [
-                ...flattened,
-                ...getFlattenedTreeData(node.children, expandedIds, __level__ + 1)
-            ];
+            for (let i = node.children.length - 1; i >= 0; i--) {
+                const childNode = node.children[i];
+                if (childNode) { // Ensure childNode is not undefined
+                    stack.push({ node: childNode, level: level + 1 });
+                }
+            }
         }
     }
+
     return flattened;
-};
+}