/**
* 重新排序
* @param array $arr [要排序的数组]
* @param integer $pid [父id]
* @return array [排好序的数组]
*/
}
return $res;
* 重新排序
* @param array $arr [要排序的数组]
* @param integer $pid [父id]
* @return array [排好序的数组]
*/
public function tree($arr,$pid = 0,$level = 0){
$res = array();
foreach ($arr as $v) {if ($v['parent_id'] == $pid) {
$v['level'] = $level;
$res[] = $v;
$res = array_merge($res,$this->tree($arr,$v['cat_id'],$level+1));
}}
return $res;
}
//无限极分类方法 |
02 | function tree(&$list,$pid=0,$level=0,$html='--'){ |
03 | static $tree = array(); |
04 | foreach($list as $v){ |
05 | if($v['pid'] == $pid){ |
06 | $v['sort'] = $level; |
07 | $v['html'] = str_repeat($html,$level); |
08 | $tree[] = $v; |
09 | tree($list,$v['id'],$level+1,$html); |
10 | } |
11 | } |
12 | return $tree; |
13 | } |
14 | //这里的$list是查询上面表获取的一个二维数组: |