先查找指定文章的一级评论,再递归查找下级评论。
下面是递归函数部分
private $article_level2_comment_arr = array();
//递归查询下级回复
public function digui_reply($comment_id)
{
$article_level2_comment = db('comment')
->alias('a')
->join('fa_user b','b.id = a.user_id')
->join('fa_user c','c.id = a.comment_to_user_id')
->where(['a.pid'=>$comment_id,'is_delete'=>'0'])
->field('a.id,b.nickname comment_user_nickname,c.nickname comment_to_nickname,a.comment_content,a.createtime,a.good_num,a.is_comment_had_child,a.pid')
->order('a.createtime desc')
->select();
$this->article_level2_comment_arr = array_merge($this->article_level2_comment_arr,$article_level2_comment);
foreach ($article_level2_comment as $k=>$v){
if ($v['is_comment_had_child']=='1'){
$this->digui_reply($v['id']);
}
}
}