Newer
Older
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
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of ISPConfig nor the names of its contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
class node {
var $childs;
var $data;
var $id;
var $parent;
}
class tree
{
var $obj;
var $events;
// Feld Definitionen
var $data_field = 'name';
var $primary_field = 'media_cat_id';
var $parent_field = 'parent';
var $root_id = '0';
var $opt_spacer = ' ';
// interne Vars
var $_last_id;
/*
Funktion zum laden des Baumes aus Array
*/
function loadFromArray ($nodes) {
$this->obj[$this->root_id] = new node();
if(is_array($nodes)) {
foreach($nodes as $row) {
$id = $row[$this->primary_field];
$data = $row[$this->data_field];
$ordner = $row[$this->parent_field];
//$this->raw_data[$id] = $row;
if($id > $this->_last_id) $this->_last_id = $id;
if(!is_object($this->obj[$id])) $this->obj[$id] = new node();
$this->obj[$id]->data = $data;
$this->obj[$id]->id = $row[$this->primary_field];
$this->obj[$id]->parent = $row[$this->parent_field];
if(is_object($this->obj[$ordner])) {
$this->obj[$ordner]->childs[$id] = &$this->obj[$id];
} else {
$this->obj[$ordner] = new node();
$this->obj[$ordner]->childs[$id] = &$this->obj[$id];
}
}
}
}
function optionlist($nroot = '')
{
if($nroot == '') $nroot = $this->obj[$this->root_id];
$opt_spacer = $this->opt_spacer;
$this->ptree($nroot,'',$optionlist, $opt_spacer);
if(is_array($optionlist)){
return $optionlist;
} else {
return false;
}
}
function ptree($myobj, $ebene, &$optionlist, $opt_spacer){
$ebene .= $opt_spacer;
if(is_array($myobj->childs)) {
foreach($myobj->childs as $val) {
$id = $val->id;
if(!empty($id)) $optionlist[$id] = array( data => $ebene . $val->data,
id => $id);
$this->ptree($val,$ebene, $optionlist, $opt_spacer);
}
}
}
function add($parent,$data) {
$id = $this->_last_id + 1;
$this->obj[$id] = new node;
$this->obj[$id]->data = $data;
$this->obj[$id]->id = $id;
$this->obj[$id]->parent = $parent;
$this->obj[$parent]->childs[$id] = &$this->obj[$id];
// Event Aufrufen
$this->_callEvent('insert',$this->obj[$id]);
}
/*
Löschen von Einträgen ohne Child's
*/
function del($id) {
if(count($this->obj[$id]->childs) == 0) {
$this->obj[$id] = NULL;
unset($this->obj[$id]);
return true;
} else {
return false;
}
}
/*
Rekursives löschen von Einträgen
$this->_deltree_recurse(&$this->obj[$this->root_id],$tree_id, 0);
}
/*
*/
function _deltree_recurse($myobj,$tree_id,$delete) {
if(is_array($myobj->childs)) {
foreach($myobj->childs as $val) {
// Setze Delete Flag
if($val->id == $tree_id) {
$delete = 1;
}
// recurse durch Objekte
$this->_deltree_recurse(&$val,$tree_id,$delete);
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
if($delete == 1) {
$tmp_id = $val->id;
$this->obj[$tmp_id] = NULL;
unset($this->obj[$tmp_id]);
$this->_callEvent('delete',$val);
//echo "Deleting ID: $tmp_id \r\n";
}
// entferne Delete Flag
if($val->id == $tree_id) {
$delete = 0;
}
}
}
}
/*
private Funktion zum aufrufen der eventHandler
*/
function _callEvent($event, $myobj, $myobj_old = '') {
global $app;
if(is_array($this->events)) {
foreach($this->events as $val) {
if($val["event"] == $event) {
$class_name = $val["class_name"];
$function_name = $val["function_name"];
if($val["class_name"] != '') {
$app->uses($class_name);
$app->$class_name->$function_name($myobj,$myobj_old);
} else {
call_user_func ($function_name, $myobj, $myobj_old);
}
}
}
}
}
/*
Funktion zum Verschieben von Einträgen
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
*/
function move($id, $new_parent) {
$obj_old = $this->obj[$id];
$parent = $this->obj[$id]->parent;
$this->obj[$new_parent]->childs[$id] = &$this->obj[$id];
$this->obj[$id]->parent = $new_parent;
unset($this->obj[$parent]->childs[$id]);
// event aufrufen
$this->_callEvent('update',$this->obj[$id],$obj_old);
}
/*
Funktion zum updaten der Daten eines Nodes
*/
function update($id,$data) {
$obj_old = $this->obj[$id];
$this->obj[$id]->data = $data;
$this->_callEvent('update',$this->obj[$id],$obj_old);
}
/*
Funktion zum registrieren von Events
mögliche events: insert, update, delete