|
@@ -85,12 +85,12 @@ func MoveKnowledgeClassify(req knowledge.ClassifyMoveReq) (err error, errMsg str
|
|
|
nextSort = nextClassify.Sort
|
|
|
}
|
|
|
|
|
|
- err, errMsg = moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify, parentClassifyId, prevSort, nextSort)
|
|
|
+ err, errMsg = moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify, parentClassifyId, prevSort, nextSort, classifyInfo.ResourceType)
|
|
|
return
|
|
|
}
|
|
|
|
|
|
// moveKnowledgeClassify 移动分类
|
|
|
-func moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify *knowledge.KnowledgeClassify, parentId, prevSort, nextSort int) (err error, errMsg string) {
|
|
|
+func moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify *knowledge.KnowledgeClassify, parentId, prevSort, nextSort, resourceType int) (err error, errMsg string) {
|
|
|
knowledgeObj := new(knowledge.KnowledgeClassify)
|
|
|
updateCol := make([]string, 0)
|
|
|
|
|
@@ -112,9 +112,9 @@ func moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify *knowledge.K
|
|
|
|
|
|
//变更分类
|
|
|
if prevClassify != nil {
|
|
|
- _ = knowledgeObj.UpdateClassifySortByParentId(parentId, prevClassify.ClassifyId, prevClassify.Sort, updateSortStr)
|
|
|
+ _ = knowledgeObj.UpdateClassifySortByParentId(parentId, prevClassify.ClassifyId, prevClassify.Sort, updateSortStr, resourceType)
|
|
|
} else {
|
|
|
- _ = knowledgeObj.UpdateClassifySortByParentId(parentId, 0, prevSort, updateSortStr)
|
|
|
+ _ = knowledgeObj.UpdateClassifySortByParentId(parentId, 0, prevSort, updateSortStr, resourceType)
|
|
|
}
|
|
|
|
|
|
} else {
|
|
@@ -125,9 +125,9 @@ func moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify *knowledge.K
|
|
|
|
|
|
//变更分类
|
|
|
if prevClassify != nil {
|
|
|
- _ = knowledgeObj.UpdateClassifySortByParentId(parentId, prevClassify.ClassifyId, prevSort, updateSortStr)
|
|
|
+ _ = knowledgeObj.UpdateClassifySortByParentId(parentId, prevClassify.ClassifyId, prevSort, updateSortStr, resourceType)
|
|
|
} else {
|
|
|
- _ = knowledgeObj.UpdateClassifySortByParentId(parentId, 0, prevSort, updateSortStr)
|
|
|
+ _ = knowledgeObj.UpdateClassifySortByParentId(parentId, 0, prevSort, updateSortStr, resourceType)
|
|
|
}
|
|
|
|
|
|
}
|
|
@@ -161,7 +161,7 @@ func moveKnowledgeClassify(classifyInfo, prevClassify, nextClassify *knowledge.K
|
|
|
//如果该分类下存在其他分类,且第一个其他分类的排序等于0,那么需要调整排序
|
|
|
if firstPermission != nil && firstPermission.ClassifyId != 0 && firstPermission.Sort == 0 {
|
|
|
updateSortStr := ` sort + 1 `
|
|
|
- _ = knowledgeObj.UpdateClassifySortByParentId(parentId, firstPermission.ClassifyId-1, 0, updateSortStr)
|
|
|
+ _ = knowledgeObj.UpdateClassifySortByParentId(parentId, firstPermission.ClassifyId-1, 0, updateSortStr, resourceType)
|
|
|
}
|
|
|
|
|
|
classifyInfo.Sort = 0 //那就是排在第一位
|
|
@@ -195,20 +195,19 @@ func AddKnowledgeClassify(classifyName string, parentId, resourceType int) (err
|
|
|
isSendEmail = true
|
|
|
errMsg = `添加失败`
|
|
|
knowledgeObj := new(knowledge.KnowledgeClassify)
|
|
|
- item, err := knowledgeObj.GetClassifyByName(classifyName, parentId, resourceType)
|
|
|
+ _, err = knowledgeObj.GetClassifyByName(classifyName, parentId, resourceType)
|
|
|
if err != nil && !utils.IsErrNoRow(err) {
|
|
|
errMsg = "获取分类信息失败"
|
|
|
- if utils.IsErrNoRow(err) {
|
|
|
- errMsg = "分类名称:" + classifyName + "已存在"
|
|
|
- isSendEmail = false
|
|
|
- }
|
|
|
return
|
|
|
}
|
|
|
- if item != nil {
|
|
|
+
|
|
|
+ if err == nil {
|
|
|
errMsg = "分类名称:" + classifyName + "已存在"
|
|
|
isSendEmail = false
|
|
|
err = errors.New(errMsg)
|
|
|
return
|
|
|
+ } else {
|
|
|
+ err = nil
|
|
|
}
|
|
|
|
|
|
level := 1
|
|
@@ -383,7 +382,7 @@ func EditKnowledgeClassify(classifyId, parentId int, classifyName string) (err e
|
|
|
err = errors.New("获取重名分类失败, Err: " + err.Error())
|
|
|
return
|
|
|
}
|
|
|
- if existName != nil && existName.ClassifyId != item.ClassifyId {
|
|
|
+ if existName != nil && existName.ClassifyId > 0 && existName.ClassifyId != item.ClassifyId {
|
|
|
errMsg = "分类名称:" + classifyName + "已存在"
|
|
|
err = errors.New(errMsg)
|
|
|
isSendEmail = false
|