Tree.php
13.8 KB
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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
<?php
namespace tree;
/**
* 通用的树型类,可以生成任何树型结构
*/
class Tree
{
/**
* 生成树型结构所需要的2维数组
* @var array
*/
public $arr = [];
/**
* 生成树型结构所需修饰符号,可以换成图片
* @var array
*/
public $icon = ['│', '├', '└'];
public $nbsp = " ";
private $str = '';
/**
* @access private
*/
public $ret = '';
/**
* 构造函数,初始化类
* @param array 2维数组,例如:
* array(
* 1 => array('id'=>'1','parent_id'=>0,'name'=>'一级栏目一'),
* 2 => array('id'=>'2','parent_id'=>0,'name'=>'一级栏目二'),
* 3 => array('id'=>'3','parent_id'=>1,'name'=>'二级栏目一'),
* 4 => array('id'=>'4','parent_id'=>1,'name'=>'二级栏目二'),
* 5 => array('id'=>'5','parent_id'=>2,'name'=>'二级栏目三'),
* 6 => array('id'=>'6','parent_id'=>3,'name'=>'三级栏目一'),
* 7 => array('id'=>'7','parent_id'=>3,'name'=>'三级栏目二')
* )
* @return array
*/
public function init($arr = [])
{
$this->arr = $arr;
$this->ret = '';
return is_array($arr);
}
/**
* 得到父级数组
* @param int
* @return array
*/
public function getParent($myId)
{
$newArr = [];
if (!isset($this->arr[$myId]))
return false;
$pid = $this->arr[$myId]['parent_id'];
$pid = $this->arr[$pid]['parent_id'];
if (is_array($this->arr)) {
foreach ($this->arr as $id => $a) {
if ($a['parent_id'] == $pid)
$newArr[$id] = $a;
}
}
return $newArr;
}
/**
* 得到子级数组
* @param int
* @return array
*/
public function getChild($myId)
{
$newArr = [];
if (is_array($this->arr)) {
foreach ($this->arr as $id => $a) {
if ($a['parent_id'] == $myId) {
$newArr[$id] = $a;
}
}
}
return $newArr ? $newArr : false;
}
/**
* 得到当前位置数组
* @param int
* @return array
*/
public function getPosition($myId, &$newArr)
{
$a = [];
if (!isset($this->arr[$myId]))
return false;
$newArr[] = $this->arr[$myId];
$pid = $this->arr[$myId]['parent_id'];
if (isset($this->arr[$pid])) {
$this->getPosition($pid, $newArr);
}
if (is_array($newArr)) {
krsort($newArr);
foreach ($newArr as $v) {
$a[$v['id']] = $v;
}
}
return $a;
}
/**
* 得到树型结构
* @param int ID,表示获得这个ID下的所有子级
* @param string 生成树型结构的基本代码,例如:"<option value=\$id \$selected>\$spacer\$name</option>"
* @param int 被选中的ID,比如在做树型下拉框的时候需要用到
* @return string
*/
public function getTree($myId, $str, $sid = 0, $adds = '', $str_group = '')
{
$number = 1;
//一级栏目
$child = $this->getChild($myId);
if (is_array($child)) {
$total = count($child);
foreach ($child as $key => $value) {
$j = $k = '';
if ($number == $total) {
$j .= $this->icon[2];
} else {
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds . $j : '';
$selected = $value['id'] == $sid ? 'selected' : '';
$id = 0;
$nstr = '';
$parentId = $value['parent_id'];
@extract($value);
$parentId == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$nbsp = $this->nbsp;
$this->getTree($id, $str, $sid, $adds . $k . $nbsp, $str_group);
$number++;
}
}
return $this->ret;
}
/**
* 生成树型结构数组
* @param int myID,表示获得这个ID下的所有子级
* @param int $maxLevel 最大获取层级,默认不限制
* @param int $level 当前层级,只在递归调用时使用,真实使用时不传入此参数
* @return array
*/
public function getTreeArray($myId, $maxLevel = 0, $level = 1)
{
$returnArray = [];
//一级数组
$children = $this->getChild($myId);
if (is_array($children)) {
foreach ($children as $child) {
$child['_level'] = $level;
$returnArray[$child['id']] = $child;
if ($maxLevel === 0 || ($maxLevel !== 0 && $maxLevel > $level)) {
$mLevel = $level + 1;
$returnArray[$child['id']]["children"] = $this->getTreeArray($child['id'], $maxLevel, $mLevel);
}
}
}
return $returnArray;
}
/**
* 同上一方法类似,但允许多选
*/
public function getTreeMulti($myId, $str, $sid = 0, $adds = '')
{
$number = 1;
$child = $this->getChild($myId);
if (is_array($child)) {
$total = count($child);
foreach ($child as $id => $a) {
$j = $k = '';
if ($number == $total) {
$j .= $this->icon[2];
} else {
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds . $j : '';
$selected = $this->have($sid, $id) ? 'selected' : '';
@extract($a);
eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$this->getTreeMulti($id, $str, $sid, $adds . $k . ' ');
$number++;
}
}
return $this->ret;
}
/**
* @param integer $myId 要查询的ID
* @param string $str 第一种HTML代码方式
* @param string $str2 第二种HTML代码方式
* @param integer $sid 默认选中
* @param integer $adds 前缀
*/
public function getTreeCategory($myId, $str, $str2, $sid = 0, $adds = '')
{
$number = 1;
$child = $this->getChild($myId);
if (is_array($child)) {
$total = count($child);
foreach ($child as $id => $a) {
$j = $k = '';
if ($number == $total) {
$j .= $this->icon[2];
} else {
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds . $j : '';
$selected = $this->have($sid, $id) ? 'selected' : '';
@extract($a);
if (empty($html_disabled)) {
eval("\$nstr = \"$str\";");
} else {
eval("\$nstr = \"$str2\";");
}
$this->ret .= $nstr;
$this->getTreeCategory($id, $str, $str2, $sid, $adds . $k . ' ');
$number++;
}
}
return $this->ret;
}
/**
* 同上一类方法,jquery treeview 风格,可伸缩样式(需要treeview插件支持)
* @param $myId 表示获得这个ID下的所有子级
* @param $effected_id 需要生成treeview目录数的id
* @param $str 末级样式
* @param $str2 目录级别样式
* @param $showlevel 直接显示层级数,其余为异步显示,0为全部限制
* @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam'
* @param $currentlevel 计算当前层级,递归使用 适用改函数时不需要用该参数
* @param $recursion 递归使用 外部调用时为FALSE
* @return string
*/
function getTreeView($myId, $effected_id = 'example', $str = "<span class='file'>\$name</span>", $str2 = "<span class='folder'>\$name</span>", $showlevel = 0, $style = 'filetree ', $currentlevel = 1, $recursion = FALSE)
{
$child = $this->getChild($myId);
if (!defined('EFFECTED_INIT')) {
$effected = ' id="' . $effected_id . '"';
define('EFFECTED_INIT', 1);
} else {
$effected = '';
}
$placeholder = '<ul><li><span class="placeholder"></span></li></ul>';
if (!$recursion)
$this->str .= '<ul' . $effected . ' class="' . $style . '">';
foreach ($child as $id => $a) {
@extract($a);
if ($showlevel > 0 && $showlevel == $currentlevel && $this->getChild($id))
$folder = 'hasChildren'; //如设置显示层级模式@2011.07.01
$floder_status = isset($folder) ? ' class="' . $folder . '"' : '';
$this->str .= $recursion ? '<ul><li' . $floder_status . ' id=\'' . $id . '\'>' : '<li' . $floder_status . ' id=\'' . $id . '\'>';
$recursion = FALSE;
//判断是否为终极栏目
if ($child == 1) {
eval("\$nstr = \"$str2\";");
$this->str .= $nstr;
if ($showlevel == 0 || ($showlevel > 0 && $showlevel > $currentlevel)) {
$this->getTreeView($id, $effected_id, $str, $str2, $showlevel, $style, $currentlevel + 1, TRUE);
} elseif ($showlevel > 0 && $showlevel == $currentlevel) {
$this->str .= $placeholder;
}
} else {
eval("\$nstr = \"$str\";");
$this->str .= $nstr;
}
$this->str .= $recursion ? '</li></ul>' : '</li>';
}
if (!$recursion)
$this->str .= '</ul>';
return $this->str;
}
/**
* 同上一类方法,jquery treeview 风格,可伸缩样式(需要treeview插件支持)
* @param $myId 表示获得这个ID下的所有子级
* @param $effected_id 需要生成treeview目录数的id
* @param $str 末级样式
* @param $str2 目录级别样式
* @param $showlevel 直接显示层级数,其余为异步显示,0为全部限制
* @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam'
* @param $currentlevel 计算当前层级,递归使用 适用改函数时不需要用该参数
* @param $recursion 递归使用 外部调用时为FALSE
* @param $dropdown 有子元素时li的class
*/
function getTreeViewMenu($myId, $effected_id = 'example', $str = "<span class='file'>\$name</span>", $str2 = "<span class='folder'>\$name</span>", $showlevel = 0, $ul_class = "", $li_class = "", $style = 'filetree ', $currentlevel = 1, $recursion = FALSE, $dropdown = 'hasChild')
{
$child = $this->getChild($myId);
if (!defined('EFFECTED_INIT')) {
$effected = ' id="' . $effected_id . '"';
define('EFFECTED_INIT', 1);
} else {
$effected = '';
}
$placeholder = '<ul><li><span class="placeholder"></span></li></ul>';
if (!$recursion) {
$this->str .= '<ul' . $effected . ' class="' . $style . '">';
}
foreach ($child as $id => $a) {
@extract($a);
if ($showlevel > 0 && is_array($this->getChild($a['id']))) {
$floder_status = " class='$dropdown $li_class'";
} else {
$floder_status = " class='$li_class'";;
}
$this->str .= $recursion ? "<ul class='$ul_class'><li $floder_status id= 'menu-item-$id'>" : "<li $floder_status id= 'menu-item-$id'>";
$recursion = FALSE;
//判断是否为终极栏目
if ($this->getChild($a['id'])) {
eval("\$nstr = \"$str2\";");
$this->str .= $nstr;
if ($showlevel == 0 || ($showlevel > 0 && $showlevel > $currentlevel)) {
$this->getTreeViewMenu($a['id'], $effected_id, $str, $str2, $showlevel, $ul_class, $li_class, $style, $currentlevel + 1, TRUE);
} elseif ($showlevel > 0 && $showlevel == $currentlevel) {
//$this->str .= $placeholder;
}
} else {
eval("\$nstr = \"$str\";");
$this->str .= $nstr;
}
$this->str .= $recursion ? '</li></ul>' : '</li>';
}
if (!$recursion)
$this->str .= '</ul>';
return $this->str;
}
/**
* 获取子栏目json
* Enter description here ...
* @param unknown_type $myId
*/
public function createSubJson($myId, $str = '')
{
$sub_cats = $this->getChild($myId);
$n = 0;
if (is_array($sub_cats))
foreach ($sub_cats as $c) {
$data[$n]['id'] = iconv(CHARSET, 'utf-8', $c['catid']);
if ($this->getChild($c['catid'])) {
$data[$n]['liclass'] = 'hasChildren';
$data[$n]['children'] = [['text' => ' ', 'classes' => 'placeholder']];
$data[$n]['classes'] = 'folder';
$data[$n]['text'] = iconv(CHARSET, 'utf-8', $c['catname']);
} else {
if ($str) {
@extract(array_iconv($c, CHARSET, 'utf-8'));
eval("\$data[$n]['text'] = \"$str\";");
} else {
$data[$n]['text'] = iconv(CHARSET, 'utf-8', $c['catname']);
}
}
$n++;
}
return json_encode($data);
}
private function have($list, $item)
{
return (strpos(',,' . $list . ',', ',' . $item . ','));
}
}