From 899ba9a0aa0775850d9734741508264834be1eef Mon Sep 17 00:00:00 2001 From: danshihao Date: Fri, 27 Sep 2024 15:59:38 +0800 Subject: [PATCH] =?UTF-8?q?[update=20=E6=8B=86=E5=88=86=E6=8B=96=E6=8B=BD]?= =?UTF-8?q?=20=E6=8B=96=E6=8B=BD=E5=88=B0=E7=AC=AC=E4=B8=80=E4=B8=AA?= =?UTF-8?q?=E8=8A=82=E7=82=B9=E4=B9=8B=E5=89=8D=E5=BA=8F=E5=8F=B7=E4=BC=A0?= =?UTF-8?q?=E7=88=B6=E7=BA=A7=E5=BA=8F=E5=8F=B7?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/views/documentTool/documentSplit/DocumentSplitDetail.vue | 4 ++-- .../documentSplit/modules/SplitTreeOrderModal.vue | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/src/views/documentTool/documentSplit/DocumentSplitDetail.vue b/src/views/documentTool/documentSplit/DocumentSplitDetail.vue index f6e2079..01adfb1 100644 --- a/src/views/documentTool/documentSplit/DocumentSplitDetail.vue +++ b/src/views/documentTool/documentSplit/DocumentSplitDetail.vue @@ -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) diff --git a/src/views/documentTool/documentSplit/modules/SplitTreeOrderModal.vue b/src/views/documentTool/documentSplit/modules/SplitTreeOrderModal.vue index d04559e..60edcfb 100644 --- a/src/views/documentTool/documentSplit/modules/SplitTreeOrderModal.vue +++ b/src/views/documentTool/documentSplit/modules/SplitTreeOrderModal.vue @@ -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)