@zat-design/sisyphus-react 3.7.3-beta.14 → 3.7.3-beta.16

package/lib/ProTree/components/Tree.d.ts

@@ -23,5 +23,5 @@ interface ListProps extends ProTreeProps {
     handleFilterClose?: (code: string, node?: any) => void;
     [key: string]: any;
 }
-declare function List(props: ListProps): JSX.Element;
+declare function List(props: ListProps): import("react/jsx-runtime").JSX.Element;
 export default List;

package/lib/ProTree/components/Tree.js

@@ -303,7 +303,7 @@ function List(props) {
     }, onlyKey);
   };
   function fn() {
-    var loop = function loop(data, index) {
+    var _loop = function loop(data, index) {
       index++;
       var treeRow = data.map(function (item) {
         var nodeClass = 'pro-tree-tree-node ';
@@ -325,7 +325,7 @@ function List(props) {
           return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, item), {}, {
             title: nodeTitle,
             key: (item === null || item === void 0 ? void 0 : item.key) || item[fieldNameValue],
-            children: loop(item[fieldNames.children], index)
+            children: _loop(item[fieldNames.children], index)
           });
         }
         return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, item), {}, {
@@ -342,7 +342,7 @@ function List(props) {
     if (searchStr) {
       newTreeData = (0, _utils.filterCheckedNodes)(originalTreeData, [], searchStr, fieldNames);
     }
-    return loop(newTreeData, -1);
+    return _loop(newTreeData, -1);
   }
   var _treeData = fn();
   var onExpand = function onExpand(newExpandedKeys, nextPara) {

package/lib/ProTree/index.d.ts

@@ -1,3 +1,3 @@
 import { ProTreeProps } from './propsType';
-declare const ProTreeHandle: (props: ProTreeProps) => JSX.Element;
+declare const ProTreeHandle: (props: ProTreeProps) => import("react/jsx-runtime").JSX.Element;
 export default ProTreeHandle;

package/lib/ProTree/utils.js

@@ -63,7 +63,7 @@ function getAllKeys(data, fieldNames) {
  * @param fieldNames
  * @returns
  */
-var getParentKey = exports.getParentKey = function getParentKey(key, tree, fieldNames) {
+var _getParentKey = exports.getParentKey = function getParentKey(key, tree, fieldNames) {
   var parentKey;
   for (var i = 0; i < tree.length; i++) {
     var node = tree[i];
@@ -72,8 +72,8 @@ var getParentKey = exports.getParentKey = function getParentKey(key, tree, field
         return item[fieldNames.value] === key;
       })) {
         parentKey = node[fieldNames.value];
-      } else if (getParentKey(key, node[fieldNames.children], fieldNames)) {
-        parentKey = getParentKey(key, node[fieldNames.children], fieldNames);
+      } else if (_getParentKey(key, node[fieldNames.children], fieldNames)) {
+        parentKey = _getParentKey(key, node[fieldNames.children], fieldNames);
       }
     }
   }
@@ -81,7 +81,7 @@ var getParentKey = exports.getParentKey = function getParentKey(key, tree, field
 };
 function findTreeNodeByKey(treeData, key, fieldNames) {
   var result = [];
-  var traverse = function traverse(node, parents) {
+  var _traverse = function traverse(node, parents) {
     if (node[fieldNames.value] === key) {
       result.push.apply(result, [node].concat((0, _toConsumableArray2.default)(parents)));
       return true;
@@ -92,7 +92,7 @@ function findTreeNodeByKey(treeData, key, fieldNames) {
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var child = _step.value;
-        if (traverse(child, [node].concat((0, _toConsumableArray2.default)(parents)))) {
+        if (_traverse(child, [node].concat((0, _toConsumableArray2.default)(parents)))) {
           return true;
         }
       }
@@ -108,7 +108,7 @@ function findTreeNodeByKey(treeData, key, fieldNames) {
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var node = _step2.value;
-      traverse(node, []);
+      _traverse(node, []);
     }
   } catch (err) {
     _iterator2.e(err);
@@ -127,23 +127,23 @@ function filterCheckedNodes(data, checkedKeys) {
   var searchStr = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';
   var fieldNames = arguments.length > 3 ? arguments[3] : undefined;
   var result = [];
-  var traverse = function traverse(node) {
+  var _traverse2 = function traverse(node) {
     var _node$fieldNames$chil3;
     var title = node[fieldNames.value] + node[fieldNames.label];
     if (!searchStr) {
       if (checkedKeys.includes(node[fieldNames.value])) {
         var _node$fieldNames$chil;
-        var _children = (node === null || node === void 0 ? void 0 : (_node$fieldNames$chil = node[fieldNames.children]) === null || _node$fieldNames$chil === void 0 ? void 0 : _node$fieldNames$chil.map(traverse).filter(Boolean)) || [];
+        var _children = (node === null || node === void 0 ? void 0 : (_node$fieldNames$chil = node[fieldNames.children]) === null || _node$fieldNames$chil === void 0 ? void 0 : _node$fieldNames$chil.map(_traverse2).filter(Boolean)) || [];
         return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, (0, _defineProperty2.default)({}, fieldNames.children, _children));
       }
     } else if ((title === null || title === void 0 ? void 0 : title.indexOf(searchStr)) > -1) {
       var _node$fieldNames$chil2;
-      var _children2 = ((_node$fieldNames$chil2 = node[fieldNames.children]) === null || _node$fieldNames$chil2 === void 0 ? void 0 : _node$fieldNames$chil2.map(traverse).filter(Boolean)) || [];
+      var _children2 = ((_node$fieldNames$chil2 = node[fieldNames.children]) === null || _node$fieldNames$chil2 === void 0 ? void 0 : _node$fieldNames$chil2.map(_traverse2).filter(Boolean)) || [];
       return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, {
         children: _children2
       });
     }
-    var children = (_node$fieldNames$chil3 = node[fieldNames.children]) === null || _node$fieldNames$chil3 === void 0 ? void 0 : _node$fieldNames$chil3.map(traverse).filter(Boolean);
+    var children = (_node$fieldNames$chil3 = node[fieldNames.children]) === null || _node$fieldNames$chil3 === void 0 ? void 0 : _node$fieldNames$chil3.map(_traverse2).filter(Boolean);
     if (children && children.length > 0) {
       return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, (0, _defineProperty2.default)({}, fieldNames.children, children));
     }
@@ -155,7 +155,7 @@ function filterCheckedNodes(data, checkedKeys) {
   try {
     for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
       var node = _step3.value;
-      var filtered = traverse(node);
+      var filtered = _traverse2(node);
       if (filtered) {
         result.push(filtered);
       }

package/lib/ProTreeModal/components/Cascader.d.ts

@@ -10,5 +10,5 @@ interface CascaderProps {
     handleOnChange?: (e: any, value: string) => void;
     optionRender?: (item: any, searchStr: string) => string | ReactNode;
 }
-declare const Cascader: (props: CascaderProps) => JSX.Element;
+declare const Cascader: (props: CascaderProps) => import("react/jsx-runtime").JSX.Element;
 export default Cascader;

package/lib/ProTreeModal/components/CloseIcon.d.ts

@@ -1,3 +1,2 @@
-/// <reference types="react" />
-declare function CloseIcon(props: any): JSX.Element;
+declare function CloseIcon(props: any): import("react/jsx-runtime").JSX.Element;
 export default CloseIcon;

package/lib/ProTreeModal/components/SearchTitle.d.ts

@@ -2,6 +2,6 @@
 declare function SearchTitle(props: {
     searchStr: string;
     label: string;
-}): JSX.Element;
+}): import("react/jsx-runtime").JSX.Element;
 declare const _default: import("react").MemoExoticComponent<typeof SearchTitle>;
 export default _default;

package/lib/ProTreeModal/components/Tree.js

@@ -65,7 +65,7 @@ function List(props, ref) {
   }, [searchStr]);
   var _treeData = (0, _react.useMemo)(function () {
     function fn() {
-      var loop = function loop(data, index) {
+      var _loop = function loop(data, index) {
         index++;
         return data.map(function (item) {
           var title = showCodeName ? "".concat(item[fieldNameValue], "-").concat(item[fieldNameLabel]) : item[fieldNameLabel];
@@ -90,7 +90,7 @@ function List(props, ref) {
                 })]
               }),
               key: item[fieldNameValue],
-              children: loop(item[fieldNames.children], index)
+              children: _loop(item[fieldNames.children], index)
             });
           }
           return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, item), {}, {
@@ -123,12 +123,12 @@ function List(props, ref) {
       if (searchStr) {
         newTreeData = (0, _utils.filterCheckedNodes)(originalTreeData, [], searchStr, fieldNames);
       }
-      return loop(newTreeData, -1);
+      return _loop(newTreeData, -1);
     }
     return fn();
   }, [searchStr, expandedKeys, showCodeName]);
   var treeViewData = (0, _react.useMemo)(function () {
-    var loop = function loop(data, index) {
+    var _loop2 = function loop(data, index) {
       index++;
       return data.map(function (item) {
         var title = showCodeName ? "".concat(item[fieldNameValue], "-").concat(item[fieldNameLabel]) : item[fieldNameLabel];
@@ -157,7 +157,7 @@ function List(props, ref) {
               })]
             }),
             key: item[fieldNameValue],
-            children: loop(item[fieldNames.children], index)
+            children: _loop2(item[fieldNames.children], index)
           });
         }
         return (0, _objectSpread2.default)((0, _objectSpread2.default)({}, item), {}, {
@@ -176,7 +176,7 @@ function List(props, ref) {
         });
       });
     };
-    return loop(treeData, -1);
+    return _loop2(treeData, -1);
   }, [treeData]);
   var onExpand = function onExpand(newExpandedKeys) {
     setExpandedKeys(newExpandedKeys);

package/lib/ProTreeModal/components/Trigger.d.ts

@@ -17,5 +17,5 @@ interface TriggerProps {
     handleClearAll: () => void;
     appointChange: (appoint?: boolean) => void;
 }
-declare function Trigger(props: TriggerProps): JSX.Element;
+declare function Trigger(props: TriggerProps): import("react/jsx-runtime").JSX.Element;
 export default Trigger;

package/lib/ProTreeModal/index.d.ts

@@ -1,5 +1,5 @@
 import { ProTreeModalProps } from './propsType';
 import './style/index.less';
 export declare const CASCADER = "CASCADER";
-declare const ProTreeModal: (props: ProTreeModalProps) => JSX.Element;
+declare const ProTreeModal: (props: ProTreeModalProps) => import("react/jsx-runtime").JSX.Element;
 export default ProTreeModal;

package/lib/ProTreeModal/utils.js

@@ -70,7 +70,7 @@ function getAllKeys(data, fieldNames) {
  * @param fieldNames
  * @returns
  */
-var getParentKey = exports.getParentKey = function getParentKey(key, tree, fieldNames) {
+var _getParentKey = exports.getParentKey = function getParentKey(key, tree, fieldNames) {
   var parentKey;
   for (var i = 0; i < tree.length; i++) {
     var node = tree[i];
@@ -79,8 +79,8 @@ var getParentKey = exports.getParentKey = function getParentKey(key, tree, field
         return item[fieldNames.value] === key;
       })) {
         parentKey = node[fieldNames.value];
-      } else if (getParentKey(key, node[fieldNames.children], fieldNames)) {
-        parentKey = getParentKey(key, node[fieldNames.children], fieldNames);
+      } else if (_getParentKey(key, node[fieldNames.children], fieldNames)) {
+        parentKey = _getParentKey(key, node[fieldNames.children], fieldNames);
       }
     }
   }
@@ -88,7 +88,7 @@ var getParentKey = exports.getParentKey = function getParentKey(key, tree, field
 };
 function findTreeNodeByKey(treeData, key, fieldNames) {
   var result = [];
-  var traverse = function traverse(node, parents) {
+  var _traverse = function traverse(node, parents) {
     if (node[fieldNames.value] === key) {
       result.push.apply(result, [node].concat((0, _toConsumableArray2.default)(parents)));
       return true;
@@ -99,7 +99,7 @@ function findTreeNodeByKey(treeData, key, fieldNames) {
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var child = _step.value;
-        if (traverse(child, [node].concat((0, _toConsumableArray2.default)(parents)))) {
+        if (_traverse(child, [node].concat((0, _toConsumableArray2.default)(parents)))) {
           return true;
         }
       }
@@ -115,7 +115,7 @@ function findTreeNodeByKey(treeData, key, fieldNames) {
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var node = _step2.value;
-      traverse(node, []);
+      _traverse(node, []);
     }
   } catch (err) {
     _iterator2.e(err);
@@ -134,23 +134,23 @@ function filterCheckedNodes(data, checkedKeys) {
   var searchStr = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '';
   var fieldNames = arguments.length > 3 ? arguments[3] : undefined;
   var result = [];
-  var traverse = function traverse(node) {
+  var _traverse2 = function traverse(node) {
     var _node$fieldNames$chil3;
     var title = node[fieldNames.value] + node[fieldNames.label];
     if (!searchStr) {
       if (checkedKeys.includes(node[fieldNames.value])) {
         var _node$fieldNames$chil;
-        var _children = (node === null || node === void 0 ? void 0 : (_node$fieldNames$chil = node[fieldNames.children]) === null || _node$fieldNames$chil === void 0 ? void 0 : _node$fieldNames$chil.map(traverse).filter(Boolean)) || [];
+        var _children = (node === null || node === void 0 ? void 0 : (_node$fieldNames$chil = node[fieldNames.children]) === null || _node$fieldNames$chil === void 0 ? void 0 : _node$fieldNames$chil.map(_traverse2).filter(Boolean)) || [];
         return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, (0, _defineProperty2.default)({}, fieldNames.children, _children));
       }
     } else if (title.indexOf(searchStr) > -1) {
       var _node$fieldNames$chil2;
-      var _children2 = ((_node$fieldNames$chil2 = node[fieldNames.children]) === null || _node$fieldNames$chil2 === void 0 ? void 0 : _node$fieldNames$chil2.map(traverse).filter(Boolean)) || [];
+      var _children2 = ((_node$fieldNames$chil2 = node[fieldNames.children]) === null || _node$fieldNames$chil2 === void 0 ? void 0 : _node$fieldNames$chil2.map(_traverse2).filter(Boolean)) || [];
       return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, {
         children: _children2
       });
     }
-    var children = (_node$fieldNames$chil3 = node[fieldNames.children]) === null || _node$fieldNames$chil3 === void 0 ? void 0 : _node$fieldNames$chil3.map(traverse).filter(Boolean);
+    var children = (_node$fieldNames$chil3 = node[fieldNames.children]) === null || _node$fieldNames$chil3 === void 0 ? void 0 : _node$fieldNames$chil3.map(_traverse2).filter(Boolean);
     if (children && children.length > 0) {
       return (0, _objectSpread4.default)((0, _objectSpread4.default)({}, node), {}, (0, _defineProperty2.default)({}, fieldNames.children, children));
     }
@@ -162,7 +162,7 @@ function filterCheckedNodes(data, checkedKeys) {
   try {
     for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
       var node = _step3.value;
-      var filtered = traverse(node);
+      var filtered = _traverse2(node);
       if (filtered) {
         result.push(filtered);
       }

package/lib/ProUpload/components/DraggableUploadListItem.d.ts

@@ -1,2 +1,2 @@
 import { DraggableUploadListItemProps } from '../propsType';
-export declare const DraggableUploadListItem: ({ file, children }: DraggableUploadListItemProps) => JSX.Element;
+export declare const DraggableUploadListItem: ({ file, children }: DraggableUploadListItemProps) => import("react/jsx-runtime").JSX.Element;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@zat-design/sisyphus-react",
-  "version": "3.7.3-beta.14",
+  "version": "3.7.3-beta.16",
   "license": "Apache-2.0",
   "main": "lib/index.js",
   "module": "es/index.js",