Home > Article > Backend Development > How to implement Infinitus classification in PHP? Three implementation methods of Infinitus classification (detailed code explanation)
The content of this article is to introduce how to implement Infinitus classification in PHP? There are three implementation methods of Infinitus classification (detailed code explanation). It has certain reference value. Friends in need can refer to it. I hope it will be helpful to you.
Infinitus Category 1:
public function judeg($id) { $rs = Db::name('finance_class') -> field('parent_code') -> where('id',$id) -> select(); $i = 1; foreach($rs as $k => $v){ if($v['parent_code'] a8093152e673feb7aba1828c43532094 0){ $i += $this -> judeg($v['parent_code']); } } return $i; } public function cid($id,$pid) { $w['parent_code'] = $id; $rs = Db::name('finance_class') -> field('id,code,name,parent_code') -> where($w) -> order('code asc') -> select(); $str = ''; foreach ($rs as $k => $v) { $name = $v['name']; $_id = $v['id']; $cutOff = ''; for($i = 0; $i 07712f3ff3ffe56750e7faf0f297fe4b judeg($_id); $i++){ $cutOff.='-'; } if($_id == $pid){ $str.='e388a4556c0f65e1904146cc1a846bee他的id='.$_id.'====他的级别'.$cutOff.$name.'94b3e26ee717c64999d7867364b1b4a3'; }else{ $str.='e388a4556c0f65e1904146cc1a846bee他的id='.$_id.'====他的级别'.$cutOff.$name.'94b3e26ee717c64999d7867364b1b4a3'; } $str.=$this->cid($_id,$pid); } return $str; 37} public function finance_c() { $w['type'] = '资产类'; $w['parent_code'] = 0; $rs = Db::name('finance_class') -> field('id,code,name,parent_code') -> where($w) -> select(); $str = ''; foreach ($rs as $k => $v){ $str.= 'e388a4556c0f65e1904146cc1a846bee一级name:'.$v['name'].'94b3e26ee717c64999d7867364b1b4a3'; $str.= $this -> cid($v['id'],0); } echo $str; }
The efficiency of this method is slow and convoluted.
Method 2:
public function getVoucherClass() { $lists = Db::name('finance_class')->select(); $lists = $this->getTree($lists); foreach($lists as $value){ echo str_repeat('--', $value['level']), $value['name'].'<br />'; } 10} /** * 递归实现无限极分类 * @param $array 分类数据 * @param $pid 父ID * @param $level * @return $list */ function getTree($array, $pid =0, $level = 0){ static $list = []; foreach ($array as $key => $value){ if ($value['parent_code'] == $pid){ $value['level'] = $level; $list[] = $value; unset($array[$key]); $this->getTree($array, $value['id'],$level+1); } } return $list; 30}
Infinitus Classification 3:
public function index() { $lists = \think\Db::table('ozyx_finance_class')->select(); $lists = $this->getTree($lists,0); foreach ($lists as $k => $v) { $lists_one[$v['type']][]=$v; } // halt($lists_one); $this->assign('lists', $lists_one); return view(); } /** * 无限极分类 */ function getTree($data, $pid) { $tree = ''; foreach($data as $k => $v) { if($v['parent_code'] == $pid) { $v['parent_code'] = $this->getTree($data, $v['id']); $tree[] = $v; unset($data[$k]); } } return $tree; }
Data table structure:
The above is the detailed content of How to implement Infinitus classification in PHP? Three implementation methods of Infinitus classification (detailed code explanation). For more information, please follow other related articles on the PHP Chinese website!