ZQ/laws-sinotruk-server
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

feat: 零部件查询接口支持全部节点名称筛选

Browse Source
This commit is contained in:
mzaxd
2024-02-26 15:14:03 +08:00
parent f8a9f5d713
commit ce556a34f2
1 changed files with 75 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files
laws-modules/src/main/java/com/jero/modules/laws/standard/service/impl/PartNameServiceImpl.java
+75 -21
View File
@@ -7,6 +7,7 @@ import com.baomidou.mybatisplus.extension.plugins.pagination.Page;
import com.baomidou.mybatisplus.extension.service.impl.ServiceImpl;
import com.jero.common.constant.enums.YesOrNoEnum;
import com.jero.common.exception.JeroBootException;
import com.jero.modules.laws.standard.entity.LawsTreeNode;
import com.jero.modules.laws.standard.entity.PartName;
import com.jero.modules.laws.standard.entity.TreePage;
import com.jero.modules.laws.standard.service.PartNameService;
@@ -15,9 +16,7 @@ import org.springframework.stereotype.Service;
import org.springframework.transaction.annotation.Transactional;
import javax.annotation.Resource;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.*;
import java.util.function.Function;
import java.util.stream.Collectors;
@@ -38,30 +37,40 @@ public class PartNameServiceImpl extends ServiceImpl<PartNameMapper, PartName>
@Override
public TreePage<PartName> queryTreeList(String nodeName, Integer pageNo, Integer pageSize) {
LambdaQueryWrapper<PartName> queryWrapper = new LambdaQueryWrapper<>();
List<PartName> topLevelNodes;
queryWrapper.eq(PartName::getDelFlag, YesOrNoEnum.NO.getValue())
.like(StrUtil.isNotBlank(nodeName), PartName::getName, nodeName);
List<PartName> allNodes = partNameMapper.selectList(queryWrapper);
List<String> firstNodeCodeList = allNodes.stream()
.map(PartName::getFirstNode)
.distinct()
.collect(Collectors.toList());
// 不做筛选的时候查询加速
if (StrUtil.isBlank(nodeName)) {
// 构建树结构
topLevelNodes = this.buildTree(new HashSet<>(allNodes));
} else {
// 做筛选的时候需要自己组树
queryWrapper.clear();
queryWrapper.eq(PartName::getDelFlag, YesOrNoEnum.NO.getValue())
.in(PartName::getFirstNode, firstNodeCodeList)
.or().in(PartName::getCode, firstNodeCodeList);
List<PartName> allNodeList = partNameMapper.selectList(queryWrapper);
// 将所有节点转换为映射，以便快速查找
Map<String, PartName> nodeMap = allNodes.stream()
.collect(Collectors.toMap(PartName::getCode, Function.identity()));
// 构建树形结构
List<PartName> topLevelNodes = new ArrayList<>();
allNodes.forEach(node -> {
if (node.getParentCode().equals("Part")) {
topLevelNodes.add(node);
} else {
PartName parentNode = nodeMap.get(node.getParentCode());
if (parentNode != null) {
if (parentNode.getChildPartNameList() == null) {
parentNode.setChildPartNameList(new ArrayList<>());
}
parentNode.getChildPartNameList().add(node);
}
// 构建树形结构
Set<PartName> nodesSet = new HashSet<>();
for (PartName node : allNodes) {
nodesSet.addAll(findPathToRoot(allNodeList, node));
nodesSet.addAll(findAllChildren(allNodeList, node));
}
});
topLevelNodes = this.buildTree(nodesSet);
}
if (!topLevelNodes.isEmpty()) {
if (topLevelNodes.get(0).getParentCode().equals("0")) {
topLevelNodes = topLevelNodes.get(0).getChildPartNameList();
}
}
// 实现分页逻辑
int start = (pageNo - 1) * pageSize;
int end = Math.min(start + pageSize, topLevelNodes.size());
@@ -76,6 +85,51 @@ public class PartNameServiceImpl extends ServiceImpl<PartNameMapper, PartName>
return result;
}
private List<PartName> buildTree(Set<PartName> nodesSet) {
List<PartName> topLevelNodes = new ArrayList<>();
Map<String, PartName> nodeMap = nodesSet.stream()
.collect(Collectors.toMap(PartName::getCode, Function.identity()));
for (PartName node : nodesSet) {
PartName parentNode = nodeMap.get(node.getParentCode());
if (parentNode != null) {
if (parentNode.getChildPartNameList() == null) {
parentNode.setChildPartNameList(new ArrayList<>());
}
parentNode.getChildPartNameList().add(node);
} else {
topLevelNodes.add(node);
}
}
return topLevelNodes;
}
public static Set<PartName> findPathToRoot(List<PartName> allNodes, PartName node) {
Set<PartName> pathNodes = new HashSet<>();
PartName[] currentHolder = new PartName[1];
currentHolder[0] = node;
while (currentHolder[0] != null) {
pathNodes.add(currentHolder[0]);
currentHolder[0] = allNodes.stream()
.filter(n -> n.getCode().equals(currentHolder[0].getParentCode()))
.findFirst().orElse(null);
}
return pathNodes;
}
public Set<PartName> findAllChildren(List<PartName> allNodes, PartName node) {
Set<PartName> childrenSet = new HashSet<>();
List<PartName> directChildren = allNodes.stream()
.filter(n -> n.getParentCode().equals(node.getCode()))
.collect(Collectors.toList());
for (PartName child : directChildren) {
childrenSet.add(child);
childrenSet.addAll(findAllChildren(allNodes, child));
}
return childrenSet;
}
@Override
public List<PartName> queryEcho(String selectNodeCodes) {
List<String> codeList = StrUtil.split(selectNodeCodes, ',');