ds-web-all 1.0.0

package/lib/components/compose-tree/hooks/use-compose-tree.js

@@ -0,0 +1,606 @@
+"use strict";
+
+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); }
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = exports.SPLITTER = exports.ComposeTreeContext = void 0;
+var _react = _interopRequireWildcard(require("react"));
+var _reactRouterDom = require("react-router-dom");
+var _lodash = require("lodash");
+var _moduleMap = _interopRequireDefault(require("../../../common/module-map"));
+var _services = _interopRequireDefault(require("../../../services"));
+var _useUnmounted3 = _interopRequireDefault(require("../../../common/use-unmounted"));
+var _utils = require("../utils");
+var _excluded = ["key", "children"],
+  _excluded2 = ["data"],
+  _excluded3 = ["children"];
+/* eslint-disable no-plusplus */
+/* eslint-disable no-unused-expressions */
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != _typeof(e) && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
+function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
+function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _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(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
+function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
+function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _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(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; }
+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(r) { if (Array.isArray(r)) return r; }
+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(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : 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 _objectWithoutProperties(e, t) { if (null == e) return {}; var o, r, i = _objectWithoutPropertiesLoose(e, t); if (Object.getOwnPropertySymbols) { var s = Object.getOwnPropertySymbols(e); for (r = 0; r < s.length; r++) o = s[r], t.includes(o) || {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]); } return i; }
+function _objectWithoutPropertiesLoose(r, e) { if (null == r) return {}; var t = {}; for (var n in r) if ({}.hasOwnProperty.call(r, n)) { if (e.includes(n)) continue; t[n] = r[n]; } return t; }
+var SPLITTER = exports.SPLITTER = ':';
+function generateTreeNodesWithUid(dataSource, cached) {
+  if (!dataSource) return dataSource;
+  // 后端返回的 key 可能会有重复，如果直接作为树节点的 key 会导致渲染异常，因此将 key 存到 id 字段上
+  return dataSource.map(function (_ref) {
+    var key = _ref.key,
+      children = _ref.children,
+      others = _objectWithoutProperties(_ref, _excluded);
+    var _nodeId = "".concat(key);
+    // 如果缓存中有该值，则使用缓存的 cache，以免树组件重新渲染
+    var matchedCache = cached ? cached.find(function (_) {
+      return _.id === _nodeId;
+    }) : null;
+    return _objectSpread(_objectSpread({}, others), {}, {
+      key: matchedCache ? matchedCache.key : (0, _utils.getUid)(),
+      id: _nodeId,
+      children: generateTreeNodesWithUid(children)
+    });
+  });
+}
+var _default = exports.default = function _default(_ref2) {
+  var request = _ref2.request,
+    extendModuleMap = _ref2.extendModuleMap,
+    _ref2$firstLoadAll = _ref2.firstLoadAll,
+    firstLoadAll = _ref2$firstLoadAll === void 0 ? false : _ref2$firstLoadAll,
+    _ref2$expandAllTree = _ref2.expandAllTree,
+    expandAllTree = _ref2$expandAllTree === void 0 ? true : _ref2$expandAllTree,
+    _ref2$typeKey = _ref2.typeKey,
+    typeKey = _ref2$typeKey === void 0 ? 'type' : _ref2$typeKey,
+    _ref2$groupTypeList = _ref2.groupTypeList,
+    groupTypeList = _ref2$groupTypeList === void 0 ? [] : _ref2$groupTypeList,
+    _ref2$requestDataForm = _ref2.requestDataFormatter,
+    requestDataFormatter = _ref2$requestDataForm === void 0 ? function (data) {
+      return data.dataSource;
+    } : _ref2$requestDataForm;
+  var match = (0, _reactRouterDom.useRouteMatch)();
+  var history = (0, _reactRouterDom.useHistory)();
+  var _useUnmounted = (0, _useUnmounted3.default)(),
+    _useUnmounted2 = _slicedToArray(_useUnmounted, 1),
+    unmounted = _useUnmounted2[0];
+  var getTreeNodes = request.getTreeNodes;
+  var path = match.path,
+    params = match.params;
+  var _useState = (0, _react.useState)([]),
+    _useState2 = _slicedToArray(_useState, 2),
+    dataSource = _useState2[0],
+    setDataSource = _useState2[1];
+  var _useState3 = (0, _react.useState)(false),
+    _useState4 = _slicedToArray(_useState3, 2),
+    firstLoaded = _useState4[0],
+    setFirstLoaded = _useState4[1];
+  var _useState5 = (0, _react.useState)(0),
+    _useState6 = _slicedToArray(_useState5, 2),
+    code = _useState6[0],
+    setDataCode = _useState6[1];
+  // 命中这一级的路由 path，要去掉星号
+  var pathPrefix = path.replace(/[/*]+$/, '');
+  var pathPrefixWithParam = /\/:treePath/.test(pathPrefix) ? pathPrefix : "".concat(pathPrefix, "/:treePath");
+  var treePath = params.treePath;
+  var _paths = treePath ? treePath.split(SPLITTER) : [];
+  var unMounted = (0, _react.useRef)(false);
+  // dataSource 中间态，稳定后 set 到 dataSource 中，以解决递归、异步、setState 协同的问题。
+  var cachedDataSource = (0, _react.useRef)([]);
+  var _useState7 = (0, _react.useState)(null),
+    _useState8 = _slicedToArray(_useState7, 2),
+    activeParams = _useState8[0],
+    setActiveParams = _useState8[1];
+  // const [selectedKeys, setSelectedKeys] = useState<TreeNodeKey[]>(
+  //   _paths.slice(-1)
+  // );
+  var _useState9 = (0, _react.useState)([]),
+    _useState10 = _slicedToArray(_useState9, 2),
+    _expandedKeys = _useState10[0],
+    _setExpandedKeys = _useState10[1];
+  var _useState11 = (0, _react.useState)({}),
+    _useState12 = _slicedToArray(_useState11, 2),
+    nowExpandedNode = _useState12[0],
+    setNowExpandedNode = _useState12[1];
+  var _useState13 = (0, _react.useState)(false),
+    _useState14 = _slicedToArray(_useState13, 2),
+    isSearch = _useState14[0],
+    setIsSearch = _useState14[1];
+  var expandedKeys = (0, _react.useRef)([]);
+  var setExpandedKeys = function setExpandedKeys(nextExpandedKeys) {
+    var _nextExpandedKeys = Array.from(new Set(nextExpandedKeys));
+    expandedKeys.current = _nextExpandedKeys;
+    _setExpandedKeys(_nextExpandedKeys);
+  };
+  var _activeId = _paths.slice(-1)[0];
+  (0, _react.useLayoutEffect)(function () {
+    if (!_activeId) {
+      return;
+    }
+    cachedDataSource.current.length && loadDataByTreePath(_paths, false).then(function () {
+      setDataSource(cachedDataSource.current);
+      // console.log('cachedDataSource.current', cachedDataSource.current);
+    });
+  }, [_activeId]);
+
+  // 计算路由
+  // 如果没有指定下级 module，则默认选中第一个 tree 根节点
+  (0, _react.useEffect)(function () {
+    unMounted.current = false;
+    setFirstLoaded(false);
+    // tslint:disable-next-line: no-floating-promises
+    _fetchTreeNodes(null, (0, _lodash.get)(_paths, 0)).then(function () {
+      if (firstLoadAll && expandAllTree) {
+        var allKeys = [];
+        var queue = _toConsumableArray(cachedDataSource.current);
+        while (queue.length > 0) {
+          var _el$children;
+          var el = queue.shift();
+          if ((el === null || el === void 0 ? void 0 : (_el$children = el.children) === null || _el$children === void 0 ? void 0 : _el$children.length) > 0) {
+            allKeys.push(el.key);
+            queue.push.apply(queue, _toConsumableArray(el.children));
+          }
+        }
+        setExpandedKeys(allKeys);
+      }
+      // console.log('获取初始 tree 数据完成');
+      // 如果没有指定路径，深度优先搜索 type不在 groupTypeList 中的第一个
+      if (!treePath) {
+        var _queue = [_toConsumableArray(cachedDataSource.current)];
+        var nodeList = [];
+        var level = 0;
+        while (level > -1 && _queue.length > 0) {
+          var _el$children2;
+          var _el = _queue[level].shift();
+          if (!groupTypeList.includes(_el[typeKey])) {
+            nodeList.push(_el);
+            break;
+          }
+          if ((_el === null || _el === void 0 ? void 0 : (_el$children2 = _el.children) === null || _el$children2 === void 0 ? void 0 : _el$children2.length) > 0) {
+            nodeList.push(_el);
+            _queue.push(_toConsumableArray(_el.children));
+            level++;
+          } else {
+            while (level > -1 && _queue[level].length === 0) {
+              nodeList.pop();
+              _queue.pop();
+              level--;
+            }
+          }
+        }
+        if (nodeList.length > 0) {
+          goToModule(nodeList[nodeList.length - 1], nodeList.map(function (el) {
+            return el.id;
+          }).join(SPLITTER), true);
+        }
+        return;
+      }
+      // tslint:disable-next-line: no-floating-promises
+      if (!firstLoadAll) {
+        loadTreeByPath(_paths, cachedDataSource.current, '0', true).then(function () {
+          setDataSource(cachedDataSource.current);
+        });
+      }
+    }).finally(function () {
+      setFirstLoaded(true);
+    });
+    return function () {
+      unMounted.current = true;
+    };
+  }, []);
+  function getModuleType(type) {
+    return extendModuleMap && extendModuleMap[type] || _moduleMap.default[type];
+  }
+  function generateUrlByTreePaths(nextTreePaths) {
+    var nextPath = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : path;
+    return (0, _reactRouterDom.generatePath)(nextPath, {
+      treePath: nextTreePaths.join(SPLITTER)
+    }).replace(/\$%7B([\w.]+)%7D/g, function (_, $1) {
+      return "${".concat($1, "}");
+    });
+  }
+
+  /**
+   * 重新加载树节点内容
+   */
+  function reloadTree() {
+    // tslint:disable-next-line: no-floating-promises
+    loadTreeByPath(_paths, cachedDataSource.current, '0', true).then(function () {
+      setDataSource(cachedDataSource.current);
+    });
+  }
+
+  /**
+   *
+   * @param idPaths 剩余的需要获取树内容的 id 列表
+   * @param traverser 当前遍历所在层级的节点列表
+   * @param pos 当前层级的序号路径
+   * @param forceUpdate 是否强制更新，如果为 true，则强制获取子节点
+   */
+  function loadTreeByPath(_x, _x2, _x3) {
+    return _loadTreeByPath.apply(this, arguments);
+  }
+  function _loadTreeByPath() {
+    _loadTreeByPath = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee(idPaths, traverser, pos) {
+      var forceUpdate,
+        id,
+        matchedIndex,
+        currentNode,
+        nodeList,
+        _args = arguments;
+      return _regeneratorRuntime().wrap(function _callee$(_context) {
+        while (1) switch (_context.prev = _context.next) {
+          case 0:
+            forceUpdate = _args.length > 3 && _args[3] !== undefined ? _args[3] : false;
+            if (!(unMounted.current || !idPaths.length)) {
+              _context.next = 3;
+              break;
+            }
+            return _context.abrupt("return");
+          case 3:
+            id = idPaths[0];
+            matchedIndex = traverser.findIndex(function (_) {
+              return _.id === id;
+            });
+            if (!(matchedIndex < 0)) {
+              _context.next = 8;
+              break;
+            }
+            console.error('找不到 url 中匹配的树节点', id, traverser);
+            // 找不到匹配的节点，就拉倒了
+            return _context.abrupt("return");
+          case 8:
+            currentNode = traverser[matchedIndex];
+            setNowExpandedNode(currentNode);
+            // 获取最后一个节点的 params
+            if (idPaths.length === 1) {
+              // 获取相应的 params
+              setActiveParams(currentNode.params || {});
+            }
+            pos += "-".concat(matchedIndex);
+            _context.next = 14;
+            return loadDataWithReturn({
+              id: id,
+              pos: pos,
+              params: currentNode.params,
+              // 传入目标节点的 children，如果有值就不重新发请求获取；如果强制更新，则不传
+              children: forceUpdate ? null : currentNode.children
+            }, idPaths[1]);
+          case 14:
+            nodeList = _context.sent;
+            _context.next = 17;
+            return loadTreeByPath(idPaths.slice(1), nodeList, pos, forceUpdate);
+          case 17:
+            setExpandedKeys([].concat(_toConsumableArray(expandedKeys.current), [currentNode.key]));
+          case 18:
+          case "end":
+            return _context.stop();
+        }
+      }, _callee);
+    }));
+    return _loadTreeByPath.apply(this, arguments);
+  }
+  function loadDataWithReturn(_x4, _x5) {
+    return _loadDataWithReturn.apply(this, arguments);
+  }
+  function _loadDataWithReturn() {
+    _loadDataWithReturn = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee2(node, idToMatch) {
+      var children, result;
+      return _regeneratorRuntime().wrap(function _callee2$(_context2) {
+        while (1) switch (_context2.prev = _context2.next) {
+          case 0:
+            // 已经有子节点了，不再重复获取
+            children = node.children;
+            if (!children) {
+              _context2.next = 5;
+              break;
+            }
+            return _context2.abrupt("return", children);
+          case 5:
+            if (!firstLoadAll) {
+              _context2.next = 7;
+              break;
+            }
+            return _context2.abrupt("return", []);
+          case 7:
+            _context2.next = 9;
+            return _fetchTreeNodes(node, idToMatch);
+          case 9:
+            result = _context2.sent;
+            return _context2.abrupt("return", result);
+          case 11:
+          case "end":
+            return _context2.stop();
+        }
+      }, _callee2);
+    }));
+    return _loadDataWithReturn.apply(this, arguments);
+  }
+  function loadData(_x6) {
+    return _loadData.apply(this, arguments);
+  }
+  function _loadData() {
+    _loadData = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee3(node) {
+      return _regeneratorRuntime().wrap(function _callee3$(_context3) {
+        while (1) switch (_context3.prev = _context3.next) {
+          case 0:
+            _context3.next = 2;
+            return loadDataWithReturn(node);
+          case 2:
+            setDataSource(cachedDataSource.current);
+            setExpandedKeys([].concat(_toConsumableArray(expandedKeys.current), [node.key]));
+            // console.log("loadData->setDataSource", cachedDataSource.current)
+          case 4:
+          case "end":
+            return _context3.stop();
+        }
+      }, _callee3);
+    }));
+    return _loadData.apply(this, arguments);
+  }
+  function loadDataByTreePath() {
+    return _loadDataByTreePath.apply(this, arguments);
+  }
+  function _loadDataByTreePath() {
+    _loadDataByTreePath = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee4() {
+      var idList,
+        forceUpdate,
+        traverser,
+        indexList,
+        keyList,
+        targetPath,
+        _args4 = arguments;
+      return _regeneratorRuntime().wrap(function _callee4$(_context4) {
+        while (1) switch (_context4.prev = _context4.next) {
+          case 0:
+            idList = _args4.length > 0 && _args4[0] !== undefined ? _args4[0] : _paths;
+            forceUpdate = _args4.length > 1 && _args4[1] !== undefined ? _args4[1] : true;
+            // 尝试根据路径获取 pos、key
+            traverser = cachedDataSource.current;
+            indexList = [];
+            keyList = []; // 除了获取目标路径的内容外，目标路径距离当前路径的所有内容也要重新获取
+            targetPath = _paths;
+            try {
+              // 找到目标节点的父节点
+              indexList = idList.slice(0, -1).map(function (currentId) {
+                var matchedIndex = traverser.findIndex(function (_) {
+                  return _.id === currentId;
+                });
+                if (currentId === targetPath[0]) {
+                  targetPath = targetPath.slice(1);
+                } else {
+                  targetPath = [];
+                }
+                // 如果找不到目标路径，则直接刷新页面
+                if (matchedIndex < 0) {
+                  throw new Error('无法找到目标路径，刷新页面');
+                }
+                var _traverser$matchedInd = traverser[matchedIndex],
+                  children = _traverser$matchedInd.children,
+                  key = _traverser$matchedInd.key;
+                // const { children, ..._targetNode } = traverser[matchedIndex];
+                traverser = children;
+                keyList.push(key);
+                return matchedIndex;
+              });
+            } catch (error) {
+              console.error(error.message);
+              history.go(0);
+            }
+            indexList.unshift(0);
+            // 重新获取目标节点到前高亮路径的所有节点
+            _context4.next = 10;
+            return loadTreeByPath(targetPath.length ? targetPath : idList.slice(-1), traverser, indexList.join('-'), forceUpdate);
+          case 10:
+            setDataSource(cachedDataSource.current);
+            setExpandedKeys([].concat(_toConsumableArray(expandedKeys.current), keyList));
+          case 12:
+          case "end":
+            return _context4.stop();
+        }
+      }, _callee4);
+    }));
+    return _loadDataByTreePath.apply(this, arguments);
+  }
+  function goToModule(targetNode, nodePath) {
+    var isReplace = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    if (unmounted.current) return;
+    var nodeParams = targetNode.params;
+    var type = targetNode[typeKey];
+    var moduleType = getModuleType(type);
+    if (!moduleType) {
+      console.error("ComposeTree\uFF1A\u6CA1\u6709\u627E\u5230 type(".concat(type, ") \u5BF9\u5E94\u7684 module"));
+      return;
+    }
+
+    // debugger;
+    setActiveParams(nodeParams || {});
+    history[isReplace ? 'replace' : 'push']("".concat((0, _reactRouterDom.generatePath)(pathPrefixWithParam, _objectSpread(_objectSpread({}, params), {}, {
+      treePath: nodePath
+    })), "/").concat(moduleType));
+  }
+  function _updateTreeChildren(position, nextChildren) {
+    // 合并孙子节点，以保证下级内容不会被覆盖
+    var originDataSource = ((position.length ? (0, _lodash.get)(cachedDataSource.current, position) : cachedDataSource.current) || []).filter(function (_) {
+      return _.children;
+    });
+    originDataSource.forEach(function (_ref3) {
+      var id = _ref3.id,
+        children = _ref3.children;
+      var matchedIndex = nextChildren.findIndex(function (_) {
+        return _.id === id;
+      });
+      if (matchedIndex >= 0) {
+        // 找到匹配的节点，合并 children
+        (0, _lodash.set)(nextChildren, [matchedIndex, 'children'], children);
+      }
+    });
+    // end - 无序返回合并逻辑
+    cachedDataSource.current = cachedDataSource.current.length ? (0, _lodash.setWith)((0, _lodash.clone)(cachedDataSource.current), position, nextChildren, _lodash.clone) : nextChildren;
+  }
+
+  /**
+   * 异步获取目标节点的子节点数据，优先返回缓存内容
+   * @param node 父节点，如果传空对象，说明是根节点
+   * @param idToMatch 要命中的 id，如果传了，则用于判断缓存是否过期
+   */
+  function _fetchTreeNodes(node, idToMatch) {
+    return new Promise(function (resolve, reject) {
+      var _ref4 = node || {},
+        _ref4$id = _ref4.id,
+        id = _ref4$id === void 0 ? '' : _ref4$id,
+        nodeParams = _ref4.params,
+        pos = _ref4.pos;
+      // console.log(typeof id, 'idid', id === 'null');
+      // if (id === 'null') {
+      //   reject();
+      // }
+      var fetchTreeNodesUrl = getTreeNodes.url,
+        method = getTreeNodes.method,
+        _getTreeNodes$params = getTreeNodes.params,
+        requestParams = _getTreeNodes$params === void 0 ? {} : _getTreeNodes$params;
+      var storageKey = "".concat(pathPrefix, "/tree/").concat(id);
+      // 如果 node 为空，说明在拉取根节点，根节点不走缓存
+      var cache = node ? localStorage.getItem(storageKey) : null;
+      var position = pos ? pos.split('-').slice(1).reduce(function (setterPath, index) {
+        return setterPath.concat([+index, 'children']);
+      }, []) : [];
+      var cacheMatched = false;
+      if (cache) {
+        var nextDataSource;
+        try {
+          nextDataSource = JSON.parse(cache);
+          // 缓存中没有命中需要匹配的 key，直接发异步请求。
+          if (idToMatch && !nextDataSource.some(function (_) {
+            return _.id === idToMatch;
+          })) {
+            console.log('缓存中没有命中需要匹配的 key，直接发异步请求。');
+            throw new Error();
+          }
+          cacheMatched = true;
+
+          // 仅仅 resolve，下面的步骤还是要走，更新缓存
+          _updateTreeChildren(position, nextDataSource);
+          resolve(nextDataSource);
+        } catch (e) {
+          console.log('缓存解析失败，发送异步请求');
+        }
+      }
+      // 自动将节点的 params 透传给 tree 的异步接口
+      // tslint:disable-next-line: no-floating-promises
+      _services.default.request(fetchTreeNodesUrl, {
+        method: method,
+        data: _objectSpread(_objectSpread({}, requestParams), {}, {
+          parentId: id === 'null' ? '' : id
+        }, nodeParams || {}),
+        showError: true
+      }).then(function (_ref5) {
+        var data = _ref5.data,
+          others = _objectWithoutProperties(_ref5, _excluded2);
+        var code = others.code;
+        // localStorage.setItem('request-code', code);
+        // console.log(data, 'data');
+        var cached = cache ? JSON.parse(cache) : null;
+        if (!data) {
+          setDataCode(code);
+          return;
+        } else if ((data === null || data === void 0 ? void 0 : data.dataSource.length) === 0) {
+          if (!id || id === 'null') {
+            setDataCode(9000);
+          }
+
+          // return;
+        }
+        var nextChildren = generateTreeNodesWithUid(requestDataFormatter(data, {
+          treePath: _paths
+        }), cached);
+        _updateTreeChildren(position, nextChildren);
+        try {
+          // 更新缓存的子节点
+          localStorage.setItem(storageKey, JSON.stringify(
+          // 只缓存直接子节点，再下级的节点会平铺缓存
+          (nextChildren || []).map(function (_ref6) {
+            var children = _ref6.children,
+              others = _objectWithoutProperties(_ref6, _excluded3);
+            return others;
+          })));
+        } catch (error) {
+          // 如果 localStorage 溢出，清空相关缓存
+          // 这里会有点边界问题：会把当前流程中的缓存也删掉，可能会导致展示不全，但出现的概率很小，刷新之后就好了
+          if (['W3CException_DOM_QUOTA_EXCEEDED_ERR', 'QuotaExceededError', 'NS_ERROR_DOM_QUOTA_REACHED', 'QUOTA_EXCEEDED_ERR'].includes(error.name)) {
+            // 遍历 localStorage，找到包含 /:treePath/ 的缓存，并清除
+            Object.keys(localStorage).forEach(function (key) {
+              if (/\/:treePath(\/|$)/.test(key)) {
+                localStorage.removeItem(key);
+              }
+            });
+          } else {
+            console.error(error);
+          }
+        }
+        cachedDataSource.current = position.length ? (0, _lodash.setWith)((0, _lodash.clone)(cachedDataSource.current), position, nextChildren, _lodash.clone) : nextChildren;
+        setDataSource(cachedDataSource.current);
+        if (idToMatch && !nextChildren.some(function (_) {
+          return _.id === idToMatch;
+        })) {
+          console.log("\u8BF7\u6C42\u7ED3\u679C\u6CA1\u6709\u547D\u4E2D\u9700\u8981\u5339\u914D\u7684 key - ".concat(idToMatch, "\uFF0C\u91CD\u5B9A\u5411\u5230\u6839\u8282\u70B9\u3002"));
+          // message.info('树中没有找到指定路径，为您跳转到根节点。');
+          var firstNode = (0, _lodash.get)(cachedDataSource.current, [0], {});
+          goToModule(firstNode, firstNode.id, true);
+          return;
+        }
+        if (!cacheMatched) {
+          resolve(nextChildren);
+        }
+      });
+    });
+  }
+  function getRoutePath(modulePath) {
+    // todo: 没有兼容 tree 套 tree 的场景，用户中心用不到，所以这里不再像 compose-tab 那样特殊梳理
+    var purePath = getModuleType([modulePath === null || modulePath === void 0 ? void 0 : modulePath.replace(/^\//, '').replace(/\/\*$/, '')]);
+    // console.log(`${pathPrefix}/${purePath}`);
+    return {
+      purePath: purePath,
+      path: "".concat(pathPrefixWithParam, "/").concat(purePath)
+    };
+  }
+  return {
+    // 变量起始，这些变量除了在页面刷新后需要被赋值外，在 goToModule 中也要赋值一次
+    activeKey: (0, _lodash.get)(_paths.slice(-1), [0]),
+    activeParams: activeParams,
+    treePaths: _paths,
+    // 变量终止
+    goToModule: goToModule,
+    dataSource: dataSource,
+    code: code,
+    getRoutePath: getRoutePath,
+    loadData: loadData,
+    expandedKeys: _expandedKeys,
+    setExpandedKeys: setExpandedKeys,
+    loadDataByTreePath: loadDataByTreePath,
+    reloadTree: reloadTree,
+    setIsSearch: setIsSearch,
+    isSearch: isSearch,
+    nowExpandedNode: nowExpandedNode,
+    generateUrlByTreePaths: generateUrlByTreePaths,
+    isInTree: true,
+    firstLoaded: firstLoaded
+  };
+};
+var ComposeTreeContext = exports.ComposeTreeContext = /*#__PURE__*/_react.default.createContext(null);