react-native-tree-multi-select 1.9.4 → 2.0.0-beta.1

package/lib/commonjs/handlers/ScrollToNodeHandler.js

@@ -1,169 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.ScrollToNodeHandler = void 0;
-var _react = _interopRequireDefault(require("react"));
-var _expandCollapse = require("../helpers/expandCollapse.helper");
-var _treeView = require("../store/treeView.store");
-var _shallow = require("zustand/react/shallow");
-var _typedMemo = require("../utils/typedMemo");
-var _fastIsEqual = require("fast-is-equal");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
-/**
- * ScrollToNodeHandler Component
- *
- * This component provides an imperative handle to scroll to a specified node within a tree view.
- * The scrolling action is orchestrated via a two-step "milestone" mechanism that ensures the target
- * node is both expanded in the tree and that the rendered list reflects this expansion before the scroll
- * is performed.
- *
- * The two key milestones tracked by the `expandAndScrollToNodeQueue` state are:
- * 1. EXPANDED: Indicates that the expansion logic for the target node has been initiated.
- * 2. RENDERED: Indicates that the list has re-rendered with the expanded node included.
- *
- * When the `scrollToNodeID` method is called:
- * - The scroll parameters (target node ID, animation preferences, view offset/position) are stored in a ref.
- * - The target node's expansion is triggered via the `expandNodes` helper.
- * - The `expandAndScrollToNodeQueue` state is updated to mark that expansion has begun.
- *
- * As the component re-renders (e.g., after the node expansion changes the rendered list):
- * - A useEffect monitors changes to the list, and once it detects the expansion has occurred,
- *   it updates the queue to include the RENDERED milestone.
- *
- * A layout effect then waits for both conditions to be met:
- * - The target node is confirmed to be in the expanded set.
- * - The `expandAndScrollToNodeQueue` exactly matches the expected milestones ([EXPANDED, RENDERED]).
- *
- * Once both conditions are satisfied:
- * - The index of the target node is determined within the latest flattened node list.
- * - The flash list is scrolled to that index.
- * - The queued scroll parameters and milestone queue are reset.
- *
- * This design ensures that the scroll action is performed only after the target node is fully present
- * in the UI, thus preventing issues with attempting to scroll to an element that does not exist yet.
- */
-// Enum representing the two milestones needed before scrolling
-var ExpandQueueAction = /*#__PURE__*/function (ExpandQueueAction) {
-  ExpandQueueAction[ExpandQueueAction["EXPANDED"] = 0] = "EXPANDED";
-  ExpandQueueAction[ExpandQueueAction["RENDERED"] = 1] = "RENDERED";
-  return ExpandQueueAction;
-}(ExpandQueueAction || {});
-function _innerScrollToNodeHandler(props, ref) {
-  const {
-    storeId,
-    flashListRef,
-    flattenedFilteredNodes,
-    setInitialScrollIndex,
-    initialScrollNodeID
-  } = props;
-  const {
-    expanded,
-    childToParentMap
-  } = (0, _treeView.useTreeViewStore)(storeId)((0, _shallow.useShallow)(state => ({
-    expanded: state.expanded,
-    childToParentMap: state.childToParentMap
-  })));
-  _react.default.useImperativeHandle(ref, () => ({
-    scrollToNodeID: params => {
-      queuedScrollToNodeParams.current = params;
-      // Mark that expansion is initiated.
-      setExpandAndScrollToNodeQueue([ExpandQueueAction.EXPANDED]);
-      // Trigger expansion logic (this may update the store and subsequently re-render the list).
-      (0, _expandCollapse.expandNodes)(storeId, [queuedScrollToNodeParams.current.nodeId], !queuedScrollToNodeParams.current.expandScrolledNode);
-    }
-  }), [storeId]);
-
-  // Ref to store the scroll parameters for the queued action.
-  const queuedScrollToNodeParams = _react.default.useRef(null);
-
-  // State to track progression: first the expansion is triggered, then the list is rendered.
-  const [expandAndScrollToNodeQueue, setExpandAndScrollToNodeQueue] = _react.default.useState([]);
-  const latestFlattenedFilteredNodesRef = _react.default.useRef(flattenedFilteredNodes);
-
-  /* When the rendered node list changes, update the ref.
-  If an expansion was triggered, mark that the list is now rendered. */
-  _react.default.useEffect(() => {
-    setExpandAndScrollToNodeQueue(prevQueue => {
-      if (prevQueue.includes(ExpandQueueAction.EXPANDED)) {
-        latestFlattenedFilteredNodesRef.current = flattenedFilteredNodes;
-        return [ExpandQueueAction.EXPANDED, ExpandQueueAction.RENDERED];
-      } else {
-        return prevQueue;
-      }
-    });
-  }, [flattenedFilteredNodes]);
-
-  /* Once the target node is expanded and the list is updated (milestones reached),
-  perform the scroll using the latest node list. */
-  _react.default.useLayoutEffect(() => {
-    if (queuedScrollToNodeParams.current === null) return;
-    if (!(0, _fastIsEqual.fastIsEqual)(expandAndScrollToNodeQueue, [ExpandQueueAction.EXPANDED, ExpandQueueAction.RENDERED])) {
-      return;
-    }
-
-    // If node is set to not expand
-    if (!queuedScrollToNodeParams.current.expandScrolledNode) {
-      let parentId;
-      // Get the parent's id of the node to scroll to
-      if (childToParentMap.has(queuedScrollToNodeParams.current.nodeId)) {
-        parentId = childToParentMap.get(queuedScrollToNodeParams.current.nodeId);
-      }
-
-      // Ensure if the parent is expanded before proceeding to scroll to the node
-      if (parentId && !expanded.has(parentId)) return;
-    }
-    // If node is set to expand
-    else {
-      if (!expanded.has(queuedScrollToNodeParams.current.nodeId)) return;
-    }
-    const {
-      nodeId,
-      animated,
-      viewOffset,
-      viewPosition
-    } = queuedScrollToNodeParams.current;
-    function scrollToItem() {
-      const index = latestFlattenedFilteredNodesRef.current.findIndex(item => item.id === nodeId);
-      if (index !== -1 && flashListRef.current) {
-        // Scroll to the target index.
-        flashListRef.current.scrollToIndex({
-          index,
-          animated,
-          viewOffset,
-          viewPosition
-        });
-      } else {
-        if (__DEV__) {
-          console.info("Cannot find the item of the mentioned id to scroll in the rendered tree view list data!");
-        }
-      }
-
-      // Clear the queued parameters and reset the expansion/render queue.
-      queuedScrollToNodeParams.current = null;
-      setExpandAndScrollToNodeQueue([]);
-    }
-    scrollToItem();
-  }, [childToParentMap, expanded, flashListRef, expandAndScrollToNodeQueue]);
-
-  ////////////////////////////// Handle Initial Scroll /////////////////////////////
-  /* On first render, if an initial scroll target is provided, determine its index.
-  This is done only once. */
-  const initialScrollDone = _react.default.useRef(false);
-  _react.default.useLayoutEffect(() => {
-    if (initialScrollDone.current) return;
-    const index = flattenedFilteredNodes.findIndex(item => item.id === initialScrollNodeID);
-    setInitialScrollIndex(index);
-    if (index !== -1) {
-      initialScrollDone.current = true;
-    }
-    // eslint-disable-next-line react-hooks/exhaustive-deps
-  }, [flattenedFilteredNodes, initialScrollNodeID]);
-  /////////////////////////////////////////////////////////////////////////////////
-
-  return null;
-}
-const _ScrollToNodeHandler = /*#__PURE__*/_react.default.forwardRef(_innerScrollToNodeHandler);
-const ScrollToNodeHandler = exports.ScrollToNodeHandler = (0, _typedMemo.typedMemo)(_ScrollToNodeHandler);
-//# sourceMappingURL=ScrollToNodeHandler.js.map

