PHP 快速扫描列表创建无限极分类树分组

废话不多说，上代码。

省市区列表结构

 public function test(){
        $data = array(
            1 => array(
                    'id' => 1,
                    'name' => '中华人民共和国',
                    'parent_id' => 0,
                    'level' => 'country',
                ),
            2 => array(
                    'id' => 2,
                    'name' => '北京市',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
            20 => array(
                    'id' => 20,
                    'name' => '天津市',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
            38 => array(
                    'id' => 38,
                    'name' => '河北省',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
            218 => array(
                    'id' => 218,
                    'name' => '山西省',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
            349 => array(
                    'id' => 349,
                    'name' => '内蒙古自治区',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
            465 => array(
                    'id' => 465,
                    'name' => '辽宁省',
                    'parent_id' => 1,
                    'level' => 'province',
                ),
           466 => array(
                    'id' => 465,
                    'name' => '辽宁省',
                    'parent_id' => 465,
                    'level' => 'province',
                ),
            467 => array(
                    'id' => 465,
                    'name' => '辽宁省',
                    'parent_id' => 2,
                    'level' => 'province',
                ),
        );
        $arr = $this->getStructuredTree($data);
        $this->success('',$arr);
    }

优化前

/**
* 获取以父级 ID 为 $parent_id 为根节点的树型结构数组
*
* @param array $arr
* @param int $level 树型当前层
* @param int $parent_id 父级id
* @param int $floor 树型总层数
* @return array
*/
public static function getList(&$arr, $level = 0, $parent_id = 1, $floor = 3)
{
    if ($level != 0) {
        $empty = $arr[$parent_id];
        $empty['list'] = [];
        $emptyPointer = &$empty['list'];
    } else {
        $empty = [];
        $emptyPointer = &$empty;
    }
    if ($level < $floor) {
        $ok = false;
        foreach ($arr as $index => &$item) {
            if ($item['parent_id'] == $parent_id) {
                $data = self::getList($arr, $level + 1, $index);
                array_push($emptyPointer, $data);
                $ok = true;
            }
            if ($ok && $item['parent_id'] != $parent_id) {
                break;
            }
        }
    }

    return $empty;
}

  public function getStructuredTree($list)
    {
        $tree = [];
    
        foreach ($list as &$item) {
            $parent_id = $item['parent_id'];
    
            if (isset($list[$parent_id]) && !empty($list[$parent_id])) {
                $list[$parent_id]['list'][] = &$item;
            } else {
                $tree[] = &$item;
            }
        }
        // unset($item);
    
        return $tree[0]['list']; // 根节点只有中华人民共和国，所以直接返回中国的所有子节点
    }

重点:数组的键是数组的ID,不是默认的从0开始

处理:

$tree = [];
        foreach ($ruleList as  $value) {
            $tree[$value['id']] = $value;
        }