|
@@ -586,7 +586,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
ArrayList::new
|
|
|
));
|
|
|
//所有节点Map
|
|
|
- Map<Long, List<WbsTreeContractLazyVO>> allNodesParentGroup = distinctNodesAll.stream().collect(Collectors.groupingBy(WbsTreeContractLazyVO::getParentId));
|
|
|
+ //Map<Long, List<WbsTreeContractLazyVO>> allNodesParentGroup = distinctNodesAll.stream().collect(Collectors.groupingBy(WbsTreeContractLazyVO::getParentId));
|
|
|
|
|
|
//所有最底层节点
|
|
|
List<WbsTreeContractLazyVO> distinctLowestNodesAll = distinctNodesAll.stream().filter(f -> f.getHasChildren().equals(0)).collect(Collectors.collectingAndThen(
|
|
@@ -618,7 +618,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
vo.setColorStatus(1);
|
|
|
}
|
|
|
}).collect(Collectors.toMap(WbsTreeContractLazyVO::getPKeyId, Function.identity()));
|
|
|
- List<WbsTreeContractLazyVO> lowestNodesReList = new ArrayList<>(lowestNodesMap.values());
|
|
|
+ /*List<WbsTreeContractLazyVO> lowestNodesReList = new ArrayList<>(lowestNodesMap.values());
|
|
|
Map<Long, WbsTreeContractLazyVO> distinctParentNodesTBIdKeyMap = resultParentNodesTB.stream()
|
|
|
.collect(Collectors.collectingAndThen(
|
|
|
Collectors.toCollection(() -> new TreeSet<>(Comparator.comparing(WbsTreeContractLazyVO::getPKeyId))),
|
|
@@ -627,7 +627,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
|
|
|
//构造完成的所有最底层节点,处理父节点颜色
|
|
|
Map<Long, WbsTreeContractLazyVO> nodeColorMap = new HashMap<>();
|
|
|
- this.recursiveParentNodeColorStatus(lowestNodesReList, distinctParentNodesTBIdKeyMap, allNodesParentGroup, nodeColorMap);
|
|
|
+ this.recursiveParentNodeColorStatus(lowestNodesReList, distinctParentNodesTBIdKeyMap, allNodesParentGroup, nodeColorMap);*/
|
|
|
|
|
|
//处理最终结果集
|
|
|
if (lazyNodes.size() > 0) {
|
|
@@ -654,18 +654,18 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
|
|
|
lazyNodeVO.setSubmitCounts(ObjectUtil.isNotEmpty(countMap.get(lazyNodeVO.getPKeyId())) ? countMap.get(lazyNodeVO.getPKeyId()) : (ObjectUtil.isNotEmpty(queryInfoMaps.get(lazyNodeVO.getPKeyId())) ? 1 : 0));
|
|
|
|
|
|
- /*if(lazyNodeVO.getSubmitCounts() >= 1) {
|
|
|
+ if (lazyNodeVO.getSubmitCounts() >= 1) {
|
|
|
lazyNodeVO.setColorStatus(2);
|
|
|
- }*/
|
|
|
- WbsTreeContractLazyVO vo = nodeColorMap.get(lazyNodeVO.getPKeyId());
|
|
|
+ }
|
|
|
+ /*WbsTreeContractLazyVO vo = nodeColorMap.get(lazyNodeVO.getPKeyId());
|
|
|
if (vo != null) {
|
|
|
lazyNodeVO.setColorStatus(vo.getColorStatus());
|
|
|
- } else {
|
|
|
- WbsTreeContractLazyVO lowestNode = lowestNodesMap.get(lazyNodeVO.getPKeyId());
|
|
|
- if (lowestNode != null) {
|
|
|
- lazyNodeVO.setColorStatus(lowestNode.getColorStatus());
|
|
|
- }
|
|
|
+ } else {*/
|
|
|
+ WbsTreeContractLazyVO lowestNode = lowestNodesMap.get(lazyNodeVO.getPKeyId());
|
|
|
+ if (lowestNode != null) {
|
|
|
+ lazyNodeVO.setColorStatus(lowestNode.getColorStatus());
|
|
|
}
|
|
|
+ //}
|
|
|
}
|
|
|
}
|
|
|
return lazyNodes;
|
|
@@ -708,7 +708,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
ArrayList::new
|
|
|
));
|
|
|
//所有节点Map
|
|
|
- Map<Long, List<WbsTreeContractLazyVO>> allNodesParentGroup = distinctNodesAll.stream().collect(Collectors.groupingBy(WbsTreeContractLazyVO::getParentId));
|
|
|
+ //Map<Long, List<WbsTreeContractLazyVO>> allNodesParentGroup = distinctNodesAll.stream().collect(Collectors.groupingBy(WbsTreeContractLazyVO::getParentId));
|
|
|
|
|
|
//所有最底层节点
|
|
|
List<WbsTreeContractLazyVO> distinctLowestNodesAll = distinctNodesAll.stream().filter(f -> f.getHasChildren().equals(0)).collect(Collectors.collectingAndThen(
|
|
@@ -740,7 +740,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
vo.setColorStatus(1);
|
|
|
}
|
|
|
}).collect(Collectors.toMap(WbsTreeContractLazyVO::getPKeyId, Function.identity()));
|
|
|
- List<WbsTreeContractLazyVO> lowestNodesReList = new ArrayList<>(lowestNodesMap.values());
|
|
|
+ /*List<WbsTreeContractLazyVO> lowestNodesReList = new ArrayList<>(lowestNodesMap.values());
|
|
|
Map<Long, WbsTreeContractLazyVO> distinctParentNodesTBIdKeyMap = resultParentNodesTB.stream()
|
|
|
.collect(Collectors.collectingAndThen(
|
|
|
Collectors.toCollection(() -> new TreeSet<>(Comparator.comparing(WbsTreeContractLazyVO::getPKeyId))),
|
|
@@ -749,7 +749,7 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
|
|
|
//构造完成的所有最底层节点,处理父节点颜色
|
|
|
Map<Long, WbsTreeContractLazyVO> nodeColorMap = new HashMap<>();
|
|
|
- this.recursiveParentNodeColorStatus(lowestNodesReList, distinctParentNodesTBIdKeyMap, allNodesParentGroup, nodeColorMap);
|
|
|
+ this.recursiveParentNodeColorStatus(lowestNodesReList, distinctParentNodesTBIdKeyMap, allNodesParentGroup, nodeColorMap);*/
|
|
|
|
|
|
//处理最终结果集
|
|
|
if (lazyNodes.size() > 0) {
|
|
@@ -777,18 +777,18 @@ public class WbsTreeContractServiceImpl extends BaseServiceImpl<WbsTreeContractM
|
|
|
|
|
|
lazyNodeVO.setSubmitCounts(ObjectUtil.isNotEmpty(countMap.get(lazyNodeVO.getPKeyId())) ? countMap.get(lazyNodeVO.getPKeyId()) : (ObjectUtil.isNotEmpty(queryInfoMaps.get(lazyNodeVO.getPKeyId())) ? 1 : 0));
|
|
|
|
|
|
- /*if (lazyNodeVO.getSubmitCounts() >= 1) {
|
|
|
+ if (lazyNodeVO.getSubmitCounts() >= 1) {
|
|
|
lazyNodeVO.setColorStatus(2);
|
|
|
- }*/
|
|
|
- WbsTreeContractLazyVO vo = nodeColorMap.get(lazyNodeVO.getPKeyId());
|
|
|
+ }
|
|
|
+ /*WbsTreeContractLazyVO vo = nodeColorMap.get(lazyNodeVO.getPKeyId());
|
|
|
if (vo != null) {
|
|
|
lazyNodeVO.setColorStatus(vo.getColorStatus());
|
|
|
- } else {
|
|
|
- WbsTreeContractLazyVO lowestNode = lowestNodesMap.get(lazyNodeVO.getPKeyId());
|
|
|
- if (lowestNode != null) {
|
|
|
- lazyNodeVO.setColorStatus(lowestNode.getColorStatus());
|
|
|
- }
|
|
|
+ } else {*/
|
|
|
+ WbsTreeContractLazyVO lowestNode = lowestNodesMap.get(lazyNodeVO.getPKeyId());
|
|
|
+ if (lowestNode != null) {
|
|
|
+ lazyNodeVO.setColorStatus(lowestNode.getColorStatus());
|
|
|
}
|
|
|
+ //}
|
|
|
}
|
|
|
}
|
|
|
lazyNodesAll.addAll(lazyNodes);
|