TreeUtils你已经使用了Map了，那就一步到位，把递归调用给省略掉呗。

我为了 TreeNode 的 final 不可变性，稍微绕了一下，如果不追求这个， 这个方案还是比较简洁的。
参考如下实现。
```
@Getter
@RequiredArgsConstructor
public class TreeNode<D, T> {
	final D pid, id;
	final T deatial;
	final String name;
	final List<TreeNode<D, T>> childs;
}
	@SuppressWarnings("unchecked")
	public <D, T> List<TreeNode<D, T>> createNode(List<T> data, D parentId, Function<T, D> idAct, Function<T, D> pidAct,
			Function<T, String> nameAct, Comparator<T> comparator) {

if (Objects.isNull(data) || data.isEmpty()) {
			return Collections.emptyList();
		}

Optional.ofNullable(comparator).ifPresent(data::sort);
		Map<List<TreeNode<D, T>>, List<TreeNode<D, T>>> realChildsMap = new IdentityHashMap<>();
		Function<T, TreeNode<D, T>> action = item -> {
			D pid = toObj(item, pidAct);
			D id = toObj(item, idAct);
			String name = toObj(item, nameAct);
			List<TreeNode<D, T>> realChilds = new ArrayList<>();
			List<TreeNode<D, T>> userChilds = Collections.unmodifiableList(realChilds);
			realChildsMap.put(userChilds, realChilds);
			return new TreeNode<D, T>(pid, id, item, name, userChilds);
		};
		List<TreeNode<D, T>> nodes = toList(data, action);
		if (Objects.isNull(comparator) && parentId instanceof Comparable) {
			nodes.sort((a, b) -> ((Comparable<D>) a.getId()).compareTo(b.getId()));
		}
		Map<D, List<TreeNode<D, T>>> map = groupingBy(nodes, TreeNode::getPid);

Consumer<TreeNode<D, T>> consumer = node -> {
			List<TreeNode<D, T>> childsData = map.getOrDefault(node.getId(), Collections.emptyList());
			List<TreeNode<D, T>> realChilds = realChildsMap.get(node.getChilds());
			realChilds.addAll(childsData);
		};
		nodes.forEach(consumer);
		return map.get(parentId);
	}
```

赛泰先生/Ucode-Cms-Vue

内容风险标识

评论 (1)

赛泰先生/Ucode-Cms-Vue .gitee-modal { width: 500px !important; }

内容风险标识