From 23d64b2cedfb01ce44089f672e4510d6040b9d0e Mon Sep 17 00:00:00 2001
From: lideqin <694785430@qq.com>
Date: Fri, 23 Aug 2024 16:21:34 +0800
Subject: [PATCH] =?UTF-8?q?[update]=20=E6=B5=B7=E5=A4=96=E6=A0=87=E5=87=86?=
 =?UTF-8?q?=E5=B7=A6=E4=BE=A7=E6=A0=91=E6=8B=96=E6=8B=BD?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../overseasStandard/OverseasStandardList.vue | 132 +++++++++++++++++-
 1 file changed, 127 insertions(+), 5 deletions(-)

diff --git a/src/views/standardRegulationLibrary/overseasStandard/OverseasStandardList.vue b/src/views/standardRegulationLibrary/overseasStandard/OverseasStandardList.vue
index d19952b1..6dbec3f0 100644
--- a/src/views/standardRegulationLibrary/overseasStandard/OverseasStandardList.vue
+++ b/src/views/standardRegulationLibrary/overseasStandard/OverseasStandardList.vue
@@ -11,7 +11,9 @@
                   :show-icon="true"
                   :tree-data="treeData"
                   :expanded-keys.sync="expandedKeys"
-                  :selected-keys="selectedTreeKeys">
+                  :selected-keys="selectedTreeKeys"
+                  draggable
+                  @drop="onDropCataSort">
 
             <template #title="record">
               <div class="tree-operate-node"
@@ -259,7 +261,8 @@ import {
   configOverseasStandard,
   removeOverseasStandard,
   getOverseasStandardForm,
-  getOverseasStandardDocumentInfo
+  getOverseasStandardDocumentInfo,
+  editOverseasStandardSystem
 } from '../../../api/standardRegulationLibraryApi'
 import {
   OperationType,
@@ -374,7 +377,7 @@ export default {
     /**
      * 获取树数据
      */
-    initTreeData () {
+    initTreeData (isPackUpExpand = true) {
       this.treeLoading = true
       const params = {
         nodeName: this.treeInput
@@ -389,8 +392,10 @@ export default {
         this.filters.nodeCode = null
         if (res.success) {
           this.treeData = res.result || []
-          // 根节点默认展开
-          this.expandedKeys = [this.treeData[0].key]
+          if (isPackUpExpand) {
+            // 根节点默认展开
+            this.expandedKeys = [this.treeData[0].key]
+          }
         } else {
           this.$message.warn(res.message)
         }
@@ -398,6 +403,123 @@ export default {
         this.treeLoading = false
       })
     },
+    // 拖拽方法
+    onDropCataSort (info) {
+      console.log('------info', info)
+      const dropPos = info.node.pos.split('-')
+      // 拖动的位置，info.dropPosition拖到了目标节点的上面则当前元素 -1，下面则是 1
+      const dropPosition = info.dropPosition - Number(dropPos[dropPos.length - 1])
+
+      const node = info.node // 目标节点
+      const dragNode = info.dragNode // 拖动节点
+      const dragNodeData = dragNode.dataRef
+      const nodeData = node.dataRef
+      console.log('---------dragNodeData', dragNodeData)
+      console.log('---------nodeData', nodeData)
+
+      const paramObj = {}
+
+      // 判断只能在同级排序
+      if (!info.dropToGap) {
+        // 不在缝隙中，在内容区
+        this.$message.warning('请拖动到缝隙中')
+        return false
+      } else if (
+        (info.node.children || []).length > 0 && // Has children
+        info.node.expanded && // Is expanded
+        dropPosition === 1 // On the bottom gap
+      ) {
+        this.$message.warning('请重新拖拽')
+      } else if (dropPos.length === 2 && info.dropToGap) {
+        this.$message.warning('不能移动到最顶级')
+        return false
+      } else {
+        paramObj.id = dragNodeData.id
+        paramObj.parentId = nodeData.parentId // 目标节点的父级id
+        // 排序序号要换成上面节点的nodeOrder+0.00000001，要根据dropPosition判断拖动到的目标节点是在
+        if (dropPos[dropPos.length - 1] < info.dropPosition) {
+          // 说明目标节点在拖动位置上方，获取目标节点下面一个节点的排序，从两个排序中去一个随机数给拖动节点，如果没有下一个同级节点，直接在当前节点排序上加0.0001
+          // 目标节点下面一个节点
+          const nextNode = this.getNextNode(this.treeData, nodeData.id)
+          console.log('---------nextNode', nextNode)
+          if (nextNode) {
+            console.log('-------获取随机数', nodeData.nodeOrder, nextNode.nodeOrder)
+            // 从两个排序获取随机数作为拖动节点的排序
+            paramObj.nodeOrder = this.getRandomArbitrary(nodeData.nodeOrder, nextNode.nodeOrder)
+          } else {
+            // 没有下一个就目标节点排序+0.0001
+            paramObj.nodeOrder = nodeData.nodeOrder + 0.0001
+          }
+        } else {
+          // 说明目标节点在拖动位置下方，要获取上面一个节点的数据，先从上一个节点和目标节点的排序中取一个随机数给拖拽节点，如果没有上一个节点，直接在当前节点排序上减0.0001
+          // 获取目标节点的上一个节点
+          const prevNode = this.getPrevNode(this.treeData, nodeData.id)
+          console.log('---------prevNode', prevNode)
+          if (prevNode) {
+            console.log('-------获取随机数', prevNode.nodeOrder, nodeData.nodeOrder)
+            // 从两个排序获取随机数作为拖动节点的排序
+            paramObj.nodeOrder = this.getRandomArbitrary(prevNode.nodeOrder, nodeData.nodeOrder)
+          } else {
+            // 没有上一个就目标节点排序-0.0001
+            paramObj.nodeOrder = nodeData.nodeOrder - 0.0001
+          }
+        }
+      }
+      // console.log("拖拽后对象是：", paramObj)
+      console.log('此处调用后端接口保存数据' + paramObj.id + paramObj.nodeOrder)
+      editOverseasStandardSystem(paramObj).then(res => {
+        if (res.success) {
+          this.$message.success(res.message)
+          // 重新获取树节点不改变展开节点
+          this.initTreeData(false)
+        } else {
+          this.$message.warning(res.message)
+        }
+      })
+    },
+    // 获取某个节点的上一个同级节点
+    getPrevNode (treeData, key) {
+      let node
+      for (let i = 0; i < treeData.length; i++) {
+        if (treeData[i].key === key) {
+          if (i - 1 < 0) {
+            // 说明是第一个节点，返回空
+            return null
+          } else {
+            node = treeData[i - 1]
+            return node
+          }
+        }
+        if (treeData[i].children) {
+          node = this.getPrevNode(treeData[i].children, key)
+          if (node) {
+            return node
+          }
+        }
+      }
+      return null
+    },
+    // 获取某个节点的下一个同级节点
+    getNextNode (treeData, key) {
+      let node
+      for (let i = 0; i < treeData.length; i++) {
+        if (treeData[i].key === key) {
+          node = treeData[i + 1]
+          return node
+        }
+        if (treeData[i].children) {
+          node = this.getNextNode(treeData[i].children, key)
+          if (node) {
+            return node
+          }
+        }
+      }
+      return null
+    },
+    // 获取两个数之间的随机数
+    getRandomArbitrary (min, max) {
+      return Math.random() * (max - min) + min
+    },
     /**
      * 树节点查询
      */