rsuite 5.31.1 → 5.32.0

package/cjs/utils/treeUtils.js

@@ -6,6 +6,7 @@ var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefau
 
 exports.__esModule = true;
 exports.shouldShowNodeByParentExpanded = shouldShowNodeByParentExpanded;
+exports.UNSAFE_flattenTree = UNSAFE_flattenTree;
 exports.flattenTree = flattenTree;
 exports.getNodeParents = getNodeParents;
 exports.getNodeParentKeys = getNodeParentKeys;
@@ -102,10 +103,13 @@ function shouldShowNodeByParentExpanded(expandItemValues, parentKeys) {
  * @param {*} tree
  * @param {*} childrenKey
  * @param {*} executor
+ *
+ * @deprecated This {@link UNSAFE_flattenTree} function is considered unsafe because it mutates `tree` argument in-place
+ *             Use {@link flattenTree} instead.
  */
 
 
-function flattenTree(tree, childrenKey, executor) {
+function UNSAFE_flattenTree(tree, childrenKey, executor) {
   if (childrenKey === void 0) {
     childrenKey = 'children';
   }
@@ -130,6 +134,27 @@ function flattenTree(tree, childrenKey, executor) {
   traverse(tree, null);
   return flattenData;
 }
+
+function flattenTree(rootNodes, getChildren) {
+  var result = [];
+  walkTree(rootNodes, getChildren, function (node) {
+    return result.push(node);
+  });
+  return result;
+}
+
+function walkTree(rootNodes, getChildren, callback) {
+  for (var queue = [].concat(rootNodes); queue.length > 0;) {
+    var _node = queue.shift();
+
+    callback(_node);
+    var children = getChildren(_node);
+
+    if (children) {
+      queue.push.apply(queue, children);
+    }
+  }
+}
 /**
  * get all ancestor nodes of given node
  * @param {*} node
@@ -212,7 +237,7 @@ function getDefaultExpandItemValues(data, props) {
       defaultExpandItemValues = _props$defaultExpandI === void 0 ? [] : _props$defaultExpandI;
 
   if (defaultExpandAll) {
-    return flattenTree(data, childrenKey).filter(function (item) {
+    return UNSAFE_flattenTree(data, childrenKey).filter(function (item) {
       return Array.isArray(item[childrenKey]) && item[childrenKey].length > 0;
     }).map(function (item) {
       return item[valueKey];
@@ -379,10 +404,10 @@ function findNodeOfTree(data, check) {
       var _item3 = nodes[i];
 
       if ((0, _isArray2.default)(_item3.children)) {
-        var _node = findNode(_item3.children);
+        var _node2 = findNode(_item3.children);
 
-        if (_node) {
-          return _node;
+        if (_node2) {
+          return _node2;
         }
       }
 
@@ -875,7 +900,7 @@ function useFlattenTreeData(_ref8) {
   var formatVirtualizedTreeData = function formatVirtualizedTreeData(nodes, data, expandItemValues, options) {
     var cascade = options.cascade,
         searchKeyword = options.searchKeyword;
-    return flattenTree(data, childrenKey, function (node) {
+    return UNSAFE_flattenTree(data, childrenKey, function (node) {
       var formatted = {};
       var curNode = nodes === null || nodes === void 0 ? void 0 : nodes[node.refKey];
       var parentKeys = getNodeParentKeys(nodes, curNode, valueKey);

package/cjs/utils/useMap.d.ts

@@ -0,0 +1,6 @@
+export declare function useMap<K, V>(): {
+    has(key: K): boolean;
+    get(key: K): V | undefined;
+    set(key: K, value: V): void;
+    clear(): void;
+};

package/cjs/utils/useMap.js

@@ -0,0 +1,35 @@
+"use strict";
+
+exports.__esModule = true;
+exports.useMap = useMap;
+
+var _react = require("react");
+
+function useMap() {
+  var _useState = (0, _react.useState)(function () {
+    return new Map();
+  }),
+      map = _useState[0],
+      setMap = _useState[1];
+
+  return (0, _react.useMemo)(function () {
+    return {
+      has: function has(key) {
+        return map.has(key);
+      },
+      get: function get(key) {
+        return map.get(key);
+      },
+      set: function set(key, value) {
+        setMap(function (prev) {
+          var copy = new Map(prev);
+          copy.set(key, value);
+          return copy;
+        });
+      },
+      clear: function clear() {
+        setMap(new Map());
+      }
+    };
+  }, [map]);
+}