QR/laws_chery_client
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[update 拆分拖拽] 拖拽到第一个节点之前序号传父级序号

Browse Source
This commit is contained in:
danshihao
2024-09-27 15:59:38 +08:00
parent 31fb9a502f
commit 899ba9a0aa
2 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/views/documentTool/documentSplit/DocumentSplitDetail.vue
+2 -2
View File
@@ -391,9 +391,9 @@ export default {
params.displaySeq = this.getLastLeafNode(info.node.dataRef.children)
}
} else {
// 拖拽到某个节点之上,就要找到上一个节点的序号，如果没有就传0
// 拖拽到某个节点之上,就要找到上一个节点的序号，如果没有就传父节点的序号
const preNodeData = this.getPrevNode(this.treeData, info.node.eventKey)
params.displaySeq = preNodeData ? preNodeData.displaySeq : 0
params.displaySeq = preNodeData ? preNodeData.displaySeq : (this.getParentNode(this.treeData, info.node.eventKey) || {}).displaySeq
// 递归拿到最内层的最后一个节点的序号
if (preNodeData && preNodeData.children && preNodeData.children.length) {
params.displaySeq = this.getLastLeafNode(preNodeData.children)
src/views/documentTool/documentSplit/modules/SplitTreeOrderModal.vue
+2 -2
View File
@@ -128,9 +128,9 @@ export default {
params.displaySeq = this.getLastLeafNode(info.node.dataRef.children || [])
}
} else {
// 拖拽到某个节点之上,就要找到上一个节点的序号，如果没有就传0
// 拖拽到某个节点之上,就要找到上一个节点的序号，如果没有就传父节点的序号
const preNodeData = this.getPrevNode(this.treeData, info.node.eventKey)
params.displaySeq = preNodeData ? preNodeData.displaySeq : 0
params.displaySeq = preNodeData ? preNodeData.displaySeq : (this.getParentNode(this.treeData, info.node.eventKey) || {}).displaySeq
// 递归拿到最内层的最后一个节点的序号
if (preNodeData && preNodeData.children && preNodeData.children.length) {
params.displaySeq = this.getLastLeafNode(preNodeData.children)