rsuite 5.32.0 → 5.33.1

package/cjs/utils/treeUtils.js

@@ -8,6 +8,8 @@ exports.__esModule = true;
 exports.shouldShowNodeByParentExpanded = shouldShowNodeByParentExpanded;
 exports.UNSAFE_flattenTree = UNSAFE_flattenTree;
 exports.flattenTree = flattenTree;
+exports.walkTreeBfs = walkTreeBfs;
+exports.walkTreeDfs = walkTreeDfs;
 exports.getNodeParents = getNodeParents;
 exports.getNodeParentKeys = getNodeParentKeys;
 exports.hasVisibleChildren = hasVisibleChildren;
@@ -39,7 +41,10 @@ exports.getNodeFormattedRefKey = getNodeFormattedRefKey;
 exports.createDragPreview = createDragPreview;
 exports.removeDragPreview = removeDragPreview;
 exports.stringifyTreeNodeLabel = stringifyTreeNodeLabel;
-exports.getScrollToIndex = exports.focusPreviousItem = exports.focusNextItem = exports.focusTreeNode = exports.getElementByDataKey = exports.getActiveItem = exports.getActiveIndex = exports.getFocusableItems = void 0;
+exports.getParentMap = getParentMap;
+exports.getKeyParentMap = getKeyParentMap;
+exports.getPathTowardsItem = getPathTowardsItem;
+exports.getScrollToIndex = exports.focusPreviousItem = exports.focusNextItem = exports.focusTreeNode = exports.getElementByDataKey = exports.getActiveItem = exports.getActiveIndex = exports.getFocusableItems = exports.WalkTreeStrategy = void 0;
 
 var _extends3 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
 
@@ -73,6 +78,12 @@ var _constants = require("./constants");
 
 var _attachParent = require("./attachParent");
 
+function _createForOfIteratorHelperLoose(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (it) return (it = it.call(o)).next.bind(it); if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; return function () { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
 // gap of tree node
 var TREE_NODE_GAP = 4;
 /**
@@ -135,15 +146,35 @@ function UNSAFE_flattenTree(tree, childrenKey, executor) {
   return flattenData;
 }
 
-function flattenTree(rootNodes, getChildren) {
+var WalkTreeStrategy;
+exports.WalkTreeStrategy = WalkTreeStrategy;
+
+(function (WalkTreeStrategy) {
+  WalkTreeStrategy[WalkTreeStrategy["DFS"] = 0] = "DFS";
+  WalkTreeStrategy[WalkTreeStrategy["BFS"] = 1] = "BFS";
+})(WalkTreeStrategy || (exports.WalkTreeStrategy = WalkTreeStrategy = {}));
+
+function flattenTree(rootNodes, getChildren, walkStrategy) {
+  if (walkStrategy === void 0) {
+    walkStrategy = WalkTreeStrategy.BFS;
+  }
+
   var result = [];
-  walkTree(rootNodes, getChildren, function (node) {
-    return result.push(node);
-  });
+
+  if (walkStrategy === WalkTreeStrategy.BFS) {
+    walkTreeBfs(rootNodes, getChildren, function (node) {
+      return result.push(node);
+    });
+  } else if (walkStrategy === WalkTreeStrategy.DFS) {
+    walkTreeDfs(rootNodes, getChildren, function (node) {
+      return result.push(node);
+    });
+  }
+
   return result;
 }
 
-function walkTree(rootNodes, getChildren, callback) {
+function walkTreeBfs(rootNodes, getChildren, callback) {
   for (var queue = [].concat(rootNodes); queue.length > 0;) {
     var _node = queue.shift();
 
@@ -155,6 +186,18 @@ function walkTree(rootNodes, getChildren, callback) {
     }
   }
 }
+
+function walkTreeDfs(rootNodes, getChildren, callback) {
+  for (var _iterator = _createForOfIteratorHelperLoose(rootNodes), _step; !(_step = _iterator()).done;) {
+    var _node2 = _step.value;
+    callback(_node2);
+    var children = getChildren(_node2);
+
+    if (children) {
+      walkTreeDfs(children, getChildren, callback);
+    }
+  }
+}
 /**
  * get all ancestor nodes of given node
  * @param {*} node
@@ -404,10 +447,10 @@ function findNodeOfTree(data, check) {
       var _item3 = nodes[i];
 
       if ((0, _isArray2.default)(_item3.children)) {
-        var _node2 = findNode(_item3.children);
+        var _node3 = findNode(_item3.children);
 
-        if (_node2) {
-          return _node2;
+        if (_node3) {
+          return _node3;
         }
       }
 
@@ -1195,4 +1238,73 @@ function stringifyTreeNodeLabel(label) {
   }
 
   return '';
+}
+/**
+ * Returns a WeakMap that maps each item in `items` to its parent
+ * indicated by `getChildren` function
+ */
+
+
+function getParentMap(items, getChildren) {
+  var map = new WeakMap();
+
+  for (var queue = [].concat(items); queue.length > 0;) {
+    var _item5 = queue.shift();
+
+    var children = getChildren(_item5);
+
+    if (children) {
+      for (var _iterator2 = _createForOfIteratorHelperLoose(children), _step2; !(_step2 = _iterator2()).done;) {
+        var child = _step2.value;
+        map.set(child, _item5);
+        queue.push(child);
+      }
+    }
+  }
+
+  return map;
+}
+/**
+ * Returns a Map that maps each item's "key", indicated by `getKey` function,
+ * to its parent indicated by `getChildren` function
+ *
+ * NOTICE:
+ * Using this function is discouraged.
+ * Use {@link getParentMap} whenever possible.
+ */
+
+
+function getKeyParentMap(items, getKey, getChildren) {
+  var map = new Map();
+
+  for (var queue = [].concat(items); queue.length > 0;) {
+    var _item6 = queue.shift();
+
+    var children = getChildren(_item6);
+
+    if (children) {
+      for (var _iterator3 = _createForOfIteratorHelperLoose(children), _step3; !(_step3 = _iterator3()).done;) {
+        var child = _step3.value;
+        map.set(getKey(child), _item6);
+        queue.push(child);
+      }
+    }
+  }
+
+  return map;
+}
+/**
+ * Returns an array indicating the hierarchy path from root towards `target` item
+ */
+
+
+function getPathTowardsItem(target, getParent) {
+  if (!target) return [];
+  var path = [target];
+
+  for (var parent = getParent(target); !!parent; parent = getParent(parent)) {
+    path.unshift(parent);
+  }
+
+  return path;
 }