js实现树结构(React)

数据

export const data = [
    {
        name: "111",
        title: "111",
        children: [{
            name: "test",
            title: "test",
            children: [{
                name: "test1",
                title: "test2",
            }]
        }]
    },
    {
        name: "222",
        title: "222",
        children: [{
            name: "test",
            title: "test",
            children: [{
                name: "test4",
                title: "test5",
            }]
        }]
    },
    {
        name: "333",
		title: "333"
    }
];

缩进函数和递归渲染函数

nbsp = (index) => {
    let temp = [];
    for (let i = 0; i < index; i++) {
        temp.push(<span key={i}>&nbsp;&nbsp;&nbsp;</span>)
    }
    return <span>{temp}</span>
};

renderTree = (data, index = 0) => {
let that = this;
 index++;
 return <div>
     {
         data ? data.map((item) => {
             if (item.children && item.children[0]) {
                 return <div>
                     <span>{that.nbsp(index)}{item.title}</span>
                     {that.renderTree(item.children, index)}
                 </div>;
             } else {
                 return <div>
                     <div>{that.nbsp(index)}{item.title}</div>
                 </div>
             }
         }) : null
     }
 </div>
};

调用树函数

render(){
	let that = this;
	return <div>{that.renderTree(data)}</div>
}

整体示例代码

import * as React from "react";
export const data = [
    {
        name: "111",
        title: "111",
        children: [{
            name: "test",
            title: "test",
            children: [{
                name: "test1",
                title: "test2",
            }]
        }]
    },
    {
        name: "222",
        title: "222",
        children: [{
            name: "test",
            title: "test",
            children: [{
                name: "test4",
                title: "test5",
            }]
        }]
    },
    {
        name: "333",
        title: "333"
    }
];

export class Tree extends React.Component{

    nbsp = (index) => {
        let temp = [];
        for (let i = 0; i < index; i++) {
            temp.push(<span key={i}>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span>)
        }
        return <span>{temp}</span>
    };

    renderTree = (data, index = 0) => {
        let that = this;
        index++;
        return <div>
            {
                data ? data.map((item) => {
                    if (item.children && item.children[0]) {
                        return <div>
                            <span>{that.nbsp(index)}{item.title}</span>
                            {that.renderTree(item.children, index)}
                        </div>;
                    } else {
                        return <div>
                            <div>{that.nbsp(index)}{item.title}</div>
                        </div>
                    }
                }) : null
            }
        </div>
    };

    render() {
        let that = this;
        return <div>{that.renderTree(data)}</div>
    }
}

实现效果

在这里插入图片描述

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值