package/lib/commonjs/handlers/ScrollToNodeHandler.js.map

@@ -1 +0,0 @@
-{"version":3,"names":["_react","_interopRequireDefault","require","_expandCollapse","_treeView","_shallow","_typedMemo","_fastIsEqual","e","__esModule","default","ExpandQueueAction","_innerScrollToNodeHandler","props","ref","storeId","flashListRef","flattenedFilteredNodes","setInitialScrollIndex","initialScrollNodeID","expanded","childToParentMap","useTreeViewStore","useShallow","state","React","useImperativeHandle","scrollToNodeID","params","queuedScrollToNodeParams","current","setExpandAndScrollToNodeQueue","EXPANDED","expandNodes","nodeId","expandScrolledNode","useRef","expandAndScrollToNodeQueue","useState","latestFlattenedFilteredNodesRef","useEffect","prevQueue","includes","RENDERED","useLayoutEffect","fastIsEqual","parentId","has","get","animated","viewOffset","viewPosition","scrollToItem","index","findIndex","item","id","scrollToIndex","__DEV__","console","info","initialScrollDone","_ScrollToNodeHandler","forwardRef","ScrollToNodeHandler","exports","typedMemo"],"sourceRoot":"../../../src","sources":["handlers/ScrollToNodeHandler.tsx"],"mappings":";;;;;;AAkCA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,eAAA,GAAAD,OAAA;AACA,IAAAE,SAAA,GAAAF,OAAA;AACA,IAAAG,QAAA,GAAAH,OAAA;AAEA,IAAAI,UAAA,GAAAJ,OAAA;AACA,IAAAK,YAAA,GAAAL,OAAA;AAA4C,SAAAD,uBAAAO,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAxC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AA2BA;AAAA,IACKG,iBAAiB,0BAAjBA,iBAAiB;EAAjBA,iBAAiB,CAAjBA,iBAAiB;EAAjBA,iBAAiB,CAAjBA,iBAAiB;EAAA,OAAjBA,iBAAiB;AAAA,EAAjBA,iBAAiB;AAStB,SAASC,yBAAyBA,CAChCC,KAAgB,EAChBC,GAAmD,EACnD;EACA,MAAM;IACJC,OAAO;IACPC,YAAY;IACZC,sBAAsB;IACtBC,qBAAqB;IACrBC;EACF,CAAC,GAAGN,KAAK;EAET,MAAM;IAAEO,QAAQ;IAAEC;EAAiB,CAAC,GAAG,IAAAC,0BAAgB,EAAKP,OAAO,CAAC,CAAC,IAAAQ,mBAAU,EAC7EC,KAAK,KAAK;IACRJ,QAAQ,EAAEI,KAAK,CAACJ,QAAQ;IACxBC,gBAAgB,EAAEG,KAAK,CAACH;EAC1B,CAAC,CACH,CAAC,CAAC;EAEFI,cAAK,CAACC,mBAAmB,CAACZ,GAAG,EAAE,OAAO;IACpCa,cAAc,EAAGC,MAA8B,IAAK;MAClDC,wBAAwB,CAACC,OAAO,GAAGF,MAAM;MACzC;MACAG,6BAA6B,CAAC,CAACpB,iBAAiB,CAACqB,QAAQ,CAAC,CAAC;MAC3D;MACA,IAAAC,2BAAW,EACTlB,OAAO,EACP,CAACc,wBAAwB,CAACC,OAAO,CAACI,MAAM,CAAC,EACzC,CAACL,wBAAwB,CAACC,OAAO,CAACK,kBACpC,CAAC;IACH;EACF,CAAC,CAAC,EAAE,CAACpB,OAAO,CAAC,CAAC;;EAEd;EACA,MAAMc,wBAAwB,GAAGJ,cAAK,CAACW,MAAM,CAAgC,IAAI,CAAC;;EAElF;EACA,MAAM,CAACC,0BAA0B,EAAEN,6BAA6B,CAAC,GAC7DN,cAAK,CAACa,QAAQ,CAAsB,EAAE,CAAC;EAE3C,MAAMC,+BAA+B,GAAGd,cAAK,CAACW,MAAM,CAACnB,sBAAsB,CAAC;;EAE5E;AACF;EACEQ,cAAK,CAACe,SAAS,CAAC,MAAM;IACpBT,6BAA6B,CAACU,SAAS,IAAI;MACzC,IAAIA,SAAS,CAACC,QAAQ,CAAC/B,iBAAiB,CAACqB,QAAQ,CAAC,EAAE;QAClDO,+BAA+B,CAACT,OAAO,GAAGb,sBAAsB;QAChE,OAAO,CACLN,iBAAiB,CAACqB,QAAQ,EAC1BrB,iBAAiB,CAACgC,QAAQ,CAC3B;MACH,CAAC,MAAM;QACL,OAAOF,SAAS;MAClB;IACF,CAAC,CAAC;EACJ,CAAC,EAAE,CAACxB,sBAAsB,CAAC,CAAC;;EAE5B;AACF;EACEQ,cAAK,CAACmB,eAAe,CAAC,MAAM;IAC1B,IAAIf,wBAAwB,CAACC,OAAO,KAAK,IAAI,EAC3C;IAEF,IAAI,CAAC,IAAAe,wBAAW,EACdR,0BAA0B,EAC1B,CAAC1B,iBAAiB,CAACqB,QAAQ,EAAErB,iBAAiB,CAACgC,QAAQ,CACzD,CAAC,EAAE;MACD;IACF;;IAEA;IACA,IAAI,CAACd,wBAAwB,CAACC,OAAO,CAACK,kBAAkB,EAAE;MACxD,IAAIW,QAAwB;MAC5B;MACA,IAAIzB,gBAAgB,CAAC0B,GAAG,CAAClB,wBAAwB,CAACC,OAAO,CAACI,MAAM,CAAC,EAAE;QACjEY,QAAQ,GAAGzB,gBAAgB,CAAC2B,GAAG,CAACnB,wBAAwB,CAACC,OAAO,CAACI,MAAM,CAAO;MAChF;;MAEA;MACA,IAAIY,QAAQ,IAAI,CAAC1B,QAAQ,CAAC2B,GAAG,CAACD,QAAQ,CAAC,EACrC;IACJ;IACA;IAAA,KACK;MACH,IAAI,CAAC1B,QAAQ,CAAC2B,GAAG,CAAClB,wBAAwB,CAACC,OAAO,CAACI,MAAM,CAAC,EACxD;IACJ;IAEA,MAAM;MACJA,MAAM;MACNe,QAAQ;MACRC,UAAU;MACVC;IACF,CAAC,GAAGtB,wBAAwB,CAACC,OAAQ;IAErC,SAASsB,YAAYA,CAAA,EAAG;MACtB,MAAMC,KAAK,GAAGd,+BAA+B,CAACT,OAAO,CAACwB,SAAS,CAC7DC,IAAI,IAAIA,IAAI,CAACC,EAAE,KAAKtB,MACtB,CAAC;MAED,IAAImB,KAAK,KAAK,CAAC,CAAC,IAAIrC,YAAY,CAACc,OAAO,EAAE;QACxC;QACAd,YAAY,CAACc,OAAO,CAAC2B,aAAa,CAAC;UACjCJ,KAAK;UACLJ,QAAQ;UACRC,UAAU;UACVC;QACF,CAAC,CAAC;MACJ,CAAC,MAAM;QACL,IAAIO,OAAO,EAAE;UACXC,OAAO,CAACC,IAAI,CAAC,yFAAyF,CAAC;QACzG;MACF;;MAEA;MACA/B,wBAAwB,CAACC,OAAO,GAAG,IAAI;MACvCC,6BAA6B,CAAC,EAAE,CAAC;IACnC;IAEAqB,YAAY,CAAC,CAAC;EAChB,CAAC,EAAE,CAAC/B,gBAAgB,EAAED,QAAQ,EAAEJ,YAAY,EAAEqB,0BAA0B,CAAC,CAAC;;EAE1E;EACA;AACF;EACE,MAAMwB,iBAAiB,GAAGpC,cAAK,CAACW,MAAM,CAAC,KAAK,CAAC;EAC7CX,cAAK,CAACmB,eAAe,CAAC,MAAM;IAC1B,IAAIiB,iBAAiB,CAAC/B,OAAO,EAAE;IAE/B,MAAMuB,KAAK,GAAGpC,sBAAsB,CAACqC,SAAS,CAC5CC,IAAI,IAAIA,IAAI,CAACC,EAAE,KAAKrC,mBACtB,CAAC;IAEDD,qBAAqB,CAACmC,KAAK,CAAC;IAE5B,IAAIA,KAAK,KAAK,CAAC,CAAC,EAAE;MAChBQ,iBAAiB,CAAC/B,OAAO,GAAG,IAAI;IAClC;IACA;EACF,CAAC,EAAE,CAACb,sBAAsB,EAAEE,mBAAmB,CAAC,CAAC;EACjD;;EAEA,OAAO,IAAI;AACb;AAEA,MAAM2C,oBAAoB,gBAAGrC,cAAK,CAACsC,UAAU,CAACnD,yBAAyB,CAEtB;AAE1C,MAAMoD,mBAAmB,GAAAC,OAAA,CAAAD,mBAAA,GAAG,IAAAE,oBAAS,EAE1CJ,oBAAoB,CAAC","ignoreList":[]}

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

