tntd 3.0.9 → 3.0.11-beta.1

package/es/tntd-virtual-tree/index.js

@@ -0,0 +1,229 @@
+import _uniq from "lodash/uniq";
+/*
+ * @Descripttion: 基于antd3 tree 部分api实现的tree，增加了虚拟滚动
+ * @Author: 郑泳健
+ * @Date: 2024-07-31 14:46:55
+ * @LastEditors: 郑泳健
+ * @LastEditTime: 2024-08-19 11:02:06
+ */
+import React, { useState, useMemo, useEffect, useRef } from 'react';
+import List from 'rc-virtual-list';
+import Icon from '../icon';
+import Ellipsis from '../ellipsis';
+import Empty from '../empty';
+import Checkbox from '../checkbox';
+import { flatTreeData, findNodeDetail, getFullExpandedKeys, getFullCheckedKeys, getNodeParentChoosed, addTreeNodeAttrs, getIndeterminate } from './utils';
+import './index.less';
+const VirtualTree = ({
+  value,
+  itemHeight,
+  height,
+  filterKey,
+  treeData,
+  checkable,
+  checkStrictly,
+  checkedKeys,
+  defaultExpandAll = true,
+  expandedKeys,
+  fieldNames,
+  titleRender,
+  onCheck,
+  onExpand,
+  onSelect
+}) => {
+  const ref = React.useRef(null);
+  const expandChangedRef = useRef(0);
+  const checkedChangeRef = useRef(0);
+  // 展开的节点列表
+  const [expandedList, setExpandedList] = useState([]);
+  // checked 节点列表
+  const [checkedList, setCheckedList] = useState([]);
+  // 当前被选中的节点
+  const [choosedValue, setChoosedValue] = useState(undefined);
+  useEffect(() => {
+    if (!checkable) {
+      setChoosedValue(value);
+    }
+  }, [value, checkable]);
+  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */
+  const treeDataWithKeys = useMemo(() => {
+    return addTreeNodeAttrs(treeData, fieldNames);
+  }, [treeData, fieldNames]);
+  /** 默认是否全部展开 */
+  const mergeDefaultExpandAll = useMemo(() => {
+    if (Array.isArray(expandedKeys)) {
+      return false;
+    }
+    return defaultExpandAll;
+  }, [defaultExpandAll, expandedKeys]);
+  /** 获取到所有选中的节点，因为checkedKeys可能传入的是最后一级 */
+  useEffect(() => {
+    // 非第一次
+    if (checkedChangeRef.current > 0) {
+      setCheckedList(checkedKeys);
+      return;
+    }
+    if (checkable) {
+      // 如果是受控
+      if (checkStrictly) {
+        setCheckedList(_uniq(Array.isArray(checkedKeys) ? checkedKeys : []));
+        return;
+      }
+      const transCheckedKeys = Array.isArray(checkedKeys) ? checkedKeys.reduce((total, item) => {
+        total.push(item);
+        const {
+          needCheckedChildrenValues
+        } = findNodeDetail(treeDataWithKeys, item) || {};
+        total = [...total, ...needCheckedChildrenValues];
+        return total;
+      }, []) : [];
+      const _checkedKeys = getFullCheckedKeys(treeDataWithKeys, transCheckedKeys);
+      setCheckedList(_uniq(_checkedKeys));
+    }
+  }, [treeDataWithKeys, checkStrictly, checkable, checkedKeys]);
+  useEffect(() => {
+    setExpandedList(expandedKeys);
+  }, [expandedKeys]);
+  /** 初始化获取到所有展开的节点，因为初始化expandedKeys可能传入的是最后一级 */
+  useEffect(() => {
+    if (expandChangedRef.current === 0) {
+      // 展开的节点
+      const transExpandedKeys = Array.isArray(expandedKeys) ? expandedKeys : [];
+      const _expandedKeys = getFullExpandedKeys(treeDataWithKeys, transExpandedKeys, mergeDefaultExpandAll);
+      setExpandedList(_expandedKeys);
+    }
+  }, [treeDataWithKeys, expandedKeys, mergeDefaultExpandAll]);
+  /** 最终渲染的数据 */
+  const renderData = useMemo(() => {
+    return flatTreeData(treeDataWithKeys, filterKey, expandedList);
+  }, [treeDataWithKeys, filterKey, expandedList]);
+  /** 切换展开/收起 */
+  const handleToggle = item => {
+    expandChangedRef.current++;
+    const {
+      value
+    } = item || {};
+    const bool = Array.isArray(expandedList) ? expandedList.includes(value) : false;
+    if (bool) {
+      const list = Array.isArray(expandedList) ? expandedList.filter(i => i !== value) : [];
+      if (onExpand) {
+        onExpand(_uniq(list), {
+          node: item,
+          expanded: !bool
+        });
+        return;
+      }
+      setExpandedList(_uniq(list));
+    } else {
+      const arr = _uniq([...expandedList, value]);
+      if (onExpand) {
+        onExpand(arr, {
+          node: item,
+          expanded: !bool
+        });
+        return;
+      }
+      setExpandedList(arr);
+    }
+  };
+  const handleCheck = (item, isChecked) => {
+    const {
+      value: _value,
+      children,
+      disabled
+    } = item;
+    if (disabled) {
+      return;
+    }
+    checkedChangeRef.current++;
+    // 需要增删的子节点
+    const itemChildrenValues = Array.isArray(children) && !!children.length ? item.needCheckedChildrenValues : [];
+    if (isChecked) {
+      // 需要删除的父节点
+      const itemParentValues = Array.isArray(item.needCheckedSiblingsValue) ? item.needCheckedSiblingsValue.map(i => i.key) : [];
+      // 当前节点所有的父节点
+      const delList = checkStrictly ? [_value] : [...itemChildrenValues, ...itemParentValues, _value];
+      const _checkedList = checkedList.filter(i => !delList.includes(i));
+      if (onCheck) {
+        onCheck === null || onCheck === void 0 ? void 0 : onCheck(_uniq(_checkedList), item, !isChecked);
+        return;
+      }
+      setCheckedList(_uniq(_checkedList));
+    } else {
+      // 递归循环其上级是否也要被选中
+      const itemParentValues = getNodeParentChoosed(item.needCheckedSiblingsValue, [...checkedList, ...itemChildrenValues, _value]);
+      const addList = checkStrictly ? [_value] : [...itemChildrenValues, ...itemParentValues, _value];
+      const _checkedList = [...checkedList, ...addList];
+      if (onCheck) {
+        onCheck === null || onCheck === void 0 ? void 0 : onCheck(_uniq(_checkedList), item, !isChecked);
+        return;
+      }
+      setCheckedList(_uniq(_checkedList));
+    }
+  };
+  const handleChoosed = item => {
+    if (item.disabled) {
+      return;
+    }
+    setChoosedValue(item.value);
+    if (!checkable) {
+      onSelect === null || onSelect === void 0 ? void 0 : onSelect(item.value);
+    }
+  };
+  const defaultRenderItem = item => {
+    return React.createElement(Ellipsis, {
+      title: item.title,
+      widthLimit: '100%'
+    });
+  };
+  return React.createElement("div", {
+    className: "tntd-virtual-tree"
+  }, !Array.isArray(renderData) || !renderData.length ? React.createElement(Empty, {
+    size: "small"
+  }) : React.createElement(List, {
+    ref: ref,
+    height: height || 300,
+    itemHeight: itemHeight || 32,
+    data: renderData
+  }, item => {
+    const {
+      level,
+      children,
+      disabled
+    } = item;
+    const bool = Array.isArray(expandedList) ? expandedList.includes(item.value) : false;
+    // 当前节点半选状态
+    const indeterminateStatus = getIndeterminate(item, checkedList);
+    // 当前节点是否被选中
+    const checkedBingo = Array.isArray(checkedList) ? checkedList.includes(item.value) : false;
+    const isChecked = !checkStrictly || disabled ? checkedBingo && !indeterminateStatus : checkedBingo;
+    const checkBoxAttrs = {
+      className: `${disabled ? 'tntd-virtual-tree-checkbox-disabled' : ''}`,
+      onChange: () => handleCheck(item, isChecked),
+      checked: isChecked,
+      disabled
+    };
+    // 状态没有半选模式
+    if (!checkStrictly) {
+      checkBoxAttrs.indeterminate = indeterminateStatus;
+    }
+    return React.createElement("div", {
+      className: `tntd-virtual-tree-item ${disabled ? 'tntd-virtual-tree-item_disabled' : ''}`,
+      style: {
+        paddingLeft: level * 18
+      },
+      key: item.value
+    }, React.createElement("div", {
+      className: "tntd-virtual-tree-item-expand-icon"
+    }, Array.isArray(children) && !!children.length ? React.createElement(Icon, {
+      type: bool ? 'caret-down' : 'caret-right',
+      onClick: () => handleToggle(item)
+    }) : ''), checkable ? React.createElement("div", {
+      className: "tntd-virtual-tree-item-checkbox"
+    }, React.createElement(Checkbox, Object.assign({}, checkBoxAttrs))) : '', React.createElement("div", {
+      className: `tntd-virtual-tree-title ${choosedValue === item.value ? 'tntd-virtual-tree-title_active' : ''}`,
+      onClick: () => handleChoosed(item)
+    }, titleRender ? titleRender(item) : defaultRenderItem(item)));
+  }));
+};
+export default VirtualTree;

