优化了一个树算法

service/role_service.go

@@ -455,34 +455,66 @@ func GetAllGeneralPurviewVMsProcessed(module int) ([]*PurviewTreeViewModel, erro
 		return nil, getPurviewErr
 	}
 	// 加工这些规则：树形化
-	purviewVMs := make([]*PurviewTreeViewModel, 0)
-	pid_childs := make(map[int64][]*PurviewTreeViewModel)
-	for _, purview := range originPurviews {
-		// warning：下面这个算法只适用最多两层树形结构的菜单，对于两层以上的会丢失掉第三层及其以下的节点
-		// 因为取出 originPurviews 的时候已经排过序了，所以顶级节点肯定最先处理，不需要担心子节点比父节点先处理
+	map1 := make(map[int64]int64)
+	map2 := make(map[int64]*PurviewTreeViewModel)
+	for _, v := range originPurviews {
+		map1[v.Id] = v.Parentid
 		pvm := &PurviewTreeViewModel{
-			ID:     purview.Id,
-			PID:    purview.Parentid,
-			Name:   purview.Name,
+			ID:     v.Id,
+			PID:    v.Parentid,
+			Name:   v.Name,
 			Number: 2,
 		}
-		if purview.Parentid == 0 {
-			purviewVMs = append(purviewVMs, pvm)
-		} else {
-			childs := pid_childs[purview.Parentid]
-			if childs == nil {
-				childs = make([]*PurviewTreeViewModel, 0)
+		map2[v.Id] = pvm
+	}
+	//可以处理多层的菜单
+	purviewVMs := Totree(map1, map2, 0)
+	//原来的逻辑
+	//purviewVMs := make([]*PurviewTreeViewModel, 0)
+	//pid_childs := make(map[int64][]*PurviewTreeViewModel)
+	//for _, purview := range originPurviews {
+	//	// warning：下面这个算法只适用最多两层树形结构的菜单，对于两层以上的会丢失掉第三层及其以下的节点
+	//	// 因为取出 originPurviews 的时候已经排过序了，所以顶级节点肯定最先处理，不需要担心子节点比父节点先处理
+	//	pvm := &PurviewTreeViewModel{
+	//		ID:     purview.Id,
+	//		PID:    purview.Parentid,
+	//		Name:   purview.Name,
+	//		Number: 2,
+	//	}
+	//	if purview.Parentid == 0 {
+	//		purviewVMs = append(purviewVMs, pvm)
+	//	} else {
+	//		childs := pid_childs[purview.Parentid]
+	//		if childs == nil {
+	//			childs = make([]*PurviewTreeViewModel, 0)
+	//		}
+	//		childs = append(childs, pvm)
+	//		pid_childs[purview.Parentid] = childs
+	//	}
+	//}
+	//
+	//for _, vm := range purviewVMs {
+	//	vm.Childs = pid_childs[vm.ID]
+	//}
+
+	return purviewVMs, nil
+}
+func Totree(map1 map[int64]int64, map2 map[int64]*PurviewTreeViewModel, tmp int64) []*PurviewTreeViewModel {
+	var j int //用来计数
+	var tmp_purview []*PurviewTreeViewModel
+	for k, v := range map1 {
+		if v == tmp {
+			tmp_purview = append(tmp_purview, map2[k])
+			delete(map1, k)
+			for k1, v1 := range tmp_purview {
+				if k1 == j {
+					v1.Childs = Totree(map1, map2, k)
+				}
 			}
-			childs = append(childs, pvm)
-			pid_childs[purview.Parentid] = childs
+			j++
 		}
 	}
-
-	for _, vm := range purviewVMs {
-		vm.Childs = pid_childs[vm.ID]
-	}
-
-	return purviewVMs, nil
+	return tmp_purview
 }
 
 func GetAllGeneralFuncPurviewVMsProcessed() ([]*PurviewTreeViewModel, error) {