@@ -1,147 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.collapseAll = collapseAll;
-exports.collapseNodes = collapseNodes;
-exports.expandAll = expandAll;
-exports.expandNodes = expandNodes;
-exports.handleToggleExpand = handleToggleExpand;
-var _treeView = require("../store/treeView.store");
-/**
- * Toggle the expanded state of a tree node by its ID.
- *
- * If the node is currently expanded, it and its descendants will be collapsed.
- * If it is currently collapsed, it will be expanded.
- *
- * @param id - The ID of the tree node to toggle.
- */
-function handleToggleExpand(storeId, id) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    expanded,
-    updateExpanded,
-    nodeMap
-  } = treeViewStore.getState();
-
-  // Create a new Set based on the current expanded state
-  const newExpanded = new Set(expanded);
-  if (expanded.has(id)) {
-    // If the node is currently expanded, collapse it and its descendants
-    newExpanded.delete(id);
-
-    // Use an iterative approach to remove all descendants from the expanded set
-    const stack = [id];
-    while (stack.length > 0) {
-      const currentId = stack.pop();
-      const node = nodeMap.get(currentId);
-      if (node && node.children) {
-        for (const child of node.children) {
-          newExpanded.delete(child.id);
-          stack.push(child.id);
-        }
-      }
-    }
-  } else {
-    // If the node is currently collapsed, expand it
-    newExpanded.add(id);
-  }
-
-  // Update the expanded state
-  updateExpanded(newExpanded);
-}
-
-/**
- * Expand all nodes in the tree.
- */
-function expandAll(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    nodeMap,
-    updateExpanded
-  } = treeViewStore.getState();
-  // Create a new Set containing the IDs of all nodes
-  const newExpanded = new Set(nodeMap.keys());
-  updateExpanded(newExpanded);
-}
-
-/**
- * Collapse all nodes in the tree.
- */
-function collapseAll(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    updateExpanded
-  } = treeViewStore.getState();
-  // Clear the expanded state
-  updateExpanded(new Set());
-}
-
-/**
- * Expand tree nodes of given ids. If the id is of a child, it also expands
- * its ancestors up to the root.
- * @param ids - Ids of nodes to expand.
- * @param _doNotExpandToShowChildren - If true, the function will not expand the ids to prevent 
- * from showing their children.
- */
-function expandNodes(storeId, ids, _doNotExpandToShowChildren = false) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    expanded,
-    updateExpanded,
-    childToParentMap
-  } = treeViewStore.getState();
-  const newExpanded = new Set(expanded);
-  const processedIds = new Set();
-  ids.forEach(id => {
-    if (_doNotExpandToShowChildren) {
-      const parentId = childToParentMap.get(id);
-      if (parentId === undefined) return;else id = parentId;
-    }
-    let currentId = id;
-    while (currentId && !processedIds.has(currentId)) {
-      newExpanded.add(currentId);
-      processedIds.add(currentId);
-      currentId = childToParentMap.get(currentId);
-    }
-  });
-  updateExpanded(newExpanded);
-}
-
-/**
- * Collapse tree nodes of given ids. If the id is of a parent, it also collapses
- * its descendants.
- * @param ids - Ids of nodes to collapse.
- */
-function collapseNodes(storeId, ids) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    expanded,
-    updateExpanded,
-    nodeMap
-  } = treeViewStore.getState();
-  const newExpanded = new Set(expanded);
-
-  // Use an iterative approach to remove all descendants from the expanded set
-  const deleteChildrenFromExpanded = nodeId => {
-    const stack = [nodeId];
-    while (stack.length > 0) {
-      const currentId = stack.pop();
-      const node = nodeMap.get(currentId);
-      if (node && node.children) {
-        for (const child of node.children) {
-          newExpanded.delete(child.id);
-          stack.push(child.id);
-        }
-      }
-    }
-  };
-  ids.forEach(id => {
-    // Remove the node ID from the set and all its descendants
-    newExpanded.delete(id);
-    deleteChildrenFromExpanded(id);
-  });
-  updateExpanded(newExpanded);
-}
-//# sourceMappingURL=expandCollapse.helper.js.map

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

