TreeDemo/index.php at master · lufeng501/TreeDemo · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
<?php
/**
 * Descript:
 * User: lufeng501206@gmail.com
 * Date: 2017/4/14 11:04
 */

global $data;

$data = require_once "data.php";

/**
 * 重组索引值值
 * @param $data
 * @param string $index
 * @return array
 */
function rebulidDataIndex($data, $index = 'id')
{
    $formatData = [];
    if (!empty($data)) {
        foreach ($data as $key => $value) {
            $formatData[$value[$index]] = $value;
        }
    }
    return $formatData;
}

/**
 * 获取某个节点下的全部数据
 * @param $pid
 * @return array
 */
function getDataLists($pid)
{
    global $data;
    $result = [];
    foreach ($data as $value) {
        if ($value['pid'] == $pid) {
            $result[$value['id']] = $value;
        }
    }
    return $result;
}

/**
 * 遍历获取需要重组树状的列表数据
 * @param int $pid
 * @param int $deep
 * @param array $results
 * @return array
 */
function getTreeLists($pid = 0, $deep = 0, &$results = [])
{
    $lists = getDataLists($pid);
    //array_merge()会重组数组索引值
    //$results = array_merge($results,$lists);
    // + 保留数组索引值
    $results = $results + $lists;
    if (!empty($lists)) {
        $deep++;
        foreach ($lists as $key => $value) {
            if ($deep < 10) {
                getTreeLists($value['id'], $deep, $results);
            }
        }
    }
    return $results;
}

/**
 * 获取树状结构数据(默认索引值)
 * @param $items
 * @return array
 */
function generateTreeDefault($items)
{
    $tree = array();
    foreach ($items as $item) {
        if (isset($items[$item['pid']])) {
            $items[$item['pid']]['children'][] = &$items[$item['id']];
        } else {
            $tree[] = &$items[$item['id']];
        }
    }
    return $tree;
}

/**
 * 获取树状结构数据（以ID作为索引值）
 * @param $items
 * @return array
 */
function generateTreeById($items)
{
    $tree = array();
    foreach ($items as $item) {
        if (isset($items[$item['pid']])) {
            $items[$item['pid']]['children'][$item['id']] = &$items[$item['id']];
        } else {
            $tree[$item['id']] = &$items[$item['id']];
        }
    }
    return $tree;
}

/**
 * 遍历树状结构数据
 * @param int $deep
 * @param array $results
 * @return array
 */
function scanTreeData($tree, $deep = 0, &$results = []){
    // + 保留数组索引值
    if (!empty($tree)) {
        $deep++;
        foreach ($tree as $key => $value) {
            $temp = $value;
            if (isset($temp['children'])) {
                unset($temp['children']);
            }
            $results[] = $temp;
            if ($deep < 10) {
                if (isset($value['children']) && !empty($value['children'])) {
                    scanTreeData($value['children'], $deep, $results);
                }
            }
        }
    }
    return $results;
}

$items = getTreeLists();

// 如果$items索引值被重组了就要重新组装索引值
//$items = rebulidDataIndex($items);

$treeDefault = generateTreeDefault($items);

$treeById = generateTreeById($items);

$scanTreeLists = scanTreeData($treeById);

var_dump($scanTreeLists);

exit();