|
|
@@ -53,10 +53,12 @@ func (s *districtService) ListToTree(Id int64) (treeList []*model.T, err error)
|
|
|
}
|
|
|
treeList = append(treeList, v)
|
|
|
}
|
|
|
- s.SortToTree(treeList)
|
|
|
+ s.SortToProvince(treeList)
|
|
|
return
|
|
|
}
|
|
|
-func (s *districtService) SortToTree(treeList []*model.T) []*model.T {
|
|
|
+
|
|
|
+// SortToTree 省市区排序
|
|
|
+func (s *districtService) SortToProvince(treeList []*model.T) []*model.T {
|
|
|
length := len(treeList)
|
|
|
for i := 0; i < length-1; i++ {
|
|
|
for j := i + 1; j < length; j++ {
|
|
|
@@ -66,7 +68,7 @@ func (s *districtService) SortToTree(treeList []*model.T) []*model.T {
|
|
|
}
|
|
|
}
|
|
|
for i := 0; i < length; i++ {
|
|
|
- treeList[i].Children = s.SortToTree(treeList[i].Children)
|
|
|
+ treeList[i].Children = s.SortToProvince(treeList[i].Children)
|
|
|
}
|
|
|
return treeList
|
|
|
}
|