The example in this article describes the implementation method of unlimited classification in PHP. Share it with everyone for your reference, the details are as follows:
1. Recursive
public function getInfo(){ $data=$this->select(); $arr=$this->noLimit($data,$f_id=0,$level=0); return $arr; } //无限极分类 public function noLimit($data,$f_id=0,$level=0){ static $lists=array(); foreach($data as $key=>$v){ if($v['f_id']==$f_id){ $v['level']=$level; $lists[]=$v; $this->noLimit($data,$v['q_id'],$level+1); } } return $lists; }
2. Ordinary
public function getInfo(){ $u_id=session('u_id'); $data=$this->join("user join user_role on user.u_id=user_role.u_id join role_quan on user_role.j_id=role_quan.j_id join quan on quan.q_id=role_quan.q_id")-> where("user.u_id=$u_id and quan.f_id=0")->group("quan.q_id")->select(); foreach($data as $k=>$v){ $arr=$this->join("user join user_role on user.u_id=user_role.u_id join role_quan on user_role.j_id=role_quan.j_id join quan on quan.q_id=role_quan.q_id")-> where("user.u_id=$u_id and quan.f_id=".$v['q_id'])->group("quan.q_id")->select(); $data[$k]['son']=$arr; }
The above is the content of the analysis of the PHP unlimited classification implementation method , for more related content, please pay attention to the PHP Chinese website (www.php.cn)!
Related articles:
php recursively implements infinite classification trees
php uses recursive method to achieve infinite classification