From 3501ca8469b1a09f22cf0d3dbbe1adf331ea814a Mon Sep 17 00:00:00 2001
From: lin <sbla5888@163.com>
Date: Tue, 27 Feb 2024 17:35:23 +0800
Subject: [PATCH] 圈子敏感信息校验

---
 src/main/java/org/springblade/modules/label/service/impl/LabelServiceImpl.java |   11 +++++++++--
 1 files changed, 9 insertions(+), 2 deletions(-)

diff --git a/src/main/java/org/springblade/modules/label/service/impl/LabelServiceImpl.java b/src/main/java/org/springblade/modules/label/service/impl/LabelServiceImpl.java
index 384908b..37dea46 100644
--- a/src/main/java/org/springblade/modules/label/service/impl/LabelServiceImpl.java
+++ b/src/main/java/org/springblade/modules/label/service/impl/LabelServiceImpl.java
@@ -18,6 +18,7 @@
 
 import com.baomidou.mybatisplus.core.metadata.IPage;
 import com.baomidou.mybatisplus.extension.service.impl.ServiceImpl;
+import io.swagger.models.auth.In;
 import org.springblade.common.node.TreeIntegerNode;
 import org.springblade.common.utils.NodeTreeUtil;
 import org.springblade.modules.label.entity.LabelEntity;
@@ -26,6 +27,7 @@
 import org.springblade.modules.label.vo.LabelVO;
 import org.springframework.stereotype.Service;
 
+import java.math.BigDecimal;
 import java.util.ArrayList;
 import java.util.List;
 import java.util.Map;
@@ -46,6 +48,7 @@
 
 	/**
 	 * 标签查询,按父id查询下级
+	 *
 	 * @param label
 	 * @return
 	 */
@@ -55,11 +58,11 @@
 		List<Integer> list = new ArrayList<>();
 		// 遍历
 		labelList.forEach((id, treeNode) -> {
-			if (treeNode.getHasChildren()){
+			if (treeNode.getHasChildren()) {
 				list.add(id);
 			}
 		});
-		if (list.size()>0) {
+		if (list.size() > 0) {
 			// 查询子集
 			Map<Integer, TreeIntegerNode> childrenLabelList = baseMapper.getChildrenLabelList(list);
 			// 合并集合
@@ -79,6 +82,10 @@
 
 	private void recursion(TreeIntegerNode node) {
 		if (node.getChildren() != null && node.getChildren().size() > 0) {
+//			BigDecimal bigDecimal = BigDecimal.valueOf(0);
+//			node.setCount(node.getChildren().stream().map(item -> {
+//				bigDecimal.add(BigDecimal.valueOf(item.getCount()));
+//			}));
 			node.getChildren().forEach(node2 -> recursion(node2));
 		} else {
 			node.setChildren(null);

--
Gitblit v1.9.3