[update 拆分排序] 问题调整

This commit is contained in:
danshihao
2024-09-14 10:04:58 +08:00
parent 00da074328
commit e596385d96
2 changed files with 6 additions and 7 deletions
@@ -406,9 +406,9 @@ export default {
const targetId = info.node.eventKey
// 序号,拖拽到节点里面,就把序号设置成最后一个节点的序号
let displaySeq = 0
const parentNodeData = this.getParentNode(this.treeData, info.node.eventKey)
if (parentNodeData && parentNodeData.children && parentNodeData.children.length) {
displaySeq = parentNodeData.children[parentNodeData.children.length - 1].displaySeq
const children = info.node.dataRef.children || []
if (children && children.length) {
displaySeq = children[children.length - 1].displaySeq
}
this.treeNodeSort({ sourceId, targetId, displaySeq })
},
@@ -50,7 +50,6 @@
<script>
import { batchEditClauseTreeNodeSort, dragClauseTreeNode, getClauseTreeData } from '@api/documentToolApi'
import STreeSelect from '@comp/STreeSelect'
export default {
name: 'SplitTreeOrderModal',
@@ -133,9 +132,9 @@ export default {
const targetId = info.node.eventKey
// 序号,拖拽到节点里面,就把序号设置成最后一个节点的序号
let displaySeq = 0
const parentNodeData = this.getParentNode(this.treeData, info.node.eventKey)
if (parentNodeData && parentNodeData.children && parentNodeData.children.length) {
displaySeq = parentNodeData.children[parentNodeData.children.length - 1].displaySeq
const children = info.node.dataRef.children || []
if (children && children.length) {
displaySeq = children[children.length - 1].displaySeq
}
this.treeNodeSort({ sourceId, targetId, displaySeq })
},