package/es/tntd-virtual-tree/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tntd-virtual-tree/index.jsx"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,KAAK,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,OAAO,CAAC;AACpE,OAAO,IAAI,MAAM,iBAAiB,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,IAAI,MAAM,SAAS,CAAC;AAC3B,OAAO,QAAQ,MAAM,aAAa,CAAC;AACnC,OAAO,KAAK,MAAM,UAAU,CAAC;AAC7B,OAAO,QAAQ,MAAM,aAAa,CAAC;AACnC,OAAO,EACL,YAAY,EACZ,cAAc,EACd,mBAAmB,EACnB,kBAAkB,EAClB,oBAAoB,EACpB,gBAAgB,EAChB,gBAAgB,EACjB,MAAM,SAAS,CAAC;AACjB,OAAO,cAAc,CAAC;AAEtB,MAAM,WAAW,GAAG,CAAC,EACnB,KAAK,EACL,UAAU,EACV,MAAM,EACN,SAAS,EACT,QAAQ,EACR,SAAS,EACT,aAAa,EACb,WAAW,EACX,gBAAgB,GAAG,IAAI,EACvB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,OAAO,EACP,QAAQ,EACR,QAAQ,EACT,EAAE,EAAE;IACH,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,gBAAgB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,gBAAgB,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACnC,UAAU;IACV,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACrD,eAAe;IACf,MAAM,CAAC,WAAW,EAAE,cAAc,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;IACnD,WAAW;IACX,MAAM,CAAC,YAAY,EAAE,eAAe,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAE5D,SAAS,CAAC,GAAG,EAAE;QACb,IAAG,CAAC,SAAS,EAAE;YACb,eAAe,CAAC,KAAK,CAAC,CAAA;SACvB;IACH,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAA;IAEtB,iCAAiC;IACjC,MAAM,gBAAgB,GAAG,OAAO,CAAC,GAAG,EAAE;QACpC,OAAO,gBAAgB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAChD,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC,CAAC;IAE3B,eAAe;IACf,MAAM,qBAAqB,GAAG,OAAO,CAAC,GAAG,EAAE;QACzC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;YAC/B,OAAO,KAAK,CAAC;SACd;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC,EAAE,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC,CAAC;IAErC,yCAAyC;IACzC,SAAS,CAAC,GAAG,EAAE;QACb,OAAO;QACP,IAAI,gBAAgB,CAAC,OAAO,GAAG,CAAC,EAAE;YAChC,cAAc,CAAC,WAAW,CAAC,CAAC;YAC5B,OAAO;SACR;QAED,IAAI,SAAS,EAAE;YACb,QAAQ;YACR,IAAI,aAAa,EAAE;gBACjB,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpE,OAAO;aACR;YACD,MAAM,gBAAgB,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC;gBACjD,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;oBACjC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjB,MAAM,EAAE,yBAAyB,EAAE,GAAG,cAAc,CAAC,gBAAgB,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;oBACnF,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,yBAAyB,CAAC,CAAC;oBACjD,OAAO,KAAK,CAAC;gBACf,CAAC,EAAE,EAAE,CAAC;gBACR,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,YAAY,GAAG,kBAAkB,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;YAC5E,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;SACpC;IACH,CAAC,EAAE,CAAC,gBAAgB,EAAE,aAAa,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC;IAE9D,SAAS,CAAC,GAAG,EAAE;QACb,eAAe,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IAEnB,gDAAgD;IAChD,SAAS,CAAC,GAAG,EAAE;QACb,IAAI,gBAAgB,CAAC,OAAO,KAAK,CAAC,EAAE;YAClC,QAAQ;YACR,MAAM,iBAAiB,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1E,MAAM,aAAa,GAAG,mBAAmB,CAAC,gBAAgB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;YACtG,eAAe,CAAC,aAAa,CAAC,CAAC;SAChC;IACH,CAAC,EAAE,CAAC,gBAAgB,EAAE,YAAY,EAAE,qBAAqB,CAAC,CAAC,CAAC;IAE5D,cAAc;IACd,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE;QAC9B,OAAO,YAAY,CAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IACjE,CAAC,EAAE,CAAC,gBAAgB,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;IAEhD,cAAc;IACd,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,EAAE;QAC5B,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAChF,IAAI,IAAI,EAAE;YACR,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACxF,IAAI,QAAQ,EAAE;gBACZ,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;gBACtD,OAAO;aACR;YACD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;SAC7B;aAAM;YACL,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC;YAC3C,IAAI,QAAQ,EAAE;gBACZ,QAAQ,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC/C,OAAO;aACR;YACD,eAAe,CAAC,GAAG,CAAC,CAAC;SACtB;IACH,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE;QACtC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QACnD,IAAI,QAAQ,EAAE;YACZ,OAAO;SACR;QACD,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3B,WAAW;QACX,MAAM,kBAAkB,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9G,IAAI,SAAS,EAAE;YACb,WAAW;YACX,MAAM,gBAAgB,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC7H,aAAa;YACb,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,kBAAkB,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,CAAC;YAChG,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACrE,IAAI,OAAO,EAAE;gBACX,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAG,IAAI,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC;gBAChD,OAAO;aACR;YAED,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;SACpC;aAAM;YACL,iBAAiB;YACjB,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC,GAAG,WAAW,EAAE,GAAG,kBAAkB,EAAE,MAAM,CAAC,CAAC,CAAC;YAC9H,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,kBAAkB,EAAE,GAAG,gBAAgB,EAAE,MAAM,CAAC,CAAC;YAChG,MAAM,YAAY,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,OAAO,CAAC,CAAC;YAElD,IAAI,OAAO,EAAE;gBACX,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAG,IAAI,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC;gBAChD,OAAO;aACR;YACD,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;SACpC;IACH,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,IAAI,EAAE,EAAE;QAC7B,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjB,OAAO;SACR;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAG,CAAC,SAAS,EAAE;YACb,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAG,IAAI,CAAC,KAAK,CAAC,CAAA;SACvB;IACH,CAAC,CAAC;IAEF,MAAM,iBAAiB,GAAG,CAAC,IAAI,EAAE,EAAE;QACjC,OAAO,oBAAC,QAAQ,IAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,GAAI,CAAC;IAC7D,CAAC,CAAC;IAEF,OAAO,CACL,6BAAK,SAAS,EAAC,mBAAmB,IAC/B,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAClD,oBAAC,KAAK,IAAC,IAAI,EAAC,OAAO,GAAG,CACvB,CAAC,CAAC,CAAC,CACF,oBAAC,IAAI,IAAC,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,IAAI,GAAG,EAAE,UAAU,EAAE,UAAU,IAAI,EAAE,EAAE,IAAI,EAAE,UAAU,IAClF,CAAC,IAAI,EAAE,EAAE;QACR,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACrF,WAAW;QACX,MAAM,mBAAmB,GAAG,gBAAgB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAChE,YAAY;QACZ,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3F,MAAM,SAAS,GAAG,CAAC,aAAa,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,CAAC;QAEnG,MAAM,aAAa,GAAG;YACpB,SAAS,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,qCAAqC,CAAC,CAAC,CAAC,EAAE,EAAE;YACrE,QAAQ,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC;YAC5C,OAAO,EAAE,SAAS;YAClB,QAAQ;SACT,CAAC;QACF,WAAW;QACX,IAAI,CAAC,aAAa,EAAE;YAClB,aAAa,CAAC,aAAa,GAAG,mBAAmB,CAAC;SACnD;QACD,OAAO,CACL,6BACE,SAAS,EAAE,0BAA0B,QAAQ,CAAC,CAAC,CAAC,iCAAiC,CAAC,CAAC,CAAC,EAAE,EAAE,EACxF,KAAK,EAAE,EAAE,WAAW,EAAE,KAAK,GAAG,EAAE,EAAE,EAClC,GAAG,EAAE,IAAI,CAAC,KAAK;YACf,6BAAK,SAAS,EAAC,oCAAoC,IAChD,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAC9C,oBAAC,IAAI,IAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,GAAI,CACvF,CAAC,CAAC,CAAC,CACF,EAAE,CACH,CACG;YAEL,SAAS,CAAC,CAAC,CAAC,CACX,6BAAK,SAAS,EAAC,iCAAiC;gBAC9C,oBAAC,QAAQ,oBAAK,aAAa,EAAI,CAC3B,CACP,CAAC,CAAC,CAAC,CACF,EAAE,CACH;YAED,6BACE,SAAS,EAAE,2BAA2B,YAAY,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,gCAAgC,CAAC,CAAC,CAAC,EAAE,EAAE,EAC3G,OAAO,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,IACjC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CACtD,CACF,CACP,CAAC;IACJ,CAAC,CACI,CACR,CACG,CACP,CAAC;AACJ,CAAC,CAAC;AAEF,eAAe,WAAW,CAAC","sourcesContent":["/*\n * @Descripttion: 基于antd3 tree 部分api实现的tree，增加了虚拟滚动\n * @Author: 郑泳健\n * @Date: 2024-07-31 14:46:55\n * @LastEditors: 郑泳健\n * @LastEditTime: 2024-08-19 11:02:06\n */\nimport React, { useState, useMemo, useEffect, useRef } from 'react';\nimport List from 'rc-virtual-list';\nimport { uniq } from 'lodash';\nimport Icon from '../icon';\nimport Ellipsis from '../ellipsis';\nimport Empty from '../empty';\nimport Checkbox from '../checkbox';\nimport {\n  flatTreeData,\n  findNodeDetail,\n  getFullExpandedKeys,\n  getFullCheckedKeys,\n  getNodeParentChoosed,\n  addTreeNodeAttrs,\n  getIndeterminate\n} from './utils';\nimport './index.less';\n\nconst VirtualTree = ({\n  value,\n  itemHeight,\n  height,\n  filterKey,\n  treeData,\n  checkable,\n  checkStrictly,\n  checkedKeys,\n  defaultExpandAll = true,\n  expandedKeys,\n  fieldNames,\n  titleRender,\n  onCheck,\n  onExpand,\n  onSelect\n}) => {\n  const ref = React.useRef(null);\n  const expandChangedRef = useRef(0);\n  const checkedChangeRef = useRef(0);\n  // 展开的节点列表\n  const [expandedList, setExpandedList] = useState([]);\n  // checked 节点列表\n  const [checkedList, setCheckedList] = useState([]);\n  // 当前被选中的节点\n  const [choosedValue, setChoosedValue] = useState(undefined);\n\n  useEffect(() => {\n    if(!checkable) {\n      setChoosedValue(value)\n    }\n  }, [value, checkable])\n\n  /** 给每个节点增加属性keys，值为其下面所有节点的集合 */\n  const treeDataWithKeys = useMemo(() => {\n    return addTreeNodeAttrs(treeData, fieldNames);\n  }, [treeData, fieldNames]);\n\n  /** 默认是否全部展开 */\n  const mergeDefaultExpandAll = useMemo(() => {\n    if (Array.isArray(expandedKeys)) {\n      return false;\n    }\n\n    return defaultExpandAll;\n  }, [defaultExpandAll, expandedKeys]);\n\n  /** 获取到所有选中的节点，因为checkedKeys可能传入的是最后一级 */\n  useEffect(() => {\n    // 非第一次\n    if (checkedChangeRef.current > 0) {\n      setCheckedList(checkedKeys);\n      return;\n    }\n\n    if (checkable) {\n      // 如果是受控\n      if (checkStrictly) {\n        setCheckedList(uniq(Array.isArray(checkedKeys) ? checkedKeys : []));\n        return;\n      }\n      const transCheckedKeys = Array.isArray(checkedKeys)\n        ? checkedKeys.reduce((total, item) => {\n            total.push(item);\n            const { needCheckedChildrenValues } = findNodeDetail(treeDataWithKeys, item) || {};\n            total = [...total, ...needCheckedChildrenValues];\n            return total;\n          }, [])\n        : [];\n      const _checkedKeys = getFullCheckedKeys(treeDataWithKeys, transCheckedKeys);\n      setCheckedList(uniq(_checkedKeys));\n    }\n  }, [treeDataWithKeys, checkStrictly, checkable, checkedKeys]);\n\n  useEffect(() => {\n    setExpandedList(expandedKeys);\n  }, [expandedKeys]);\n\n  /** 初始化获取到所有展开的节点，因为初始化expandedKeys可能传入的是最后一级 */\n  useEffect(() => {\n    if (expandChangedRef.current === 0) {\n      // 展开的节点\n      const transExpandedKeys = Array.isArray(expandedKeys) ? expandedKeys : [];\n      const _expandedKeys = getFullExpandedKeys(treeDataWithKeys, transExpandedKeys, mergeDefaultExpandAll);\n      setExpandedList(_expandedKeys);\n    }\n  }, [treeDataWithKeys, expandedKeys, mergeDefaultExpandAll]);\n\n  /** 最终渲染的数据 */\n  const renderData = useMemo(() => {\n    return flatTreeData(treeDataWithKeys, filterKey, expandedList);\n  }, [treeDataWithKeys, filterKey, expandedList]);\n\n  /** 切换展开/收起 */\n  const handleToggle = (item) => {\n    expandChangedRef.current++;\n    const { value } = item || {};\n    const bool = Array.isArray(expandedList) ? expandedList.includes(value) : false;\n    if (bool) {\n      const list = Array.isArray(expandedList) ? expandedList.filter((i) => i !== value) : [];\n      if (onExpand) {\n        onExpand(uniq(list), { node: item, expanded: !bool });\n        return;\n      }\n      setExpandedList(uniq(list));\n    } else {\n      const arr = uniq([...expandedList, value]);\n      if (onExpand) {\n        onExpand(arr, { node: item, expanded: !bool });\n        return;\n      }\n      setExpandedList(arr);\n    }\n  };\n\n  const handleCheck = (item, isChecked) => {\n    const { value: _value, children, disabled } = item;\n    if (disabled) {\n      return;\n    }\n    checkedChangeRef.current++;\n    // 需要增删的子节点\n    const itemChildrenValues = Array.isArray(children) && !!children.length ? item.needCheckedChildrenValues : [];\n    if (isChecked) {\n      // 需要删除的父节点\n      const itemParentValues = Array.isArray(item.needCheckedSiblingsValue) ? item.needCheckedSiblingsValue.map((i) => i.key) : [];\n      // 当前节点所有的父节点\n      const delList = checkStrictly ? [_value] : [...itemChildrenValues, ...itemParentValues, _value];\n      const _checkedList = checkedList.filter((i) => !delList.includes(i));\n      if (onCheck) {\n        onCheck?.(uniq(_checkedList), item, !isChecked);\n        return;\n      }\n\n      setCheckedList(uniq(_checkedList));\n    } else {\n      // 递归循环其上级是否也要被选中\n      const itemParentValues = getNodeParentChoosed(item.needCheckedSiblingsValue, [...checkedList, ...itemChildrenValues, _value]);\n      const addList = checkStrictly ? [_value] : [...itemChildrenValues, ...itemParentValues, _value];\n      const _checkedList = [...checkedList, ...addList];\n\n      if (onCheck) {\n        onCheck?.(uniq(_checkedList), item, !isChecked);\n        return;\n      }\n      setCheckedList(uniq(_checkedList));\n    }\n  };\n\n  const handleChoosed = (item) => {\n    if (item.disabled) {\n      return;\n    }\n    setChoosedValue(item.value);\n    if(!checkable) {\n      onSelect?.(item.value)\n    }\n  };\n\n  const defaultRenderItem = (item) => {\n    return <Ellipsis title={item.title} widthLimit={'100%'} />;\n  };\n\n  return (\n    <div className=\"tntd-virtual-tree\">\n      {!Array.isArray(renderData) || !renderData.length ? (\n        <Empty size=\"small\" />\n      ) : (\n        <List ref={ref} height={height || 300} itemHeight={itemHeight || 32} data={renderData}>\n          {(item) => {\n            const { level, children, disabled } = item;\n            const bool = Array.isArray(expandedList) ? expandedList.includes(item.value) : false;\n            // 当前节点半选状态\n            const indeterminateStatus = getIndeterminate(item, checkedList);\n            // 当前节点是否被选中\n            const checkedBingo = Array.isArray(checkedList) ? checkedList.includes(item.value) : false;\n            const isChecked = !checkStrictly || disabled ? checkedBingo && !indeterminateStatus : checkedBingo;\n\n            const checkBoxAttrs = {\n              className: `${disabled ? 'tntd-virtual-tree-checkbox-disabled' : ''}`,\n              onChange: () => handleCheck(item, isChecked),\n              checked: isChecked,\n              disabled\n            };\n            // 状态没有半选模式\n            if (!checkStrictly) {\n              checkBoxAttrs.indeterminate = indeterminateStatus;\n            }\n            return (\n              <div\n                className={`tntd-virtual-tree-item ${disabled ? 'tntd-virtual-tree-item_disabled' : ''}`}\n                style={{ paddingLeft: level * 18 }}\n                key={item.value}>\n                <div className=\"tntd-virtual-tree-item-expand-icon\">\n                  {Array.isArray(children) && !!children.length ? (\n                    <Icon type={bool ? 'caret-down' : 'caret-right'} onClick={() => handleToggle(item)} />\n                  ) : (\n                    ''\n                  )}\n                </div>\n\n                {checkable ? (\n                  <div className=\"tntd-virtual-tree-item-checkbox\">\n                    <Checkbox {...checkBoxAttrs} />\n                  </div>\n                ) : (\n                  ''\n                )}\n\n                <div\n                  className={`tntd-virtual-tree-title ${choosedValue === item.value ? 'tntd-virtual-tree-title_active' : ''}`}\n                  onClick={() => handleChoosed(item)}>\n                  {titleRender ? titleRender(item) : defaultRenderItem(item)}\n                </div>\n              </div>\n            );\n          }}\n        </List>\n      )}\n    </div>\n  );\n};\n\nexport default VirtualTree;\n"]}

