花名册树BUG

pull/25/head
dxfeng 3 years ago
parent 594173175c
commit a36648ea39

@ -576,7 +576,9 @@ public class HrmResourceServiceImpl extends Service implements HrmResourceServic
for (DepartmentPO departmentPO : filterDeparts) { for (DepartmentPO departmentPO : filterDeparts) {
buildParentDepts(departmentPO, builderDeparts); buildParentDepts(departmentPO, builderDeparts);
} }
List<SearchTree> deptTrees = SearchTreeUtil.builderTreeMode(DepartmentBO.buildSetToSearchTree(builderDeparts, false)); List<SearchTree> departmentTrees = DepartmentBO.buildSetToSearchTree(builderDeparts, false);
List<SearchTree> searchTrees = SearchTreeUtil.builderTreeMode(departmentTrees, jobTrees);
List<SearchTree> deptTrees = SearchTreeUtil.builderTreeMode(departmentTrees);
// 添加部门的上级分部 // 添加部门的上级分部
String parentCompS = deptTrees.stream().map(SearchTree::getParentComp).collect(Collectors.joining(",")); String parentCompS = deptTrees.stream().map(SearchTree::getParentComp).collect(Collectors.joining(","));
if (!StringUtil.isEmpty(parentCompS)) { if (!StringUtil.isEmpty(parentCompS)) {
@ -589,7 +591,6 @@ public class HrmResourceServiceImpl extends Service implements HrmResourceServic
for (CompPO compPO : filterComps) { for (CompPO compPO : filterComps) {
buildParentComps(compPO, builderComps); buildParentComps(compPO, builderComps);
} }
List<SearchTree> searchTrees = SearchTreeUtil.builderTreeMode(deptTrees, jobTrees);
return SearchTreeUtil.builderTreeMode(CompBO.buildSetToSearchTree(builderComps), searchTrees); return SearchTreeUtil.builderTreeMode(CompBO.buildSetToSearchTree(builderComps), searchTrees);
} }

@ -108,7 +108,7 @@ public class SearchTreeUtil {
Map<String, List<SearchTree>> childMap = deptTrees.stream().collect(Collectors.groupingBy(SearchTree::getParentComp)); Map<String, List<SearchTree>> childMap = deptTrees.stream().collect(Collectors.groupingBy(SearchTree::getParentComp));
boolean isAdd = !childMap.isEmpty(); boolean isAdd = !childMap.isEmpty();
return treeList.stream().peek(e -> { return treeList.stream().peek(e -> {
List<TreeNode> treeNodes = new ArrayList<>(); Set<TreeNode> treeNodes = new HashSet<>();
List<TreeNode> nodes = parentMap.get(e.getId()); List<TreeNode> nodes = parentMap.get(e.getId());
if (CollectionUtils.isNotEmpty(nodes)) { if (CollectionUtils.isNotEmpty(nodes)) {
treeNodes.addAll(nodes); treeNodes.addAll(nodes);
@ -119,7 +119,7 @@ public class SearchTreeUtil {
if (CollectionUtils.isNotEmpty(e.getSubs())) { if (CollectionUtils.isNotEmpty(e.getSubs())) {
treeNodes.addAll(e.getSubs()); treeNodes.addAll(e.getSubs());
} }
e.setSubs(treeNodes); e.setSubs( new ArrayList<>(treeNodes));
}).peek(item -> { }).peek(item -> {
if (CollectionUtils.isNotEmpty(item.getSubs())) { if (CollectionUtils.isNotEmpty(item.getSubs())) {
item.setIsParent(true); item.setIsParent(true);

Loading…
Cancel
Save