tntd 3.0.9-beta.3 → 3.0.10

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

@@ -1,14 +1,10 @@
 "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.getNodeValuess = exports.getNodeStr = exports.getNodeParentChoosed = exports.getNodeAllChildrenValue = exports.getIndeterminate = exports.getFullExpandedKeys = exports.getFullCheckedKeys = exports.flatTreeData = exports.addTreeNodeAttrs = void 0;
+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 _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : 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 _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); }
@@ -24,7 +20,12 @@ var __rest = void 0 && (void 0).__rest || function (s, e) {
   return t;
 };
 /**
- * 初始化给树的每个节点增加属性字段（childrenValues, titleTotal, parentsValues, siblingsValue），childrenValues: 当前节点下的所有子节点的value和, titleTotal: 当前节点下的所有子节点的title和 parentsValues: 当前节点所有的父节点 siblingsValue: 当前节点所有上级节点的兄弟节点
+ * 初始化给树的每个节点增加以下属性字段
+ * childrenValues: 当前节点下的所有子节点的value和（包含了disabled节点）用户展开/收起
+ * titleTotal: 当前节点下的所有子节点的title和 （包含了disabled节点）用于搜索
+ * needCheckedChildrenValues: 当前节点下的节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中
+ * needCheckedLastestChildrenValues: 当前节点下的最底层节点（即无children）的value和（不包含了disabled节点），用于选中/取消选中
+ * needCheckedSiblingsValue: 当前节点所有上级节点的兄弟节点， [{ key: '上级节点value', list: [xx] }] list包含非disabled节点 用于选中/取消选中
  * 用于判断后续展开/收起
  * @param {*} treeData
  */
@@ -35,8 +36,7 @@ var addTreeNodeAttrs = exports.addTreeNodeAttrs = function addTreeNodeAttrs(tree
     children: 'children',
     disabled: 'disabled'
   };
-  var parentsValues = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  var siblingsValue = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+  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']];
@@ -45,9 +45,22 @@ var addTreeNodeAttrs = exports.addTreeNodeAttrs = function addTreeNodeAttrs(tree
       var children = item.children,
         query = __rest(item, ["children"]);
       if (Array.isArray(children) && !!children.length) {
-        query.children = addTreeNodeAttrs(children, fieldNames, [item.value].concat(_toConsumableArray(parentsValues)), Object.assign(Object.assign({}, siblingsValue), _defineProperty({}, item.value, children.map(function (i) {
-          return i[fieldNames['value']];
-        }))));
+        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']],
@@ -55,8 +68,9 @@ var addTreeNodeAttrs = exports.addTreeNodeAttrs = function addTreeNodeAttrs(tree
         disabled: query[fieldNames['disabled']],
         childrenValues: getNodeValuess(query, false),
         titleTotal: getNodeStr(query, fieldNames['title']),
-        parentsValues: parentsValues,
-        siblingsValue: siblingsValue
+        needCheckedLastestChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledLastestChildrenValues(item, fieldNames) : [],
+        needCheckedChildrenValues: !item[fieldNames['disabled']] ? getNodeNoDisabledChildrenValues(item, fieldNames) : [],
+        needCheckedSiblingsValue: !item[fieldNames['disabled']] ? needCheckedSiblingsValue : []
       });
     });
   }
@@ -115,13 +129,9 @@ var flatTreeData = exports.flatTreeData = function flatTreeData(treeData) {
         var i = _step.value;
         var value = i.value,
           children = i.children,
-          childrenValues = i.childrenValues,
-          parentsValues = i.parentsValues,
           titleTotal = i.titleTotal,
-          siblingsValue = i.siblingsValue,
           title = i.title,
-          disabled = i.disabled,
-          rest = __rest(i, ["value", "children", "childrenValues", "parentsValues", "titleTotal", "siblingsValue", "title", "disabled"]);
+          rest = __rest(i, ["value", "children", "titleTotal", "title"]);
         // 判断是否命中过滤
         var bingo = true;
         var transFilterKey = !['', null, undefined].includes(filterKey);
@@ -131,17 +141,9 @@ var flatTreeData = exports.flatTreeData = function flatTreeData(treeData) {
           }) : false;
         }
         if (bingo) {
-          result.push({
-            value: value,
-            children: children,
-            title: title,
-            level: level,
-            titleTotal: titleTotal,
-            childrenValues: childrenValues,
-            parentsValues: parentsValues,
-            siblingsValue: siblingsValue,
-            disabled: disabled
-          });
+          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) {
@@ -186,7 +188,7 @@ var getFullExpandedKeys = exports.getFullExpandedKeys = function getFullExpanded
   return result;
 };
 /**
- * 获取所有选中的节点 （组件传入最后一层，需要将其上层和自身全部加入到expandedKeys）
+ * 初始化根据用户传入的值获取其关联节点是否要在checkList
  * @param {*} treeDataWithKeys
  * @param {*} transCheckedKeys
  * @param {*} result
@@ -198,38 +200,66 @@ var getFullCheckedKeys = exports.getFullCheckedKeys = function getFullCheckedKey
     return [];
   }
   treeDataWithKeys.forEach(function (i) {
-    var childrenValues = i.childrenValues,
-      value = i.value,
-      children = i.children;
-    if (Array.isArray(childrenValues) && [].concat(_toConsumableArray(childrenValues), [value]).some(function (el) {
-      return transCheckedKeys.includes(el);
-    })) {
+    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) {
-        result = [].concat(_toConsumableArray(result), _toConsumableArray(getFullCheckedKeys(children, transCheckedKeys)));
+    }
+    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
- * @param {*} result
  * @returns
  */
