一个pid的递归排序

    public function getCaches()
    {
        $data = $this->getByOrder('disabled = 0', [], 'id, pid, name, sort', 'id asc,sort desc');

        $res = $this->build_tree($data);

        dump($res);die;

//        $cache_list = [];
//        if($data) {
//            foreach ($data as $dk => $dv) {
//                if ($dv['pid'] == 0) {
//                    $cache_list[$dv['id']] = $dv;
//                } else {
//                    $cache_list[$dv['pid']]['child_list'][$dv['id']] = $dv;
//                }
//            }
//        }
//
//        return $cache_list;
    }

    function findChild(&$arr,$id){
        $childs=array();
        foreach ($arr as $k => $v){
            if($v['pid'] == $id){
                $childs[$v['id']]=$v; //使用id作为键
            }
        }
        return $childs;
    }

    function build_tree($rows,$root_id = 0){
        $childs = $this->findChild($rows,$root_id);
        if(empty($childs)){
            return null;
        }
        foreach ($childs as $k => $v){
            $rescurTree= $this->build_tree($rows,$v['id']);
            if( null != $rescurTree){
                $childs[$k]['child_list'] = $rescurTree;
            }
        }
        return $childs;
    }