ILIAS  release_5-3 Revision v5.3.23-19-g915713cf615
Public Member Functions | Protected Attributes
_tree_struct Class Reference
+ Inheritance diagram for _tree_struct:
+ Collaboration diagram for _tree_struct:

Public Member Functions

 __construct ($table="tree", $fields=array())
 
 _get_node ($id)
 
 _get_children ($id, $recursive=false)
 
 _get_path ($id)
 
 _create ($parent, $position)
 
 _remove ($id)
 
 _move ($id, $ref_id, $position=0, $is_copy=false)
 
 _fix_copy ($id, $position)
 
 _reconstruct ()
 
 _analyze ()
 
 _dump ($output=false)
 
 _drop ()
 

Protected Attributes

 $table = ""
 
 $fields
 

Detailed Description

Definition at line 2 of file class.tree.php.

Constructor & Destructor Documentation

◆ __construct()

_tree_struct::__construct (   $table = "tree",
  $fields = array() 
)

Definition at line 15 of file class.tree.php.

15 {
16 $this->table = $table;
17 if(!count($fields)) {
18 foreach($this->fields as $k => &$v) { $v = $k; }
19 }
20 else {
21 foreach($fields as $key => $field) {
22 switch($key) {
23 case "id":
24 case "parent_id":
25 case "position":
26 case "left":
27 case "right":
28 case "level":
29 $this->fields[$key] = $field;
30 break;
31 }
32 }
33 }
34 // Database
35 $this->db = new _database;
36 }
_database
Definition: class._database.php:2
_tree_struct\$fields
$fields
Definition: class.tree.php:5
_tree_struct\$table
$table
Definition: class.tree.php:4
$key
$key
Definition: croninfo.php:18
fields
$errors fields
Definition: imgupload.php:51

References $fields, $key, $table, and fields.

Member Function Documentation

◆ _analyze()

_tree_struct::_analyze ( )

Definition at line 387 of file class.tree.php.

387 {
388 $report = array();
389
390 $this->db->query("" .
391 "SELECT " .
392 "`".$this->fields["left"]."` FROM `".$this->table."` s " .
393 "WHERE " .
394 "`".$this->fields["parent_id"]."` = 0 "
395 );
396 $this->db->nextr();
397 if($this->db->nf() == 0) {
398 $report[] = "[FAIL]\tNo root node.";
399 }
400 else {
401 $report[] = ($this->db->nf() > 1) ? "[FAIL]\tMore than one root node." : "[OK]\tJust one root node.";
402 }
403 $report[] = ($this->db->f(0) != 1) ? "[FAIL]\tRoot node's left index is not 1." : "[OK]\tRoot node's left index is 1.";
404
405 $this->db->query("" .
406 "SELECT " .
407 "COUNT(*) FROM `".$this->table."` s " .
408 "WHERE " .
409 "`".$this->fields["parent_id"]."` != 0 AND " .
410 "(SELECT COUNT(*) FROM `".$this->table."` WHERE `".$this->fields["id"]."` = s.`".$this->fields["parent_id"]."`) = 0 ");
411 $this->db->nextr();
412 $report[] = ($this->db->f(0) > 0) ? "[FAIL]\tMissing parents." : "[OK]\tNo missing parents.";
413
414 $this->db->query("SELECT MAX(`".$this->fields["right"]."`) FROM `".$this->table."`");
415 $this->db->nextr();
416 $n = $this->db->f(0);
417 $this->db->query("SELECT COUNT(*) FROM `".$this->table."`");
418 $this->db->nextr();
419 $c = $this->db->f(0);
420 $report[] = ($n/2 != $c) ? "[FAIL]\tRight index does not match node count." : "[OK]\tRight index matches count.";
421
422 $this->db->query("" .
423 "SELECT COUNT(`".$this->fields["id"]."`) FROM `".$this->table."` s " .
424 "WHERE " .
425 "(SELECT COUNT(*) FROM `".$this->table."` WHERE " .
426 "`".$this->fields["right"]."` < s.`".$this->fields["right"]."` AND " .
427 "`".$this->fields["left"]."` > s.`".$this->fields["left"]."` AND " .
428 "`".$this->fields["level"]."` = s.`".$this->fields["level"]."` + 1" .
429 ") != " .
430 "(SELECT COUNT(*) FROM `".$this->table."` WHERE " .
431 "`".$this->fields["parent_id"]."` = s.`".$this->fields["id"]."`" .
432 ") "
433 );
434 $this->db->nextr();
435 $report[] = ($this->db->f(0) > 0) ? "[FAIL]\tAdjacency and nested set do not match." : "[OK]\tNS and AJ match";
436
437 return implode("<br />",$report);
438 }
$n
$n
Definition: RandomTest.php:85

