rsuite 5.32.0 → 5.33.1

package/esm/utils/treeUtils.js

@@ -6,6 +6,13 @@ import _isArray from "lodash/isArray";
 import _omit from "lodash/omit";
 import _isUndefined from "lodash/isUndefined";
 import _intersection from "lodash/intersection";
+
+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; }
+
 import React, { useRef, useState, useEffect, useCallback } from 'react';
 import shallowEqualArray from '../utils/shallowEqualArray';
 import { getNodeCheckState } from '../CheckTreePicker/utils';
@@ -74,15 +81,33 @@ export function UNSAFE_flattenTree(tree, childrenKey, executor) {
   traverse(tree, null);
   return flattenData;
 }
-export function flattenTree(rootNodes, getChildren) {
+export var WalkTreeStrategy;
+
+(function (WalkTreeStrategy) {
+  WalkTreeStrategy[WalkTreeStrategy["DFS"] = 0] = "DFS";
+  WalkTreeStrategy[WalkTreeStrategy["BFS"] = 1] = "BFS";
+})(WalkTreeStrategy || (WalkTreeStrategy = {}));
+
+export 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) {
+export function walkTreeBfs(rootNodes, getChildren, callback) {
   for (var queue = [].concat(rootNodes); queue.length > 0;) {
     var _node = queue.shift();
 
@@ -94,12 +119,22 @@ function walkTree(rootNodes, getChildren, callback) {
     }
   }
 }
+export 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
  */
 
-
 export function getNodeParents(node, parentKey, valueKey) {
   if (parentKey === void 0) {
     parentKey = 'parent';
@@ -335,10 +370,10 @@ export function findNodeOfTree(data, check) {
       var _item3 = nodes[i];
 
       if (_isArray(_item3.children)) {
-        var _node2 = findNode(_item3.children);
+        var _node3 = findNode(_item3.children);
 
-        if (_node2) {
-          return _node2;
+        if (_node3) {
+          return _node3;
         }
       }
 
@@ -1091,4 +1126,70 @@ export function stringifyTreeNodeLabel(label) {
   }
 
   return '';
+}
+/**
+ * Returns a WeakMap that maps each item in `items` to its parent
+ * indicated by `getChildren` function
+ */
+
+export 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.
+ */
+
+export 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
+ */
+
+export function getPathTowardsItem(target, getParent) {
+  if (!target) return [];
+  var path = [target];
+
+  for (var parent = getParent(target); !!parent; parent = getParent(parent)) {
+    path.unshift(parent);
+  }
+
+  return path;
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rsuite",
-  "version": "5.32.0",
+  "version": "5.33.1",
   "description": "A suite of react components",
   "main": "cjs/index.js",
   "module": "esm/index.js",
@@ -38,8 +38,8 @@
     "prop-types": "^15.8.1",
     "react-use-set": "^1.0.0",
     "react-window": "^1.8.8",
-    "rsuite-table": "^5.10.3",
-    "schema-typed": "^2.1.2"
+    "rsuite-table": "^5.10.5",
+    "schema-typed": "^2.1.3"
   },
   "peerDependencies": {
     "react": ">=16.8.0",