|
@@ -102,6 +102,7 @@ export default {
|
|
//console.log(allTree,'allTree');
|
|
//console.log(allTree,'allTree');
|
|
this.getRightTree(allTree,keys);
|
|
this.getRightTree(allTree,keys);
|
|
this.rightTreeData = allTree;
|
|
this.rightTreeData = allTree;
|
|
|
|
+ this.$emit('onAddTree',this.rightTreeData);
|
|
}else{
|
|
}else{
|
|
//只增加右侧树没有的节点,不会覆盖右侧树多余的节点
|
|
//只增加右侧树没有的节点,不会覆盖右侧树多余的节点
|
|
|
|
|
|
@@ -132,14 +133,22 @@ export default {
|
|
}
|
|
}
|
|
})
|
|
})
|
|
|
|
|
|
- //console.log(addMap)
|
|
|
|
- addMap.forEach((value,key)=>{
|
|
|
|
- this.$refs.rightTree.append(key,value);
|
|
|
|
- })
|
|
|
|
|
|
+ //把半选和选中的数组key合并
|
|
|
|
+ let keys = this.$refs.leftTree.getCheckedKeys().concat(this.$refs.leftTree.getHalfCheckedKeys());
|
|
|
|
+ const myArray = Array.from(addMap.keys());
|
|
|
|
+ this.getRightTree(myArray,keys);
|
|
|
|
+ myArray.forEach((data)=>{
|
|
|
|
+ this.$refs.rightTree.append(data,data.parentId);
|
|
|
|
+ })
|
|
|
|
+
|
|
|
|
+
|
|
|
|
+ // addMap.forEach((value,key)=>{
|
|
|
|
+ // this.$refs.rightTree.append(key,value);
|
|
|
|
+ // })
|
|
|
|
|
|
}
|
|
}
|
|
|
|
|
|
- this.$emit('onAddTree',this.rightTreeData);
|
|
|
|
|
|
+
|
|
},
|
|
},
|
|
getRightTree(arr,keys){
|
|
getRightTree(arr,keys){
|
|
//对比所有的node和选中的key
|
|
//对比所有的node和选中的key
|
|
@@ -168,7 +177,7 @@ export default {
|
|
}
|
|
}
|
|
}
|
|
}
|
|
},
|
|
},
|
|
-
|
|
|
|
|
|
+
|
|
getRightTreeData(set,arr){
|
|
getRightTreeData(set,arr){
|
|
arr.forEach((data)=>{
|
|
arr.forEach((data)=>{
|
|
set.add(data.id);
|
|
set.add(data.id);
|