php无限级分类转换为树型结构
代码如下:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 |
public function updateCache($tip = 1) { $_tree = array(); $results = D( 'enum' )->field( 'id,pid,title,name,value' )->select( array( 'index' => 'id' ) ); if(!empty($results)){ foreach ( $results as $key=> $value ) { if ( isset( $results[ $value['pid'] ] ) ) { $results[ $value['pid'] ]['_'][ $key ] = &$results[ $value['id'] ]; }else{ $_tree[ $key ] = & $results[$value['id']]; } } } S('enum',$_tree); if($tip == 1){ $this->ajaxSuccess('缓存成功!'); } } |
转载请注明:PHP笔记 » PHP无限级分类转换为树型结构