PHP三级分类数据处理

荣~博客

已于 2024-02-22 17:58:39 修改

阅读量532

点赞数 3

文章标签： php windows

于 2024-02-04 13:54:04 首次发布

本文链接：https://blog.csdn.net/bianenhui91/article/details/136024791

版权

文章描述了一个JavaScript函数，用于生成一个系统的功能树结构，包含用户管理、数据管理（如报表）、资源管理等子模块。该结构通过递归处理数组，形成层次分明的菜单结构。

摘要由CSDN通过智能技术生成

一、原始数据

function getDatas(){
    return [
	[
		'component' => 'system',
		'redict' => '/system',
		'path' => '/system',
		'hidden' => 1,
		'name' => '系统管理',
		'children' => [
			[
				'component' => 'user',
				'redict' => '/user',
				'path' => '/user',
				'hidden' => 1,
				'name' => '用户管理',
				'children' => [
					[
						'component' => 'user_list',
						'redict' => '/user_list',
						'path' => '/user_list',
						'hidden' => 1,
						'name' => '用户列表',
					],
					[
						'component' => 'role',
						'redict' => '/user_role',
						'path' => '/user_role',
						'hidden' => 1,
						'name' => '角色列表',
					],
					[
						'component' => 'perm',
						'redict' => '/perm',
						'path' => '/perm',
						'hidden' => 1,
						'name' => '权限列表',
					],
				]
			],
			[
				'component' => 'data',
				'redict' => '/data',
				'path' => '/data',
				'hidden' => 1,
				'name' => '数据管理',
				'children' => [
					[
						'component' => 'report',
						'redict' => '/report',
						'path' => '/report',
						'hidden' => 1,
						'name' => '分日报表',
					],
					[
						'component' => 'hour_report',
						'redict' => '/hour_report',
						'path' => '/hour_report',
						'hidden' => 1,
						'name' => '分时报表',
					],
					[
						'component' => 'month_report',
						'redict' => '/month_report',
						'path' => '/month_report',
						'hidden' => 1,
						'name' => '分月报表',
					],
				]
			],
			[
				'component' => 'resource',
				'redict' => '/resource',
				'path' => '/resource',
				'hidden' => 1,
				'name' => '资源管理',
				'children' => [
					[
						'component' => 'res_list',
						'redict' => '/res_list',
						'path' => '/res_list',
						'hidden' => 1,
						'name' => '资源列表'
					]
				]
			]
		]
	]
]
}

二、函数处理

private static function GetTree($arr,$pid,$step){
        global $tree;
        foreach($arr as $key=>$val) {
            if($val['pid'] == $pid) {
                $flg = str_repeat('└―',$step);
                $val['name'] = $flg.$val['name'];
                $tree[] = $val;
                $this->GetTree($arr , $val['cid'] ,$step+1);
            }
        }
        return $tree;
    }