-var getNodeAllChildrenValue = exports.getNodeAllChildrenValue = function getNodeAllChildrenValue(node) {
-  var isSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+var getNodeNoDisabledLastestChildrenValues = exports.getNodeNoDisabledLastestChildrenValues = function getNodeNoDisabledLastestChildrenValues(node, fieldNames) {
   var result = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
-  var value = node.value,
-    children = node.children;
-  if (!['', null, undefined].includes(value) || !isSelf) {
-    result.push(value);
+  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']]);
+    }
   }
-  if (Array.isArray(children)) {
-    children.forEach(function (i) {
-      result = [].concat(_toConsumableArray(result), _toConsumableArray(getNodeAllChildrenValue(i, false)));
+  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;
 };
@@ -238,47 +268,48 @@ var getNodeAllChildrenValue = exports.getNodeAllChildrenValue = function getNode
  * @param {*} item
  * @param {*} checkedList
  */
-var getIndeterminate = exports.getIndeterminate = function getIndeterminate(item, 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;
   }
-  // 如果有子节点，判断子节点是否都被选中
-  var list = getNodeAllChildrenValue(item);
+  // 当前节点下的去掉disabled的所有末级节点
+  var list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];
   var childrenCheckedList = list.filter(function (i) {
-    return checkedList.includes(i);
+    return checkedList === null || checkedList === void 0 ? void 0 : checkedList.includes(i);
   });
   return childrenCheckedList.length > 0 && childrenCheckedList.length < list.length;
 };
 /**
  * 获取当前节点的父亲节点是否需要被选中
- * @param {*} parentsValues
- * @param {*} siblingsValue
+ * @param {*} needCheckedSiblingsValue
  * @param {*} checkedList
  * @returns
  */
-var getNodeParentChoosed = exports.getNodeParentChoosed = function getNodeParentChoosed(parentsValues, siblingsValue, checkedList) {
-  if (!Array.isArray(parentsValues) || !parentsValues.length || !Array.isArray(checkedList) || !checkedList.length) {
+var getNodeParentChoosed = exports.getNodeParentChoosed = function getNodeParentChoosed(needCheckedSiblingsValue, checkedList) {
+  if (!Array.isArray(checkedList) || !checkedList.length) {
     return [];
   }
   var result = [];
-  var _iterator2 = _createForOfIteratorHelper(parentsValues),
+  var _iterator2 = _createForOfIteratorHelper(needCheckedSiblingsValue),
     _step2;
   try {
     for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
       var item = _step2.value;
-      var list = Array.isArray(siblingsValue[item]) ? siblingsValue[item] : [];
-      var bool = list.every(function (it) {
+      var _ref = item || {},
+        key = _ref.key,
+        list = _ref.list;
+      // 过滤掉子节点为disabled的
+      var bool = Array.isArray(list) ? list.every(function (it) {
         return checkedList.includes(it);
-      });
-      if (!bool) {
-        break;
+      }) : false;
+      if (bool) {
+        checkedList.push(key);
+        result.push(key);
       }
-      checkedList.push(item);
-      result.push(item);
     }
   } catch (err) {
     _iterator2.e(err);
@@ -286,4 +317,37 @@ var getNodeParentChoosed = exports.getNodeParentChoosed = function getNodeParent
     _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

@@ -1 +1 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree/utils.js"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA;;;;GAIG;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,aAAa,GAAG,EAAE,EAClB,aAAa,GAAG,EAAE,EAClB,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,KAAK,CAAC,QAAQ,GAAG,IAAA,wBAAgB,EAAC,QAAQ,EAAE,UAAU,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,aAAa,CAAC,kCACjF,aAAa,KAChB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,IACzD,CAAC;aACJ;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,aAAa;gBACb,aAAa,IACb;QACJ,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAhCW,QAAA,gBAAgB,oBAgC3B;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,cAAc,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,KAAc,CAAC,EAAV,IAAI,UAAK,CAAC,EAA3G,4GAAuG,CAAI,CAAC;YAElH,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,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,cAAc,EAAE,aAAa,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC;aACpH;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,cAAc,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAE9C,IAAI,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,EAAE;YAC3G,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,0BAAkB,EAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC;aACzE;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAlBW,QAAA,kBAAkB,sBAkB7B;AAEF;;;;;GAKG;AACI,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,EAAE;IAC1E,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;IAEjC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE;QACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACpB;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAC3B,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACrB,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,IAAA,+BAAuB,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAdW,QAAA,uBAAuB,2BAclC;AAEF;;;;GAIG;AACI,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE;IACpD,sBAAsB;IACtB,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,qBAAqB;IACrB,MAAM,IAAI,GAAG,IAAA,+BAAuB,EAAC,IAAI,CAAC,CAAC;IAE3C,MAAM,mBAAmB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAExE,OAAO,mBAAmB,CAAC,MAAM,GAAG,CAAC,IAAI,mBAAmB,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;AACpF,CAAC,CAAC;AAhBW,QAAA,gBAAgB,oBAgB3B;AAEF;;;;;;GAMG;AACI,MAAM,oBAAoB,GAAG,CAAC,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,EAAE;IAChF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;QAChH,OAAO,EAAE,CAAC;KACX;IACD,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,IAAI,IAAI,aAAa,EAAE;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,IAAI,EAAE;YACT,MAAM;SACP;QACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;KACnB;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAhBW,QAAA,oBAAoB,wBAgB/B","sourcesContent":["/**\n * 初始化给树的每个节点增加属性字段（childrenValues, titleTotal, parentsValues, siblingsValue），childrenValues: 当前节点下的所有子节点的value和, titleTotal: 当前节点下的所有子节点的title和 parentsValues: 当前节点所有的父节点 siblingsValue: 当前节点所有上级节点的兄弟节点\n * 用于判断后续展开/收起\n * @param {*} treeData\n */\nexport const addTreeNodeAttrs = (\n  treeData,\n  fieldNames = { title: 'title', value: 'value', children: 'children', disabled: 'disabled' },\n  parentsValues = [],\n  siblingsValue = {}\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        query.children = addTreeNodeAttrs(children, fieldNames, [item.value, ...parentsValues], {\n          ...siblingsValue,\n          [item.value]: children.map((i) => i[fieldNames['value']])\n        });\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        parentsValues,\n        siblingsValue\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, childrenValues, parentsValues, titleTotal, siblingsValue, title, disabled, ...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({ value, children, title, level, titleTotal, childrenValues, parentsValues, siblingsValue, disabled });\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 * 获取所有选中的节点 （组件传入最后一层，需要将其上层和自身全部加入到expandedKeys）\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 { childrenValues, value, children } = i;\n\n    if (Array.isArray(childrenValues) && [...childrenValues, value].some((el) => transCheckedKeys.includes(el))) {\n      result.push(value);\n\n      if (Array.isArray(children) && !!children.length) {\n        result = [...result, ...getFullCheckedKeys(children, transCheckedKeys)];\n      }\n    }\n  });\n\n  return result;\n};\n\n/**\n * 获取当前节点下的所有子节点\n * @param {*} node\n * @param {*} result\n * @returns\n */\nexport const getNodeAllChildrenValue = (node, isSelf = true, result = []) => {\n  const { value, children } = node;\n\n  if (!['', null, undefined].includes(value) || !isSelf) {\n    result.push(value);\n  }\n\n  if (Array.isArray(children)) {\n    children.forEach((i) => {\n      result = [...result, ...getNodeAllChildrenValue(i, false)];\n    });\n  }\n\n  return result;\n};\n\n/**\n * 判断当前节点是否半选\n * @param {*} item\n * @param {*} checkedList\n */\nexport const getIndeterminate = (item, checkedList) => {\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  // 如果有子节点，判断子节点是否都被选中\n  const list = getNodeAllChildrenValue(item);\n\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 {*} parentsValues\n * @param {*} siblingsValue\n * @param {*} checkedList\n * @returns\n */\nexport const getNodeParentChoosed = (parentsValues, siblingsValue, checkedList) => {\n  if (!Array.isArray(parentsValues) || !parentsValues.length || !Array.isArray(checkedList) || !checkedList.length) {\n    return [];\n  }\n  let result = [];\n  for (let item of parentsValues) {\n    const list = Array.isArray(siblingsValue[item]) ? siblingsValue[item] : [];\n    const bool = list.every((it) => checkedList.includes(it));\n    if (!bool) {\n      break;\n    }\n    checkedList.push(item);\n    result.push(item);\n  }\n\n  return result;\n};\n"]}
+{"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/package.json

@@ -1,6 +1,6 @@
 {
     "name": "tntd",
-    "version": "3.0.9-beta.3",
+    "version": "3.0.10",
     "license": "MIT",
     "scripts": {
         "start": "heft start --storybook",