递归实现树结构数据回显

最新推荐文章于 2024-08-01 15:37:23 发布

︶ㄣ洳影隨形しovё

最新推荐文章于 2024-08-01 15:37:23 发布

阅读量126

点赞数

CC 4.0 BY-SA版权

文章标签： iview tree

本文链接：https://blog.csdn.net/qq_43907534/article/details/132100272

文章描述了一个JavaScript方法`treeShow`，用于处理表单中的多级组织数据选择，通过递归函数`hx`实现节点的选中状态管理和名称收集。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

treeShow() {
      let oneLists = this.formItem.org_one.split(",");
      let twoLists = this.formItem.org_two.split(",");
      let threeLists = this.formItem.org_three.split(",");
      let selectedLists = oneLists.concat(twoLists, threeLists);
      let selectedNamesLists = [];

      console.log(this.branchDatas)
      this.selectedTreeList = this.branchDatas
      console.log(this.selectedTreeList)

      this.selectedTreeList.forEach(a => {
        this.hx(a, selectedLists, selectedNamesLists)
      })

      this.selectedNames = selectedNamesLists.join(",");
    },
    hx(a, selectedLists, selectedNamesLists) {
      let index = selectedLists.findIndex(item => item == a.organ_id)
      if (index != -1) {
        a.checked = true;
        selectedNamesLists.push(a.depart_fullname);
      } else {
        a.checked = false
      }

      if (a.children && a.children.length) {
        a.children.forEach(b => {
          this.hx(b, selectedLists, selectedNamesLists)
        })
      }
    },