@@ -1 +0,0 @@
-{"version":3,"names":["_treeView","require","handleToggleExpand","storeId","id","treeViewStore","getTreeViewStore","expanded","updateExpanded","nodeMap","getState","newExpanded","Set","has","delete","stack","length","currentId","pop","node","get","children","child","push","add","expandAll","keys","collapseAll","expandNodes","ids","_doNotExpandToShowChildren","childToParentMap","processedIds","forEach","parentId","undefined","collapseNodes","deleteChildrenFromExpanded","nodeId"],"sourceRoot":"../../../src","sources":["helpers/expandCollapse.helper.ts"],"mappings":";;;;;;;;;;AAAA,IAAAA,SAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,kBAAkBA,CAAKC,OAAe,EAAEC,EAAM,EAAE;EAC5D,MAAMC,aAAa,GAAG,IAAAC,0BAAgB,EAAKH,OAAO,CAAC;EACnD,MAAM;IACFI,QAAQ;IACRC,cAAc;IACdC;EACJ,CAAC,GAAGJ,aAAa,CAACK,QAAQ,CAAC,CAAC;;EAE5B;EACA,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACL,QAAQ,CAAC;EAErC,IAAIA,QAAQ,CAACM,GAAG,CAACT,EAAE,CAAC,EAAE;IAClB;IACAO,WAAW,CAACG,MAAM,CAACV,EAAE,CAAC;;IAEtB;IACA,MAAMW,KAAK,GAAG,CAACX,EAAE,CAAC;IAElB,OAAOW,KAAK,CAACC,MAAM,GAAG,CAAC,EAAE;MACrB,MAAMC,SAAS,GAAGF,KAAK,CAACG,GAAG,CAAC,CAAE;MAC9B,MAAMC,IAAI,GAAGV,OAAO,CAACW,GAAG,CAACH,SAAS,CAAC;MAEnC,IAAIE,IAAI,IAAIA,IAAI,CAACE,QAAQ,EAAE;QACvB,KAAK,MAAMC,KAAK,IAAIH,IAAI,CAACE,QAAQ,EAAE;UAC/BV,WAAW,CAACG,MAAM,CAACQ,KAAK,CAAClB,EAAE,CAAC;UAC5BW,KAAK,CAACQ,IAAI,CAACD,KAAK,CAAClB,EAAE,CAAC;QACxB;MACJ;IACJ;EACJ,CAAC,MAAM;IACH;IACAO,WAAW,CAACa,GAAG,CAACpB,EAAE,CAAC;EACvB;;EAEA;EACAI,cAAc,CAACG,WAAW,CAAC;AAC/B;;AAEA;AACA;AACA;AACO,SAASc,SAASA,CAACtB,OAAe,EAAE;EACvC,MAAME,aAAa,GAAG,IAAAC,0BAAgB,EAACH,OAAO,CAAC;EAC/C,MAAM;IAAEM,OAAO;IAAED;EAAe,CAAC,GAAGH,aAAa,CAACK,QAAQ,CAAC,CAAC;EAC5D;EACA,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACH,OAAO,CAACiB,IAAI,CAAC,CAAC,CAAC;EAC3ClB,cAAc,CAACG,WAAW,CAAC;AAC/B;;AAEA;AACA;AACA;AACO,SAASgB,WAAWA,CAACxB,OAAe,EAAE;EACzC,MAAME,aAAa,GAAG,IAAAC,0BAAgB,EAACH,OAAO,CAAC;EAC/C,MAAM;IAAEK;EAAe,CAAC,GAAGH,aAAa,CAACK,QAAQ,CAAC,CAAC;EACnD;EACAF,cAAc,CAAC,IAAII,GAAG,CAAS,CAAC,CAAC;AACrC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASgB,WAAWA,CACvBzB,OAAe,EACf0B,GAAS,EACTC,0BAAmC,GAAG,KAAK,EAC7C;EACE,MAAMzB,aAAa,GAAG,IAAAC,0BAAgB,EAAKH,OAAO,CAAC;EACnD,MAAM;IAAEI,QAAQ;IAAEC,cAAc;IAAEuB;EAAiB,CAAC,GAAG1B,aAAa,CAACK,QAAQ,CAAC,CAAC;EAC/E,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACL,QAAQ,CAAC;EACrC,MAAMyB,YAAY,GAAG,IAAIpB,GAAG,CAAK,CAAC;EAElCiB,GAAG,CAACI,OAAO,CAAE7B,EAAE,IAAK;IAChB,IAAI0B,0BAA0B,EAAE;MAC5B,MAAMI,QAAQ,GAAGH,gBAAgB,CAACX,GAAG,CAAChB,EAAE,CAAC;MAEzC,IAAI8B,QAAQ,KAAKC,SAAS,EACtB,OAAO,KAEP/B,EAAE,GAAG8B,QAAQ;IACrB;IAEA,IAAIjB,SAAyB,GAAGb,EAAE;IAClC,OAAOa,SAAS,IAAI,CAACe,YAAY,CAACnB,GAAG,CAACI,SAAS,CAAC,EAAE;MAC9CN,WAAW,CAACa,GAAG,CAACP,SAAS,CAAC;MAC1Be,YAAY,CAACR,GAAG,CAACP,SAAS,CAAC;MAC3BA,SAAS,GAAGc,gBAAgB,CAACX,GAAG,CAACH,SAAS,CAAC;IAC/C;EACJ,CAAC,CAAC;EAEFT,cAAc,CAACG,WAAW,CAAC;AAC/B;;AAEA;AACA;AACA;AACA;AACA;AACO,SAASyB,aAAaA,CAAKjC,OAAe,EAAE0B,GAAS,EAAE;EAC1D,MAAMxB,aAAa,GAAG,IAAAC,0BAAgB,EAAKH,OAAO,CAAC;EACnD,MAAM;IAAEI,QAAQ;IAAEC,cAAc;IAAEC;EAAQ,CAAC,GAAGJ,aAAa,CAACK,QAAQ,CAAC,CAAC;EACtE,MAAMC,WAAW,GAAG,IAAIC,GAAG,CAACL,QAAQ,CAAC;;EAErC;EACA,MAAM8B,0BAA0B,GAAIC,MAAU,IAAK;IAC/C,MAAMvB,KAAK,GAAG,CAACuB,MAAM,CAAC;IAEtB,OAAOvB,KAAK,CAACC,MAAM,GAAG,CAAC,EAAE;MACrB,MAAMC,SAAS,GAAGF,KAAK,CAACG,GAAG,CAAC,CAAE;MAC9B,MAAMC,IAAI,GAAGV,OAAO,CAACW,GAAG,CAACH,SAAS,CAAC;MAEnC,IAAIE,IAAI,IAAIA,IAAI,CAACE,QAAQ,EAAE;QACvB,KAAK,MAAMC,KAAK,IAAIH,IAAI,CAACE,QAAQ,EAAE;UAC/BV,WAAW,CAACG,MAAM,CAACQ,KAAK,CAAClB,EAAE,CAAC;UAC5BW,KAAK,CAACQ,IAAI,CAACD,KAAK,CAAClB,EAAE,CAAC;QACxB;MACJ;IACJ;EACJ,CAAC;EAEDyB,GAAG,CAACI,OAAO,CAAE7B,EAAE,IAAK;IAChB;IACAO,WAAW,CAACG,MAAM,CAACV,EAAE,CAAC;IACtBiC,0BAA0B,CAACjC,EAAE,CAAC;EAClC,CAAC,CAAC;EAEFI,cAAc,CAACG,WAAW,CAAC;AAC/B","ignoreList":[]}

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

