php无限 极连,php无限级分类函数(无极限)

该博客介绍了一个PHP函数,用于将具有pid(父ID)和id(主键)字段的扁平数据集转换为树形结构。通过递归遍历数据并根据pid组织子节点,实现了数据的层次化。同时,它还支持指定排序字段和类型,确保了树形结构的排序正确性。示例展示了如何处理具有用户分类的数据,并给出了输入和输出结果。
摘要由CSDN通过智能技术生成

/**

* [pidToGetTree description]

* @Author Lerko

* @DateTime 2017-04-05T10:44:06+0800

* @param [type] $list [所有的数据]

* @param [type] &$data [返回的数据的载体,传空数组]

* @param string $pk [默认主键]

* @param string $pid [关联到主键的key]

* @param string $child_key [孩子节点的数据key]

* @param string $sort_id [排序id]

* @param [type] $sort_type [排序方式 php自身辩来给你 SORT_ASC SORT_DESC]

* @return [type] [description]

*/

function pidToGetTree($list,&$data,$pk='id',$pid='pid',$child_key="_child",$sort_id='sort_id',$sort_type=SORT_ASC,$start_pid=0){

if($data===null){

return;

}

if(count($data)==$start_pid){

//初始化根列表

foreach ($list as $key => &$value) {

if($value[$pid]==0){

$data[]=$value;

unset($list[$key]);

}

}

$sort_root_arr=array_column($data,$sort_id);

array_multisort($sort_root_arr,$sort_type,$data);

}

foreach ($data as $key => &$value) {

foreach ($list as $key2 => $value2) {

if($value2[$pid]==$value[$pk]){

$value[$child_key][]=$value2;

unset($list[$key2]);

}

}

if(empty($value[$child_key])){continue;}

$sort_arr=array_column($value[$child_key],$sort_id);

array_multisort($sort_arr,$sort_type,$value[$child_key]);

pidToGetTree($list,$value[$child_key],$pk,$pid,$child_key,$sort_id,$sort_type);

}

}

输入数据

+----+-----+---------+---------+---------+-------------+---------+

| id | pid | root_id | user_id | sort_id | name_cn | name_en |

+----+-----+---------+---------+---------+-------------+---------+

| 1 | 0 | 2160 | 2160 | 0 | 种类1 | cat |

| 2 | 1 | 2160 | 2160 | 1 | 种类1-1 | cat |

| 3 | 1 | 2160 | 2160 | 1 | 种类1-2 | cat |

| 4 | 1 | 2160 | 2160 | 1 | 种类1-3 | cat |

| 5 | 0 | 2160 | 2160 | 0 | 种类5 | cat |

| 6 | 2 | 2160 | 2160 | 2 | 种类1-1-1 | cat |

| 7 | 5 | 2160 | 2160 | 5 | 种类5-1 | cat |

| 8 | 5 | 2160 | 2160 | 3 | 种类5-2 | cat |

| 9 | 0 | 2160 | 2160 | 0 | 种类9 | cat |

| 10 | 9 | 2160 | 2160 | 9 | 种类9-1 | cat |

| 11 | 9 | 2160 | 2160 | 9 | 种类9-2 | cat |

+----+-----+---------+---------+---------+-------------+---------+

输出数据

array (size=3)

0 =>

array (size=8)

'id' => string '1' (length=1)

'pid' => string '0' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '0' (length=1)

'name_cn' => string '种类1' (length=7)

'name_en' => string 'cat' (length=3)

'_child' =>

array (size=3)

0 =>

array (size=7)

'id' => string '2' (length=1)

'pid' => string '1' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '1' (length=1)

'name_cn' => string '种类1-1' (length=9)

'name_en' => string 'cat' (length=3)

1 =>

array (size=7)

'id' => string '3' (length=1)

'pid' => string '1' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '1' (length=1)

'name_cn' => string '种类1-2' (length=9)

'name_en' => string 'cat' (length=3)

2 =>

array (size=7)

'id' => string '4' (length=1)

'pid' => string '1' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '1' (length=1)

'name_cn' => string '种类1-3' (length=9)

'name_en' => string 'cat' (length=3)

1 =>

array (size=8)

'id' => string '5' (length=1)

'pid' => string '0' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '0' (length=1)

'name_cn' => string '种类5' (length=7)

'name_en' => string 'cat' (length=3)

'_child' =>

array (size=2)

0 =>

array (size=7)

'id' => string '7' (length=1)

'pid' => string '5' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '5' (length=1)

'name_cn' => string '种类5-1' (length=9)

'name_en' => string 'cat' (length=3)

1 =>

array (size=7)

'id' => string '8' (length=1)

'pid' => string '5' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '3' (length=1)

'name_cn' => string '种类5-2' (length=9)

'name_en' => string 'cat' (length=3)

2 =>

array (size=8)

'id' => string '9' (length=1)

'pid' => string '0' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '0' (length=1)

'name_cn' => string '种类9' (length=7)

'name_en' => string 'cat' (length=3)

'_child' =>

array (size=2)

0 =>

array (size=7)

'id' => string '10' (length=2)

'pid' => string '9' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '9' (length=1)

'name_cn' => string '种类9-1' (length=9)

'name_en' => string 'cat' (length=3)

1 =>

array (size=7)

'id' => string '11' (length=2)

'pid' => string '9' (length=1)

'root_id' => string '2160' (length=4)

'user_id' => string '2160' (length=4)

'sort_id' => string '9' (length=1)

'name_cn' => string '种类9-2' (length=9)

'name_en' => string 'cat' (length=3)

作者:lerko_

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值