|
@@ -1972,6 +1972,8 @@ func GetMoveEdbChartList(source, subSource, userId int, keyword, classify string
|
|
|
return
|
|
|
}
|
|
|
|
|
|
+// TODO 资产转移要通知到用户(被转移的用户和新用户)
|
|
|
+
|
|
|
// MoveEdbChart 转移指标/图表创建人
|
|
|
// @param source 来源 :1:手工数据指标 2:钢联化工数据库 3:ETA指标库 4:ETA预测指标 5:图库 6:ETA表格
|
|
|
func MoveEdbChart(source, subSource, oldUserId, newUserId int, isSelectAll bool, dataId, noDataId []string, keyword, classify string) (err error, errMsg string) {
|
|
@@ -2107,7 +2109,7 @@ func MoveEdbChart(source, subSource, oldUserId, newUserId int, isSelectAll bool,
|
|
|
return
|
|
|
}
|
|
|
|
|
|
-func GetEdbChartClassifyList(source int) (resp data_manage.EdbChartClassifyResp, err error) {
|
|
|
+func GetEdbChartClassifyList(source, subSource int) (resp data_manage.EdbChartClassifyResp, err error) {
|
|
|
switch source {
|
|
|
case 1: //手工数据指标
|
|
|
list, e := models.GetEdbdataClassify(0)
|
|
@@ -2194,37 +2196,6 @@ func GetEdbChartClassifyList(source int) (resp data_manage.EdbChartClassifyResp,
|
|
|
}
|
|
|
resp.List = GetEdbMenuTreeRecursive(classifyAll, 0)
|
|
|
|
|
|
- //rootChildMap := make(map[int][]*data_manage.EdbClassifyItems)
|
|
|
- //for _, v := range classifyAll {
|
|
|
- // rootChildMap[v.ParentId] = append(rootChildMap[v.ParentId], v)
|
|
|
- //}
|
|
|
- //nodeAll := make([]*data_manage.EdbClassifyItems, 0)
|
|
|
- //for _, v := range rootList {
|
|
|
- // if existItems, ok := rootChildMap[v.ClassifyId]; ok {
|
|
|
- // v.Children = existItems
|
|
|
- // } else {
|
|
|
- // items := make([]*data_manage.EdbClassifyItems, 0)
|
|
|
- // v.Children = items
|
|
|
- // }
|
|
|
- // nodeAll = append(nodeAll, v)
|
|
|
- //}
|
|
|
- //
|
|
|
- //for _, v := range nodeAll {
|
|
|
- // item := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v.ClassifyId,
|
|
|
- // ClassifyName: v.ClassifyName,
|
|
|
- // ParentId: v.ParentId,
|
|
|
- // }
|
|
|
- // for _, v2 := range v.Children {
|
|
|
- // child := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v2.ClassifyId,
|
|
|
- // ClassifyName: v2.ClassifyName,
|
|
|
- // ParentId: v2.ParentId,
|
|
|
- // }
|
|
|
- // item.Child = append(item.Child, &child)
|
|
|
- // }
|
|
|
- // resp.List = append(resp.List, &item)
|
|
|
- //}
|
|
|
case 4: //ETA预测指标
|
|
|
// 考虑到后面可以会迭代到10层, 这里直接用递归
|
|
|
classifyAll, e := data_manage.GetAllEdbClassifyByType(1)
|
|
@@ -2233,66 +2204,7 @@ func GetEdbChartClassifyList(source int) (resp data_manage.EdbChartClassifyResp,
|
|
|
return
|
|
|
}
|
|
|
resp.List = GetEdbMenuTreeRecursive(classifyAll, 0)
|
|
|
-
|
|
|
- //rootList, e := data_manage.GetEdbClassifyByParentId(0, 1)
|
|
|
- //if e != nil && e.Error() != utils.ErrNoRow() {
|
|
|
- // err = e
|
|
|
- // return
|
|
|
- //}
|
|
|
- //nodeAll := make([]*data_manage.EdbClassifyItems, 0)
|
|
|
- //for _, v := range rootList {
|
|
|
- // nodeAll = append(nodeAll, v)
|
|
|
- //}
|
|
|
- //
|
|
|
- //for _, v := range nodeAll {
|
|
|
- // item := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v.ClassifyId,
|
|
|
- // ClassifyName: v.ClassifyName,
|
|
|
- // ParentId: v.ParentId,
|
|
|
- // }
|
|
|
- // for _, v2 := range v.Children {
|
|
|
- // child := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v2.ClassifyId,
|
|
|
- // ClassifyName: v2.ClassifyName,
|
|
|
- // ParentId: v2.ParentId,
|
|
|
- // }
|
|
|
- // item.Child = append(item.Child, &child)
|
|
|
- // }
|
|
|
- // resp.List = append(resp.List, &item)
|
|
|
- //}
|
|
|
case 5: //图库
|
|
|
-
|
|
|
- //判断是否存在缓存,如果存在缓存,那么直接从缓存中获取
|
|
|
- //key := utils.CACHE_CHART_CLASSIFY
|
|
|
- //if utils.Re == nil {
|
|
|
- // if utils.Re == nil && utils.Rc.IsExist(key) {
|
|
|
- // rep := new(data_manage.ChartClassifyListResp)
|
|
|
- // if data, err1 := utils.Rc.RedisBytes(key); err1 == nil {
|
|
|
- // e := json.Unmarshal(data, &rep)
|
|
|
- // if e == nil && rep != nil {
|
|
|
- // for _, v := range rep.AllNodes {
|
|
|
- // item := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v.ChartClassifyId,
|
|
|
- // ClassifyName: v.ChartClassifyName,
|
|
|
- // ParentId: v.ParentId,
|
|
|
- // }
|
|
|
- // for _, v2 := range v.Children {
|
|
|
- // child := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v2.ChartClassifyId,
|
|
|
- // ClassifyName: v2.ChartClassifyName,
|
|
|
- // ParentId: v2.ParentId,
|
|
|
- // }
|
|
|
- // item.Child = append(item.Child, &child)
|
|
|
- // }
|
|
|
- // resp.List = append(resp.List, &item)
|
|
|
- // }
|
|
|
- // fmt.Println("source redis")
|
|
|
- // return
|
|
|
- // }
|
|
|
- // }
|
|
|
- // }
|
|
|
- //}
|
|
|
-
|
|
|
// 考虑到后面可以会迭代到10层, 这里直接用递归处理
|
|
|
classifyAll, e := data_manage.GetAllChartClassifyItemsBySource(1)
|
|
|
if e != nil && e.Error() != utils.ErrNoRow() {
|
|
@@ -2301,55 +2213,18 @@ func GetEdbChartClassifyList(source int) (resp data_manage.EdbChartClassifyResp,
|
|
|
}
|
|
|
resp.List = GetChartMenuTreeRecursive(classifyAll, 0)
|
|
|
|
|
|
- //rootList, e := data_manage.GetChartClassifyByParentIdFromETA(0)
|
|
|
- //if e != nil && e.Error() != utils.ErrNoRow() {
|
|
|
- // err = e
|
|
|
- // return
|
|
|
- //}
|
|
|
- //
|
|
|
- //classifyAll, e := data_manage.GetChartClassifyAllFromETA()
|
|
|
- //if e != nil && e.Error() != utils.ErrNoRow() {
|
|
|
- // err = e
|
|
|
- // return
|
|
|
- //}
|
|
|
- //
|
|
|
- //rootChildMap := make(map[int][]*data_manage.ChartClassifyItems)
|
|
|
- //for _, v := range classifyAll {
|
|
|
- // rootChildMap[v.ParentId] = append(rootChildMap[v.ParentId], v)
|
|
|
- //}
|
|
|
- //nodeAll := make([]*data_manage.ChartClassifyItems, 0)
|
|
|
- //for _, v := range rootList {
|
|
|
- // if existItems, ok := rootChildMap[v.ChartClassifyId]; ok {
|
|
|
- // v.Children = existItems
|
|
|
- // } else {
|
|
|
- // items := make([]*data_manage.ChartClassifyItems, 0)
|
|
|
- // v.Children = items
|
|
|
- // }
|
|
|
- // nodeAll = append(nodeAll, v)
|
|
|
- //}
|
|
|
- //
|
|
|
- //for _, v := range nodeAll {
|
|
|
- // item := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v.ChartClassifyId,
|
|
|
- // ClassifyName: v.ChartClassifyName,
|
|
|
- // ParentId: v.ParentId,
|
|
|
- // }
|
|
|
- // for _, v2 := range v.Children {
|
|
|
- // child := data_manage.EdbChartClassify{
|
|
|
- // ClassifyId: v2.ChartClassifyId,
|
|
|
- // ClassifyName: v2.ChartClassifyName,
|
|
|
- // ParentId: v2.ParentId,
|
|
|
- // }
|
|
|
- // item.Child = append(item.Child, &child)
|
|
|
- // }
|
|
|
- // resp.List = append(resp.List, &item)
|
|
|
- //}
|
|
|
-
|
|
|
- // 将数据加入缓存
|
|
|
- //if utils.Re == nil {
|
|
|
- // utils.Rc.Delete(key)
|
|
|
- //}
|
|
|
-
|
|
|
+ // 将数据加入缓存
|
|
|
+ //if utils.Re == nil {
|
|
|
+ // utils.Rc.Delete(key)
|
|
|
+ //}
|
|
|
+ case 6: // ETA表格
|
|
|
+ // 考虑到后面可以会迭代到10层, 这里直接用递归处理
|
|
|
+ classifyAll, e := excel.GetExcelClassifyBySourceOrderByLevel(subSource)
|
|
|
+ if e != nil && e.Error() != utils.ErrNoRow() {
|
|
|
+ err = e
|
|
|
+ return
|
|
|
+ }
|
|
|
+ resp.List = GetExcelMenuTreeRecursive(classifyAll, 0)
|
|
|
default:
|
|
|
return
|
|
|
}
|
|
@@ -3000,6 +2875,28 @@ func GetChartMenuTreeRecursive(list []*data_manage.ChartClassifyItems, parentId
|
|
|
return res
|
|
|
}
|
|
|
|
|
|
+// GetExcelMenuTreeRecursive
|
|
|
+// @Description: 递归ETA表格菜单树
|
|
|
+// @author: Roc
|
|
|
+// @datetime 2024-03-27 10:30:32
|
|
|
+// @param list []*data_manage.ChartClassifyItems
|
|
|
+// @param parentId int
|
|
|
+// @return []*data_manage.EdbChartClassify
|
|
|
+func GetExcelMenuTreeRecursive(list []*excel.ExcelClassifyItems, parentId int) []*data_manage.EdbChartClassify {
|
|
|
+ res := make([]*data_manage.EdbChartClassify, 0)
|
|
|
+ for _, v := range list {
|
|
|
+ t := new(data_manage.EdbChartClassify)
|
|
|
+ t.ClassifyId = v.ExcelClassifyId
|
|
|
+ t.ClassifyName = v.ExcelClassifyName
|
|
|
+ t.ParentId = v.ParentId
|
|
|
+ if v.ParentId == parentId {
|
|
|
+ t.Child = GetExcelMenuTreeRecursive(list, v.ExcelClassifyId)
|
|
|
+ res = append(res, t)
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return res
|
|
|
+}
|
|
|
+
|
|
|
func GetTerminalFromBaseIndex(source int, edbCode string) (terminalCode string, sourceIndexName string, err error) {
|
|
|
tbName := GetBaseIndexTableName(source)
|
|
|
if tbName != "" {
|