//无限极分类
/* @param $data array 数据
- @param $pid int 父类关系值
- @param $parentFieldstring 父类字段
- @param $pkField string 主键字段
- return array
*/
function getTreesPro( d a t a , data, data,pid=‘0’, p a r e n t F i e l d = ′ p i d ′ , parentField='pid', parentField=′pid′,pkField=‘id’){
t r e e = a r r a y ( ) ; f o r e a c h ( tree =array(); foreach( tree=array();foreach(data as k = > k=> k=>v){
if( v [ v[ v[parentField] == $pid){
t e m p = g e t T r e e s P r o ( temp = getTreesPro( temp=getTreesPro(data, v [ v[ v[pkField]);// d a t a 是 对 象 则 改 为 data是对象则改为 data是对象则改为v-> p k F i e l d i f ( ! e m p t y ( pkField if(!empty( pkFieldif(!empty(temp)){ //分层
v [ ′ s o n ′ ] = g e t T r e e s P r o ( v['son']= getTreesPro( v[′son′]=getTreesPro(data, v [ v[ v[pkField]);
}
$tree[] = $v;
}
}
return $tree;
}