References $n, and fields.

◆ _create()

_tree_struct::_create (   $parent,
  $position 
)

Definition at line 64 of file class.tree.php.

64 {
65 return $this->_move(0, $parent, $position);
66 }
_tree_struct\_move
_move($id, $ref_id, $position=0, $is_copy=false)
Definition: class.tree.php:103

References _move().

+ Here is the call graph for this function:

◆ _drop()

_tree_struct::_drop ( )

Definition at line 455 of file class.tree.php.

455 {
456 $this->db->query("TRUNCATE TABLE `".$this->table."`");
457 $this->db->query("" .
458 "INSERT INTO `".$this->table."` (" .
459 "`".$this->fields["id"]."`, " .
460 "`".$this->fields["parent_id"]."`, " .
461 "`".$this->fields["position"]."`, " .
462 "`".$this->fields["left"]."`, " .
463 "`".$this->fields["right"]."`, " .
464 "`".$this->fields["level"]."` " .
465 ") " .
466 "VALUES (" .
467 "1, " .
468 "0, " .
469 "0, " .
470 "1, " .
471 "2, " .
472 "0 ".
473 ")");
474 }

Referenced by json_tree\_create_default().

+ Here is the caller graph for this function:

◆ _dump()

_tree_struct::_dump (   $output = false)

Definition at line 440 of file class.tree.php.

