js展开一颗树

 

Tree View 指令不支持 树结构数据源, 只支持单层数组。(也许是我没发现,人家可以设置) 。我只能把树展开,变成单层数组。然后还要记录已经递归到第一层了。比如这样。

<!doctype html>

<html lang="en-US">

<head>

    <meta charset="UTF-8">

    <title></title>

</head>

<body>

<script type="text/javascript">

    var self = this;

    self.list =  [

        {

            "id": 1,

            "title": "node1",

            "children": [

                {

                    "id": 11,

                    "title": "node1.1",

                    "children": [

                        {

                            "id": 111,

                            "title": "node1.1.1"

                        }

                    ]

                },

                {

                    "id": 12,

                    "title": "node1.2",

                    "children": []

                }

            ]

        },

        {

            "id": 2,

            "title": "node2",

            "nodrop": true,

            "children": [

                {

                    "id": 21,

                    "title": "node2.1",

                    "children": []

                },

                {

                    "id": 22,

                    "title": "node2.2",

                    "children": []

                }

            ]

        },

        {

            "id": 3,

            "title": "node3",

            "children": [

                {

                    "id": 31,

                    "title": "node3.1",

                    "children": []

                }

            ]

        }

    ];

    function flatten (arr,level){

        var result = [],

                recursion = function (arr,level) {

                    arr.level = arr.level || level || 0;

                    //这里用了个巧妙的方法,记录该数组的level。有就用它自己的,没有就判断是不是别人给它的,别人给的一般代表自己是子树。然后给的时候 +1

                    arr.forEach(function (item) {

                        item.$$treeLevel =  arr.level;

                        result.push(item);

                        item.children && recursion(item.children,arr.level + 1);

                    });

                    delete arr.level;

                };

        recursion(arr);

        return result;

    };

    self.arr = flatten(self.list);

    console.log(self.arr);

</script>

</body>

</html>

web前端免费学习资料,搜【WEB前端互动交流群】

转载于:https://www.cnblogs.com/CCDS01/p/shenlaiyibi.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值