package/es/tntd-virtual-tree/index.less

@@ -0,0 +1,59 @@
+.tntd-virtual-tree{
+  padding: 0;
+  white-space: nowrap;
+  .tntd-virtual-tree-item{
+    border-radius: var(--border-radius-sm);
+    color: #17233d;
+    text-decoration: none;
+    cursor: pointer;
+    line-height: 24px;
+    padding: 4px 0;
+    font-size: 14px;
+    box-sizing: border-box;
+
+    .tntd-virtual-tree-item-expand-icon{
+      display: inline-block;
+      width: 18px;
+      padding-left: 3px;
+      margin-right: 4px;
+
+      .anticon-caret-down,.anticon-caret-right {
+        vertical-align: middle;
+        font-size: 16px;
+        margin-right: 4px;
+      }
+    }
+
+    .tntd-virtual-tree-item-checkbox{
+      display: inline-block;
+      margin: 0 4px;
+      vertical-align: middle;
+    }
+
+    .tntd-virtual-tree-title{
+      padding: 0 2px;
+      flex: 1;
+      overflow: hidden;
+      display: inline-block;
+      vertical-align: middle;
+
+      &:hover{
+        background-color: var(--blue-1);
+      }
+
+      &_active{
+        background-color: var(--blue-2) !important;
+        border-radius: @border-radius-base;
+      }
+    }
+
+    &.tntd-virtual-tree-item_disabled{
+      color: rgba(0, 0, 0, 0.25);
+      cursor: not-allowed;
+
+      .tntd-virtual-tree-title:hover{
+        background-color: inherit;
+      }
+    }
+  }
+}

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

