不使用递归实现无限极分类

最新推荐文章于 2022-09-16 14:39:47 发布

原创最新推荐文章于 2022-09-16 14:39:47 发布 · 450 阅读

0 ·

CC 4.0 BY-SA版权

php 专栏收录该内容

41 篇文章

订阅专栏

<?php
/**
 * 书籍分类服务
 *
 * @author zz@flyzz.net
 * @date 2018-10-08
 */

namespace app\common\service;


use app\common\model\BookCategoryModel;
use app\common\model\BookModel;
use think\Db;

class BookCategoryService
{
    /**
     *Notes:
     *User: admin
     *全部分类
     * @param string $cate_name
     * @return array|mixed
     * @throws \think\exception\DbException
     */
    public static function cateList($cate_name=''){
        $liazai_cate = BookModel::getUpdateStatusArray();
        $pay_cate = BookModel::getNeedPayArray();
        $list = BookCategoryModel::all(['status'=>1])->toArray();
        $list = self::getTree($list);
        if(!empty($cate_name)){
            foreach ($list as $item){
                if($item['name']=='漫画'){
                    $list = $item;
                }
            }
        }
        $cate['book_type'] = $list;
        $cate['lianzai'] = $liazai_cate;
        $cate['pay_type'] = $pay_cate;
        return $cate;
    }

   private static function getTree($list){
        $tree = [];
        $list = array_column($list,null,'id');
        foreach($list as $val){
            if(isset($list[$val['parent_id']]))
                $list[$val['parent_id']]['son'][] = &$list[$val['id']];
            else
                $tree[] =  &$list[$val['id']];
        }
        return $tree;
    }
}