//父子级
if (!function_exists('get_tree_list'))
{
function get_tree_list($list)
{
//将每条数据的id值
$temp=[];
foreach ($list as $v){
$v['son'] =[];
$temp[$v['id']] =$v;
}
// 获取分类树,;
foreach($temp as $k=>$v){
$temp[$v['pid']]['son'][]=&$temp[$v['id']];
}
return isset($temp [0]['son'])?$temp[0]['son']:[];
}
}
无限极分类
if (!function_exists('get_cate_title')){
//递归函数 实现无限极分类列表
function get_cate_list($list,$pid=0,$level=0){
static $tree=array();
foreach ($list as $row){
if ($row['pid'] ==$pid){
$row['level']=$level;
$tree[]=$row;
get_cate_list($list,$row['id'],$level+1);
}
}
return $tree;
}
}