zoukankan      html  css  js  c++  java
  • Tree全部展开/折叠

    <template>

      <el-tree :data="navs" :props="defaultProps" show-checkbox ref="tree" highlight-current draggable  node-key="navId"   :default-expand-all="defaultExpand"> </el-tree>

      <el-button @click="setCheckedNodes">展开所有菜单</el-button>

      <el-button @click="setCheckedKeys">收起所有菜单</el-button>

    </template>

    <script>

    export default { 
      data() {
        return {

          navs:[],   //所有菜单 

            defaultProps: {
            id:'navId',
            children: 'snavList',
            label: 'navName',
            disabled:'navOffOn'
            },

          defaultExpand:true,  //默认展开所有节点

        }

      },

      methods: {

        setCheckedKeys() {  
          this.defaultExpand=false;
          for(var i=0;i<this.$refs.tree.store._getAllNodes().length;i++){
            this.$refs.tree.store._getAllNodes()[i].expanded=this.defaultExpand;
          }
        },

        setCheckedNodes() {
          this.defaultExpand=true; //展开所有节点
          for(var i=0;i<this.$refs.tree.store._getAllNodes().length;i++){
            this.$refs.tree.store._getAllNodes()[i].expanded=this.defaultExpand;
          }
        }

      }

    }

    </script>

  • 相关阅读:
    《构建之法》第四章读后感
    复利计算-单元测试
    hadoop 不同URLTitle文件提取关联URL
    全角转半角-半角转全角
    leetcode unique binary search Tree
    leetcode validBST
    leetcode -- Flatten Binary Tree to Linked List
    堆排序
    比较字符串总结:如果计算两个字符串的相似度或者距离
    leetcode Populating Next Right Pointers in Each Node
  • 原文地址:https://www.cnblogs.com/miaoyiyan/p/9486210.html
Copyright © 2011-2022 走看看