PHP implements stepless recursive classification (ThinkPHP framework), stepless thinkphp_PHP tutorial

PHP implements levelless recursive classification (ThinkPHP framework), levelless thinkphp

<span>/*</span><span>*
*   无级递归分类
*   @param   int     $assortPid   要查询分类的父级id
*   @param   mixed   $tag         上下级分类之间的分隔符
*   @return  string  $tree        返回的分类树型结构结果 
*
</span><span>*/</span>
<span>function</span> recursiveAssort(<span>$assortPid</span>, <span>$tag</span> = ''<span>)
{   
    </span><span>$assort</span> = M('goods_class')->where("class_pid = <span>$assortPid</span>")->field('class_id, class_name')-><span>select();
    </span><span>foreach</span> (<span>$assort</span> <span>as</span> <span>$value</span><span>) {
        </span><span>$tree</span> .= '<option value="' . <span>$value</span>['class_id'] . '">' . <span>$tag</span> . <span>$value</span>['class_name'] . '</option>'<span>;
        </span><span>$tree</span> .= recursiveAssort(<span>$value</span>['class_id'], <span>$tag</span> . '&emsp;'<span>);
    }
    </span><span>return</span> <span>$tree</span><span>;
}</span>

http://www.bkjia.com/PHPjc/1040158.htmlwww.bkjia.comtruehttp: //www.bkjia.com/PHPjc/1040158.htmlTechArticlePHP implements levelless recursive classification (ThinkPHP framework), levelless thinkphp /* ** Levelless recursive classification* @ param int $assortPid To query the parent id of the category* @param mixed $tag Between the upper and lower categories...