~liusuyi/ruoyi-api.git

			@@ -6,6 +6,7 @@
			import com.ruoyi.alarmpoints.well.domain.ArdAlarmpointsWellDeptVo;
			import com.ruoyi.common.core.domain.HealthVo;
			import com.ruoyi.alarmpoints.well.service.IArdAlarmpointsWellService;
			import com.ruoyi.common.core.domain.TreeDeptWell;
			import com.ruoyi.common.core.domain.TreeSelectWell;
			import com.ruoyi.common.core.domain.TreeSelectWellJson;
			import com.ruoyi.common.core.domain.entity.SysConfig;
			@@ -32,10 +33,7 @@
			import javax.annotation.Resource;
			import java.math.BigDecimal;
			import java.text.SimpleDateFormat;
			import java.util.ArrayList;
			import java.util.HashMap;
			import java.util.List;
			import java.util.Map;
			import java.util.*;

			/**
			* @author Administrator
			@@ -90,7 +88,6 @@
			List<Map<String, Object>> listResult = (List<Map<String, Object>>) JSON.parse((String) mapResult.get("resdata"));
			//循环得到权限下匹配数据
			for (int i = 0; i < listResult.size(); i++) {
			JSONObject jsonObject = new JSONObject();
			String equipNumber = (String) listResult.get(i).get("EquipNumber");
			if(equipNumber!=null){
			for (int j = 0; j < list.size(); j++) {
			@@ -113,6 +110,7 @@
			healthVo.setLatitude(list.get(j).getLatitude());
			healthVo.setAltitude(list.get(j).getAltitude());
			healthVo.setDeptId(list.get(j).getDeptId());
			healthVo.setAncestors(list.get(j).getAncestors());
			healthVos.add(healthVo);
			if(listResult.get(i).get("EquipLevel").equals("0")){
			count0++;
			@@ -127,69 +125,88 @@
			}
			}
			}
			//用逗号分隔字符后的size为最大的结构层数
			String[] ancestorsArray = longest.split(",");
			int max = ancestorsArray.length;
			//获取部门层级
			List<SysDept> sysDepts = sysDeptService.all();
			List<TreeSelectWell> tree = sysDeptService.wellTree(sysDepts);
			//循环数据挂在到部门层级下
			for (int i = 0; i < healthVos.size(); i++) {
			HealthVo healthVo = healthVos.get(i);
			Long deptId = healthVo.getDeptId();
			//循环树结构
			for (int j = 0; j < tree.size(); j++) {
			//如果第一层匹配赋值
			if(deptId.equals(tree.get(j).getId())){
			tree.get(j).getWell().add(healthVo);
			break;
			//根据deptList查询出用户及以下的所有部门信息
			List<SysDept> sysDepts = sysDeptService.allByUser(deptList);
			//循环查询出该用户的所有上级ID
			List<String> userParentId = new ArrayList<>();
			for (int i = 0; i < sysDepts.size(); i++) {
			Long userDeptId = sysDepts.get(i).getDeptId();
			if(usersId.equals(userDeptId)){
			String ancestors = sysDepts.get(i).getAncestors();
			if(ancestors.contains(",")){
			userParentId = Arrays.asList(ancestors.split(","));
			}else {
			//不匹配且children大于0查询第二层
			if(tree.get(j).getChildren().size()>0){
			for (int k = 0; k < tree.get(j).getChildren().size(); k++) {
			//如果第二层匹配
			if(deptId.equals(tree.get(j).getChildren().get(k).getId())){
			tree.get(j).getChildren().get(k).getWell().add(healthVo);
			break;
			}else {
			//不匹配且children大于0查询第三层
			if(tree.get(j).getChildren().get(k).getChildren().size()>0){
			for (int l = 0; l < tree.get(j).getChildren().get(k).getChildren().size(); l++) {
			//如果第三层匹配
			if(deptId.equals(tree.get(j).getChildren().get(k).getChildren().get(l).getId())){
			tree.get(j).getChildren().get(k).getChildren().get(l).getWell().add(healthVo);
			break;
			}else {
			//不匹配且children大于0查询第四层
			if(tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().size()>0){
			for (int m = 0; m < tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().size(); m++) {
			//如果第四层匹配
			if(deptId.equals(tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getId())){
			tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getWell().add(healthVo);
			break;
			}else {
			//不匹配且children大于0查询第五层
			if(tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getChildren().size()>0){
			for (int n = 0; n < tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getChildren().size(); n++) {
			//如果第五层匹配
			if(deptId.equals(tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getChildren().get(n).getId())){
			tree.get(j).getChildren().get(k).getChildren().get(l).getChildren().get(m).getChildren().get(n).getWell().add(healthVo);
			break;
			}
			}
			}
			}
			}
			}
			}
			userParentId.add(ancestors);
			}
			break;
			}
			}
			//把部门层级和数据结合
			List<TreeDeptWell> treeDeptWells = new ArrayList<>();
			for (int i = 0; i < sysDepts.size(); i++) {
			SysDept sysDept = sysDepts.get(i);
			Long deptId = sysDept.getDeptId();
			List<HealthVo> deptHealths = new ArrayList<>();
			for (int j = 0; j < healthVos.size(); j++) {
			HealthVo healthVo = healthVos.get(j);
			Long healthDeptId = healthVo.getDeptId();
			if(deptId.equals(healthDeptId)){
			deptHealths.add(healthVo);
			//父级结构赋值
			String thisAncestors = healthVo.getAncestors();
			List<String> ancestorsA = Arrays.asList(thisAncestors.split(","));
			ancestorsA.removeAll(userParentId);
			// for (int k = 0; k < userParentId.size(); k++) {
			// String a = userParentId.get(k);
			// for (int l = 0; l < ancestorsA.size(); l++) {
			// String b = ancestorsA.get(l);
			// if(a.equals(b)){
			// ancestorsA.remove(b);
			// }
			// }
			// }
			for (int k = 0; k < ancestorsA.size(); k++) {
			Long ancestor = Long.parseLong(ancestorsA.get(k));
			//循环最终List判断是否有该数据的父级，如果没有就填进去
			boolean wellTrue = false;
			if(ancestor==0){
			wellTrue = true;
			}else {
			if(treeDeptWells.size()>0){
			for (int l = 0; l < treeDeptWells.size(); l++) {
			Long treeId = treeDeptWells.get(l).getDeptId();
			if(ancestor.equals(treeId)){
			wellTrue = true;
			}
			}
			}
			}
			if(!wellTrue){
			SysDept sysDept1 = sysDeptService.selectDeptById(ancestor);
			TreeDeptWell treeDeptWell = new TreeDeptWell();
			treeDeptWell.setDeptId(ancestor);
			treeDeptWell.setAncestors(sysDept1.getAncestors());
			treeDeptWell.setDeptName(sysDept1.getDeptName());
			treeDeptWell.setOrderNum(sysDept1.getOrderNum());
			treeDeptWell.setParentId(sysDept1.getParentId());
			treeDeptWells.add(treeDeptWell);
			}
			}
			}
			}
			if(deptHealths.size()>0){
			//有设备展示
			TreeDeptWell treeDeptWell = new TreeDeptWell();
			treeDeptWell.setDeptId(deptId);
			treeDeptWell.setAncestors(sysDept.getAncestors());
			treeDeptWell.setDeptName(sysDept.getDeptName());
			treeDeptWell.setOrderNum(sysDept.getOrderNum());
			treeDeptWell.setParentId(sysDept.getParentId());
			treeDeptWell.setWell(deptHealths);
			treeDeptWells.add(treeDeptWell);
			}
			}
			List<TreeSelectWell> tree = sysDeptService.wellTree(treeDeptWells);
			TreeSelectWellJson treeSelectWellJson = new TreeSelectWellJson();
			treeSelectWellJson.setWellList(tree);
			treeSelectWellJson.setCount0(count0);