tntd 2.8.8 → 2.8.10

package/lib/tntd-virtual-tree/utils.js

@@ -0,0 +1,353 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getNodeValuess = exports.getNodeStr = exports.getNodeParentChoosed = exports.getNodeNoDisabledLastestChildrenValues = exports.getNodeNoDisabledChildrenValues = exports.getIndeterminate = exports.getFullExpandedKeys = exports.getFullCheckedKeys = exports.flatTreeData = exports.findNodeDetail = exports.addTreeNodeAttrs = void 0;
+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 _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 _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 _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 _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; }
+var __rest = void 0 && (void 0).__rest || function (s, e) {
+  var t = {};
+  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];
+  if (s != null && typeof Object.getOwnPropertySymbols === "function") for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+    if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) t[p[i]] = s[p[i]];
+  }
+  return t;
+};
+/**
+ * 初始化给树的每个节点增加以下属性字段
+ * childrenValues: 当前节点下的所有子节点的value和（包含了disabled节点）用户展开/收起
+ * titleTotal: 当前节点下的所有子节点的title和 （包含了disabled节点）用于搜索
+ * needCheckedChildrenValues: 当前节点下的节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中
+ * needCheckedLastestChildrenValues: 当前节点下的最底层节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中
+ * needCheckedSiblingsValue: 当前节点所有上级节点的兄弟节点， [{ key: '上级节点value', list: [xx] }] list包含非disabled节点 用于选中/取消选中
+ * 用于判断后续展开/收起
+ * @param {*} treeData
+ */
+var addTreeNodeAttrs = exports.addTreeNodeAttrs = function addTreeNodeAttrs(treeData) {
+  var fieldNames = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {
+    title: 'title',
+    value: 'value',
+    children: 'children',
+    disabled: 'disabled'
+  };
+  var needCheckedSiblingsValue = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  if (Array.isArray(treeData) && !!treeData.length) {
+    return treeData.map(function (item) {
+      item.children = item[fieldNames['children']];
+      item.title = item[fieldNames['title']];
+      item.value = item[fieldNames['value']];
+      var children = item.children,
+        query = __rest(item, ["children"]);
+      if (Array.isArray(children) && !!children.length) {
+        var siblingsSum = needCheckedSiblingsValue;
+        if (!item[fieldNames['disabled']]) {
+          // 这里注意要逆序，要不然校验的时候会出问题
+          siblingsSum = [{
+            key: item[fieldNames['value']],
+            list: children.reduce(function (total, item) {
+              if (!item[fieldNames['disabled']]) {
+                total.push(item[fieldNames['value']]);
+              }
+              return total;
+            }, [])
+          }].concat(_toConsumableArray(siblingsSum));
+        } else {
+          siblingsSum = [];
+        }
+        query.children = addTreeNodeAttrs(children, fieldNames, siblingsSum);
+      }
+      return Object.assign(Object.assign({}, query), {
+        title: query[fieldNames['title']],
+        value: query[fieldNames['value']],
+        disabled: query[fieldNames['disabled']],
+        childrenValues: getNodeValuess(query, false),
+        titleTotal: getNodeStr(query, fieldNames['title']),
+        needCheckedLastestChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledLastestChildrenValues(item, fieldNames) : [],
+        needCheckedChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledChildrenValues(item, fieldNames) : [],
+        needCheckedSiblingsValue: !item[fieldNames['disabled']] ? needCheckedSiblingsValue : []
+      });
+    });
+  }
+  return [];
+};
+var getNodeStr = exports.getNodeStr = function getNodeStr(node, key) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  result.push(node[key]);
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(function (element) {
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeStr(element, key)));
+    });
+  }
+  return result;
+};
+/**
+ * 获取每个节点下面所有子节点的value值
+ * @param {*} node
+ * @param {*} widthSelf 是否包含自己
+ * @param {*} result
+ * @returns []
+ */
+var getNodeValuess = exports.getNodeValuess = function getNodeValuess(node) {
+  var widthSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  if (widthSelf) {
+    result.push(node.value);
+  }
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(function (element) {
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeValuess(element)));
+    });
+  }
+  return result;
+};
+/**
+ * 扁平树
+ * @param {*} treeData
+ * @param {*} expandedKeys 展开的节点
+ * @param {*} treeDefaultExpandAll
+ * @param {*} level
+ * @param {*} result
+ * @returns
+ */
+var flatTreeData = exports.flatTreeData = function flatTreeData(treeData) {
+  var filterKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
+  var expandedKeys = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  var treeDefaultExpandAll = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
+  var level = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+  var result = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : [];
+  if (Array.isArray(treeData)) {
+    var _iterator = _createForOfIteratorHelper(treeData),
+      _step;
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var i = _step.value;
+        var value = i.value,
+          children = i.children,
+          titleTotal = i.titleTotal,
+          title = i.title,
+          rest = __rest(i, ["value", "children", "titleTotal", "title"]);
+        // 判断是否命中过滤
+        var bingo = true;
+        var transFilterKey = !['', null, undefined].includes(filterKey);
+        if (transFilterKey) {
+          bingo = Array.isArray(titleTotal) ? titleTotal.some(function (i) {
+            return i.includes(filterKey);
+          }) : false;
+        }
+        if (bingo) {
+          result.push(Object.assign({
+            level: level
+          }, i));
+        }
+        var selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
+        if ((treeDefaultExpandAll || selfIn || transFilterKey && bingo) && Array.isArray(children) && !!children.length) {
+          result = [].concat(_toConsumableArray(result), _toConsumableArray(flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, level + 1)));
+        }
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
+    }
+  }
+  return result;
+};
+/**
+ * 获取所有展开的节点 （组件传入最后一层，需要将其上层全部加入到expandedKeys）
+ * @param {*} treeDataWithKeys
+ * @param {*} treeExpandedKeys
+ * @param {*} result
+ * @returns
+ */
+var getFullExpandedKeys = exports.getFullExpandedKeys = function getFullExpandedKeys(treeDataWithKeys) {
+  var treeExpandedKeys = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
+  var treeDefaultExpandAll = arguments.length > 2 ? arguments[2] : undefined;
+  var result = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
+  if (!treeDefaultExpandAll && (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)) {
+    return [];
+  }
+  treeDataWithKeys.forEach(function (i) {
+    var childrenValues = i.childrenValues,
+      value = i.value,
+      children = i.children;
+    if (treeDefaultExpandAll || Array.isArray(childrenValues) && [].concat(_toConsumableArray(childrenValues), [value]).some(function (el) {
+      return treeExpandedKeys.includes(el);
+    })) {
+      result.push(value);
+      if (Array.isArray(children) && !!children.length) {
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)));
+      }
+    }
+  });
+  return result;
+};
+/**
+ * 初始化根据用户传入的值获取其关联节点是否要在checkList
+ * @param {*} treeDataWithKeys
+ * @param {*} transCheckedKeys
+ * @param {*} result
+ * @returns
+ */
+var getFullCheckedKeys = exports.getFullCheckedKeys = function getFullCheckedKeys(treeDataWithKeys, transCheckedKeys) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  if (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(transCheckedKeys) || !transCheckedKeys.length) {
+    return [];
+  }
+  treeDataWithKeys.forEach(function (i) {
+    var value = i.value,
+      children = i.children,
+      disabled = i.disabled;
+    var bingo = transCheckedKeys.includes(value);
+    if (bingo) {
+      result.push(value);
+    }
+    if (Array.isArray(children) && !!children.length) {
+      var lastestUnDisabledChildrenValues = i.needCheckedLastestChildrenValues;
+      // 如果当前节点是被命中，就将其下面所有子节点都选中
+      if (Array.isArray(lastestUnDisabledChildrenValues) && !!lastestUnDisabledChildrenValues.length && lastestUnDisabledChildrenValues.every(function (el) {
+        return transCheckedKeys.includes(el);
+      })) {
+        result.push(value);
+      }
+      result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullCheckedKeys(children, transCheckedKeys)));
+    }
+  });
+  return result;
+};
+/**
+ * 递归获取某个节点所有最下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了
+ * @param {*} node
+ * @param {*} node
+ * @returns
+ */
+var getNodeNoDisabledLastestChildrenValues = exports.getNodeNoDisabledLastestChildrenValues = function getNodeNoDisabledLastestChildrenValues(node, fieldNames) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(function (element) {
+      if (!element[fieldNames['disabled']]) {
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeNoDisabledLastestChildrenValues(element, fieldNames)));
+      }
+    });
+  } else {
+    if (!node[fieldNames['disabled']]) {
+      result.push(node[fieldNames['value']]);
+    }
+  }
+  return result;
+};
+/**
+ * 递归获取某个节点所有下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了
+ * @param {*} node
+ * @param {*} node
+ * @returns
+ */
+var getNodeNoDisabledChildrenValues = exports.getNodeNoDisabledChildrenValues = function getNodeNoDisabledChildrenValues(node, fieldNames) {
+  var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(function (element) {
+      if (!element[fieldNames['disabled']]) {
+        result.push(element[fieldNames['value']]);
+        result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeNoDisabledChildrenValues(element, fieldNames)));
+      }
+    });
+  } else {
+    if (!node[fieldNames['disabled']]) {
+      result.push(node[fieldNames['value']]);
+    }
+  }
+  return result;
+};
+/**
+ * 判断当前节点是否半选
+ * @param {*} item
+ * @param {*} checkedList
+ */
+var getIndeterminate = exports.getIndeterminate = function getIndeterminate(item, checkedList, disabledList) {
+  // 如果没有子节点,就没有半选情况
+  if (!Array.isArray(item.children) || !item.children.length) {
+    return false;
+  }
+  if (!Array.isArray(checkedList) || !checkedList.length) {
+    return false;
+  }
+  // 当前节点下的去掉disabled的所有末级节点
+  var list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];
+  var childrenCheckedList = list.filter(function (i) {
+    return checkedList === null || checkedList === void 0 ? void 0 : checkedList.includes(i);
+  });
+  return childrenCheckedList.length > 0 && childrenCheckedList.length < list.length;
+};
+/**
+ * 获取当前节点的父亲节点是否需要被选中
+ * @param {*} needCheckedSiblingsValue
+ * @param {*} checkedList
+ * @returns
+ */
+var getNodeParentChoosed = exports.getNodeParentChoosed = function getNodeParentChoosed(needCheckedSiblingsValue, checkedList) {
+  if (!Array.isArray(checkedList) || !checkedList.length) {
+    return [];
+  }
+  var result = [];
+  var _iterator2 = _createForOfIteratorHelper(needCheckedSiblingsValue),
+    _step2;
+  try {
+    for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+      var item = _step2.value;
+      var _ref = item || {},
+        key = _ref.key,
+        list = _ref.list;
+      // 过滤掉子节点为disabled的
+      var bool = Array.isArray(list) ? list.every(function (it) {
+        return checkedList.includes(it);
+      }) : false;
+      if (bool) {
+        checkedList.push(key);
+        result.push(key);
+      }
+    }
+  } catch (err) {
+    _iterator2.e(err);
+  } finally {
+    _iterator2.f();
+  }
+  return result;
+};
+/**
+ * 获取节点的信息
+ * @param {*} tree
+ * @param {*} key
+ * @param {*} result
+ * @returns
+ */
+var findNodeDetail = exports.findNodeDetail = function findNodeDetail(tree, key, result) {
+  if (Array.isArray(tree) && !!key) {
+    var _iterator3 = _createForOfIteratorHelper(tree),
+      _step3;
+    try {
+      for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
+        var i = _step3.value;
+        if (i.value === key) {
+          result = i;
+          break;
+        }
+        if (Array.isArray(i.children) && !!i.children.length) {
+          result = findNodeDetail(i.children, key);
+          if (result) {
+            break;
+          }
+        }
+      }
+    } catch (err) {
+      _iterator3.e(err);
+    } finally {
+      _iterator3.f();
+    }
+  }
+  return result;
+};

