|
|
@ -92,8 +92,8 @@ public class SearchTreeUtil {
|
|
|
|
List<SearchTree> collect = treeList.stream().peek(e -> {
|
|
|
|
List<SearchTree> collect = treeList.stream().peek(e -> {
|
|
|
|
if (null != collects && CollectionUtils.isNotEmpty(collects.get(e.getId()))) {
|
|
|
|
if (null != collects && CollectionUtils.isNotEmpty(collects.get(e.getId()))) {
|
|
|
|
List<TreeNode> nodes = collects.get(e.getId()).stream().sorted(Comparator
|
|
|
|
List<TreeNode> nodes = collects.get(e.getId()).stream().sorted(Comparator
|
|
|
|
.comparing(SearchTree::getOrderNum)
|
|
|
|
.comparingDouble(SearchTree::getOrderNum)
|
|
|
|
.thenComparing(SearchTree::getShowOrderOfTree)
|
|
|
|
.thenComparingDouble(SearchTree::getShowOrderOfTree)
|
|
|
|
)
|
|
|
|
)
|
|
|
|
.collect(Collectors.toList());
|
|
|
|
.collect(Collectors.toList());
|
|
|
|
e.setSubs(nodes);
|
|
|
|
e.setSubs(nodes);
|
|
|
@ -122,8 +122,8 @@ public class SearchTreeUtil {
|
|
|
|
Set<TreeNode> treeNodes = new LinkedHashSet<>();
|
|
|
|
Set<TreeNode> treeNodes = new LinkedHashSet<>();
|
|
|
|
if (isAdd && CollectionUtils.isNotEmpty(childMap.get(e.getId()))) {
|
|
|
|
if (isAdd && CollectionUtils.isNotEmpty(childMap.get(e.getId()))) {
|
|
|
|
List<SearchTree> searchTrees = childMap.get(e.getId()).stream().sorted(
|
|
|
|
List<SearchTree> searchTrees = childMap.get(e.getId()).stream().sorted(
|
|
|
|
Comparator.comparing(SearchTree::getOrderNum)
|
|
|
|
Comparator.comparingDouble(SearchTree::getOrderNum)
|
|
|
|
.thenComparing(SearchTree::getShowOrderOfTree)
|
|
|
|
.thenComparingDouble(SearchTree::getShowOrderOfTree)
|
|
|
|
).collect(Collectors.toList());
|
|
|
|
).collect(Collectors.toList());
|
|
|
|
treeNodes.addAll(searchTrees);
|
|
|
|
treeNodes.addAll(searchTrees);
|
|
|
|
}
|
|
|
|
}
|
|
|
|