@@ -0,0 +1,296 @@
+var __rest = this && this.__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
+ */
+export const addTreeNodeAttrs = (treeData, fieldNames = {
+  title: 'title',
+  value: 'value',
+  children: 'children',
+  disabled: 'disabled'
+}, needCheckedSiblingsValue = []) => {
+  if (Array.isArray(treeData) && !!treeData.length) {
+    return treeData.map(item => {
+      item.children = item[fieldNames['children']];
+      item.title = item[fieldNames['title']];
+      item.value = item[fieldNames['value']];
+      const {
+          children
+        } = item,
+        query = __rest(item, ["children"]);
+      if (Array.isArray(children) && !!children.length) {
+        let siblingsSum = needCheckedSiblingsValue;
+        if (!item[fieldNames['disabled']]) {
+          // 这里注意要逆序，要不然校验的时候会出问题
+          siblingsSum = [{
+            key: item[fieldNames['value']],
+            list: children.reduce((total, item) => {
+              if (!item[fieldNames['disabled']]) {
+                total.push(item[fieldNames['value']]);
+              }
+              return total;
+            }, [])
+          }, ...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 [];
+};
+export const getNodeStr = (node, key, result = []) => {
+  result.push(node[key]);
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(element => {
+      result = [...result, ...getNodeStr(element, key)];
+    });
+  }
+  return result;
+};
+/**
+ * 获取每个节点下面所有子节点的value值
+ * @param {*} node
+ * @param {*} widthSelf 是否包含自己
+ * @param {*} result
+ * @returns []
+ */
+export const getNodeValuess = (node, widthSelf = true, result = []) => {
+  if (widthSelf) {
+    result.push(node.value);
+  }
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(element => {
+      result = [...result, ...getNodeValuess(element)];
+    });
+  }
+  return result;
+};
+/**
+ * 扁平树
+ * @param {*} treeData
+ * @param {*} expandedKeys 展开的节点
+ * @param {*} treeDefaultExpandAll
+ * @param {*} level
+ * @param {*} result
+ * @returns
+ */
+export const flatTreeData = (treeData, filterKey = '', expandedKeys = [], treeDefaultExpandAll = false, level = 0, result = []) => {
+  if (Array.isArray(treeData)) {
+    for (const i of treeData) {
+      const {
+          value,
+          children,
+          titleTotal,
+          title
+        } = i,
+        rest = __rest(i, ["value", "children", "titleTotal", "title"]);
+      // 判断是否命中过滤
+      let bingo = true;
+      const transFilterKey = !['', null, undefined].includes(filterKey);
+      if (transFilterKey) {
+        bingo = Array.isArray(titleTotal) ? titleTotal.some(i => i.includes(filterKey)) : false;
+      }
+      if (bingo) {
+        result.push(Object.assign({
+          level
+        }, i));
+      }
+      const selfIn = Array.isArray(expandedKeys) ? expandedKeys.includes(value) : false;
+      if ((treeDefaultExpandAll || selfIn || transFilterKey && bingo) && Array.isArray(children) && !!children.length) {
+        result = [...result, ...flatTreeData(children, filterKey, expandedKeys, treeDefaultExpandAll, level + 1)];
+      }
+    }
+  }
+  return result;
+};
+/**
+ * 获取所有展开的节点 （组件传入最后一层，需要将其上层全部加入到expandedKeys）
+ * @param {*} treeDataWithKeys
+ * @param {*} treeExpandedKeys
+ * @param {*} result
+ * @returns
+ */
+export const getFullExpandedKeys = (treeDataWithKeys, treeExpandedKeys = [], treeDefaultExpandAll, result = []) => {
+  if (!treeDefaultExpandAll && (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(treeExpandedKeys) || !treeExpandedKeys.length)) {
+    return [];
+  }
+  treeDataWithKeys.forEach(i => {
+    const {
+      childrenValues,
+      value,
+      children
+    } = i;
+    if (treeDefaultExpandAll || Array.isArray(childrenValues) && [...childrenValues, value].some(el => treeExpandedKeys.includes(el))) {
+      result.push(value);
+      if (Array.isArray(children) && !!children.length) {
+        result = [...result, ...getFullExpandedKeys(children, treeExpandedKeys, treeDefaultExpandAll)];
+      }
+    }
+  });
+  return result;
+};
+/**
+ * 初始化根据用户传入的值获取其关联节点是否要在checkList
+ * @param {*} treeDataWithKeys
+ * @param {*} transCheckedKeys
+ * @param {*} result
+ * @returns
+ */
+export const getFullCheckedKeys = (treeDataWithKeys, transCheckedKeys, result = []) => {
+  if (!Array.isArray(treeDataWithKeys) || !treeDataWithKeys.length || !Array.isArray(transCheckedKeys) || !transCheckedKeys.length) {
+    return [];
+  }
+  treeDataWithKeys.forEach(i => {
+    const {
+      value,
+      children,
+      disabled
+    } = i;
+    const bingo = transCheckedKeys.includes(value);
+    if (bingo) {
+      result.push(value);
+    }
+    if (Array.isArray(children) && !!children.length) {
+      const lastestUnDisabledChildrenValues = i.needCheckedLastestChildrenValues;
+      // 如果当前节点是被命中，就将其下面所有子节点都选中
+      if (Array.isArray(lastestUnDisabledChildrenValues) && !!lastestUnDisabledChildrenValues.length && lastestUnDisabledChildrenValues.every(el => transCheckedKeys.includes(el))) {
+        result.push(value);
+      }
+      result = [...result, ...getFullCheckedKeys(children, transCheckedKeys)];
+    }
+  });
+  return result;
+};
+/**
+ * 递归获取某个节点所有最下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了
+ * @param {*} node
+ * @param {*} node
+ * @returns
+ */
+export const getNodeNoDisabledLastestChildrenValues = (node, fieldNames, result = []) => {
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(element => {
+      if (!element[fieldNames['disabled']]) {
+        result = [...result, ...getNodeNoDisabledLastestChildrenValues(element, fieldNames)];
+      }
+    });
+  } else {
+    if (!node[fieldNames['disabled']]) {
+      result.push(node[fieldNames['value']]);
+    }
+  }
+  return result;
+};
+/**
+ * 递归获取某个节点所有下层(没有children)的values集合,递归遇到disable的节点就不继续往下递归了
+ * @param {*} node
+ * @param {*} node
+ * @returns
+ */
+export const getNodeNoDisabledChildrenValues = (node, fieldNames, result = []) => {
+  if (Array.isArray(node.children) && !!node.children.length) {
+    node.children.forEach(element => {
+      if (!element[fieldNames['disabled']]) {
+        result.push(element[fieldNames['value']]);
+        result = [...result, ...getNodeNoDisabledChildrenValues(element, fieldNames)];
+      }
+    });
+  } else {
+    if (!node[fieldNames['disabled']]) {
+      result.push(node[fieldNames['value']]);
+    }
+  }
+  return result;
+};
+/**
+ * 判断当前节点是否半选
+ * @param {*} item
+ * @param {*} checkedList
+ */
+export const getIndeterminate = (item, checkedList, disabledList) => {
+  // 如果没有子节点,就没有半选情况
+  if (!Array.isArray(item.children) || !item.children.length) {
+    return false;
+  }
+  if (!Array.isArray(checkedList) || !checkedList.length) {
+    return false;
+  }
+  // 当前节点下的去掉disabled的所有末级节点
+  const list = Array.isArray(item.needCheckedLastestChildrenValues) ? item.needCheckedLastestChildrenValues : [];
+  const childrenCheckedList = list.filter(i => checkedList === null || checkedList === void 0 ? void 0 : checkedList.includes(i));
+  return childrenCheckedList.length > 0 && childrenCheckedList.length < list.length;
+};
+/**
+ * 获取当前节点的父亲节点是否需要被选中
+ * @param {*} needCheckedSiblingsValue
+ * @param {*} checkedList
+ * @returns
+ */
+export const getNodeParentChoosed = (needCheckedSiblingsValue, checkedList) => {
+  if (!Array.isArray(checkedList) || !checkedList.length) {
+    return [];
+  }
+  let result = [];
+  for (let item of needCheckedSiblingsValue) {
+    const {
+      key,
+      list
+    } = item || {};
+    // 过滤掉子节点为disabled的
+    const bool = Array.isArray(list) ? list.every(it => checkedList.includes(it)) : false;
+    if (bool) {
+      checkedList.push(key);
+      result.push(key);
+    }
+  }
+  return result;
+};
+/**
+ * 获取节点的信息
+ * @param {*} tree
+ * @param {*} key
+ * @param {*} result
+ * @returns
+ */
+export const findNodeDetail = (tree, key, result) => {
+  if (Array.isArray(tree) && !!key) {
+    for (let i of tree) {
+      if (i.value === key) {
+        result = i;
+        break;
+      }
+      if (Array.isArray(i.children) && !!i.children.length) {
+        result = findNodeDetail(i.children, key);
+        if (result) {
+          break;
+        }
+      }
+    }
+  }
+  return result;
+};

package/es/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;AACH,MAAM,CAAC,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,gBAAgB,CAAC,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,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,EAC5C,UAAU,EAAE,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,EAClD,gCAAgC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,sCAAsC,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,EAC/H,yBAAyB,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,+BAA+B,CAAC,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;AAEF,MAAM,CAAC,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,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,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,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;KACJ;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,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,YAAY,CAAC,QAAQ,EAAE,SAAS,EAAE,YAAY,EAAE,oBAAoB,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;aAC3G;SACF;KACF;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,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,mBAAmB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,oBAAoB,CAAC,CAAC,CAAC;aAChG;SACF;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,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,kBAAkB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC;SACzE;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,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,sCAAsC,CAAC,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;AAEF;;;;;GAKG;AACH,MAAM,CAAC,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,+BAA+B,CAAC,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;AAED;;;;GAIG;AACH,MAAM,CAAC,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;AAEF;;;;;GAKG;AACH,MAAM,CAAC,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;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,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,cAAc,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,MAAM,EAAE;oBACV,MAAM;iBACP;aACF;SACF;KACF;IAED,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC","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"]}