react-native-tree-multi-select 1.7.0-beta.1 → 1.7.0

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

@@ -14,18 +14,53 @@ 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];
+    /* istanbul ignore next */
+    if (node) {
+      // Ensure node is not undefined - redundant safety
+      stack.push({
+        node,
+        level: 0
+      });
+    }
+  }
+  while (stack.length > 0) {
+    const item = stack.pop();
+    /* istanbul ignore next */
+    if (!item) continue; // Redundant 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];
+        /* istanbul ignore next */
+        if (childNode) {
+          // Ensure childNode is not undefined - redundant safety
+          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;IACA,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;IACA,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;QACA,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/commonjs/helpers/treeNode.helper.js

@@ -21,9 +21,7 @@ function initializeNodeMaps(storeId, initialData) {
     updateChildToParentMap
   } = treeViewStore.getState();
   const tempNodeMap = new Map();
-  ;
   const tempChildToParentMap = new Map();
-  ;
 
   /**
    * Recursively processes nodes, adding them to the nodeMap and childToParentMap.

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

@@ -1 +1 @@
-{"version":3,"names":["_treeView","require","initializeNodeMaps","storeId","initialData","treeViewStore","getTreeViewStore","updateNodeMap","updateChildToParentMap","getState","tempNodeMap","Map","tempChildToParentMap","processNodes","nodes","parentId","forEach","node","set","id","children"],"sourceRoot":"../../../src","sources":["helpers/treeNode.helper.ts"],"mappings":";;;;;;AACA,IAAAA,SAAA,GAAAC,OAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,kBAAkBA,CAACC,OAAe,EAAEC,WAAuB,EAAE;EACzE,MAAMC,aAAa,GAAG,IAAAC,0BAAgB,EAACH,OAAO,CAAC;EAC/C,MAAM;IACFI,aAAa;IACbC;EACJ,CAAC,GAAGH,aAAa,CAACI,QAAQ,CAAC,CAAC;EAE5B,MAAMC,WAAkC,GAAG,IAAIC,GAAG,CAAC,CAAC;EAAC;EACrD,MAAMC,oBAAyC,GAAG,IAAID,GAAG,CAAC,CAAC;EAAC;;EAE5D;AACJ;AACA;AACA;AACA;AACA;EACI,MAAME,YAAY,GAAGA,CACjBC,KAAiB,EACjBC,QAAuB,GAAG,IAAI,KAC7B;IACDD,KAAK,CAACE,OAAO,CAAEC,IAAI,IAAK;MACpB;MACAP,WAAW,CAACQ,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEF,IAAI,CAAC;MAC9B;MACA,IAAIF,QAAQ,EAAEH,oBAAoB,CAACM,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEJ,QAAQ,CAAC;MACzD;MACA,IAAIE,IAAI,CAACG,QAAQ,EAAEP,YAAY,CAACI,IAAI,CAACG,QAAQ,EAAEH,IAAI,CAACE,EAAE,CAAC;IAC3D,CAAC,CAAC;EACN,CAAC;;EAED;EACAN,YAAY,CAACT,WAAW,CAAC;EAEzBG,aAAa,CAACG,WAAW,CAAC;EAC1BF,sBAAsB,CAACI,oBAAoB,CAAC;AAChD","ignoreList":[]}
+{"version":3,"names":["_treeView","require","initializeNodeMaps","storeId","initialData","treeViewStore","getTreeViewStore","updateNodeMap","updateChildToParentMap","getState","tempNodeMap","Map","tempChildToParentMap","processNodes","nodes","parentId","forEach","node","set","id","children"],"sourceRoot":"../../../src","sources":["helpers/treeNode.helper.ts"],"mappings":";;;;;;AACA,IAAAA,SAAA,GAAAC,OAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,kBAAkBA,CAACC,OAAe,EAAEC,WAAuB,EAAE;EACzE,MAAMC,aAAa,GAAG,IAAAC,0BAAgB,EAACH,OAAO,CAAC;EAC/C,MAAM;IACFI,aAAa;IACbC;EACJ,CAAC,GAAGH,aAAa,CAACI,QAAQ,CAAC,CAAC;EAE5B,MAAMC,WAAkC,GAAG,IAAIC,GAAG,CAAC,CAAC;EACpD,MAAMC,oBAAyC,GAAG,IAAID,GAAG,CAAC,CAAC;;EAE3D;AACJ;AACA;AACA;AACA;AACA;EACI,MAAME,YAAY,GAAGA,CACjBC,KAAiB,EACjBC,QAAuB,GAAG,IAAI,KAC7B;IACDD,KAAK,CAACE,OAAO,CAAEC,IAAI,IAAK;MACpB;MACAP,WAAW,CAACQ,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEF,IAAI,CAAC;MAC9B;MACA,IAAIF,QAAQ,EAAEH,oBAAoB,CAACM,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEJ,QAAQ,CAAC;MACzD;MACA,IAAIE,IAAI,CAACG,QAAQ,EAAEP,YAAY,CAACI,IAAI,CAACG,QAAQ,EAAEH,IAAI,CAACE,EAAE,CAAC;IAC3D,CAAC,CAAC;EACN,CAAC;;EAED;EACAN,YAAY,CAACT,WAAW,CAAC;EAEzBG,aAAa,CAACG,WAAW,CAAC;EAC1BF,sBAAsB,CAACI,oBAAoB,CAAC;AAChD","ignoreList":[]}

package/lib/commonjs/utils/useDeepCompareEffect.js

@@ -4,30 +4,37 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = useDeepCompareEffect;
-var _react = _interopRequireWildcard(require("react"));
+var _react = _interopRequireDefault(require("react"));
 var _isEqual = _interopRequireDefault(require("lodash/isEqual"));
 function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
-function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
-function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 /**
  * Deep compare effect hook.
  * Ensures the effect runs on the first render and whenever dependencies deeply change.
  *
  * @param effect The effect callback function.
- * @param dependencies The dependencies array to compare deeply.
+ * @param deps The dependencies array to compare deeply.
  */
-function useDeepCompareEffect(effect, dependencies) {
-  const previousDependenciesRef = (0, _react.useRef)();
-  const isFirstRender = (0, _react.useRef)(true);
-  const hasChanged = isFirstRender.current || !(0, _isEqual.default)(previousDependenciesRef.current, dependencies);
+function useDeepCompareEffect(effect, deps) {
+  // Ref to track if it's the first render
+  const firstRenderRef = _react.default.useRef(true);
+
+  // Memoized dependencies to avoid redundant `isEqual` checks
+  const memoizedDependencies = _react.default.useMemo(() => deps, [deps]);
+
+  // Ref to store the previous dependencies
+  const dependenciesRef = _react.default.useRef(memoizedDependencies);
+
+  // Check for dependency changes
+  const dependenciesChanged = !(0, _isEqual.default)(dependenciesRef.current, memoizedDependencies);
+  if (dependenciesChanged) {
+    dependenciesRef.current = memoizedDependencies;
+  }
   _react.default.useEffect(() => {
-    if (hasChanged) {
-      isFirstRender.current = false; // Mark that the first render has passed
-      previousDependenciesRef.current = dependencies; // Update dependencies reference
-      return effect();
+    if (firstRenderRef.current) {
+      firstRenderRef.current = false;
     }
+    return effect();
     // eslint-disable-next-line react-hooks/exhaustive-deps
-  }, [hasChanged]); // Depend only on the change detection flag
+  }, [dependenciesChanged]); // exclude the effect function from the dependencies
 }
-;
 //# sourceMappingURL=useDeepCompareEffect.js.map

package/lib/commonjs/utils/useDeepCompareEffect.js.map

@@ -1 +1 @@
-{"version":3,"names":["_react","_interopRequireWildcard","require","_isEqual","_interopRequireDefault","e","__esModule","default","_getRequireWildcardCache","WeakMap","r","t","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","hasOwnProperty","call","i","set","useDeepCompareEffect","effect","dependencies","previousDependenciesRef","useRef","isFirstRender","hasChanged","current","isEqual","React","useEffect"],"sourceRoot":"../../../src","sources":["utils/useDeepCompareEffect.ts"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,uBAAA,CAAAC,OAAA;AACA,IAAAC,QAAA,GAAAC,sBAAA,CAAAF,OAAA;AAAqC,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAAA,SAAAG,yBAAAH,CAAA,6BAAAI,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAD,wBAAA,YAAAA,CAAAH,CAAA,WAAAA,CAAA,GAAAM,CAAA,GAAAD,CAAA,KAAAL,CAAA;AAAA,SAAAJ,wBAAAI,CAAA,EAAAK,CAAA,SAAAA,CAAA,IAAAL,CAAA,IAAAA,CAAA,CAAAC,UAAA,SAAAD,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAE,OAAA,EAAAF,CAAA,QAAAM,CAAA,GAAAH,wBAAA,CAAAE,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAC,GAAA,CAAAP,CAAA,UAAAM,CAAA,CAAAE,GAAA,CAAAR,CAAA,OAAAS,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAf,CAAA,oBAAAe,CAAA,OAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAe,CAAA,SAAAG,CAAA,GAAAP,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAd,CAAA,EAAAe,CAAA,UAAAG,CAAA,KAAAA,CAAA,CAAAV,GAAA,IAAAU,CAAA,CAAAC,GAAA,IAAAP,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAG,CAAA,IAAAT,CAAA,CAAAM,CAAA,IAAAf,CAAA,CAAAe,CAAA,YAAAN,CAAA,CAAAP,OAAA,GAAAF,CAAA,EAAAM,CAAA,IAAAA,CAAA,CAAAa,GAAA,CAAAnB,CAAA,EAAAS,CAAA,GAAAA,CAAA;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASW,oBAAoBA,CAC1CC,MAA4B,EAC5BC,YAAmB,EACnB;EACA,MAAMC,uBAAuB,GAAG,IAAAC,aAAM,EAAQ,CAAC;EAC/C,MAAMC,aAAa,GAAG,IAAAD,aAAM,EAAC,IAAI,CAAC;EAElC,MAAME,UAAU,GACdD,aAAa,CAACE,OAAO,IAAI,CAAC,IAAAC,gBAAO,EAACL,uBAAuB,CAACI,OAAO,EAAEL,YAAY,CAAC;EAElFO,cAAK,CAACC,SAAS,CAAC,MAAM;IACpB,IAAIJ,UAAU,EAAE;MACdD,aAAa,CAACE,OAAO,GAAG,KAAK,CAAC,CAAC;MAC/BJ,uBAAuB,CAACI,OAAO,GAAGL,YAAY,CAAC,CAAC;MAChD,OAAOD,MAAM,CAAC,CAAC;IACjB;IACA;EACF,CAAC,EAAE,CAACK,UAAU,CAAC,CAAC,CAAC,CAAC;AACpB;AAAC","ignoreList":[]}
+{"version":3,"names":["_react","_interopRequireDefault","require","_isEqual","e","__esModule","default","useDeepCompareEffect","effect","deps","firstRenderRef","React","useRef","memoizedDependencies","useMemo","dependenciesRef","dependenciesChanged","isEqual","current","useEffect"],"sourceRoot":"../../../src","sources":["utils/useDeepCompareEffect.ts"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,QAAA,GAAAF,sBAAA,CAAAC,OAAA;AAAqC,SAAAD,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASG,oBAAoBA,CAC1CC,MAA4B,EAC5BC,IAA0B,EAC1B;EACA;EACA,MAAMC,cAAc,GAAGC,cAAK,CAACC,MAAM,CAAU,IAAI,CAAC;;EAElD;EACA,MAAMC,oBAAoB,GAAGF,cAAK,CAACG,OAAO,CAAC,MAAML,IAAI,EAAE,CAACA,IAAI,CAAC,CAAC;;EAE9D;EACA,MAAMM,eAAe,GAAGJ,cAAK,CAACC,MAAM,CAAuBC,oBAAoB,CAAC;;EAEhF;EACA,MAAMG,mBAAmB,GAAG,CAAC,IAAAC,gBAAO,EAACF,eAAe,CAACG,OAAO,EAAEL,oBAAoB,CAAC;EACnF,IAAIG,mBAAmB,EAAE;IACvBD,eAAe,CAACG,OAAO,GAAGL,oBAAoB;EAChD;EAEAF,cAAK,CAACQ,SAAS,CAAC,MAAM;IACpB,IAAIT,cAAc,CAACQ,OAAO,EAAE;MAC1BR,cAAc,CAACQ,OAAO,GAAG,KAAK;IAChC;IAEA,OAAOV,MAAM,CAAC,CAAC;IACf;EACF,CAAC,EAAE,CAACQ,mBAAmB,CAAC,CAAC,CAAC,CAAC;AAC7B","ignoreList":[]}

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

@@ -10,18 +10,53 @@
  * @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];
+    /* istanbul ignore next */
+    if (node) {
+      // Ensure node is not undefined - redundant safety
+      stack.push({
+        node,
+        level: 0
+      });
+    }
+  }
+  while (stack.length > 0) {
+    const item = stack.pop();
+    /* istanbul ignore next */
+    if (!item) continue; // Redundant 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];
+        /* istanbul ignore next */
+        if (childNode) {
+          // Ensure childNode is not undefined - redundant safety
+          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;IACA,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;IACA,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;QACA,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/treeNode.helper.js

@@ -18,9 +18,7 @@ export function initializeNodeMaps(storeId, initialData) {
     updateChildToParentMap
   } = treeViewStore.getState();
   const tempNodeMap = new Map();
-  ;
   const tempChildToParentMap = new Map();
-  ;
 
   /**
    * Recursively processes nodes, adding them to the nodeMap and childToParentMap.

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

@@ -1 +1 @@
-{"version":3,"names":["getTreeViewStore","initializeNodeMaps","storeId","initialData","treeViewStore","updateNodeMap","updateChildToParentMap","getState","tempNodeMap","Map","tempChildToParentMap","processNodes","nodes","parentId","forEach","node","set","id","children"],"sourceRoot":"../../../src","sources":["helpers/treeNode.helper.ts"],"mappings":";;AACA,SACIA,gBAAgB,QACb,yBAAyB;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,kBAAkBA,CAACC,OAAe,EAAEC,WAAuB,EAAE;EACzE,MAAMC,aAAa,GAAGJ,gBAAgB,CAACE,OAAO,CAAC;EAC/C,MAAM;IACFG,aAAa;IACbC;EACJ,CAAC,GAAGF,aAAa,CAACG,QAAQ,CAAC,CAAC;EAE5B,MAAMC,WAAkC,GAAG,IAAIC,GAAG,CAAC,CAAC;EAAC;EACrD,MAAMC,oBAAyC,GAAG,IAAID,GAAG,CAAC,CAAC;EAAC;;EAE5D;AACJ;AACA;AACA;AACA;AACA;EACI,MAAME,YAAY,GAAGA,CACjBC,KAAiB,EACjBC,QAAuB,GAAG,IAAI,KAC7B;IACDD,KAAK,CAACE,OAAO,CAAEC,IAAI,IAAK;MACpB;MACAP,WAAW,CAACQ,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEF,IAAI,CAAC;MAC9B;MACA,IAAIF,QAAQ,EAAEH,oBAAoB,CAACM,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEJ,QAAQ,CAAC;MACzD;MACA,IAAIE,IAAI,CAACG,QAAQ,EAAEP,YAAY,CAACI,IAAI,CAACG,QAAQ,EAAEH,IAAI,CAACE,EAAE,CAAC;IAC3D,CAAC,CAAC;EACN,CAAC;;EAED;EACAN,YAAY,CAACR,WAAW,CAAC;EAEzBE,aAAa,CAACG,WAAW,CAAC;EAC1BF,sBAAsB,CAACI,oBAAoB,CAAC;AAChD","ignoreList":[]}
+{"version":3,"names":["getTreeViewStore","initializeNodeMaps","storeId","initialData","treeViewStore","updateNodeMap","updateChildToParentMap","getState","tempNodeMap","Map","tempChildToParentMap","processNodes","nodes","parentId","forEach","node","set","id","children"],"sourceRoot":"../../../src","sources":["helpers/treeNode.helper.ts"],"mappings":";;AACA,SACIA,gBAAgB,QACb,yBAAyB;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,kBAAkBA,CAACC,OAAe,EAAEC,WAAuB,EAAE;EACzE,MAAMC,aAAa,GAAGJ,gBAAgB,CAACE,OAAO,CAAC;EAC/C,MAAM;IACFG,aAAa;IACbC;EACJ,CAAC,GAAGF,aAAa,CAACG,QAAQ,CAAC,CAAC;EAE5B,MAAMC,WAAkC,GAAG,IAAIC,GAAG,CAAC,CAAC;EACpD,MAAMC,oBAAyC,GAAG,IAAID,GAAG,CAAC,CAAC;;EAE3D;AACJ;AACA;AACA;AACA;AACA;EACI,MAAME,YAAY,GAAGA,CACjBC,KAAiB,EACjBC,QAAuB,GAAG,IAAI,KAC7B;IACDD,KAAK,CAACE,OAAO,CAAEC,IAAI,IAAK;MACpB;MACAP,WAAW,CAACQ,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEF,IAAI,CAAC;MAC9B;MACA,IAAIF,QAAQ,EAAEH,oBAAoB,CAACM,GAAG,CAACD,IAAI,CAACE,EAAE,EAAEJ,QAAQ,CAAC;MACzD;MACA,IAAIE,IAAI,CAACG,QAAQ,EAAEP,YAAY,CAACI,IAAI,CAACG,QAAQ,EAAEH,IAAI,CAACE,EAAE,CAAC;IAC3D,CAAC,CAAC;EACN,CAAC;;EAED;EACAN,YAAY,CAACR,WAAW,CAAC;EAEzBE,aAAa,CAACG,WAAW,CAAC;EAC1BF,sBAAsB,CAACI,oBAAoB,CAAC;AAChD","ignoreList":[]}

package/lib/module/utils/useDeepCompareEffect.js

@@ -1,6 +1,6 @@
 "use strict";
 
-import React, { useRef } from "react";
+import React from "react";
 import isEqual from "lodash/isEqual";
 
 /**
@@ -8,20 +8,29 @@ import isEqual from "lodash/isEqual";
  * Ensures the effect runs on the first render and whenever dependencies deeply change.
  *
  * @param effect The effect callback function.
- * @param dependencies The dependencies array to compare deeply.
+ * @param deps The dependencies array to compare deeply.
  */
-export default function useDeepCompareEffect(effect, dependencies) {
-  const previousDependenciesRef = useRef();
-  const isFirstRender = useRef(true);
-  const hasChanged = isFirstRender.current || !isEqual(previousDependenciesRef.current, dependencies);
+export default function useDeepCompareEffect(effect, deps) {
+  // Ref to track if it's the first render
+  const firstRenderRef = React.useRef(true);
+
+  // Memoized dependencies to avoid redundant `isEqual` checks
+  const memoizedDependencies = React.useMemo(() => deps, [deps]);
+
+  // Ref to store the previous dependencies
+  const dependenciesRef = React.useRef(memoizedDependencies);
+
+  // Check for dependency changes
+  const dependenciesChanged = !isEqual(dependenciesRef.current, memoizedDependencies);
+  if (dependenciesChanged) {
+    dependenciesRef.current = memoizedDependencies;
+  }
   React.useEffect(() => {
-    if (hasChanged) {
-      isFirstRender.current = false; // Mark that the first render has passed
-      previousDependenciesRef.current = dependencies; // Update dependencies reference
-      return effect();
+    if (firstRenderRef.current) {
+      firstRenderRef.current = false;
     }
+    return effect();
     // eslint-disable-next-line react-hooks/exhaustive-deps
-  }, [hasChanged]); // Depend only on the change detection flag
+  }, [dependenciesChanged]); // exclude the effect function from the dependencies
 }
-;
 //# sourceMappingURL=useDeepCompareEffect.js.map

package/lib/module/utils/useDeepCompareEffect.js.map

@@ -1 +1 @@
-{"version":3,"names":["React","useRef","isEqual","useDeepCompareEffect","effect","dependencies","previousDependenciesRef","isFirstRender","hasChanged","current","useEffect"],"sourceRoot":"../../../src","sources":["utils/useDeepCompareEffect.ts"],"mappings":";;AAAA,OAAOA,KAAK,IAAIC,MAAM,QAAQ,OAAO;AACrC,OAAOC,OAAO,MAAM,gBAAgB;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,oBAAoBA,CAC1CC,MAA4B,EAC5BC,YAAmB,EACnB;EACA,MAAMC,uBAAuB,GAAGL,MAAM,CAAQ,CAAC;EAC/C,MAAMM,aAAa,GAAGN,MAAM,CAAC,IAAI,CAAC;EAElC,MAAMO,UAAU,GACdD,aAAa,CAACE,OAAO,IAAI,CAACP,OAAO,CAACI,uBAAuB,CAACG,OAAO,EAAEJ,YAAY,CAAC;EAElFL,KAAK,CAACU,SAAS,CAAC,MAAM;IACpB,IAAIF,UAAU,EAAE;MACdD,aAAa,CAACE,OAAO,GAAG,KAAK,CAAC,CAAC;MAC/BH,uBAAuB,CAACG,OAAO,GAAGJ,YAAY,CAAC,CAAC;MAChD,OAAOD,MAAM,CAAC,CAAC;IACjB;IACA;EACF,CAAC,EAAE,CAACI,UAAU,CAAC,CAAC,CAAC,CAAC;AACpB;AAAC","ignoreList":[]}
+{"version":3,"names":["React","isEqual","useDeepCompareEffect","effect","deps","firstRenderRef","useRef","memoizedDependencies","useMemo","dependenciesRef","dependenciesChanged","current","useEffect"],"sourceRoot":"../../../src","sources":["utils/useDeepCompareEffect.ts"],"mappings":";;AAAA,OAAOA,KAAK,MAAM,OAAO;AACzB,OAAOC,OAAO,MAAM,gBAAgB;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,oBAAoBA,CAC1CC,MAA4B,EAC5BC,IAA0B,EAC1B;EACA;EACA,MAAMC,cAAc,GAAGL,KAAK,CAACM,MAAM,CAAU,IAAI,CAAC;;EAElD;EACA,MAAMC,oBAAoB,GAAGP,KAAK,CAACQ,OAAO,CAAC,MAAMJ,IAAI,EAAE,CAACA,IAAI,CAAC,CAAC;;EAE9D;EACA,MAAMK,eAAe,GAAGT,KAAK,CAACM,MAAM,CAAuBC,oBAAoB,CAAC;;EAEhF;EACA,MAAMG,mBAAmB,GAAG,CAACT,OAAO,CAACQ,eAAe,CAACE,OAAO,EAAEJ,oBAAoB,CAAC;EACnF,IAAIG,mBAAmB,EAAE;IACvBD,eAAe,CAACE,OAAO,GAAGJ,oBAAoB;EAChD;EAEAP,KAAK,CAACY,SAAS,CAAC,MAAM;IACpB,IAAIP,cAAc,CAACM,OAAO,EAAE;MAC1BN,cAAc,CAACM,OAAO,GAAG,KAAK;IAChC;IAEA,OAAOR,MAAM,CAAC,CAAC;IACf;EACF,CAAC,EAAE,CAACO,mBAAmB,CAAC,CAAC,CAAC,CAAC;AAC7B","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,CAoCzB"}

package/lib/typescript/utils/useDeepCompareEffect.d.ts

@@ -4,7 +4,7 @@ import React from "react";
  * Ensures the effect runs on the first render and whenever dependencies deeply change.
  *
  * @param effect The effect callback function.
- * @param dependencies The dependencies array to compare deeply.
+ * @param deps The dependencies array to compare deeply.
  */
-export default function useDeepCompareEffect(effect: React.EffectCallback, dependencies: any[]): void;
+export default function useDeepCompareEffect(effect: React.EffectCallback, deps: React.DependencyList): void;
 //# sourceMappingURL=useDeepCompareEffect.d.ts.map

package/lib/typescript/utils/useDeepCompareEffect.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"useDeepCompareEffect.d.ts","sourceRoot":"","sources":["../../../src/utils/useDeepCompareEffect.ts"],"names":[],"mappings":"AAAA,OAAO,KAAiB,MAAM,OAAO,CAAC;AAGtC;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,oBAAoB,CAC1C,MAAM,EAAE,KAAK,CAAC,cAAc,EAC5B,YAAY,EAAE,GAAG,EAAE,QAgBpB"}
+{"version":3,"file":"useDeepCompareEffect.d.ts","sourceRoot":"","sources":["../../../src/utils/useDeepCompareEffect.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AAG1B;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,oBAAoB,CAC1C,MAAM,EAAE,KAAK,CAAC,cAAc,EAC5B,IAAI,EAAE,KAAK,CAAC,cAAc,QAyB3B"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "react-native-tree-multi-select",
-  "version": "1.7.0-beta.1",
+  "version": "1.7.0",
   "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",
@@ -129,7 +129,7 @@
     "react-native-vector-icons": "*"
   },
   "engines": {
-    "node": ">= 16.0.0"
+    "node": ">= 18.0.0"
   },
   "packageManager": "yarn@1.22.22",
   "jest": {

package/src/helpers/flattenTree.helper.ts

@@ -13,17 +13,40 @@ 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];
+        /* istanbul ignore next */
+        if (node) { // Ensure node is not undefined - redundant safety
+            stack.push({ node, level: 0 });
+        }
+    }
+
+    while (stack.length > 0) {
+        const item = stack.pop();
+        /* istanbul ignore next */
+        if (!item) continue; // Redundant 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];
+                /* istanbul ignore next */
+                if (childNode) { // Ensure childNode is not undefined - redundant safety
+                    stack.push({ node: childNode, level: level + 1 });
+                }
+            }
         }
     }
+
     return flattened;
-};
+}

package/src/helpers/treeNode.helper.ts

@@ -19,8 +19,8 @@ export function initializeNodeMaps(storeId: string, initialData: TreeNode[]) {
         updateChildToParentMap
     } = treeViewStore.getState();
 
-    const tempNodeMap: Map<string, TreeNode> = new Map();;
-    const tempChildToParentMap: Map<string, string> = new Map();;
+    const tempNodeMap: Map<string, TreeNode> = new Map();
+    const tempChildToParentMap: Map<string, string> = new Map();
 
     /**
      * Recursively processes nodes, adding them to the nodeMap and childToParentMap.

package/src/utils/useDeepCompareEffect.ts

@@ -1,4 +1,4 @@
-import React, { useRef } from "react";
+import React from "react";
 import isEqual from "lodash/isEqual";
 
 /**
@@ -6,24 +6,33 @@ import isEqual from "lodash/isEqual";
  * Ensures the effect runs on the first render and whenever dependencies deeply change.
  *
  * @param effect The effect callback function.
- * @param dependencies The dependencies array to compare deeply.
+ * @param deps The dependencies array to compare deeply.
  */
 export default function useDeepCompareEffect(
   effect: React.EffectCallback,
-  dependencies: any[]
+  deps: React.DependencyList
 ) {
-  const previousDependenciesRef = useRef<any[]>();
-  const isFirstRender = useRef(true);
+  // Ref to track if it's the first render
+  const firstRenderRef = React.useRef<boolean>(true);
 
-  const hasChanged =
-    isFirstRender.current || !isEqual(previousDependenciesRef.current, dependencies);
+  // Memoized dependencies to avoid redundant `isEqual` checks
+  const memoizedDependencies = React.useMemo(() => deps, [deps]);
+
+  // Ref to store the previous dependencies
+  const dependenciesRef = React.useRef<React.DependencyList>(memoizedDependencies);
+
+  // Check for dependency changes
+  const dependenciesChanged = !isEqual(dependenciesRef.current, memoizedDependencies);
+  if (dependenciesChanged) {
+    dependenciesRef.current = memoizedDependencies;
+  }
 
   React.useEffect(() => {
-    if (hasChanged) {
-      isFirstRender.current = false; // Mark that the first render has passed
-      previousDependenciesRef.current = dependencies; // Update dependencies reference
-      return effect();
+    if (firstRenderRef.current) {
+      firstRenderRef.current = false;
     }
+
+    return effect();
     // eslint-disable-next-line react-hooks/exhaustive-deps
-  }, [hasChanged]); // Depend only on the change detection flag
-};
+  }, [dependenciesChanged]); // exclude the effect function from the dependencies
+}