11.29 jy

src/views/Transaction.vue

@@ -375,10 +375,6 @@ export default {
     });
 
     this.getTreeData();
-    if (this.$route.query.lcId) {
-      this.lcId = this.$route.query.lcId;
-      this.getInfoData(this.$route.query.lcId);
-    }
     if (this.$route.query.systemId) {
       this.formData.lcJudgmentPoint.systemId = this.$route.query.systemId;
     }
@@ -396,54 +392,31 @@ export default {
           this.anewPosttingData(judgmentRuleList)
           this.tableData.forEach(async (item, index) => {
             // 勾选树节点
-            console.log(item.operationIds)
             if (item.operationIds) {
-
               this.$nextTick(() => {
                 this.$refs[`tree-${index}`].setCheckedKeys([item.operationIds]);
-                let currentNode = this.$refs[`tree-${index}`].getNode([item]);
-                let parentLevel
-                let nodeCount = 1//当前树展开节点的数量
-                let nodeIndex = 1//当前选中节点在当前树的位置
-                let dataIndex; //后台返回当前选中节点的父节点是当前的第几位
-                for ( let i=0; i<this.treeData.length; i++){
-                  if(this.treeData[i].children !=null){//有子集节点的
-                    if(this.treeData[i].children==this.treeData[i].children){ //this.orgListLine[i].orgCode默认选中的父节点的orgCode（一个），另外一个this.orgListLine[i].orgCode是一级节点所有的orgCode(多个)
-                      dataIndex =i
-                    }
-                  }
-                  if(this.treeData[i].children==item.operationIds){ //只有一级节点的
-                    dataIndex =i
-                  }
-                }
-                console.log(dataIndex)
-                let  topHeight=dataIndex*20;//计算出选中节点到到顶部的高度
-                if(currentNode){
-                  let currentNodeOrgCode= currentNode&&currentNode.children.operationIds;
-                  //计算nodeCount和nodeIndex
-                  do {
-                    currentNode = currentNode.parent
-                    parentLevel = currentNode.level
-                    let childNodes = currentNode.childNodes
-                    nodeCount += childNodes.length
-                    for (let i = 0; i < childNodes.length; i ++) {
-                      if (childNodes[i].data.children == currentNodeOrgCode) {
-                        nodeIndex += (i + 1)
+                console.log(this.$refs[`tree-${index}`].getCheckedNodes(true))
+                for (var i=0;i<this.treeData.length;i++){
+                  if (this.treeData[i].children>0){
+                    let children = this.treeData[i].children
+                    for (var j=0;j<children.length;j++){
+                      if (children[j].children>0) {
+                        let childrens = children[i].children
                       }
                     }
-                    currentNodeOrgCode = currentNode.children.operationIds
                   }
-                  while ( parentLevel>0)//包含一级节点，因为一级节点有多个，如果是一级节点有一个，那这个判断就是while ( 1!=parentLevel)
-                  let dom = document.querySelector("#divTree")
-                  let dom1 = document.querySelector("#depTree")
-                  //一个节点的高度是26px,这个值能否从对象中获取，等我把这个功能做好再考虑吧
-                  let nodeHight =26
-                  dom1.style.height = (nodeCount * nodeHight) + "px"
-                  let contHeight=(nodeIndex * nodeHight)+topHeight-300//总高度,盒子高度的一半
-                  dom.scrollTo(0, contHeight)
                 }
+                // let currentNode = this.$refs[`tree-${index}`].getNode([item]);
+                // while ( parentLevel>0)//包含一级节点，因为一级节点有多个，如果是一级节点有一个，那这个判断就是while ( 1!=parentLevel)
+                // let dom = document.querySelector("#divTree")
+                // let dom1 = document.querySelector("#depTree")
+                // //一个节点的高度是26px,这个值能否从对象中获取，等我把这个功能做好再考虑吧
+                // let nodeHight =26
+                // dom1.style.height = (nodeCount * nodeHight) + "px"
+                // let contHeight=(nodeIndex * nodeHight)+topHeight-300//总高度,盒子高度的一半
+                // dom.scrollTo(0, contHeight)
                 // this.scrollToDepTree(item.operationIds)
-              });
+              })
             }
             // 根据题目id,获取题目信息
             if (item.isSubject && item.type && item.type != 4 && item.emptyOne) {
@@ -526,6 +499,7 @@ export default {
       this.checkChange = true
       if (checked && data.isNode === 1) {
         this.tableData[index].operationIds = data.id; // 操作id串
+        // for ()
         row.value1 = "";
         row.value2 = "";
         row.value3 = "";
@@ -539,18 +513,25 @@ export default {
           row.type = "";
           this.currentNodeData = {};
           this.$refs[`tree-${index}`].setCheckedNodes([data]);
-
         }
       }
     },
     getTreeData() { // 获取树结构数据
     console.log('getTreeData')
       this.$get(this.api.getLcRecord).then(res => {
-        if (res.status === 200 && res.list) {
-          if (res.list.length) {
+        console.log(res)
+        if (res.status == 200 && res.list.length>0) {
+          if (res.list.length>0) {
             this.treeData = this.toTreeId(res.list, res.list[0].parentId);
+<<<<<<< HEAD
             console.log('---this.treeData')
             console.log(this.treeData)
+=======
+            if (this.$route.query.lcId) {
+              this.lcId = this.$route.query.lcId;
+              this.getInfoData(this.$route.query.lcId);
+            }
+>>>>>>> ec22a93db6e0a2fc0e096d7988bd1adb8413af1a
           }
         } else {
           console.log('---this.treeData拿取失败')