package/lib/tntd-virtual-tree/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree/utils.js"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA;;;;;;;;;GASG;AACI,MAAM,gBAAgB,GAAG,CAC9B,QAAQ,EACR,UAAU,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,EAC3F,wBAAwB,GAAG,EAAE,EAC7B,EAAE;IACF,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;QAChD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;YACvC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;YACvC,MAAM,EAAE,QAAQ,KAAe,IAAI,EAAd,KAAK,UAAK,IAAI,EAA7B,YAAsB,CAAO,CAAC;YACpC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAChD,IAAI,WAAW,GAAG,wBAAwB,CAAC;gBAC3C,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;oBACjC,uBAAuB;oBACvB,WAAW,GAAG;wBACZ;4BACE,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;4BAC9B,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;gCACpC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;oCACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iCACvC;gCACD,OAAO,KAAK,CAAC;4BACf,CAAC,EAAE,EAAE,CAAC;yBACP;wBACD,GAAG,WAAW;qBACf,CAAC;iBACH;qBAAM;oBACL,WAAW,GAAG,EAAE,CAAC;iBAClB;gBACD,KAAK,CAAC,QAAQ,GAAG,IAAA,wBAAgB,EAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;aACtE;YACD,uCACK,KAAK,KACR,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EACjC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EACjC,QAAQ,EAAE,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EACvC,cAAc,EAAE,IAAA,sBAAc,EAAC,KAAK,EAAE,KAAK,CAAC,EAC5C,UAAU,EAAE,IAAA,kBAAU,EAAC,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAClD,gCAAgC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,8CAAsC,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAC/H,yBAAyB,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,uCAA+B,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EACjH,wBAAwB,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE,IACvF;QACJ,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AA/CW,QAAA,gBAAgB,oBA+C3B;AAEK,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACnD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAEvB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC1D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,kBAAU,EAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAVW,QAAA,UAAU,cAUrB;AAEF;;;;;;GAMG;AACI,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACpE,IAAI,SAAS,EAAE;QACb,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACzB;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC1D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,sBAAc,EAAC,OAAO,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAZW,QAAA,cAAc,kBAYzB;AAEF;;;;;;;;GAQG;AACI,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,SAAS,GAAG,EAAE,EAAE,YAAY,GAAG,EAAE,EAAE,oBAAoB,GAAG,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAChI,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC3B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;YACxB,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,KAAc,CAAC,EAAV,IAAI,UAAK,CAAC,EAAnD,4CAA+C,CAAI,CAAC;YAE1D,WAAW;YACX,IAAI,KAAK,GAAG,IAAI,CAAC;YACjB,MAAM,cAAc,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAClE,IAAI,cAAc,EAAE;gBAClB,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;aAC3F;YAED,IAAI,KAAK,EAAE;gBACT,MAAM,CAAC,IAAI,iBAAG,KAAK,IAAK,CAAC,EAAG,CAAC;aAC9B;YAED,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAClF,IAAI,CAAC,oBAAoB,IAAI,MAAM,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACjH,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,oBAAY,EAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,oBAAoB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;aAC3G;SACF;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAvBW,QAAA,YAAY,gBAuBvB;AAEF;;;;;;GAMG;AACI,MAAM,mBAAmB,GAAG,CAAC,gBAAgB,EAAE,gBAAgB,GAAG,EAAE,EAAE,oBAAoB,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAChH,IACE,CAAC,oBAAoB;QACrB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAC9H;QACA,OAAO,EAAE,CAAC;KACX;IAED,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7B,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAE9C,IAAI,oBAAoB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACrI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEnB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBAChD,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,2BAAmB,EAAC,QAAQ,EAAE,gBAAgB,EAAE,oBAAoB,CAAC,CAAC,CAAC;aAChG;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AArBW,QAAA,mBAAmB,uBAqB9B;AAEF;;;;;;GAMG;AACI,MAAM,kBAAkB,GAAG,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACpF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE;QAChI,OAAO,EAAE,CAAC;KACX;IAED,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7B,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,KAAK,EAAE;YACT,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;YAChD,MAAM,+BAA+B,GAAG,CAAC,CAAC,gCAAgC,CAAC;YAC3E,2BAA2B;YAC3B,IACE,KAAK,CAAC,OAAO,CAAC,+BAA+B,CAAC;gBAC9C,CAAC,CAAC,+BAA+B,CAAC,MAAM;gBACxC,+BAA+B,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAC5E;gBACA,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACpB;YACD,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,0BAAkB,EAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC;SACzE;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AA3BW,QAAA,kBAAkB,sBA2B7B;AAEF;;;;;GAKG;AACI,MAAM,sCAAsC,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IACtF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC1D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;gBACpC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,8CAAsC,EAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;aACtF;QACH,CAAC,CAAC,CAAC;KACJ;SAAM;QACL,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SACxC;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAbW,QAAA,sCAAsC,0CAajD;AAEF;;;;;GAKG;AACI,MAAM,+BAA+B,GAAG,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC1D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;gBACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1C,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,uCAA+B,EAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;aAC/E;QACH,CAAC,CAAC,CAAC;KACJ;SAAM;QACL,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,EAAE;YACjC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SACxC;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAA;AAdY,QAAA,+BAA+B,mCAc3C;AAED;;;;GAIG;AACI,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAE,EAAE;IAClE,kBAAkB;IAClB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC1D,OAAO,KAAK,CAAC;KACd;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;QACtD,OAAO,KAAK,CAAC;KACd;IAED,0BAA0B;IAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/G,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzE,OAAO,mBAAmB,CAAC,MAAM,GAAG,CAAC,IAAI,mBAAmB,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;AACpF,CAAC,CAAC;AAfW,QAAA,gBAAgB,oBAe3B;AAEF;;;;;GAKG;AACI,MAAM,oBAAoB,GAAG,CAAC,wBAAwB,EAAE,WAAW,EAAE,EAAE;IAC5E,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;QACtD,OAAO,EAAE,CAAC;KACX;IACD,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,IAAI,IAAI,wBAAwB,EAAE;QACzC,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC;QACjC,mBAAmB;QACnB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACxF,IAAI,IAAI,EAAE;YACR,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAClB;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAhBW,QAAA,oBAAoB,wBAgB/B;AAEF;;;;;;GAMG;AACI,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE;IAClD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE;QAChC,KAAK,IAAI,CAAC,IAAI,IAAI,EAAE;YAClB,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,EAAE;gBACnB,MAAM,GAAG,CAAC,CAAC;gBACX,MAAM;aACP;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACpD,MAAM,GAAG,IAAA,sBAAc,EAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,MAAM,EAAE;oBACV,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAjBW,QAAA,cAAc,kBAiBzB","sourcesContent":["/**\n * 初始化给树的每个节点增加以下属性字段\n * childrenValues: 当前节点下的所有子节点的value和（包含了disabled节点）用户展开/收起\n * titleTotal: 当前节点下的所有子节点的title和 （包含了disabled节点）用于搜索\n * needCheckedChildrenValues: 当前节点下的节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中\n * needCheckedLastestChildrenValues: 当前节点下的最底层节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中\n * needCheckedSiblingsValue: 当前节点所有上级节点的兄弟节点， [{ key: '上级节点value', list: [xx] }] list包含非disabled节点 用于选中/取消选中\n * 用于判断后续展开/收起\n * @param {*} treeData\n */\nexport const addTreeNodeAttrs = (\n  treeData,\n  fieldNames = { title: 'title', value: 'value', children: 'children', disabled: 'disabled' },\n  needCheckedSiblingsValue = []\n) => {\n  if (Array.isArray(treeData) && !!treeData.length) {\n    return treeData.map((item) => {\n      item.children = item[fieldNames['children']];\n      item.title = item[fieldNames['title']];\n      item.value = item[fieldNames['value']];\n      const { children, ...query } = item;\n      if (Array.isArray(children) && !!children.length) {\n        let siblingsSum = needCheckedSiblingsValue;\n        if (!item[fieldNames['disabled']]) {\n          // 这里注意要逆序，要不然校验的时候会出问题\n          siblingsSum = [\n            {\n              key: item[fieldNames['value']],\n              list: children.reduce((total, item) => {\n                if (!item[fieldNames['disabled']]) {\n                  total.push(item[fieldNames['value']]);\n                }\n                return total;\n              }, [])\n            },\n            ...siblingsSum\n          ];\n        } else {\n          siblingsSum = [];\n        }\n        query.children = addTreeNodeAttrs(children, fieldNames, siblingsSum);\n      }\n      return {\n        ...query,\n        title: query[fieldNames['title']],\n        value: query[fieldNames['value']],\n        disabled: query[fieldNames['disabled']],\n        childrenValues: getNodeValuess(query, false),\n        titleTotal: getNodeStr(query, fieldNames['title']),\n        needCheckedLastestChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledLastestChildrenValues(item, fieldNames) : [],\n        needCheckedChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledChildrenValues(item, fieldNames) : [],\n        needCheckedSiblingsValue: !item[fieldNames['disabled']] ? needCheckedSiblingsValue : []\n      };\n    });\n  }\n\n  return [];\n};\n\nexport const getNodeStr = (node, key, result = []) => {\n  result.push(node[key]);\n\n  if (Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach((element) => {\n      result = [...result, ...getNodeStr(element, key)];\n    });\n  }\n\n  return result;\n};\n\n/**\n * 获取每个节点下面所有子节点的value值\n * @param {*} node\n * @param {*} widthSelf 是否包含自己\n * @param {*} result\n * @returns []\n */\nexport const getNodeValuess = (node, widthSelf = true, result = []) => {\n  if (widthSelf) {\n    result.push(node.value);\n  }\n\n  if (Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach((element) => {\n      result = [...result, ...getNodeValuess(element)];\n    });\n  }\n\n  return result;\n};\n\n/**\n * 扁平树\n * @param {*} treeData\n * @param {*} expandedKeys 展开的节点\n * @param {*} treeDefaultExpandAll\n * @param {*} level\n * @param {*} result\n * @returns\n */\nexport const flatTreeData = (treeData, filterKey = '', expandedKeys = [], treeDefaultExpandAll = false, level = 0, result = []) => {\n  if (Array.isArray(treeData)) {\n    for (const i of treeData) {\n      const { value, children, titleTotal, title, ...rest } = i;\n\n      // 判断是否命中过滤\n      let bingo = true;\n      const transFilterKey = !['', null, undefined].includes(filterKey);\n      if (transFilterKey) {\n        bingo = Array.isArray(titleTotal) ? titleTotal.some((i) => i.includes(filterKey)) : false;\n      }\n\n      if (bingo) {\n        result.push({ level, ...i });\n      }\n\n      const selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;\n      if ((treeDefaultExpandAll || selfIn || (transFilterKey && bingo)) && Array.isArray(children) && !!children.length) {\n        result = [...result, ...flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, level + 1)];\n      }\n    }\n  }\n  return result;\n};\n\n/**\n * 获取所有展开的节点 （组件传入最后一层，需要将其上层全部加入到expandedKeys）\n * @param {*} treeDataWithKeys\n * @param {*} treeExpandedKeys\n * @param {*} result\n * @returns\n */\nexport const getFullExpandedKeys = (treeDataWithKeys, treeExpandedKeys = [], treeDefaultExpandAll, result = []) => {\n  if (\n    !treeDefaultExpandAll &&\n    (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)\n  ) {\n    return [];\n  }\n\n  treeDataWithKeys.forEach((i) => {\n    const { childrenValues, value, children } = i;\n\n    if (treeDefaultExpandAll || (Array.isArray(childrenValues) && [...childrenValues, value].some((el) => treeExpandedKeys.includes(el)))) {\n      result.push(value);\n\n      if (Array.isArray(children) && !!children.length) {\n        result = [...result, ...getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)];\n      }\n    }\n  });\n\n  return result;\n};\n\n/**\n * 初始化根据用户传入的值获取其关联节点是否要在checkList\n * @param {*} treeDataWithKeys\n * @param {*} transCheckedKeys\n * @param {*} result\n * @returns\n */\nexport const getFullCheckedKeys = (treeDataWithKeys, transCheckedKeys, result = []) => {\n  if (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(transCheckedKeys) || !transCheckedKeys.length) {\n    return [];\n  }\n\n  treeDataWithKeys.forEach((i) => {\n    const { value, children, disabled } = i;\n    const bingo = transCheckedKeys.includes(value);\n    if (bingo) {\n      result.push(value);\n    }\n\n    if (Array.isArray(children) && !!children.length) {\n      const lastestUnDisabledChildrenValues = i.needCheckedLastestChildrenValues;\n      // 如果当前节点是被命中，就将其下面所有子节点都选中\n      if (\n        Array.isArray(lastestUnDisabledChildrenValues) &&\n        !!lastestUnDisabledChildrenValues.length &&\n        lastestUnDisabledChildrenValues.every((el) => transCheckedKeys.includes(el))\n      ) {\n        result.push(value);\n      }\n      result = [...result, ...getFullCheckedKeys(children, transCheckedKeys)];\n    }\n  });\n\n  return result;\n};\n\n/**\n * 递归获取某个节点所有最下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了\n * @param {*} node\n * @param {*} node\n * @returns\n */\nexport const getNodeNoDisabledLastestChildrenValues = (node, fieldNames, result = []) => {\n  if (Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach((element) => {\n      if (!element[fieldNames['disabled']]) {\n        result = [...result, ...getNodeNoDisabledLastestChildrenValues(element, fieldNames)];\n      }\n    });\n  } else {\n    if (!node[fieldNames['disabled']]) {\n      result.push(node[fieldNames['value']]);\n    }\n  }\n  return result;\n};\n\n/**\n * 递归获取某个节点所有下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了\n * @param {*} node\n * @param {*} node\n * @returns\n */\nexport const getNodeNoDisabledChildrenValues = (node, fieldNames, result = []) => {\n  if (Array.isArray(node.children) && !!node.children.length) {\n    node.children.forEach((element) => {\n      if (!element[fieldNames['disabled']]) {\n        result.push(element[fieldNames['value']]);\n        result = [...result, ...getNodeNoDisabledChildrenValues(element, fieldNames)];\n      }\n    });\n  } else {\n    if (!node[fieldNames['disabled']]) {\n      result.push(node[fieldNames['value']]);\n    }\n  }\n  return result;\n}\n\n/**\n * 判断当前节点是否半选\n * @param {*} item\n * @param {*} checkedList\n */\nexport const getIndeterminate = (item, checkedList, disabledList) => {\n  // 如果没有子节点,就没有半选情况\n  if (!Array.isArray(item.children) || !item.children.length) {\n    return false;\n  }\n\n  if (!Array.isArray(checkedList) || !checkedList.length) {\n    return false;\n  }\n\n  // 当前节点下的去掉disabled的所有末级节点\n  const list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];\n  const childrenCheckedList = list.filter((i) => checkedList?.includes(i));\n\n  return childrenCheckedList.length > 0 && childrenCheckedList.length < list.length;\n};\n\n/**\n * 获取当前节点的父亲节点是否需要被选中\n * @param {*} needCheckedSiblingsValue\n * @param {*} checkedList\n * @returns\n */\nexport const getNodeParentChoosed = (needCheckedSiblingsValue, checkedList) => {\n  if (!Array.isArray(checkedList) || !checkedList.length) {\n    return [];\n  }\n  let result = [];\n  for (let item of needCheckedSiblingsValue) {\n    const { key, list } = item || {};\n    // 过滤掉子节点为disabled的\n    const bool = Array.isArray(list) ? list.every((it) => checkedList.includes(it)) : false;\n    if (bool) {\n      checkedList.push(key);\n      result.push(key);\n    }\n  }\n\n  return result;\n};\n\n/**\n * 获取节点的信息\n * @param {*} tree \n * @param {*} key \n * @param {*} result \n * @returns \n */\nexport const findNodeDetail = (tree, key, result) => {\n  if (Array.isArray(tree) && !!key) {\n    for (let i of tree) {\n      if (i.value === key) {\n        result = i;\n        break;\n      }\n      if (Array.isArray(i.children) && !!i.children.length) {\n        result = findNodeDetail(i.children, key);\n        if (result) {\n          break;\n        }\n      }\n    }\n  }\n\n  return result;\n};\n"]}