@@ -1,66 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getFlattenedTreeData = getFlattenedTreeData;
-/**
- * Flatten the tree and attach a "level" key to object to indicate it's depth. This
- * returns the flattened tree data of expanded ids only. We do not prune the tree off the
- * children after the flattening as it would be unnecessary computation.
- *
- * @param nodes - Input recursive tree
- * @param expandedIds - ids of currently expanded nodes
- * @param __level__ - (optional) for internal recursive use only
- * @returns Flattened tree data with expanded ids only
- */
-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
-    });
-
-    // Add children nodes to the stack if the node is expanded
-    if (node.children && expandedIds.has(node.id)) {
-      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 +0,0 @@
-{"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,KAAqB,EACrBC,WAAoB,EACO;EAC3B,MAAMC,SAAsC,GAAG,EAAE;EACjD,MAAMC,KAA+C,GAAG,EAAE;;EAE1D;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/index.js

@@ -1,72 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-var _expandCollapse = require("./expandCollapse.helper");
-Object.keys(_expandCollapse).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _expandCollapse[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _expandCollapse[key];
-    }
-  });
-});
-var _treeNode = require("./treeNode.helper");
-Object.keys(_treeNode).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _treeNode[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _treeNode[key];
-    }
-  });
-});
-var _selectAll = require("./selectAll.helper");
-Object.keys(_selectAll).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _selectAll[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _selectAll[key];
-    }
-  });
-});
-var _toggleCheckbox = require("./toggleCheckbox.helper");
-Object.keys(_toggleCheckbox).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _toggleCheckbox[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _toggleCheckbox[key];
-    }
-  });
-});
-var _search = require("./search.helper");
-Object.keys(_search).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _search[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _search[key];
-    }
-  });
-});
-var _flattenTree = require("./flattenTree.helper");
-Object.keys(_flattenTree).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (key in exports && exports[key] === _flattenTree[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _flattenTree[key];
-    }
-  });
-});
-//# sourceMappingURL=index.js.map

