在项目中我们常常用到无限极分类:
1.在下拉选择分类中,最简单的是将分类组装成二维数组,遍历一次即可:
//获取排列好的二维数组(带等级)
public function GetTree($arr,$pid,$step){
global $tree;
foreach($arr as $key=>$val) {
if($val['parent_id'] == $pid) {
$flg = str_repeat('|―',$step);//重复几次 根据等级不同重复次数不同
$val['name'] = $flg.$val['name'];
$val['level'] = $step;
$tree[] = $val;
$this->GetTree($arr , $val['id'] ,$step+1);
}
}
return $tree;
}
2.组装成多维数组:
//分类函数 (分成带child的多维数组)
public function buildTree($rows,$root_id){ $childs=$this->findChild($rows,$root_id); if(empty($childs)){ return null; } foreach ($childs as $k => $v){ $rescurTree=$this->buildTree($rows,$v['id']); if( null != $rescurTree){ $childs[$k]['child']=$rescurTree; } } return $childs; }
public function findChild(&$arr,$id){ $childs=array(); foreach ($arr as $k => $v){ if($v['parent_id']== $id){ $childs[]=$v; } } return $childs; }