package/lib/tntd-virtual-tree-select/VirtualTree.d.ts

@@ -0,0 +1,13 @@
+export default VirtualTree;
+declare function VirtualTree({ value, onChange, treeDefaultExpandAll, fieldNames, treeExpandedKeys, showSearch, treeData, renderItem }: {
+    value: any;
+    onChange: any;
+    treeDefaultExpandAll: any;
+    fieldNames: any;
+    treeExpandedKeys: any;
+    showSearch: any;
+    treeData: any;
+    renderItem: any;
+}): React.JSX.Element;
+import React from "react";
+//# sourceMappingURL=VirtualTree.d.ts.map

package/lib/tntd-virtual-tree-select/VirtualTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualTree.d.ts","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/VirtualTree.jsx"],"names":[],"mappings":";AAgBA;;;;;;;;;sBA2GC"}

package/lib/tntd-virtual-tree-select/VirtualTree.js

@@ -0,0 +1,155 @@
+"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"] = void 0;
+var _react = _interopRequireWildcard(require("react"));
+var _rcVirtualList = _interopRequireDefault(require("rc-virtual-list"));
+var _icon = _interopRequireDefault(require("../icon"));
+var _ellipsis = _interopRequireDefault(require("../ellipsis"));
+var _empty = _interopRequireDefault(require("../empty"));
+var _input = _interopRequireDefault(require("../input"));
+var _utils = require("./utils");
+require("./tree.less");
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
+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 _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 _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; } /*
+ * @Descripttion: 最简单的tree下拉框，增加了虚拟滚动
+ * @Author: 郑泳健
+ * @Date: 2024-07-31 14:46:55
+ * @LastEditors: 郑泳健
+ * @LastEditTime: 2024-08-05 15:58:47
+ */
+var VirtualTree = function VirtualTree(_ref) {
+  var value = _ref.value,
+    onChange = _ref.onChange,
+    treeDefaultExpandAll = _ref.treeDefaultExpandAll,
+    fieldNames = _ref.fieldNames,
+    treeExpandedKeys = _ref.treeExpandedKeys,
+    showSearch = _ref.showSearch,
+    treeData = _ref.treeData,
+    renderItem = _ref.renderItem;
+  var ref = _react["default"].useRef(null);
+  // 展开的节点列表
+  var _useState = (0, _react.useState)([]),
+    _useState2 = _slicedToArray(_useState, 2),
+    expandedKeys = _useState2[0],
+    setExpandedKeys = _useState2[1];
+  var _useState3 = (0, _react.useState)([]),
+    _useState4 = _slicedToArray(_useState3, 2),
+    choosedValue = _useState4[0],
+    setChoosedValue = _useState4[1];
+  var _useState5 = (0, _react.useState)(undefined),
+    _useState6 = _slicedToArray(_useState5, 2),
+    filterKey = _useState6[0],
+    setFilterKey = _useState6[1];
+  (0, _react.useEffect)(function () {
+    if (!['', null, undefined].includes(value)) {
+      setChoosedValue(value);
+    } else {
+      setChoosedValue(undefined);
+    }
+  }, [value]);
+  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */
+  var treeDataWithKeys = (0, _react.useMemo)(function () {
+    return (0, _utils.addTreeNodeKeys)(treeData, fieldNames);
+  }, [treeData, fieldNames]);
+  var mergeTreeDefaultExpandAll = (0, _react.useMemo)(function () {
+    if (Array.isArray(treeExpandedKeys) && treeExpandedKeys.length) {
+      return false;
+    }
+    return treeDefaultExpandAll;
+  }, [treeDefaultExpandAll, treeExpandedKeys]);
+  /** 获取到所有展开的节点，因为treeDataWithKeys可能传入的是最后一级 */
+  (0, _react.useEffect)(function () {
+    var transTreeExpandedKeys = Array.isArray(treeExpandedKeys) ? treeExpandedKeys : [];
+    if (value) {
+      transTreeExpandedKeys = [].concat(_toConsumableArray(treeExpandedKeys), [value]);
+    }
+    var _expandedKeys = (0, _utils.getFullExpandedKeys)(treeDataWithKeys, transTreeExpandedKeys, mergeTreeDefaultExpandAll);
+    setExpandedKeys(_expandedKeys);
+  }, [treeDataWithKeys, treeExpandedKeys, mergeTreeDefaultExpandAll, value]);
+  /** 最终渲染的数据 */
+  var renderData = (0, _react.useMemo)(function () {
+    return (0, _utils.flatTreeData)(treeDataWithKeys, filterKey, expandedKeys);
+  }, [treeDataWithKeys, filterKey, expandedKeys]);
+  /** 切换展开/收起 */
+  var handleToggle = function handleToggle(item) {
+    var _ref2 = item || {},
+      value = _ref2.value;
+    var bool = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
+    if (bool) {
+      var list = Array.isArray(expandedKeys) ? expandedKeys.filter(function (i) {
+        return i !== value;
+      }) : [];
+      setExpandedKeys(list);
+    } else {
+      setExpandedKeys([].concat(_toConsumableArray(expandedKeys), [value]));
+    }
+  };
+  var defaultRenderItem = function defaultRenderItem(item, expandedKeys) {
+    return _react["default"].createElement(_ellipsis["default"], {
+      title: item.title,
+      widthLimit: '100%'
+    });
+  };
+  var handleChange = function handleChange(_value) {
+    setChoosedValue(_value);
+    onChange === null || onChange === void 0 ? void 0 : onChange(_value);
+  };
+  var handleInput = function handleInput(e) {
+    var _filterValue = e.target.value;
+    setFilterKey(_filterValue);
+  };
+  return _react["default"].createElement("div", {
+    className: 'tntd-tree-select'
+  }, showSearch && Array.isArray(treeData) && !!treeData.length ? _react["default"].createElement(_input["default"], {
+    onChange: handleInput,
+    allowClear: true
+  }) : '', !Array.isArray(renderData) || !renderData.length ? _react["default"].createElement(_empty["default"], {
+    size: 'small'
+  }) : _react["default"].createElement(_rcVirtualList["default"], {
+    ref: ref,
+    height: 300,
+    itemHeight: 44,
+    data: renderData
+  }, function (item) {
+    var level = item.level,
+      children = item.children;
+    var bool = expandedKeys.includes(item.value);
+    return _react["default"].createElement("div", {
+      className: "tntd-tree-select-item",
+      style: {
+        paddingLeft: level * 18
+      }
+    }, _react["default"].createElement("div", {
+      style: {
+        width: 18,
+        paddingLeft: 3
+      }
+    }, Array.isArray(children) && !!children.length ? _react["default"].createElement(_icon["default"], {
+      type: bool ? 'caret-down' : 'caret-right',
+      onClick: function onClick() {
+        return handleToggle(item);
+      }
+    }) : _react["default"].createElement(_icon["default"], null)), _react["default"].createElement("div", {
+      className: "tntd-tree-select-item-title ".concat(choosedValue === item.value ? 'tntd-tree-select-item-title_active' : ''),
+      onClick: function onClick() {
+        return handleChange(item.value);
+      }
+    }, renderItem ? renderItem(item, expandedKeys) : defaultRenderItem(item, expandedKeys)));
+  }));
+};
+var _default = exports["default"] = VirtualTree;