440 {
441 $nodes = array();
442 $this->db->query("SELECT * FROM ".$this->table." ORDER BY `".$this->fields["left"]."`");
443 while($this->db->nextr()) $nodes[] = $this->db->get_row("assoc");
444 if($output) {
445 echo "<pre>";
446 foreach($nodes as $node) {
447 echo str_repeat("&#160;",(int)$node[$this->fields["level"]] * 2);
448 echo $node[$this->fields["id"]]." (".$node[$this->fields["left"]].",".$node[$this->fields["right"]].",".$node[$this->fields["level"]].",".$node[$this->fields["parent_id"]].",".$node[$this->fields["position"]].")<br />";
449 }
450 echo str_repeat("-",40);
451 echo "</pre>";
452 }
453 return $nodes;
454 }
$output
if(!is_dir( $entity_dir)) exit("Fatal Error ([A-Za-z0-9]+)\s+" &#(? foreach( $entity_files as $file) $output
Definition: generate-entity-file.php:67

References $output, and fields.

◆ _fix_copy()

_tree_struct::_fix_copy (   $id,
  $position 
)

Definition at line 241 of file class.tree.php.

241 {
242 $node = $this->_get_node($id);
243 $children = $this->_get_children($id, true);
244
245 $map = array();
246 for($i = $node[$this->fields["left"]] + 1; $i < $node[$this->fields["right"]]; $i++) {
247 $map[$i] = $id;
248 }
249 foreach($children as $cid => $child) {
250 if((int)$cid == (int)$id) {
251 $this->db->query("UPDATE `".$this->table."` SET `".$this->fields["position"]."` = ".$position." WHERE `".$this->fields["id"]."` = ".$cid);
252 continue;
253 }
254 $this->db->query("UPDATE `".$this->table."` SET `".$this->fields["parent_id"]."` = ".$map[(int)$child[$this->fields["left"]]]." WHERE `".$this->fields["id"]."` = ".$cid);
255 for($i = $child[$this->fields["left"]] + 1; $i < $child[$this->fields["right"]]; $i++) {
256 $map[$i] = $cid;
257 }
258 }
259 }
_tree_struct\_get_node
_get_node($id)
Definition: class.tree.php:38
_tree_struct\_get_children
_get_children($id, $recursive=false)
Definition: class.tree.php:43
$i
$i
Definition: disco.tpl.php:19
$id
if(!array_key_exists('StateId', $_REQUEST)) $id
Definition: expirywarning.php:14

References $i, $id, _get_children(), _get_node(), and fields.

Referenced by _move().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ _get_children()

_tree_struct::_get_children (   $id,
  $recursive = false 
)

Definition at line 43 of file class.tree.php.

43 {
44 $children = array();
45 if($recursive) {
46 $node = $this->_get_node($id);
47 $this->db->query("SELECT `".implode("` , `", $this->fields)."` FROM `".$this->table."` WHERE `".$this->fields["left"]."` >= ".(int) $node[$this->fields["left"]]." AND `".$this->fields["right"]."` <= ".(int) $node[$this->fields["right"]]." ORDER BY `".$this->fields["left"]."` ASC");
48 }
49 else {
50 $this->db->query("SELECT `".implode("` , `", $this->fields)."` FROM `".$this->table."` WHERE `".$this->fields["parent_id"]."` = ".(int) $id." ORDER BY `".$this->fields["position"]."` ASC");
51 }
52 while($this->db->nextr()) $children[$this->db->f($this->fields["id"])] = $this->db->get_row("assoc");
53 return $children;
54 }

References $id, _get_node(), and fields.

Referenced by _fix_copy(), _move(), json_tree\get_children(), and json_tree\move_node().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ _get_node()

_tree_struct::_get_node (   $id)

Definition at line 38 of file class.tree.php.

38 {
39 $this->db->query("SELECT `".implode("` , `", $this->fields)."` FROM `".$this->table."` WHERE `".$this->fields["id"]."` = ".(int) $id);
40 $this->db->nextr();
41 return $this->db->nf() === 0 ? false : $this->db->get_row("assoc");
42 }

References $id, and fields.

Referenced by _fix_copy(), _get_children(), _get_path(), _move(), and _remove().

+ Here is the caller graph for this function:

◆ _get_path()

_tree_struct::_get_path (   $id)

Definition at line 55 of file class.tree.php.

55 {
56 $node = $this->_get_node($id);
57 $path = array();
58 if(!$node === false) return false;
59 $this->db->query("SELECT `".implode("` , `", $this->fields)."` FROM `".$this->table."` WHERE `".$this->fields["left"]."` <= ".(int) $node[$this->fields["left"]]." AND `".$this->fields["right"]."` >= ".(int) $node[$this->fields["right"]]);
60 while($this->db->nextr()) $path[$this->db->f($this->fields["id"])] = $this->db->get_row("assoc");
61 return $path;
62 }

References $id, $path, _get_node(), and fields.

+ Here is the call graph for this function:

◆ _move()

_tree_struct::_move (   $id,
  $ref_id,
  $position = 0,
  $is_copy = false 
)

Definition at line 103 of file class.tree.php.

103 {
104 if((int)$ref_id === 0 || (int)$id === 1) { return false; }
105 $sql = array(); // Queries executed at the end
106 $node = $this->_get_node($id); // Node data
107 $nchildren = $this->_get_children($id); // Node children
108 $ref_node = $this->_get_node($ref_id); // Ref node data
109 $rchildren = $this->_get_children($ref_id);// Ref node children
110
111 $ndif = 2;
112 $node_ids = array(-1);
113 if($node !== false) {
114 $node_ids = array_keys($this->_get_children($id, true));
115 // TODO: should be !$is_copy && , but if copied to self - screws some right indexes
116 if(in_array($ref_id, $node_ids)) return false;
117 $ndif = $node[$this->fields["right"]] - $node[$this->fields["left"]] + 1;
118 }
119 if($position >= count($rchildren)) {
120 $position = count($rchildren);
121 }
122
123 // Not creating or copying - old parent is cleaned
124 if($node !== false && $is_copy == false) {
125 $sql[] = "" .
126 "UPDATE `".$this->table."` " .
127 "SET `".$this->fields["position"]."` = `".$this->fields["position"]."` - 1 " .
128 "WHERE " .
129 "`".$this->fields["parent_id"]."` = ".$node[$this->fields["parent_id"]]." AND " .
130 "`".$this->fields["position"]."` > ".$node[$this->fields["position"]];
131 $sql[] = "" .
132 "UPDATE `".$this->table."` " .
133 "SET `".$this->fields["left"]."` = `".$this->fields["left"]."` - ".$ndif." " .
134 "WHERE `".$this->fields["left"]."` > ".$node[$this->fields["right"]];
135 $sql[] = "" .
136 "UPDATE `".$this->table."` " .
137 "SET `".$this->fields["right"]."` = `".$this->fields["right"]."` - ".$ndif." " .
138 "WHERE " .
139 "`".$this->fields["right"]."` > ".$node[$this->fields["left"]]." AND " .
140 "`".$this->fields["id"]."` NOT IN (".implode(",", $node_ids).") ";
141 }
142 // Preparing new parent
143 $sql[] = "" .
144 "UPDATE `".$this->table."` " .
145 "SET `".$this->fields["position"]."` = `".$this->fields["position"]."` + 1 " .
146 "WHERE " .
147 "`".$this->fields["parent_id"]."` = ".$ref_id." AND " .
148 "`".$this->fields["position"]."` >= ".$position." " .
149 ( $is_copy ? "" : " AND `".$this->fields["id"]."` NOT IN (".implode(",", $node_ids).") ");
150
151 $ref_ind = $ref_id === 0 ? (int)$rchildren[count($rchildren) - 1][$this->fields["right"]] + 1 : (int)$ref_node[$this->fields["right"]];
152 $ref_ind = max($ref_ind, 1);
153
154 $self = ($node !== false && !$is_copy && (int)$node[$this->fields["parent_id"]] == $ref_id && $position > $node[$this->fields["position"]]) ? 1 : 0;
155 foreach($rchildren as $k => $v) {
156 if($v[$this->fields["position"]] - $self == $position) {
157 $ref_ind = (int)$v[$this->fields["left"]];
158 break;
159 }
160 }
161 if($node !== false && !$is_copy && $node[$this->fields["left"]] < $ref_ind) {
162 $ref_ind -= $ndif;
163 }
164
165 $sql[] = "" .
166 "UPDATE `".$this->table."` " .
167 "SET `".$this->fields["left"]."` = `".$this->fields["left"]."` + ".$ndif." " .
168 "WHERE " .
169 "`".$this->fields["left"]."` >= ".$ref_ind." " .
170 ( $is_copy ? "" : " AND `".$this->fields["id"]."` NOT IN (".implode(",", $node_ids).") ");
171 $sql[] = "" .
172 "UPDATE `".$this->table."` " .
173 "SET `".$this->fields["right"]."` = `".$this->fields["right"]."` + ".$ndif." " .
174 "WHERE " .
175 "`".$this->fields["right"]."` >= ".$ref_ind." " .
176 ( $is_copy ? "" : " AND `".$this->fields["id"]."` NOT IN (".implode(",", $node_ids).") ");
177
178 $ldif = $ref_id == 0 ? 0 : $ref_node[$this->fields["level"]] + 1;
179 $idif = $ref_ind;
180 if($node !== false) {
181 $ldif = $node[$this->fields["level"]] - ($ref_node[$this->fields["level"]] + 1);
182 $idif = $node[$this->fields["left"]] - $ref_ind;
183 if($is_copy) {
184 $sql[] = "" .
185 "INSERT INTO `".$this->table."` (" .
186 "`".$this->fields["parent_id"]."`, " .
187 "`".$this->fields["position"]."`, " .
188 "`".$this->fields["left"]."`, " .
189 "`".$this->fields["right"]."`, " .
190 "`".$this->fields["level"]."`" .
191 ") " .
192 "SELECT " .
193 "".$ref_id.", " .
194 "`".$this->fields["position"]."`, " .
195 "`".$this->fields["left"]."` - (".($idif + ($node[$this->fields["left"]] >= $ref_ind ? $ndif : 0))."), " .
196 "`".$this->fields["right"]."` - (".($idif + ($node[$this->fields["left"]] >= $ref_ind ? $ndif : 0))."), " .
197 "`".$this->fields["level"]."` - (".$ldif.") " .
198 "FROM `".$this->table."` " .
199 "WHERE " .
200 "`".$this->fields["id"]."` IN (".implode(",", $node_ids).") " .
201 "ORDER BY `".$this->fields["level"]."` ASC";
202 }
203 else {
204 $sql[] = "" .
205 "UPDATE `".$this->table."` SET " .
206 "`".$this->fields["parent_id"]."` = ".$ref_id.", " .
207 "`".$this->fields["position"]."` = ".$position." " .
208 "WHERE " .
209 "`".$this->fields["id"]."` = ".$id;
210 $sql[] = "" .
211 "UPDATE `".$this->table."` SET " .
212 "`".$this->fields["left"]."` = `".$this->fields["left"]."` - (".$idif."), " .
213 "`".$this->fields["right"]."` = `".$this->fields["right"]."` - (".$idif."), " .
214 "`".$this->fields["level"]."` = `".$this->fields["level"]."` - (".$ldif.") " .
215 "WHERE " .
216 "`".$this->fields["id"]."` IN (".implode(",", $node_ids).") ";
217 }
218 }
219 else {
220 $sql[] = "" .
221 "INSERT INTO `".$this->table."` (" .
222 "`".$this->fields["parent_id"]."`, " .
223 "`".$this->fields["position"]."`, " .
224 "`".$this->fields["left"]."`, " .
225 "`".$this->fields["right"]."`, " .
226 "`".$this->fields["level"]."` " .
227 ") " .
228 "VALUES (" .
229 $ref_id.", " .
230 $position.", " .
231 $idif.", " .
232 ($idif + 1).", " .
233 $ldif.
234 ")";
235 }
236 foreach($sql as $q) { $this->db->query($q); }
237 $ind = $this->db->insert_id();
238 if($is_copy) $this->_fix_copy($ind, $position);
239 return $node === false || $is_copy ? $ind : true;
240 }
_tree_struct\_fix_copy
_fix_copy($id, $position)
Definition: class.tree.php:241

References $id, _fix_copy(), _get_children(), _get_node(), and fields.

Referenced by _create().

+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ _reconstruct()

_tree_struct::_reconstruct ( )

Definition at line 261 of file class.tree.php.

261 {
262 $this->db->query("" .
263 "CREATE TEMPORARY TABLE `temp_tree` (" .
264 "`".$this->fields["id"]."` INTEGER NOT NULL, " .
265 "`".$this->fields["parent_id"]."` INTEGER NOT NULL, " .
266 "`". $this->fields["position"]."` INTEGER NOT NULL" .
267 ") type=HEAP"
268 );
269 $this->db->query("" .
270 "INSERT INTO `temp_tree` " .
271 "SELECT " .
272 "`".$this->fields["id"]."`, " .
273 "`".$this->fields["parent_id"]."`, " .
274 "`".$this->fields["position"]."` " .
275 "FROM `".$this->table."`"
276 );
277
278 $this->db->query("" .
279 "CREATE TEMPORARY TABLE `temp_stack` (" .
280 "`".$this->fields["id"]."` INTEGER NOT NULL, " .
281 "`".$this->fields["left"]."` INTEGER, " .
282 "`".$this->fields["right"]."` INTEGER, " .
283 "`".$this->fields["level"]."` INTEGER, " .
284 "`stack_top` INTEGER NOT NULL, " .
285 "`".$this->fields["parent_id"]."` INTEGER, " .
286 "`".$this->fields["position"]."` INTEGER " .
287 ") type=HEAP"
288 );
289 $counter = 2;
290 $this->db->query("SELECT COUNT(*) FROM temp_tree");
291 $this->db->nextr();
292 $maxcounter = (int) $this->db->f(0) * 2;
293 $currenttop = 1;
294 $this->db->query("" .
295 "INSERT INTO `temp_stack` " .
296 "SELECT " .
297 "`".$this->fields["id"]."`, " .
298 "1, " .
299 "NULL, " .
300 "0, " .
301 "1, " .
302 "`".$this->fields["parent_id"]."`, " .
303 "`".$this->fields["position"]."` " .
304 "FROM `temp_tree` " .
305 "WHERE `".$this->fields["parent_id"]."` = 0"
306 );
307 $this->db->query("DELETE FROM `temp_tree` WHERE `".$this->fields["parent_id"]."` = 0");
308
309 while ($counter <= $maxcounter) {
310 $this->db->query("" .
311 "SELECT " .
312 "`temp_tree`.`".$this->fields["id"]."` AS tempmin, " .
313 "`temp_tree`.`".$this->fields["parent_id"]."` AS pid, " .
314 "`temp_tree`.`".$this->fields["position"]."` AS lid " .
315 "FROM `temp_stack`, `temp_tree` " .
316 "WHERE " .
317 "`temp_stack`.`".$this->fields["id"]."` = `temp_tree`.`".$this->fields["parent_id"]."` AND " .
318 "`temp_stack`.`stack_top` = ".$currenttop." " .
319 "ORDER BY `temp_tree`.`".$this->fields["position"]."` ASC LIMIT 1"
320 );
321
322 if ($this->db->nextr()) {
323 $tmp = $this->db->f("tempmin");
324
325 $q = "INSERT INTO temp_stack (stack_top, `".$this->fields["id"]."`, `".$this->fields["left"]."`, `".$this->fields["right"]."`, `".$this->fields["level"]."`, `".$this->fields["parent_id"]."`, `".$this->fields["position"]."`) VALUES(".($currenttop + 1).", ".$tmp.", ".$counter.", NULL, ".$currenttop.", ".$this->db->f("pid").", ".$this->db->f("lid").")";
326 $this->db->query($q);
327 $this->db->query("DELETE FROM `temp_tree` WHERE `".$this->fields["id"]."` = ".$tmp);
328 $counter++;
329 $currenttop++;
330 }
331 else {
332 $this->db->query("" .
333 "UPDATE temp_stack SET " .
334 "`".$this->fields["right"]."` = ".$counter.", " .
335 "`stack_top` = -`stack_top` " .
336 "WHERE `stack_top` = ".$currenttop
337 );
338 $counter++;
339 $currenttop--;
340 }
341 }
342
343 $temp_fields = $this->fields;
344 unset($temp_fields["parent_id"]);
345 unset($temp_fields["position"]);
346 unset($temp_fields["left"]);
347 unset($temp_fields["right"]);
348 unset($temp_fields["level"]);
349 if(count($temp_fields) > 1) {
350 $this->db->query("" .
351 "CREATE TEMPORARY TABLE `temp_tree2` " .
352 "SELECT `".implode("`, `", $temp_fields)."` FROM `".$this->table."` "
353 );
354 }
355 $this->db->query("TRUNCATE TABLE `".$this->table."`");
356 $this->db->query("" .
357 "INSERT INTO ".$this->table." (" .
358 "`".$this->fields["id"]."`, " .
359 "`".$this->fields["parent_id"]."`, " .
360 "`".$this->fields["position"]."`, " .
361 "`".$this->fields["left"]."`, " .
362 "`".$this->fields["right"]."`, " .
363 "`".$this->fields["level"]."` " .
364 ") " .
365 "SELECT " .
366 "`".$this->fields["id"]."`, " .
367 "`".$this->fields["parent_id"]."`, " .
368 "`".$this->fields["position"]."`, " .
369 "`".$this->fields["left"]."`, " .
370 "`".$this->fields["right"]."`, " .
371 "`".$this->fields["level"]."` " .
372 "FROM temp_stack " .
373 "ORDER BY `".$this->fields["id"]."`"
374 );
375 if(count($temp_fields) > 1) {
376 $sql = "" .
377 "UPDATE `".$this->table."` v, `temp_tree2` SET v.`".$this->fields["id"]."` = v.`".$this->fields["id"]."` ";
378 foreach($temp_fields as $k => $v) {
379 if($k == "id") continue;
380 $sql .= ", v.`".$v."` = `temp_tree2`.`".$v."` ";
381 }
382 $sql .= " WHERE v.`".$this->fields["id"]."` = `temp_tree2`.`".$this->fields["id"]."` ";
383 $this->db->query($sql);
384 }
385 }
$counter
$counter
Definition: config-scanner.php:59

References $counter, $fields, and fields.

◆ _remove()

_tree_struct::_remove (   $id)

Definition at line 67 of file class.tree.php.

67 {
68 if((int)$id === 1) { return false; }
69 $data = $this->_get_node($id);
70 $lft = (int)$data[$this->fields["left"]];
71 $rgt = (int)$data[$this->fields["right"]];
72 $dif = $rgt - $lft + 1;
73
74 // deleting node and its children
75 $this->db->query("" .
76 "DELETE FROM `".$this->table."` " .
77 "WHERE `".$this->fields["left"]."` >= ".$lft." AND `".$this->fields["right"]."` <= ".$rgt
78 );
79 // shift left indexes of nodes right of the node
80 $this->db->query("".
81 "UPDATE `".$this->table."` " .
82 "SET `".$this->fields["left"]."` = `".$this->fields["left"]."` - ".$dif." " .
83 "WHERE `".$this->fields["left"]."` > ".$rgt
84 );
85 // shift right indexes of nodes right of the node and the node's parents
86 $this->db->query("" .
87 "UPDATE `".$this->table."` " .
88 "SET `".$this->fields["right"]."` = `".$this->fields["right"]."` - ".$dif." " .
89 "WHERE `".$this->fields["right"]."` > ".$lft
90 );
91
92 $pid = (int)$data[$this->fields["parent_id"]];
93 $pos = (int)$data[$this->fields["position"]];
94
95 // Update position of siblings below the deleted node
96 $this->db->query("" .
97 "UPDATE `".$this->table."` " .
98 "SET `".$this->fields["position"]."` = `".$this->fields["position"]."` - 1 " .
99 "WHERE `".$this->fields["parent_id"]."` = ".$pid." AND `".$this->fields["position"]."` > ".$pos
100 );
101 return true;
102 }

References $data, $id, _get_node(), and fields.

+ Here is the call graph for this function:

Field Documentation

◆ $fields

_tree_struct::$fields
protected
Initial value:
= array(
"id" => false,
"parent_id" => false,
"position" => false,
"left" => false,
"right" => false,
"level" => false
)

Definition at line 5 of file class.tree.php.

Referenced by __construct(), json_tree\__construct(), and _reconstruct().

◆ $table

_tree_struct::$table = ""
protected

Definition at line 4 of file class.tree.php.

Referenced by __construct(), and json_tree\__construct().

The documentation for this class was generated from the following file: