PHP unlimited classification tree [supports sub-category sorting]

No one stipulates that classes must be used. You can write it as a function. Everyone’s programming habits, styles, and preferences are different. The purpose of encapsulating into classes is to make the program structured and organized, rather than placing it randomly. , Regarding the multiple methods (vTree, hTree) included in the class, they mainly deal with different business scenarios. vTree has a single-line vertical structure, while hTree has a tree structure.

ClassTree.class.php

<?php
/**
 * 无限分类树（支持子分类排序）
 * version：1.4
 * author：Veris
 * website：www.mostclan.com
 */
class ClassTree {
    /**
     * 分类排序（降序）
     */
    static public function sort($arr,$cols){
        //子分类排序
        foreach ($arr as $k => &$v) {
            if(!empty($v[&#39;sub&#39;])){
                $v[&#39;sub&#39;]=self::sort($v[&#39;sub&#39;],$cols);
            }
            $sort[$k]=$v[$cols];
        }
        if(isset($sort))
            array_multisort($sort,SORT_DESC,$arr);
        return $arr;
    }
    /**
     * 横向分类树
     */
    static public function hTree($arr,$pid=0){
        foreach($arr as $k => $v){
            if($v[&#39;pid&#39;]==$pid){
                $data[$v[&#39;id&#39;]]=$v;
                $data[$v[&#39;id&#39;]][&#39;sub&#39;]=self::hTree($arr,$v[&#39;id&#39;]);
            }
        }
        return isset($data)?$data:array();
    }
    /**
     * 纵向分类树
     */
    static public function vTree($arr,$pid=0){
        foreach($arr as $k => $v){
            if($v[&#39;pid&#39;]==$pid){
                $data[$v[&#39;id&#39;]]=$v;
                $data+=self::vTree($arr,$v[&#39;id&#39;]);
            }
        }
        return isset($data)?$data:array();
    }
}

Return example:

Array
(
    [4] => Array
        (
            [id] => 4
            [pid] => 0
            [name] => 上海
            [sort] => 2
        )

    [5] => Array
        (
            [id] => 5
            [pid] => 4
            [name] => 闵行
            [sort] => 0
        )

    [1] => Array
        (
            [id] => 1
            [pid] => 0
            [name] => 浙江
            [sort] => 0
        )

    [13] => Array
        (
            [id] => 13
            [pid] => 1
            [name] => 金华
            [sort] => 1
        )

    [10] => Array
        (
            [id] => 10
            [pid] => 1
            [name] => 宁波
            [sort] => 0
        )

    [6] => Array
        (
            [id] => 6
            [pid] => 10
            [name] => 宁海
            [sort] => 0
        )

)
Array
(
    [4] => Array
        (
            [id] => 4
            [pid] => 0
            [name] => 上海
            [sort] => 2
            [sub] => Array
                (
                    [5] => Array
                        (
                            [id] => 5
                            [pid] => 4
                            [name] => 闵行
                            [sort] => 0
                            [sub] => Array
                                (
                                )

                        )

                )

        )

    [1] => Array
        (
            [id] => 1
            [pid] => 0
            [name] => 浙江
            [sort] => 0
            [sub] => Array
                (
                    [13] => Array
                        (
                            [id] => 13
                            [pid] => 1
                            [name] => 金华
                            [sort] => 1
                            [sub] => Array
                                (
                                )

                        )

                    [10] => Array
                        (
                            [id] => 10
                            [pid] => 1
                            [name] => 宁波
                            [sort] => 0
                            [sub] => Array
                                (
                                    [6] => Array
                                        (
                                            [id] => 6
                                            [pid] => 10
                                            [name] => 宁海
                                            [sort] => 0
                                            [sub] => Array
                                                (
                                                )

                                        )

                                )

                        )

                )

        )

)

public function vTree($arr,$pid=0){
foreach($arr as $k => $v){
if($v['pid']==$pid){
$data[$v['id']]=$v;
$data+=vTree($arr,$v['id']);
}
}
return isset($data)?$data:array();
}

The above is the detailed content of PHP unlimited classification tree [supports sub-category sorting]. For more information, please follow other related articles on the PHP Chinese website!