package/lib/tntd-virtual-tree-select/VirtualTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"VirtualTree.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/VirtualTree.jsx"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;;GAMG;AACH,+CAA4D;AAC5D,sEAAmC;AACnC,mDAA0B;AAC1B,2DAAmC;AACnC,qDAA6B;AAC7B,qDAA6B;AAC7B,mCAA6E;AAC7E,uBAAoB;AAEpB,MAAM,WAAW,GAAG,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,oBAAoB,EAAE,UAAU,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE;IAChI,MAAM,GAAG,GAAG,eAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC9B,UAAU;IACV,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,IAAA,gBAAQ,EAAC,EAAE,CAAC,CAAA;IACpD,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,IAAA,gBAAQ,EAAC,EAAE,CAAC,CAAA;IACpD,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,IAAA,gBAAQ,EAAC,SAAS,CAAC,CAAA;IAErD,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,IAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YACzC,eAAe,CAAC,KAAK,CAAC,CAAA;SACvB;aAAK;YACJ,eAAe,CAAC,SAAS,CAAC,CAAA;SAC3B;IACH,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAA;IAEX,iCAAiC;IACjC,MAAM,gBAAgB,GAAG,IAAA,eAAO,EAAC,GAAG,EAAE;QACpC,OAAO,IAAA,uBAAe,EAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;IAC9C,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAA;IAE1B,MAAM,yBAAyB,GAAG,IAAA,eAAO,EAAC,GAAG,EAAE;QAC7C,IAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,CAAC,MAAM,EAAE;YAC7D,OAAO,KAAK,CAAA;SACb;QAED,OAAO,oBAAoB,CAAA;IAC7B,CAAC,EAAE,CAAC,oBAAoB,EAAE,gBAAgB,CAAC,CAAC,CAAA;IAE5C,8CAA8C;IAC9C,IAAA,iBAAS,EAAC,GAAG,EAAE;QACb,IAAI,qBAAqB,GAAG,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAA;QACnF,IAAG,KAAK,EAAE;YACR,qBAAqB,GAAG,CAAC,GAAG,gBAAgB,EAAE,KAAK,CAAC,CAAA;SACrD;QACD,MAAM,aAAa,GAAG,IAAA,2BAAmB,EAAC,gBAAgB,EAAE,qBAAqB,EAAE,yBAAyB,CAAC,CAAA;QAC7G,eAAe,CAAC,aAAa,CAAC,CAAA;IAChC,CAAC,EAAE,CAAC,gBAAgB,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,KAAK,CAAC,CAAC,CAAA;IAE1E,cAAc;IACd,MAAM,UAAU,GAAG,IAAA,eAAO,EAAC,GAAG,EAAE;QAC9B,OAAO,IAAA,oBAAY,EAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAA;IAChE,CAAC,EAAE,CAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAA;IAE/C,cAAc;IACd,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,EAAE;QAC5B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,EAAE,CAAA;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAChF,IAAG,IAAI,EAAE;YACP,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YACrF,eAAe,CAAC,IAAI,CAAC,CAAA;SACtB;aAAK;YACJ,eAAe,CAAC,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,CAAC,CAAA;SAC1C;IACH,CAAC,CAAA;IAED,MAAM,iBAAiB,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,EAAE;QAC/C,OAAO,8BAAC,kBAAQ,IAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,GAAI,CAAA;IAC5D,CAAC,CAAA;IAED,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,EAAE;QAC9B,eAAe,CAAC,MAAM,CAAC,CAAA;QACvB,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,MAAM,CAAC,CAAA;IACpB,CAAC,CAAA;IAED,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,EAAE;QACxB,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAA;QAEnC,YAAY,CAAC,YAAY,CAAC,CAAA;IAC5B,CAAC,CAAA;IAED,OAAO,CACL,uCAAK,SAAS,EAAC,kBAAkB;QAC9B,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,8BAAC,eAAK,IAAC,QAAQ,EAAE,WAAW,EAAE,UAAU,SAAG,CAAC,CAAC,CAAC,EAAE;QAE5G,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAClD,8BAAC,eAAK,IAAC,IAAI,EAAC,OAAO,GAAG,CAAC,CAAC;YACxB,8BAAC,yBAAI,IACH,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,GAAG,EACX,UAAU,EAAE,EAAE,EACd,IAAI,EAAE,UAAU,IAGd,CAAC,IAAI,EAAE,EAAE;gBACP,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;gBACjC,MAAM,IAAI,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC9C,OAAO,CACL,uCAAK,SAAS,EAAC,uBAAuB,EAClC,KAAK,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,EAAE,EAAE;oBAClC,uCAAK,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,IACtC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,8BAAC,cAAI,IAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,GAAI,CAAC,CAAC,CAAC,8BAAC,cAAI,OAAG,CAC7I;oBAEN,uCACE,SAAS,EAAE,+BAA+B,YAAY,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,oCAAoC,CAAC,CAAC,CAAC,EAAG,EAAE,EACpH,OAAO,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,IAEtC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,CAChF,CACJ,CACP,CAAA;YACH,CAAC,CAEE,CAEL,CACP,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,WAAW,CAAA","sourcesContent":["/*\n * @Descripttion: 最简单的tree下拉框，增加了虚拟滚动\n * @Author: 郑泳健\n * @Date: 2024-07-31 14:46:55\n * @LastEditors: 郑泳健\n * @LastEditTime: 2024-08-05 15:58:47\n */\nimport React, { useState, useMemo, useEffect } from 'react';\nimport List from 'rc-virtual-list';\nimport Icon from '../icon'\nimport Ellipsis from '../ellipsis';\nimport Empty from '../empty';\nimport Input from '../input';\nimport { flatTreeData, getFullExpandedKeys, addTreeNodeKeys } from './utils';\nimport './tree.less'\n\nconst VirtualTree = ({ value, onChange, treeDefaultExpandAll, fieldNames, treeExpandedKeys, showSearch, treeData, renderItem }) => {\n  const ref = React.useRef(null)\n  // 展开的节点列表\n  const [expandedKeys, setExpandedKeys] = useState([])\n  const [choosedValue, setChoosedValue] = useState([])\n  const [filterKey, setFilterKey] = useState(undefined)\n\n  useEffect(() => {\n    if(!['', null, undefined].includes(value)) {\n      setChoosedValue(value)\n    }else {\n      setChoosedValue(undefined)\n    }\n  }, [value])\n\n  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */\n  const treeDataWithKeys = useMemo(() => {\n    return addTreeNodeKeys(treeData, fieldNames)\n  }, [treeData, fieldNames])\n\n  const mergeTreeDefaultExpandAll = useMemo(() => {\n    if(Array.isArray(treeExpandedKeys) && treeExpandedKeys.length) {\n      return false\n    }\n\n    return treeDefaultExpandAll\n  }, [treeDefaultExpandAll, treeExpandedKeys])\n\n  /** 获取到所有展开的节点，因为treeDataWithKeys可能传入的是最后一级 */\n  useEffect(() => {\n    let transTreeExpandedKeys = Array.isArray(treeExpandedKeys) ? treeExpandedKeys : []\n    if(value) {\n      transTreeExpandedKeys = [...treeExpandedKeys, value]\n    }\n    const _expandedKeys = getFullExpandedKeys(treeDataWithKeys, transTreeExpandedKeys, mergeTreeDefaultExpandAll)\n    setExpandedKeys(_expandedKeys)\n  }, [treeDataWithKeys, treeExpandedKeys, mergeTreeDefaultExpandAll, value])\n\n  /** 最终渲染的数据 */\n  const renderData = useMemo(() => {\n    return flatTreeData(treeDataWithKeys, filterKey, expandedKeys)\n  }, [treeDataWithKeys, filterKey, expandedKeys])\n\n  /** 切换展开/收起 */\n  const handleToggle = (item) => {\n    const { value } = item || {}\n    const bool = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;\n    if(bool) {\n      const list = Array.isArray(expandedKeys) ? expandedKeys.filter(i => i !== value) : []\n      setExpandedKeys(list)\n    }else {\n      setExpandedKeys([...expandedKeys, value])\n    }\n  }\n\n  const defaultRenderItem = (item, expandedKeys) => {\n    return <Ellipsis title={item.title} widthLimit={'100%'} />\n  }\n\n  const handleChange = (_value) => {\n    setChoosedValue(_value)\n    onChange?.(_value)\n  }\n\n  const handleInput = (e) => {\n    const _filterValue = e.target.value\n\n    setFilterKey(_filterValue)\n  }\n\n  return (\n    <div className='tntd-tree-select'>\n      {showSearch && Array.isArray(treeData) && !!treeData.length ? <Input onChange={handleInput} allowClear /> : ''}\n      {\n        !Array.isArray(renderData) || !renderData.length ? \n        <Empty size='small' /> :\n        <List\n          ref={ref}\n          height={300}\n          itemHeight={44}\n          data={renderData}\n        >\n          {\n            (item) => { \n              const { level, children } = item;\n              const bool = expandedKeys.includes(item.value)\n              return (\n                <div className=\"tntd-tree-select-item\"\n                    style={{ paddingLeft: level * 18 }}>\n                    <div style={{ width: 18, paddingLeft: 3 }}>\n                      {Array.isArray(children) && !!children.length ? <Icon type={bool ? 'caret-down' : 'caret-right'} onClick={() => handleToggle(item)} /> : <Icon />}\n                    </div>\n                   \n                    <div \n                      className={`tntd-tree-select-item-title ${choosedValue === item.value ? 'tntd-tree-select-item-title_active' : '' }`}\n                      onClick={() => handleChange(item.value)}\n                    >\n                      {renderItem ? renderItem(item, expandedKeys) : defaultRenderItem(item, expandedKeys)}\n                    </div>\n                </div>\n              )\n            }\n          }\n        </List>\n      }\n    </div>\n  );\n};\n\nexport default VirtualTree\n"]}

package/lib/tntd-virtual-tree-select/index.d.ts

@@ -0,0 +1,17 @@
+export default TntdVirtualTreeSelect;
+declare function TntdVirtualTreeSelect({ value, onChange, renderItem, treeData, showSearch, treeDefaultExpandAll, treeExpandedKeys, fieldNames, dropdownMatchSelectWidth, dropdownStyle, treeCheckable, ...restProps }: {
+    [x: string]: any;
+    value: any;
+    onChange: any;
+    renderItem: any;
+    treeData: any;
+    showSearch: any;
+    treeDefaultExpandAll: any;
+    treeExpandedKeys: any;
+    fieldNames: any;
+    dropdownMatchSelectWidth: any;
+    dropdownStyle: any;
+    treeCheckable: any;
+}): React.JSX.Element;
+import React from "react";
+//# sourceMappingURL=index.d.ts.map

package/lib/tntd-virtual-tree-select/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tntd-virtual-tree-select/index.jsx"],"names":[],"mappings":";AAYA;;;;;;;;;;;;;sBA6BC"}