package/lib/commonjs/helpers/index.js.map

@@ -1 +0,0 @@
-{"version":3,"names":["_expandCollapse","require","Object","keys","forEach","key","exports","defineProperty","enumerable","get","_treeNode","_selectAll","_toggleCheckbox","_search","_flattenTree"],"sourceRoot":"../../../src","sources":["helpers/index.ts"],"mappings":";;;;;AAEA,IAAAA,eAAA,GAAAC,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAH,eAAA,EAAAI,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAL,eAAA,CAAAK,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAT,eAAA,CAAAK,GAAA;IAAA;EAAA;AAAA;AACA,IAAAK,SAAA,GAAAT,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAO,SAAA,EAAAN,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAK,SAAA,CAAAL,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAC,SAAA,CAAAL,GAAA;IAAA;EAAA;AAAA;AACA,IAAAM,UAAA,GAAAV,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAQ,UAAA,EAAAP,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAM,UAAA,CAAAN,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAE,UAAA,CAAAN,GAAA;IAAA;EAAA;AAAA;AACA,IAAAO,eAAA,GAAAX,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAS,eAAA,EAAAR,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAO,eAAA,CAAAP,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAG,eAAA,CAAAP,GAAA;IAAA;EAAA;AAAA;AACA,IAAAQ,OAAA,GAAAZ,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAU,OAAA,EAAAT,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAQ,OAAA,CAAAR,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAI,OAAA,CAAAR,GAAA;IAAA;EAAA;AAAA;AACA,IAAAS,YAAA,GAAAb,OAAA;AAAAC,MAAA,CAAAC,IAAA,CAAAW,YAAA,EAAAV,OAAA,WAAAC,GAAA;EAAA,IAAAA,GAAA,kBAAAA,GAAA;EAAA,IAAAA,GAAA,IAAAC,OAAA,IAAAA,OAAA,CAAAD,GAAA,MAAAS,YAAA,CAAAT,GAAA;EAAAH,MAAA,CAAAK,cAAA,CAAAD,OAAA,EAAAD,GAAA;IAAAG,UAAA;IAAAC,GAAA,WAAAA,CAAA;MAAA,OAAAK,YAAA,CAAAT,GAAA;IAAA;EAAA;AAAA","ignoreList":[]}

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

