40 lines
1.1 KiB
PHP
40 lines
1.1 KiB
PHP
<?php
|
|
//无限分类树（支持子分类排序）
|
|
namespace org;
|
|
class Tree{
|
|
//分类排序（升序）
|
|
static public function sort($arr,$cols){
|
|
//子分类排序
|
|
foreach ($arr as $k => &$v) {
|
|
if(!empty($v['sub'])){
|
|
$v['sub']=self::sort($v['sub'],$cols);
|
|
}
|
|
$sort[$k]=$v[$cols];
|
|
}
|
|
if(isset($sort))
|
|
array_multisort($sort,SORT_ASC,$arr);
|
|
return $arr;
|
|
}
|
|
//横向分类树
|
|
static public function hTree($arr,$pid=0){
|
|
foreach($arr as $k => $v){
|
|
if($v['pid']==$pid){
|
|
$v['sub']=self::hTree($arr,$v['id']);
|
|
$data[]=$v;
|
|
}
|
|
}
|
|
return isset($data)?$data:[];
|
|
}
|
|
//纵向分类树
|
|
static public function vTree($arr,$pid=0,$state=true){
|
|
static $data=[];
|
|
$state&&$data=[];
|
|
foreach($arr as $k => $v){
|
|
if($v['pid']==$pid){
|
|
$data[]=$v;
|
|
self::vTree($arr,$v['id'],false);
|
|
}
|
|
}
|
|
return $data;
|
|
}
|
|
} |