mirror of
https://gitee.com/apiadmin/ApiAdmin.git
synced 2025-04-06 03:58:00 +08:00
65 lines
2.2 KiB
PHP
65 lines
2.2 KiB
PHP
<?php
|
|
// +----------------------------------------------------------------------
|
|
// | ThinkPHP [ WE CAN DO IT JUST THINK ]
|
|
// +----------------------------------------------------------------------
|
|
// | Copyright (c) 2006-2016 http://thinkphp.cn All rights reserved.
|
|
// +----------------------------------------------------------------------
|
|
// | Licensed ( http://www.apache.org/licenses/LICENSE-2.0 )
|
|
// +----------------------------------------------------------------------
|
|
// | Author: 流年 <liu21st@gmail.com>
|
|
// +----------------------------------------------------------------------
|
|
|
|
// 应用公共文件
|
|
/**
|
|
* 把返回的数据集转换成Tree
|
|
* @param $list
|
|
* @param string $pk
|
|
* @param string $pid
|
|
* @param string $child
|
|
* @param string $root
|
|
* @return array
|
|
*/
|
|
function listToTree($list, $pk='id', $pid = 'fid', $child = '_child', $root = '0') {
|
|
$tree = array();
|
|
if(is_array($list)) {
|
|
$refer = array();
|
|
foreach ($list as $key => $data) {
|
|
$refer[$data[$pk]] = &$list[$key];
|
|
}
|
|
foreach ($list as $key => $data) {
|
|
$parentId = $data[$pid];
|
|
if ($root == $parentId) {
|
|
$tree[] = &$list[$key];
|
|
}else{
|
|
if (isset($refer[$parentId])) {
|
|
$parent = &$refer[$parentId];
|
|
$parent[$child][] = &$list[$key];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return $tree;
|
|
}
|
|
|
|
function formatTree($list, $lv = 0, $title = 'name'){
|
|
$formatTree = array();
|
|
foreach($list as $key => $val){
|
|
$title_prefix = '';
|
|
for( $i=0;$i<$lv;$i++ ){
|
|
$title_prefix .= "|---";
|
|
}
|
|
$val['lv'] = $lv;
|
|
$val['namePrefix'] = $lv == 0 ? '' : $title_prefix;
|
|
$val['showName'] = $lv == 0 ? $val[$title] : $title_prefix.$val[$title];
|
|
if(!array_key_exists('_child', $val)){
|
|
array_push($formatTree, $val);
|
|
}else{
|
|
$child = $val['_child'];
|
|
unset($val['_child']);
|
|
array_push($formatTree, $val);
|
|
$middle = formatTree($child, $lv+1, $title); //进行下一层递归
|
|
$formatTree = array_merge($formatTree, $middle);
|
|
}
|
|
}
|
|
return $formatTree;
|
|
} |