hc-busin-components 1.0.4 → 1.0.6

package/dist/Actions/index.js

@@ -1,19 +1,11 @@
 var _excluded = ["disabled", "children", "onClick", "style"],
-  _excluded2 = ["onClick", "disabled", "children"],
-  _excluded3 = ["onClick", "disabled", "style", "children"],
-  _excluded4 = ["onClick", "disabled", "children"];
-function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
-function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure 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; }
-function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
-function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+  _excluded2 = ["onClick", "disabled", "children"];
 function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
 function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
 function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
 import { MoreOutlined } from '@ant-design/icons';
 import { Divider, Dropdown, Space } from 'antd';
-import React, { useEffect, useState } from 'react';
+import React from 'react';
 import "./index.less";
 var LinkButton = function LinkButton(_ref) {
   var _ref$disabled = _ref.disabled,
@@ -28,29 +20,38 @@ var LinkButton = function LinkButton(_ref) {
     onClick: disabled ? undefined : onClick
   }, args), linkChildren);
 };
+var isLinkButtonElement = function isLinkButtonElement(item) {
+  return /*#__PURE__*/React.isValidElement(item) && item.type === LinkButton;
+};
+var normalizeChildren = function normalizeChildren(children) {
+  return React.Children.toArray(children).filter(React.isValidElement);
+};
+var renderInlineAction = function renderInlineAction(item, index) {
+  var _item$key2;
+  if (isLinkButtonElement(item)) {
+    var _item$key;
+    var _item$props = item.props,
+      onClick = _item$props.onClick,
+      _item$props$disabled = _item$props.disabled,
+      disabled = _item$props$disabled === void 0 ? false : _item$props$disabled,
+      linkChildren = _item$props.children,
+      rest = _objectWithoutProperties(_item$props, _excluded2);
+    return /*#__PURE__*/React.createElement(LinkButton, _extends({
+      key: (_item$key = item.key) !== null && _item$key !== void 0 ? _item$key : index,
+      onClick: onClick,
+      disabled: disabled
+    }, rest), linkChildren);
+  }
+  return /*#__PURE__*/React.createElement(React.Fragment, {
+    key: (_item$key2 = item.key) !== null && _item$key2 !== void 0 ? _item$key2 : index
+  }, item);
+};
 var Actions = function Actions(_ref2) {
   var children = _ref2.children,
     _ref2$threshold = _ref2.threshold,
     threshold = _ref2$threshold === void 0 ? 3 : _ref2$threshold;
-  var _useState = useState([]),
-    _useState2 = _slicedToArray(_useState, 2),
-    list = _useState2[0],
-    setList = _useState2[1];
-  useEffect(function () {
-    if (!children) {
-      setList([]);
-      return;
-    }
-    if (Array.isArray(children)) {
-      var lt = children.filter(function (item) {
-        return item !== null && typeof item !== 'boolean' && /*#__PURE__*/React.isValidElement(item);
-      });
-      setList(lt);
-    } else if ( /*#__PURE__*/React.isValidElement(children) && children.props.children) {
-      setList([children]);
-    } else {
-      setList([]);
-    }
+  var list = React.useMemo(function () {
+    return normalizeChildren(children);
   }, [children]);
   if (list.length <= threshold) {
     return /*#__PURE__*/React.createElement(Space, {
@@ -61,51 +62,10 @@ var Actions = function Actions(_ref2) {
       split: /*#__PURE__*/React.createElement(Divider, {
         type: "vertical"
       })
-    }, list.map(function (item, index) {
-      var _item$props = item.props,
-        onClick = _item$props.onClick,
-        _item$props$disabled = _item$props.disabled,
-        disabled = _item$props$disabled === void 0 ? false : _item$props$disabled,
-        linkChildren = _item$props.children,
-        rest = _objectWithoutProperties(_item$props, _excluded2);
-      return /*#__PURE__*/React.createElement(LinkButton, _extends({
-        key: index,
-        onClick: onClick,
-        disabled: disabled
-      }, rest), linkChildren);
-    }));
+    }, list.map(renderInlineAction));
   }
   var l1 = list.slice(0, threshold);
   var l2 = list.slice(threshold);
-  var items = l2.map(function (item, index) {
-    var _item$props2 = item.props,
-      onClick = _item$props2.onClick,
-      _item$props2$disabled = _item$props2.disabled,
-      disabled = _item$props2$disabled === void 0 ? false : _item$props2$disabled,
-      style = _item$props2.style,
-      labelChildren = _item$props2.children,
-      rest = _objectWithoutProperties(_item$props2, _excluded3);
-    void onClick;
-    return {
-      key: String(index),
-      disabled: disabled,
-      label: /*#__PURE__*/React.createElement("span", _extends({
-        className: disabled ? 'displayed-name' : '',
-        style: style
-      }, rest), labelChildren)
-    };
-  });
-  var onMenuClick = function onMenuClick(_ref3) {
-    var key = _ref3.key,
-      domEvent = _ref3.domEvent;
-    domEvent === null || domEvent === void 0 || domEvent.stopPropagation();
-    var idx = Number(key);
-    var item = l2[idx];
-    if (item && !item.props.disabled) {
-      var _item$props$onClick, _item$props3;
-      (_item$props$onClick = (_item$props3 = item.props).onClick) === null || _item$props$onClick === void 0 || _item$props$onClick.call(_item$props3);
-    }
-  };
   return /*#__PURE__*/React.createElement(Space, {
     align: "center",
     style: {
@@ -114,23 +74,22 @@ var Actions = function Actions(_ref2) {
     split: /*#__PURE__*/React.createElement(Divider, {
       type: "vertical"
     })
-  }, l1.map(function (item, index) {
-    var _item$props4 = item.props,
-      onClick = _item$props4.onClick,
-      _item$props4$disabled = _item$props4.disabled,
-      disabled = _item$props4$disabled === void 0 ? false : _item$props4$disabled,
-      linkChildren = _item$props4.children,
-      rest = _objectWithoutProperties(_item$props4, _excluded4);
-    return /*#__PURE__*/React.createElement(LinkButton, _extends({
-      key: index,
-      onClick: onClick,
-      disabled: disabled
-    }, rest), linkChildren);
-  }), /*#__PURE__*/React.createElement(Dropdown, {
+  }, l1.map(renderInlineAction), /*#__PURE__*/React.createElement(Dropdown, {
     trigger: ['click'],
-    menu: {
-      items: items,
-      onClick: onMenuClick
+    overlayClassName: "actions-dropdown",
+    dropdownRender: function dropdownRender() {
+      return /*#__PURE__*/React.createElement("div", {
+        className: "actions-dropdown-content",
+        onClick: function onClick(event) {
+          return event.stopPropagation();
+        }
+      }, l2.map(function (item, index) {
+        var _item$key3;
+        return /*#__PURE__*/React.createElement("div", {
+          key: (_item$key3 = item.key) !== null && _item$key3 !== void 0 ? _item$key3 : index,
+          className: "actions-dropdown-item"
+        }, renderInlineAction(item, index));
+      }));
     }
   }, /*#__PURE__*/React.createElement(MoreOutlined, {
     style: {

package/dist/Actions/index.less

@@ -7,3 +7,36 @@
   color: var(--ant-color-text-disabled);
   cursor: not-allowed;
 }
+
+.actions-dropdown-content {
+  display: inline-block;
+  width: fit-content;
+  min-width: unset;
+  max-width: max-content;
+  padding: 4px 0;
+  background: var(--ant-color-bg-elevated, #fff);
+  border-radius: var(--ant-border-radius-lg, 8px);
+  box-shadow: var(--ant-box-shadow-secondary, 0 6px 16px 0 rgb(0 0 0 / 8%));
+  overflow: hidden;
+}
+
+.actions-dropdown-item {
+  padding: 5px 12px;
+  white-space: nowrap;
+  line-height: 22px;
+  transition: background-color 0.2s;
+}
+
+.actions-dropdown-item:hover {
+  background: var(--ant-control-item-bg-hover, rgb(0 0 0 / 4%));
+}
+
+.actions-dropdown-item .name-link,
+.actions-dropdown-item .displayed-name {
+  display: inline-block;
+  width: 100%;
+}
+
+.actions-dropdown .ant-dropdown-arrow::before {
+  background: var(--ant-color-bg-elevated, #fff);
+}

package/dist/DeleteConfirm/index.js

@@ -47,6 +47,7 @@ var DeleteConfirm = function DeleteConfirm(props) {
   var common = _objectSpread(_objectSpread({}, deleteConfirmLocaleZhCN.common), antdLocale === null || antdLocale === void 0 ? void 0 : antdLocale.common);
   var deleteLabel = deleteText !== null && deleteText !== void 0 ? deleteText : common.delete;
   var cancelLabel = common.cancel;
+  var triggerClassName = [type === 'link' ? 'hc-delete-link-btn' : '', isIcon && isDelete ? 'hc-delete-icon-btn' : '', className].filter(Boolean).join(' ');
   if (disabled) {
     return /*#__PURE__*/React.createElement(Popover, {
       placement: placement,
@@ -58,7 +59,7 @@ var DeleteConfirm = function DeleteConfirm(props) {
     }, /*#__PURE__*/React.createElement(Button, {
       type: type,
       danger: danger,
-      className: className,
+      className: triggerClassName,
       disabled: true
     }, deleteLabel));
   }
@@ -93,7 +94,7 @@ var DeleteConfirm = function DeleteConfirm(props) {
     danger: danger,
     size: size,
     ghost: ghost,
-    className: ['hc-delete-icon-btn', className].filter(Boolean).join(' '),
+    className: triggerClassName,
     icon: /*#__PURE__*/React.createElement(Icon, {
       name: "v35_TrashCan"
     })
@@ -102,7 +103,7 @@ var DeleteConfirm = function DeleteConfirm(props) {
     danger: danger,
     size: size,
     ghost: ghost,
-    className: className
+    className: triggerClassName
   }, deleteLabel));
 };
 export { deleteConfirmLocaleZhCN } from "./locale";

package/dist/DeleteConfirm/index.less

@@ -42,3 +42,11 @@
     font-size: 16px;
   }
 }
+
+.hc-delete-link-btn {
+  &.ant-btn.ant-btn-link {
+    height: auto;
+    padding-inline: 0;
+    padding-block: 0;
+  }
+}

package/dist/PageHeader/index.less

@@ -1,7 +1,7 @@
 .page-header-enhance.ant-page-header {
   width: 100%;
   height: 56px;
-  padding: 16px 20px 0;
+  padding: 16px 0 0;
   background: #fff;
 
   .ant-page-header-heading {

package/dist/index.d.ts

@@ -54,5 +54,8 @@ export { default as CascaderCluster, cascaderClusterLocaleZhCN, CASCADER_CLUSTER
 export type { CascaderClusterProps, CascaderClusterTexts, CascaderClusterFilterCache, CascaderClusterStorage, CascaderClusterDataInterface, CascaderClusterServices, CascaderClusterRequest, } from './CascaderCluster';
 export { default as LogicalResourceFilter, logicalResourceLocaleZhCN } from './LogicalResourceFilter';
 export type { LogicalResourceFilterProps, LogicalResourceFilterTexts, LogicalResourceInitParams, LogicalResourceChangeValue, LogicalDatacenterItem, LogicalClusterItem, } from './LogicalResourceFilter';
+export { default as storage } from './utils/storage/index';
+export { default as tree } from './utils/tree/index';
+export type { TreeNode } from './utils/tree/index';
 import useTableParams from './CombinTable/hooks/useTableParams';
 export { useTableParams };

package/dist/index.js

@@ -31,5 +31,7 @@ export { default as IconPopTips } from "./IconPopTips";
 export { default as ComponentUninstalled, componentUninstalledLocaleZhCN } from "./ComponentUninstalled";
 export { default as CascaderCluster, cascaderClusterLocaleZhCN, CASCADER_CLUSTER_API, createCascaderClusterServices, buildCascaderClusterDataInterface } from "./CascaderCluster";
 export { default as LogicalResourceFilter, logicalResourceLocaleZhCN } from "./LogicalResourceFilter";
+export { default as storage } from "./utils/storage/index";
+export { default as tree } from "./utils/tree/index";
 import useTableParams from "./CombinTable/hooks/useTableParams";
 export { useTableParams };

package/dist/utils/storage/index.d.ts

@@ -0,0 +1,11 @@
+declare const _default: {
+    getLocal: (key: string) => any;
+    setLocal: (key: string, value: any) => void;
+    removeLocal: (key: string, isClear?: boolean) => void;
+    clearLocal: () => void;
+    getSession: (key: string, returnStr?: boolean | undefined) => any;
+    setSession: (key: string, value: any) => void;
+    removeSession: (key: string, isClear?: boolean) => void;
+    clearSession: () => void;
+};
+export default _default;

package/dist/utils/storage/index.js

@@ -0,0 +1,67 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+var getLocal = function getLocal(key) {
+  var value = window.localStorage.getItem(key) || '';
+  try {
+    return JSON.parse(value);
+  } catch (error) {
+    return value;
+  }
+};
+var setLocal = function setLocal(key, value) {
+  if (_typeof(value) === 'object' || Array.isArray(value)) {
+    window.localStorage.setItem(key, JSON.stringify(value));
+  } else {
+    window.localStorage.setItem(key, value);
+  }
+};
+var removeLocal = function removeLocal(key) {
+  var isClear = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  if (isClear) {
+    window.localStorage.clear();
+    return;
+  }
+  window.localStorage.removeItem(key);
+};
+var clearLocal = function clearLocal() {
+  window.localStorage.clear();
+};
+var getSession = function getSession(key, returnStr) {
+  var value = window.sessionStorage.getItem(key) || '';
+  if (returnStr) {
+    // 大数字存取 parse 丢失精度，如组织id
+    return value;
+  }
+  try {
+    return JSON.parse(value);
+  } catch (error) {
+    return value;
+  }
+};
+var setSession = function setSession(key, value) {
+  if (_typeof(value) === 'object' || Array.isArray(value)) {
+    window.sessionStorage.setItem(key, JSON.stringify(value));
+  } else {
+    window.sessionStorage.setItem(key, value);
+  }
+};
+var removeSession = function removeSession(key) {
+  var isClear = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  if (isClear) {
+    window.sessionStorage.clear();
+    return;
+  }
+  window.sessionStorage.removeItem(key);
+};
+var clearSession = function clearSession() {
+  window.sessionStorage.clear();
+};
+export default {
+  getLocal: getLocal,
+  setLocal: setLocal,
+  removeLocal: removeLocal,
+  clearLocal: clearLocal,
+  getSession: getSession,
+  setSession: setSession,
+  removeSession: removeSession,
+  clearSession: clearSession
+};

package/dist/utils/tree/index.d.ts

@@ -0,0 +1,59 @@
+/**
+ * 树节点的基础类型定义
+ */
+export interface TreeNode<T = any> {
+    id?: string | number;
+    children?: TreeNode<T>[];
+    [key: string]: any;
+}
+export declare const isLeaf: <T = any>(node: TreeNode<T>) => boolean;
+export declare const hasChildren: <T = any>(node: TreeNode<T>) => boolean;
+export declare const getFirstLeaf: <T = any>(node: TreeNode<T>) => TreeNode<T> | null;
+export declare const getAllLeaves: <T = any>(tree: TreeNode<T> | TreeNode<T>[]) => TreeNode<T>[];
+export declare function getKeyAllValues<T = any>(tree: TreeNode<T>[], key?: string): any[];
+export declare function findNodeInTree<T = any>(tree: TreeNode<T>[], key: string | undefined, value: any): TreeNode<T> | null;
+export declare const getNodeInTree: typeof findNodeInTree;
+export declare const findAllNodes: <T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: (node: TreeNode<T>) => boolean) => TreeNode<T>[];
+export declare const findParentNode: <T = any>(tree: TreeNode<T>[], predicate: string | number | ((node: TreeNode<T>) => boolean)) => TreeNode<T> | null;
+export declare const getNodePath: <T = any>(tree: TreeNode<T>[], predicate: string | number | ((node: TreeNode<T>) => boolean)) => TreeNode<T>[];
+export declare function flattenTree<T = any>(tree: TreeNode<T> | TreeNode<T>[], includeChildren?: boolean): TreeNode<T>[];
+export declare const arrayToTree: <T = any>(list: any[], options?: {
+    idKey?: string | undefined;
+    parentIdKey?: string | undefined;
+    childrenKey?: string | undefined;
+    rootParentId?: any;
+}) => TreeNode<T>[];
+export declare const filterTree: <T = any>(tree: TreeNode<T> | TreeNode<T>[], predicate: (node: TreeNode<T>) => boolean) => TreeNode<T>[];
+export declare const mapTree: <T = any, R = any>(tree: TreeNode<T> | TreeNode<T>[], mapper: (node: TreeNode<T>, parent?: TreeNode<R> | undefined) => TreeNode<R>) => TreeNode<R>[];
+export declare const traverseTree: <T = any>(tree: TreeNode<T> | TreeNode<T>[], callback: (node: TreeNode<T>, parent?: TreeNode<T> | undefined) => void | boolean, parent?: TreeNode<T> | undefined) => void;
+export declare const traverseTreePostorder: <T = any>(tree: TreeNode<T> | TreeNode<T>[], callback: (node: TreeNode<T>, parent?: TreeNode<T> | undefined) => void) => void;
+export declare const getTreeDepth: <T = any>(tree: TreeNode<T> | TreeNode<T>[]) => number;
+export declare const cloneTree: <T = any>(tree: TreeNode<T> | TreeNode<T>[]) => TreeNode<T> | TreeNode<T>[];
+export declare const sortTree: <T = any>(tree: TreeNode<T> | TreeNode<T>[], compareFn: (a: TreeNode<T>, b: TreeNode<T>) => number, recursive?: boolean) => TreeNode<T>[];
+declare const tree: {
+    arrayToTree: <T = any>(list: any[], options?: {
+        idKey?: string | undefined;
+        parentIdKey?: string | undefined;
+        childrenKey?: string | undefined;
+        rootParentId?: any;
+    }) => TreeNode<T>[];
+    cloneTree: <T_1 = any>(tree: TreeNode<T_1> | TreeNode<T_1>[]) => TreeNode<T_1> | TreeNode<T_1>[];
+    filterTree: <T_2 = any>(tree: TreeNode<T_2> | TreeNode<T_2>[], predicate: (node: TreeNode<T_2>) => boolean) => TreeNode<T_2>[];
+    findAllNodes: <T_3 = any>(tree: TreeNode<T_3> | TreeNode<T_3>[], predicate: (node: TreeNode<T_3>) => boolean) => TreeNode<T_3>[];
+    findNodeInTree: typeof findNodeInTree;
+    findParentNode: <T_4 = any>(tree: TreeNode<T_4>[], predicate: string | number | ((node: TreeNode<T_4>) => boolean)) => TreeNode<T_4> | null;
+    flattenTree: typeof flattenTree;
+    getAllLeaves: <T_5 = any>(tree: TreeNode<T_5> | TreeNode<T_5>[]) => TreeNode<T_5>[];
+    getFirstLeaf: <T_6 = any>(node: TreeNode<T_6>) => TreeNode<T_6> | null;
+    getKeyAllValues: typeof getKeyAllValues;
+    getNodeInTree: typeof findNodeInTree;
+    getNodePath: <T_7 = any>(tree: TreeNode<T_7>[], predicate: string | number | ((node: TreeNode<T_7>) => boolean)) => TreeNode<T_7>[];
+    getTreeDepth: <T_8 = any>(tree: TreeNode<T_8> | TreeNode<T_8>[]) => number;
+    hasChildren: <T_9 = any>(node: TreeNode<T_9>) => boolean;
+    isLeaf: <T_10 = any>(node: TreeNode<T_10>) => boolean;
+    mapTree: <T_11 = any, R = any>(tree: TreeNode<T_11> | TreeNode<T_11>[], mapper: (node: TreeNode<T_11>, parent?: TreeNode<R> | undefined) => TreeNode<R>) => TreeNode<R>[];
+    sortTree: <T_12 = any>(tree: TreeNode<T_12> | TreeNode<T_12>[], compareFn: (a: TreeNode<T_12>, b: TreeNode<T_12>) => number, recursive?: boolean) => TreeNode<T_12>[];
+    traverseTree: <T_13 = any>(tree: TreeNode<T_13> | TreeNode<T_13>[], callback: (node: TreeNode<T_13>, parent?: TreeNode<T_13> | undefined) => void | boolean, parent?: TreeNode<T_13> | undefined) => void;
+    traverseTreePostorder: <T_14 = any>(tree: TreeNode<T_14> | TreeNode<T_14>[], callback: (node: TreeNode<T_14>, parent?: TreeNode<T_14> | undefined) => void) => void;
+};
+export default tree;

package/dist/utils/tree/index.js

@@ -0,0 +1,375 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
+function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
+function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
+function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
+function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+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; }
+/**
+ * 树节点的基础类型定义
+ */
+
+export var isLeaf = function isLeaf(node) {
+  return !node.children || node.children.length === 0;
+};
+export var hasChildren = function hasChildren(node) {
+  return !isLeaf(node);
+};
+export var getFirstLeaf = function getFirstLeaf(node) {
+  if (!node) return null;
+  if (isLeaf(node)) {
+    return node;
+  }
+  return getFirstLeaf(node.children[0]);
+};
+export var getAllLeaves = function getAllLeaves(tree) {
+  var leaves = [];
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var traverse = function traverse(node) {
+    if (isLeaf(node)) {
+      leaves.push(node);
+    } else if (node.children) {
+      node.children.forEach(function (child) {
+        return traverse(child);
+      });
+    }
+  };
+  nodes.forEach(function (node) {
+    return traverse(node);
+  });
+  return leaves;
+};
+export function getKeyAllValues(tree) {
+  var key = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'id';
+  var result = [];
+  var collect = function collect(nodes) {
+    var _iterator = _createForOfIteratorHelper(nodes),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var item = _step.value;
+        result.push(item[key]);
+        if (item.children && item.children.length > 0) {
+          collect(item.children);
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+  };
+  collect(tree);
+  return result;
+}
+export function findNodeInTree(tree) {
+  var key = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'id';
+  var value = arguments.length > 2 ? arguments[2] : undefined;
+  var _iterator2 = _createForOfIteratorHelper(tree),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var item = _step2.value;
+      if (item[key] === value) {
+        return item;
+      }
+      if (item.children && item.children.length > 0) {
+        var result = findNodeInTree(item.children, key, value);
+        if (result) {
+          return result;
+        }
+      }
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  return null;
+}
+export var getNodeInTree = findNodeInTree;
+export var findAllNodes = function findAllNodes(tree, predicate) {
+  var result = [];
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var traverse = function traverse(node) {
+    if (predicate(node)) {
+      result.push(node);
+    }
+    if (node.children) {
+      node.children.forEach(function (child) {
+        return traverse(child);
+      });
+    }
+  };
+  nodes.forEach(function (node) {
+    return traverse(node);
+  });
+  return result;
+};
+export var findParentNode = function findParentNode(tree, predicate) {
+  var matchFn = typeof predicate === 'function' ? predicate : function (node) {
+    return node.id === predicate;
+  };
+  var traverse = function traverse(nodes) {
+    var parent = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
+    var _iterator3 = _createForOfIteratorHelper(nodes),
+      _step3;
+    try {
+      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+        var _node = _step3.value;
+        if (matchFn(_node)) {
+          return parent;
+        }
+        if (_node.children && _node.children.length > 0) {
+          var result = traverse(_node.children, _node);
+          if (result !== null) {
+            return result;
+          }
+        }
+      }
+    } catch (err) {
+      _iterator3.e(err);
+    } finally {
+      _iterator3.f();
+    }
+    return null;
+  };
+  return traverse(tree);
+};
+export var getNodePath = function getNodePath(tree, predicate) {
+  var matchFn = typeof predicate === 'function' ? predicate : function (node) {
+    return node.id === predicate;
+  };
+  var path = [];
+  var traverse = function traverse(nodes) {
+    var _iterator4 = _createForOfIteratorHelper(nodes),
+      _step4;
+    try {
+      for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
+        var _node2 = _step4.value;
+        path.push(_node2);
+        if (matchFn(_node2)) {
+          return true;
+        }
+        if (_node2.children && _node2.children.length > 0) {
+          if (traverse(_node2.children)) {
+            return true;
+          }
+        }
+        path.pop();
+      }
+    } catch (err) {
+      _iterator4.e(err);
+    } finally {
+      _iterator4.f();
+    }
+    return false;
+  };
+  traverse(tree);
+  return path;
+};
+export function flattenTree(tree) {
+  var includeChildren = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+  var result = [];
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var traverse = function traverse(nodes) {
+    var _iterator5 = _createForOfIteratorHelper(nodes),
+      _step5;
+    try {
+      for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
+        var item = _step5.value;
+        if (includeChildren) {
+          result.push(item);
+        } else {
+          var rest = _objectSpread({}, item);
+          delete rest.children;
+          result.push(rest);
+        }
+        if (item.children && item.children.length > 0) {
+          traverse(item.children);
+        }
+      }
+    } catch (err) {
+      _iterator5.e(err);
+    } finally {
+      _iterator5.f();
+    }
+  };
+  traverse(nodes);
+  return result;
+}
+export var arrayToTree = function arrayToTree(list) {
+  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  var _options$idKey = options.idKey,
+    idKey = _options$idKey === void 0 ? 'id' : _options$idKey,
+    _options$parentIdKey = options.parentIdKey,
+    parentIdKey = _options$parentIdKey === void 0 ? 'parentId' : _options$parentIdKey,
+    _options$childrenKey = options.childrenKey,
+    childrenKey = _options$childrenKey === void 0 ? 'children' : _options$childrenKey,
+    _options$rootParentId = options.rootParentId,
+    rootParentId = _options$rootParentId === void 0 ? null : _options$rootParentId;
+  var tree = [];
+  var map = new Map();
+  list.forEach(function (item) {
+    map.set(item[idKey], _objectSpread(_objectSpread({}, item), {}, _defineProperty({}, childrenKey, [])));
+  });
+  list.forEach(function (item) {
+    var node = map.get(item[idKey]);
+    var parentId = item[parentIdKey];
+    if (parentId === rootParentId || parentId === undefined) {
+      tree.push(node);
+    } else {
+      var _parent = map.get(parentId);
+      if (_parent) {
+        _parent[childrenKey].push(node);
+      }
+    }
+  });
+  return tree;
+};
+export var filterTree = function filterTree(tree, predicate) {
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var filter = function filter(nodes) {
+    return nodes.reduce(function (acc, node) {
+      var newNode = _objectSpread({}, node);
+      if (node.children) {
+        newNode.children = filter(node.children);
+      }
+      if (predicate(node) || newNode.children && newNode.children.length > 0) {
+        acc.push(newNode);
+      }
+      return acc;
+    }, []);
+  };
+  return filter(nodes);
+};
+export var mapTree = function mapTree(tree, mapper) {
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var map = function map(nodes, parent) {
+    return nodes.map(function (node) {
+      var newNode = mapper(node, parent);
+      if (node.children && node.children.length > 0) {
+        newNode.children = map(node.children, newNode);
+      }
+      return newNode;
+    });
+  };
+  return map(nodes);
+};
+export var traverseTree = function traverseTree(tree, callback, parent) {
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var _iterator6 = _createForOfIteratorHelper(nodes),
+    _step6;
+  try {
+    for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
+      var _node3 = _step6.value;
+      var result = callback(_node3, parent);
+      if (result === false) {
+        return;
+      }
+      if (_node3.children && _node3.children.length > 0) {
+        traverseTree(_node3.children, callback, _node3);
+      }
+    }
+  } catch (err) {
+    _iterator6.e(err);
+  } finally {
+    _iterator6.f();
+  }
+};
+export var traverseTreePostorder = function traverseTreePostorder(tree, callback) {
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  var traverse = function traverse(nodes, parent) {
+    var _iterator7 = _createForOfIteratorHelper(nodes),
+      _step7;
+    try {
+      for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
+        var _node4 = _step7.value;
+        if (_node4.children && _node4.children.length > 0) {
+          traverse(_node4.children, _node4);
+        }
+        callback(_node4, parent);
+      }
+    } catch (err) {
+      _iterator7.e(err);
+    } finally {
+      _iterator7.f();
+    }
+  };
+  traverse(nodes);
+};
+export var getTreeDepth = function getTreeDepth(tree) {
+  var nodes = Array.isArray(tree) ? tree : [tree];
+  if (nodes.length === 0) return 0;
+  var getDepth = function getDepth(node) {
+    if (isLeaf(node)) {
+      return 1;
+    }
+    return 1 + Math.max.apply(Math, _toConsumableArray(node.children.map(function (child) {
+      return getDepth(child);
+    })));
+  };
+  return Math.max.apply(Math, _toConsumableArray(nodes.map(function (node) {
+    return getDepth(node);
+  })));
+};
+export var cloneTree = function cloneTree(tree) {
+  var nodes = Array.isArray(tree) ? tree : tree;
+  var isArray = Array.isArray(tree);
+  var clone = function clone(node) {
+    var newNode = _objectSpread({}, node);
+    if (node.children && node.children.length > 0) {
+      newNode.children = node.children.map(function (child) {
+        return clone(child);
+      });
+    }
+    return newNode;
+  };
+  if (isArray) {
+    return nodes.map(function (node) {
+      return clone(node);
+    });
+  }
+  return clone(nodes);
+};
+export var sortTree = function sortTree(tree, compareFn) {
+  var recursive = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+  var nodes = Array.isArray(tree) ? _toConsumableArray(tree) : [_objectSpread({}, tree)];
+  nodes.sort(compareFn);
+  if (recursive) {
+    nodes.forEach(function (node) {
+      if (node.children && node.children.length > 0) {
+        node.children = sortTree(node.children, compareFn, recursive);
+      }
+    });
+  }
+  return nodes;
+};
+var tree = {
+  arrayToTree: arrayToTree,
+  cloneTree: cloneTree,
+  filterTree: filterTree,
+  findAllNodes: findAllNodes,
+  findNodeInTree: findNodeInTree,
+  findParentNode: findParentNode,
+  flattenTree: flattenTree,
+  getAllLeaves: getAllLeaves,
+  getFirstLeaf: getFirstLeaf,
+  getKeyAllValues: getKeyAllValues,
+  getNodeInTree: getNodeInTree,
+  getNodePath: getNodePath,
+  getTreeDepth: getTreeDepth,
+  hasChildren: hasChildren,
+  isLeaf: isLeaf,
+  mapTree: mapTree,
+  sortTree: sortTree,
+  traverseTree: traverseTree,
+  traverseTreePostorder: traverseTreePostorder
+};
+export default tree;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "hc-busin-components",
-  "version": "1.0.4",
+  "version": "1.0.6",
   "description": "",
   "module": "dist/index.js",
   "types": "dist/index.d.ts",