rsuite 5.76.0 → 6.0.0-canary-20241227

package/cjs/Tree/hooks/useVirtualizedTreeData.js

@@ -4,7 +4,6 @@
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
 exports.__esModule = true;
 exports.default = void 0;
-var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
 var _react = require("react");
 var _intersection = _interopRequireDefault(require("lodash/intersection"));
 var _isUndefined = _interopRequireDefault(require("lodash/isUndefined"));
@@ -23,34 +22,37 @@ function shouldShowNodeByParentExpanded(expandItemValues, parentKeys) {
   if (parentKeys === void 0) {
     parentKeys = [];
   }
-  var intersectionKeys = (0, _intersection.default)(expandItemValues, parentKeys);
+  const intersectionKeys = (0, _intersection.default)(expandItemValues, parentKeys);
   if (intersectionKeys.length === parentKeys.length) {
     return true;
   }
   return false;
 }
 function useVirtualizedTreeData(nodes, data, options) {
-  var _useItemDataKeys = (0, _TreeProvider.useItemDataKeys)(),
-    childrenKey = _useItemDataKeys.childrenKey,
-    valueKey = _useItemDataKeys.valueKey;
+  const {
+    childrenKey,
+    valueKey
+  } = (0, _TreeProvider.useItemDataKeys)();
 
   /**
    * Formats the virtualized tree data.
    */
-  return (0, _react.useCallback)(function () {
-    var cascade = options.cascade,
-      searchKeyword = options.searchKeyword,
-      expandItemValues = options.expandItemValues;
-    return (0, _flattenTree.UNSAFE_flattenTree)(data, childrenKey, function (node) {
-      var formatted = {};
-      var curNode = nodes === null || nodes === void 0 ? void 0 : nodes[node.refKey];
-      var parentKeys = (0, _getNodeParentKeys.getNodeParentKeys)(nodes, curNode, valueKey);
+  return (0, _react.useCallback)(() => {
+    const {
+      cascade,
+      searchKeyword,
+      expandItemValues
+    } = options;
+    return (0, _flattenTree.UNSAFE_flattenTree)(data, childrenKey, node => {
+      let formatted = {};
+      const curNode = nodes === null || nodes === void 0 ? void 0 : nodes[node.refKey];
+      const parentKeys = (0, _getNodeParentKeys.getNodeParentKeys)(nodes, curNode, valueKey);
       /**
        * When using virtualized,
        * if the parent node is collapsed, the child nodes should be hidden
        * avoid component height calculation errors
        */
-      var visible = curNode !== null && curNode !== void 0 && curNode.parent ? shouldShowNodeByParentExpanded(expandItemValues, parentKeys) : true;
+      let visible = curNode !== null && curNode !== void 0 && curNode.parent ? shouldShowNodeByParentExpanded(expandItemValues, parentKeys) : true;
 
       /**
        * when searching, every node default expand
@@ -60,20 +62,21 @@ function useVirtualizedTreeData(nodes, data, options) {
         visible = node.visible;
       }
       if (curNode) {
-        var checkState = !(0, _isUndefined.default)(cascade) ? (0, _utils.getNodeCheckState)(curNode, {
-          cascade: cascade,
-          nodes: nodes,
-          childrenKey: childrenKey
+        const checkState = !(0, _isUndefined.default)(cascade) ? (0, _utils.getNodeCheckState)(curNode, {
+          cascade,
+          nodes,
+          childrenKey
         }) : undefined;
-        formatted = (0, _extends2.default)({}, node, {
+        formatted = {
+          ...node,
           check: curNode.check,
           uncheckable: curNode.uncheckable,
           hasChildren: !!node[childrenKey],
           layer: curNode.layer,
           parent: curNode.parent,
-          checkState: checkState,
-          visible: visible
-        });
+          checkState,
+          visible
+        };
       }
       return formatted;
     });

package/cjs/Tree/types.js

@@ -6,7 +6,7 @@ exports.TREE_NODE_DROP_POSITION = void 0;
 /**
  * Tree Node Drag Type
  */
-var TREE_NODE_DROP_POSITION = exports.TREE_NODE_DROP_POSITION = /*#__PURE__*/function (TREE_NODE_DROP_POSITION) {
+let TREE_NODE_DROP_POSITION = exports.TREE_NODE_DROP_POSITION = /*#__PURE__*/function (TREE_NODE_DROP_POSITION) {
   TREE_NODE_DROP_POSITION[TREE_NODE_DROP_POSITION["DRAG_OVER"] = 0] = "DRAG_OVER";
   TREE_NODE_DROP_POSITION[TREE_NODE_DROP_POSITION["DRAG_OVER_TOP"] = 1] = "DRAG_OVER_TOP";
   TREE_NODE_DROP_POSITION[TREE_NODE_DROP_POSITION["DRAG_OVER_BOTTOM"] = 2] = "DRAG_OVER_BOTTOM";

package/cjs/Tree/utils/flattenTree.js

@@ -8,13 +8,10 @@ exports.flattenTree = flattenTree;
 exports.walkTreeBfs = walkTreeBfs;
 exports.walkTreeDfs = walkTreeDfs;
 var _utils = require("../../internals/utils");
-function _createForOfIteratorHelperLoose(r, e) { var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (t) return (t = t.call(r)).next.bind(t); if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) { t && (r = t); var o = 0; return function () { return o >= r.length ? { done: !0 } : { done: !1, value: r[o++] }; }; } 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(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
-function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
 /**
  * Strategy for walking the tree.
  */
-var WalkTreeStrategy = exports.WalkTreeStrategy = /*#__PURE__*/function (WalkTreeStrategy) {
+let WalkTreeStrategy = exports.WalkTreeStrategy = /*#__PURE__*/function (WalkTreeStrategy) {
   WalkTreeStrategy[WalkTreeStrategy["DFS"] = 0] = "DFS";
   WalkTreeStrategy[WalkTreeStrategy["BFS"] = 1] = "BFS";
   return WalkTreeStrategy;
@@ -26,15 +23,11 @@ function flattenTree(rootNodes, getChildren, walkStrategy) {
   if (walkStrategy === void 0) {
     walkStrategy = WalkTreeStrategy.BFS;
   }
-  var result = [];
+  const result = [];
   if (walkStrategy === WalkTreeStrategy.BFS) {
-    walkTreeBfs(rootNodes, getChildren, function (node) {
-      return result.push(node);
-    });
+    walkTreeBfs(rootNodes, getChildren, node => result.push(node));
   } else if (walkStrategy === WalkTreeStrategy.DFS) {
-    walkTreeDfs(rootNodes, getChildren, function (node) {
-      return result.push(node);
-    });
+    walkTreeDfs(rootNodes, getChildren, node => result.push(node));
   }
   return result;
 }
@@ -43,12 +36,12 @@ function flattenTree(rootNodes, getChildren, walkStrategy) {
  * Walks the tree in a breadth-first search (BFS) manner.
  */
 function walkTreeBfs(rootNodes, getChildren, callback) {
-  for (var queue = [].concat(rootNodes); queue.length > 0;) {
-    var node = queue.shift();
+  for (const queue = [...rootNodes]; queue.length > 0;) {
+    const node = queue.shift();
     callback(node);
-    var children = getChildren(node);
+    const children = getChildren(node);
     if (children) {
-      queue.push.apply(queue, children);
+      queue.push(...children);
     }
   }
 }
@@ -57,10 +50,9 @@ function walkTreeBfs(rootNodes, getChildren, callback) {
  * Walks the tree in a depth-first search (DFS) manner.
  */
 function walkTreeDfs(rootNodes, getChildren, callback) {
-  for (var _iterator = _createForOfIteratorHelperLoose(rootNodes), _step; !(_step = _iterator()).done;) {
-    var node = _step.value;
+  for (const node of rootNodes) {
     callback(node);
-    var children = getChildren(node);
+    const children = getChildren(node);
     if (children) {
       walkTreeDfs(children, getChildren, callback);
     }
@@ -76,19 +68,19 @@ function UNSAFE_flattenTree(tree, childrenKey, executor) {
   if (childrenKey === void 0) {
     childrenKey = 'children';
   }
-  var flattenData = [];
-  var _traverse = function traverse(data, parent) {
+  const flattenData = [];
+  const traverse = (data, parent) => {
     if (!Array.isArray(data)) {
       return;
     }
-    data.forEach(function (item, index) {
-      var node = typeof executor === 'function' ? executor(item, index) : item;
+    data.forEach((item, index) => {
+      const node = typeof executor === 'function' ? executor(item, index) : item;
       flattenData.push((0, _utils.attachParent)(node, parent));
       if (item[childrenKey]) {
-        _traverse(item[childrenKey], item);
+        traverse(item[childrenKey], item);
       }
     });
   };
-  _traverse(tree, null);
+  traverse(tree, null);
   return flattenData;
 }

package/cjs/Tree/utils/focusableTree.js

@@ -6,34 +6,34 @@ exports.getFocusableItems = exports.getActiveItem = exports.focusTreeNode = expo
 exports.scrollToActiveTreeNode = scrollToActiveTreeNode;
 var _utils = require("../../internals/utils");
 // Active tree node selector
-var SELECTED_TREEITEM_SELECTOR = '[role="treeitem"][aria-selected="true"]';
+const SELECTED_TREEITEM_SELECTOR = '[role="treeitem"][aria-selected="true"]';
 
 /**
  * Retrieves the focusable items from the filtered data based on the provided props.
  * Excludes nodes that are not visible or are disabled.
  */
-var getFocusableItems = exports.getFocusableItems = function getFocusableItems(filteredData, props, isSearching) {
-  var disabledItemValues = props.disabledItemValues,
-    valueKey = props.valueKey,
-    childrenKey = props.childrenKey,
-    expandItemValues = props.expandItemValues;
-  var items = [];
-  var _loop = function loop(nodes) {
-    nodes.forEach(function (node) {
-      var disabled = disabledItemValues.some(function (disabledItem) {
-        return (0, _utils.shallowEqual)(disabledItem, node[valueKey]);
-      });
+const getFocusableItems = (filteredData, props, isSearching) => {
+  const {
+    disabledItemValues,
+    valueKey,
+    childrenKey,
+    expandItemValues
+  } = props;
+  const items = [];
+  const loop = nodes => {
+    nodes.forEach(node => {
+      const disabled = disabledItemValues.some(disabledItem => (0, _utils.shallowEqual)(disabledItem, node[valueKey]));
       if (!disabled && node.visible) {
         items.push(node);
       }
       // always expand when searching
-      var expand = isSearching ? true : expandItemValues.includes(node[valueKey]);
+      const expand = isSearching ? true : expandItemValues.includes(node[valueKey]);
       if (node[childrenKey] && expand) {
-        _loop(node[childrenKey]);
+        loop(node[childrenKey]);
       }
     });
   };
-  _loop(filteredData);
+  loop(filteredData);
   return items;
 };
 
@@ -41,9 +41,10 @@ var getFocusableItems = exports.getFocusableItems = function getFocusableItems(f
  * Returns the index of the active item in the focusItems array.
  *
  */
-var getActiveIndex = function getActiveIndex(focusItemValue, focusItems, valueKey) {
-  var activeIndex = -1;
-  focusItems.forEach(function (item, index) {
+exports.getFocusableItems = getFocusableItems;
+const getActiveIndex = (focusItemValue, focusItems, valueKey) => {
+  let activeIndex = -1;
+  focusItems.forEach((item, index) => {
     if ((0, _utils.shallowEqual)(item[valueKey], focusItemValue)) {
       activeIndex = index;
     }
@@ -54,11 +55,9 @@ var getActiveIndex = function getActiveIndex(focusItemValue, focusItems, valueKe
 /**
  * Retrieves the active item from the flattened nodes based on the provided focus item value.
  */
-var getActiveItem = exports.getActiveItem = function getActiveItem(focusItemValue, flattenedNodes, valueKey) {
-  var nodeData = null;
-  var activeNode = Object.values(flattenedNodes).find(function (node) {
-    return (0, _utils.shallowEqual)(node[valueKey], focusItemValue);
-  });
+const getActiveItem = (focusItemValue, flattenedNodes, valueKey) => {
+  let nodeData = null;
+  const activeNode = Object.values(flattenedNodes).find(node => (0, _utils.shallowEqual)(node[valueKey], focusItemValue));
   if (activeNode) {
     nodeData = activeNode;
   }
@@ -69,25 +68,29 @@ var getActiveItem = exports.getActiveItem = function getActiveItem(focusItemValu
  * Focuses on a specific tree node element.
  *
  */
-var focusTreeNode = exports.focusTreeNode = function focusTreeNode(refKey, treeNodeRefs) {
+exports.getActiveItem = getActiveItem;
+const focusTreeNode = (refKey, treeNodeRefs) => {
   var _treeItem$focus;
-  var treeItem = treeNodeRefs[refKey];
+  const treeItem = treeNodeRefs[refKey];
   treeItem === null || treeItem === void 0 || (_treeItem$focus = treeItem.focus) === null || _treeItem$focus === void 0 || _treeItem$focus.call(treeItem);
 };
+exports.focusTreeNode = focusTreeNode;
 /**
  * Focuses on the next item in a tree.
  */
-var focusNextItem = exports.focusNextItem = function focusNextItem(props) {
-  var focusItemValue = props.focusItemValue,
-    focusableItems = props.focusableItems,
-    treeNodesRefs = props.treeNodesRefs,
-    valueKey = props.valueKey;
-  var activeIndex = getActiveIndex(focusItemValue, focusableItems, valueKey);
+const focusNextItem = props => {
+  const {
+    focusItemValue,
+    focusableItems,
+    treeNodesRefs,
+    valueKey
+  } = props;
+  const activeIndex = getActiveIndex(focusItemValue, focusableItems, valueKey);
   if (focusableItems.length === 0) {
     return;
   }
-  var nextIndex = activeIndex === focusableItems.length - 1 ? 0 : activeIndex + 1;
-  var value = focusableItems[nextIndex][valueKey];
+  const nextIndex = activeIndex === focusableItems.length - 1 ? 0 : activeIndex + 1;
+  const value = focusableItems[nextIndex][valueKey];
   focusTreeNode(focusableItems[nextIndex].refKey, treeNodesRefs);
   return value;
 };
@@ -95,18 +98,21 @@ var focusNextItem = exports.focusNextItem = function focusNextItem(props) {
 /**
  * Focuses on the previous item in a tree.
  */
-var focusPreviousItem = exports.focusPreviousItem = function focusPreviousItem(props) {
-  var focusItemValue = props.focusItemValue,
-    focusableItems = props.focusableItems,
-    treeNodesRefs = props.treeNodesRefs,
-    valueKey = props.valueKey;
-  var activeIndex = getActiveIndex(focusItemValue, focusableItems, valueKey);
+exports.focusNextItem = focusNextItem;
+const focusPreviousItem = props => {
+  const {
+    focusItemValue,
+    focusableItems,
+    treeNodesRefs,
+    valueKey
+  } = props;
+  const activeIndex = getActiveIndex(focusItemValue, focusableItems, valueKey);
   if (focusableItems.length === 0) {
     return;
   }
-  var prevIndex = activeIndex === 0 ? focusableItems.length - 1 : activeIndex - 1;
+  let prevIndex = activeIndex === 0 ? focusableItems.length - 1 : activeIndex - 1;
   prevIndex = prevIndex >= 0 ? prevIndex : 0;
-  var value = focusableItems[prevIndex][valueKey];
+  const value = focusableItems[prevIndex][valueKey];
   focusTreeNode(focusableItems[prevIndex].refKey, treeNodesRefs);
   return value;
 };
@@ -114,12 +120,9 @@ var focusPreviousItem = exports.focusPreviousItem = function focusPreviousItem(p
 /**
  * Returns the index of the first visible node in the tree that matches the given value.
  */
-var getScrollToIndex = function getScrollToIndex(nodes, value, valueKey) {
-  return nodes.filter(function (n) {
-    return n.visible;
-  }).findIndex(function (item) {
-    return item[valueKey] === value;
-  });
+exports.focusPreviousItem = focusPreviousItem;
+const getScrollToIndex = (nodes, value, valueKey) => {
+  return nodes.filter(n => n.visible).findIndex(item => item[valueKey] === value);
 };
 /**
  * Scrolls the list to the active tree node.
@@ -127,25 +130,29 @@ var getScrollToIndex = function getScrollToIndex(nodes, value, valueKey) {
  * @param props - The props object containing the necessary parameters.
  */
 function scrollToActiveTreeNode(props) {
-  var list = props.list,
-    value = props.value,
-    valueKey = props.valueKey,
-    virtualized = props.virtualized,
-    formattedNodes = props.formattedNodes;
+  const {
+    list,
+    value,
+    valueKey,
+    virtualized,
+    formattedNodes
+  } = props;
   if (virtualized && value) {
     var _list$scrollToItem;
-    var scrollIndex = getScrollToIndex(formattedNodes, value, valueKey);
+    const scrollIndex = getScrollToIndex(formattedNodes, value, valueKey);
     list === null || list === void 0 || (_list$scrollToItem = list.scrollToItem) === null || _list$scrollToItem === void 0 || _list$scrollToItem.call(list, scrollIndex);
   }
 }
-var focusCurrentItem = exports.focusCurrentItem = function focusCurrentItem(props) {
-  var _props$selector = props.selector,
-    selector = _props$selector === void 0 ? SELECTED_TREEITEM_SELECTOR : _props$selector,
-    container = props.container;
-  var activeItem = container === null || container === void 0 ? void 0 : container.querySelector(selector);
+const focusCurrentItem = props => {
+  const {
+    selector = SELECTED_TREEITEM_SELECTOR,
+    container
+  } = props;
+  const activeItem = container === null || container === void 0 ? void 0 : container.querySelector(selector);
   if (activeItem) {
     var _activeItem$focus, _activeItem$dataset;
     activeItem === null || activeItem === void 0 || (_activeItem$focus = activeItem.focus) === null || _activeItem$focus === void 0 || _activeItem$focus.call(activeItem);
     return (_activeItem$dataset = activeItem.dataset) === null || _activeItem$dataset === void 0 ? void 0 : _activeItem$dataset.key;
   }
-};
+};
+exports.focusCurrentItem = focusCurrentItem;

package/cjs/Tree/utils/formatNodeRefKey.js

@@ -7,5 +7,5 @@ exports.formatNodeRefKey = formatNodeRefKey;
  * Formats the reference key for a tree node.
  */
 function formatNodeRefKey(value) {
-  return "" + (typeof value === 'number' ? 'Number_' : 'String_') + value;
+  return `${typeof value === 'number' ? 'Number_' : 'String_'}${value}`;
 }

package/cjs/Tree/utils/getExpandItemValues.js

@@ -7,11 +7,13 @@ exports.getExpandItemValues = getExpandItemValues;
  * Returns an array of expanded item values.
  */
 function getExpandItemValues(_ref) {
-  var node = _ref.node,
-    isExpand = _ref.isExpand,
-    expandItemValues = _ref.expandItemValues,
-    valueKey = _ref.valueKey;
-  var newExpandItemValues = new Set(expandItemValues);
+  let {
+    node,
+    isExpand,
+    expandItemValues,
+    valueKey
+  } = _ref;
+  const newExpandItemValues = new Set(expandItemValues);
   if (isExpand) {
     newExpandItemValues.add(node[valueKey]);
   } else {

package/cjs/Tree/utils/getNodeParentKeys.js

@@ -7,15 +7,15 @@ exports.getNodeParentKeys = getNodeParentKeys;
  * Retrieves an array of parent keys for a given node in a tree.
  */
 function getNodeParentKeys(nodes, node, valueKey) {
-  var parentKeys = [];
-  var _traverse = function traverse(node) {
+  const parentKeys = [];
+  const traverse = node => {
     var _node$parent;
     if (node !== null && node !== void 0 && (_node$parent = node.parent) !== null && _node$parent !== void 0 && _node$parent.refKey) {
       var _node$parent2;
-      _traverse(nodes[node.parent.refKey]);
+      traverse(nodes[node.parent.refKey]);
       parentKeys.push(node === null || node === void 0 || (_node$parent2 = node.parent) === null || _node$parent2 === void 0 ? void 0 : _node$parent2[valueKey]);
     }
   };
-  _traverse(node);
+  traverse(node);
   return parentKeys;
 }

package/cjs/Tree/utils/getTreeActiveNode.js

@@ -11,8 +11,8 @@ function getTreeActiveNode(nodes, value, valueKey) {
   if (typeof value === 'undefined') {
     return;
   }
-  for (var refKey in nodes) {
-    var node = nodes[refKey];
+  for (const refKey in nodes) {
+    const node = nodes[refKey];
     if ((0, _utils.shallowEqual)(node[valueKey], value)) {
       return node;
     }

package/cjs/Tree/utils/hasVisibleChildren.js

@@ -10,7 +10,5 @@ function hasVisibleChildren(node, childrenKey) {
   if (!Array.isArray(node[childrenKey])) {
     return false;
   }
-  return node[childrenKey].some(function (child) {
-    return child.visible;
-  });
+  return node[childrenKey].some(child => child.visible);
 }

package/cjs/Tree/utils/indentTreeNode.js

@@ -4,15 +4,17 @@
 exports.__esModule = true;
 exports.indentTreeNode = indentTreeNode;
 function indentTreeNode(rtl, layer, absolute) {
-  var _ref2;
   if (absolute === void 0) {
     absolute = false;
   }
   // layer start from 1
-  var offset = layer * 26;
+  const offset = layer * 26;
   if (absolute) {
-    var _ref;
-    return _ref = {}, _ref[rtl ? 'right' : 'left'] = offset, _ref;
+    return {
+      [rtl ? 'right' : 'left']: offset
+    };
   }
-  return _ref2 = {}, _ref2[rtl ? 'paddingRight' : 'paddingLeft'] = offset, _ref2;
+  return {
+    [rtl ? 'paddingRight' : 'paddingLeft']: offset
+  };
 }

package/cjs/Tree/utils/treeKeyboardInteractions.js

@@ -12,10 +12,12 @@ var _isEmpty = _interopRequireDefault(require("lodash/isEmpty"));
  * it moves the focus to the parent item.
  */
 function handleLeftArrow(props) {
-  var focusItem = props.focusItem,
-    expand = props.expand,
-    onExpand = props.onExpand,
-    onFocusItem = props.onFocusItem;
+  const {
+    focusItem,
+    expand,
+    onExpand,
+    onFocusItem
+  } = props;
   if ((0, _isEmpty.default)(focusItem)) {
     return;
   }
@@ -33,11 +35,13 @@ function handleLeftArrow(props) {
  * If the focused item does not have children, it does nothing.
  */
 function handleRightArrow(props) {
-  var focusItem = props.focusItem,
-    expand = props.expand,
-    childrenKey = props.childrenKey,
-    onExpand = props.onExpand,
-    onFocusItem = props.onFocusItem;
+  const {
+    focusItem,
+    expand,
+    childrenKey,
+    onExpand,
+    onFocusItem
+  } = props;
   if ((0, _isEmpty.default)(focusItem) || !Array.isArray(focusItem[childrenKey])) {
     return;
   }