@@ -1,65 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getFilteredTreeData = getFilteredTreeData;
-/**
- * Get filtered tree data based on the search term and the search keys
- * If any of the parent contains the search term, the tree will also contain
- * it's children.
- *
- * If only one of the innermost children contains the search term then it's siblings
- * won't be included in the search. But all it's ancestor nodes will be included
- *
- * @param nodes Input tree data
- * @param trimmedSearchTerm search term
- * @param searchKeys search key
- * @returns filtered tree data
- */
-function getFilteredTreeData(nodes, trimmedSearchTerm, searchKeys) {
-  let filtered = [];
-  for (let node of nodes) {
-    const isSearchTermInNode = doesNodeContainSearchTerm(node, trimmedSearchTerm, searchKeys);
-    if (!trimmedSearchTerm || isSearchTermInNode) {
-      // If node itself matches, include it and all its descendants
-      filtered.push(node);
-    } else if (node.children) {
-      // If node does not match, check its children and include them if they match
-      const childMatches = getFilteredTreeData(node.children, trimmedSearchTerm, searchKeys);
-      if (childMatches.length > 0) {
-        // If any children match, include the node, replacing its children with the matching ones
-        filtered.push({
-          ...node,
-          children: childMatches
-        });
-      }
-    }
-  }
-  return filtered;
-}
-;
-
-/**
- * Checks if a given tree node contains a specific search term in any of its specified keys.
- *
- * This function will check each of the specified keys in the tree node, convert the key's value to a string,
- * and check if it includes the search term.
- *
- * @param node - The tree node to search through.
- * @param searchTerm - The term to search for.
- * @param searchKeys - The keys in the tree node to search in.
- * @returns True if the search term is found in any of the specified keys, false otherwise.
- */
-function doesNodeContainSearchTerm(node, searchTerm, searchKeys) {
-  // We're using the `some` method on the array of keys to check each one
-  return searchKeys.some(key => {
-    // Get the value of the key in the tree node
-    const nodeValue = node[key];
-    // Check if the string representation of the key's value includes the search term
-    // If the value is undefined or null, `nodeValue?.toString()` will return undefined,
-    // and the call to `toLowerCase().includes(searchTerm)` will return false.
-    return nodeValue?.toString().toLowerCase().includes(searchTerm);
-  });
-}
-//# sourceMappingURL=search.helper.js.map

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

