1.读取数据数据
/**
* 所有分类数据
* */
public function categoryData(){
$order = 'id,sort asc';
$res = $this->db->cache($this->cache)->order($order)->select();
return $data;
}
结构如下
Array
(
[] => Array
(
[id] =>
[pid] =>
[name] => 新闻40
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[pid] =>
[name] => 图片
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[pid] =>
[name] =>
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[pid] =>
[name] =>
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[pid] =>
[name] => 第4级分类
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[pid] =>
[name] =>
[desc] =>
[is_delete] =>
[add_time] =>
))
2.创建子分类查询
/**
* 子分类列表
* */
public function pidData($pid=null){
$result ='';
$arr = $this->categoryData();
foreach($arr as $k=>$v){
if($v['pid'] == $pid){
$result[$v['id']] = $v;
}
}
return $result;
}
3.无限循环
/**
* 分类树
* */
public function tree($pid=){
$res = $this->pidData($pid);
if(empty($res)) return false;
foreach($res as $k=>$v){
$result[$v['id']] = $v; $rf = $this->tree($v['id']);
if($rf){
foreach($rf as $k=>$vv){
$result[$vv['id']]['id'] = $vv['id'];
$result[$vv['id']]['name'] = " |- ".$vv['name'];
$result[$vv['id']]['pid'] = $vv['pid'];
}
}
}
return $result;
}
最后获得的无限循环结构
Array
(
[] => Array
(
[id] =>
[pid] =>
[name] => 新闻40
[desc] =>
[is_delete] =>
[add_time] =>
) [] => Array
(
[id] =>
[name] => |-
[pid] =>
) [] => Array
(
[id] =>
[name] => |- |- 第4级分类
[pid] =>
) [] => Array
(
[id] =>
[name] => |- |- |-
[pid] =>
) [] => Array
(
[id] =>
[name] => |-
[pid] =>
) [] => Array
(
[id] =>
[pid] =>
[name] => 图片
[desc] =>
[is_delete] =>
[add_time] =>
))