@@ -1 +0,0 @@
-{"version":3,"names":["getFilteredTreeData","nodes","trimmedSearchTerm","searchKeys","filtered","node","isSearchTermInNode","doesNodeContainSearchTerm","push","children","childMatches","length","searchTerm","some","key","nodeValue","toString","toLowerCase","includes"],"sourceRoot":"../../../src","sources":["helpers/search.helper.ts"],"mappings":";;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,mBAAmBA,CAC/BC,KAAqB,EACrBC,iBAAyB,EACzBC,UAAoB,EACN;EACd,IAAIC,QAAwB,GAAG,EAAE;EAEjC,KAAK,IAAIC,IAAI,IAAIJ,KAAK,EAAE;IACpB,MAAMK,kBAAkB,GAAGC,yBAAyB,CAChDF,IAAI,EACJH,iBAAiB,EACjBC,UACJ,CAAC;IAED,IAAI,CAACD,iBAAiB,IAAII,kBAAkB,EAAE;MAC1C;MACAF,QAAQ,CAACI,IAAI,CAACH,IAAI,CAAC;IACvB,CAAC,MAAM,IAAIA,IAAI,CAACI,QAAQ,EAAE;MACtB;MACA,MAAMC,YAAY,GAAGV,mBAAmB,CACpCK,IAAI,CAACI,QAAQ,EACbP,iBAAiB,EACjBC,UACJ,CAAC;MAED,IAAIO,YAAY,CAACC,MAAM,GAAG,CAAC,EAAE;QACzB;QACAP,QAAQ,CAACI,IAAI,CAAC;UAAE,GAAGH,IAAI;UAAEI,QAAQ,EAAEC;QAAa,CAAC,CAAC;MACtD;IACJ;EACJ;EAEA,OAAON,QAAQ;AACnB;AAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,yBAAyBA,CAC9BF,IAAkB,EAClBO,UAAkB,EAClBT,UAAoB,EACb;EACP;EACA,OAAOA,UAAU,CAACU,IAAI,CAACC,GAAG,IAAI;IAC1B;IACA,MAAMC,SAAS,GAAGV,IAAI,CAACS,GAAG,CAAC;IAC3B;IACA;IACA;IACA,OAAQC,SAAS,EAAEC,QAAQ,CAAC,CAAC,CAACC,WAAW,CAAC,CAAC,CAACC,QAAQ,CAACN,UAAU,CAAC;EACpE,CAAC,CAAC;AACN","ignoreList":[]}

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

@@ -1,117 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getInnerMostChildrenIdsInTree = getInnerMostChildrenIdsInTree;
-exports.selectAll = selectAll;
-exports.selectAllFiltered = selectAllFiltered;
-exports.unselectAll = unselectAll;
-exports.unselectAllFiltered = unselectAllFiltered;
-var _treeView = require("../store/treeView.store");
-var _toggleCheckbox = require("./toggleCheckbox.helper");
-/**
- * Selects all nodes that are currently visible due to the applied filter.
- *
- * If there is no search text, then it selects all nodes; otherwise, it selects all visible nodes.
- */
-function selectAllFiltered(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    searchText,
-    innerMostChildrenIds
-  } = treeViewStore.getState();
-
-  // If there's no search text, select all nodes
-  if (!searchText) {
-    selectAll(storeId);
-  } else {
-    // If there's search text, only select the visible nodes
-    (0, _toggleCheckbox.toggleCheckboxes)(storeId, innerMostChildrenIds, true);
-  }
-}
-;
-
-/**
- * Unselects all nodes that are currently visible due to the applied filter.
- *
- * If there is no search text, then it unselects all nodes; otherwise, it unselects all visible nodes.
- */
-function unselectAllFiltered(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    searchText,
-    innerMostChildrenIds
-  } = treeViewStore.getState();
-
-  // If there's no search text, unselect all nodes
-  if (!searchText) {
-    unselectAll(storeId);
-  } else {
-    // If there's search text, only unselect the visible nodes
-    (0, _toggleCheckbox.toggleCheckboxes)(storeId, innerMostChildrenIds, false);
-  }
-}
-;
-
-/**
- * Selects all nodes in the tree.
- *
- * This function selects all nodes by adding all node ids to the checked set and clearing the indeterminate set.
- */
-function selectAll(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    nodeMap,
-    updateChecked,
-    updateIndeterminate
-  } = treeViewStore.getState();
-
-  // Create a new set containing the ids of all nodes
-  const newChecked = new Set(nodeMap.keys());
-  // Update the state to mark all nodes as checked
-
-  updateChecked(newChecked);
-  updateIndeterminate(new Set());
-}
-;
-
-/**
- * Unselects all nodes in the tree.
- *
- * This function unselects all nodes by clearing both the checked and indeterminate sets.
- */
-function unselectAll(storeId) {
-  const treeViewStore = (0, _treeView.getTreeViewStore)(storeId);
-  const {
-    updateChecked,
-    updateIndeterminate
-  } = treeViewStore.getState();
-  // Update the state to mark all nodes as unchecked
-
-  updateChecked(new Set());
-  updateIndeterminate(new Set());
-}
-;
-
-/**
- * Get the ids of the innermost children in the tree
- *
- * @param filteredTreeNodes - The filtered tree data
- * @returns - array of ids of the inner most children only
- */
-function getInnerMostChildrenIdsInTree(filteredTreeNodes) {
-  const allLeafIds = [];
-  const getLeafNodes = _nodes => {
-    for (let node of _nodes) {
-      if (node.children) {
-        getLeafNodes(node.children);
-      } else {
-        allLeafIds.push(node.id);
-      }
-    }
-  };
-  getLeafNodes(filteredTreeNodes);
-  return allLeafIds;
-}
-//# sourceMappingURL=selectAll.helper.js.map