ILIAS  release_5-3 Revision v5.3.23-19-g915713cf615
class.tree.php
Go to the documentation of this file.
1 <?php
2 class _tree_struct {
3  // Structure table and fields
4  protected $table = "";
5  protected $fields = array(
6  "id" => false,
7  "parent_id" => false,
8  "position" => false,
9  "left" => false,
10  "right" => false,
11  "level" => false
12  );
13 
14  // Constructor
15  function __construct($table = "tree", $fields = array()) {
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  }
37 
38  function _get_node($id) {
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  }
43  function _get_children($id, $recursive = false) {
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  }
55  function _get_path($id) {
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  }
63 
64  function _create($parent, $position) {
65  return $this->_move(0, $parent, $position);
66  }
67  function _remove($id) {
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  }
103  function _move($id, $ref_id, $position = 0, $is_copy = false) {
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  }
241  function _fix_copy($id, $position) {
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  }
260 
261  function _reconstruct() {
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  }
386 
387  function _analyze() {
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  }
439 
440  function _dump($output = false) {
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  }
455  function _drop() {
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  }
475 }
476 
477 class json_tree extends _tree_struct {
478  function __construct($table = "tree", $fields = array(), $add_fields = array("title" => "title", "type" => "type")) {
479  parent::__construct($table, $fields);
480  $this->fields = array_merge($this->fields, $add_fields);
481  $this->add_fields = $add_fields;
482  }
483 
484  function create_node($data) {
485  $id = parent::_create((int)$data[$this->fields["id"]], (int)$data[$this->fields["position"]]);
486  if($id) {
487  $data["id"] = $id;
488  $this->set_data($data);
489  return "{ \"status\" : 1, \"id\" : ".(int)$id." }";
490  }
491  return "{ \"status\" : 0 }";
492  }
493  function set_data($data) {
494  if(count($this->add_fields) == 0) { return "{ \"status\" : 1 }"; }
495  $s = "UPDATE `".$this->table."` SET `".$this->fields["id"]."` = `".$this->fields["id"]."` ";
496  foreach($this->add_fields as $k => $v) {
497  if(isset($data[$k])) $s .= ", `".$this->fields[$v]."` = \"".$this->db->escape($data[$k])."\" ";
498  else $s .= ", `".$this->fields[$v]."` = `".$this->fields[$v]."` ";
499  }
500  $s .= "WHERE `".$this->fields["id"]."` = ".(int)$data["id"];
501  $this->db->query($s);
502  return "{ \"status\" : 1 }";
503  }
504  function rename_node($data) { return $this->set_data($data); }
505 
506  function move_node($data) {
507  $id = parent::_move((int)$data["id"], (int)$data["ref"], (int)$data["position"], (int)$data["copy"]);
508  if(!$id) return "{ \"status\" : 0 }";
509  if((int)$data["copy"] && count($this->add_fields)) {
510  $ids = array_keys($this->_get_children($id, true));
511  $data = $this->_get_children((int)$data["id"], true);
512 
513  $i = 0;
514  foreach($data as $dk => $dv) {
515  $s = "UPDATE `".$this->table."` SET `".$this->fields["id"]."` = `".$this->fields["id"]."` ";
516  foreach($this->add_fields as $k => $v) {
517  if(isset($dv[$k])) $s .= ", `".$this->fields[$v]."` = \"".$this->db->escape($dv[$k])."\" ";
518  else $s .= ", `".$this->fields[$v]."` = `".$this->fields[$v]."` ";
519  }
520  $s .= "WHERE `".$this->fields["id"]."` = ".$ids[$i];
521  $this->db->query($s);
522  $i++;
523  }
524  }
525  return "{ \"status\" : 1, \"id\" : ".$id." }";
526  }
527  function remove_node($data) {
528  $id = parent::_remove((int)$data["id"]);
529  return "{ \"status\" : 1 }";
530  }
531  function get_children($data) {
532  $tmp = $this->_get_children((int)$data["id"]);
533  if((int)$data["id"] === 1 && count($tmp) === 0) {
534  $this->_create_default();
535  $tmp = $this->_get_children((int)$data["id"]);
536  }
537  $result = array();
538  if((int)$data["id"] === 0) return json_encode($result);
539  foreach($tmp as $k => $v) {
540  $result[] = array(
541  "attr" => array("id" => "node_".$k, "rel" => $v[$this->fields["type"]]),
542  "data" => $v[$this->fields["title"]],
543  "state" => ((int)$v[$this->fields["right"]] - (int)$v[$this->fields["left"]] > 1) ? "closed" : ""
544  );
545  }
546  return json_encode($result);
547  }
548  function search($data) {
549  $this->db->query("SELECT `".$this->fields["left"]."`, `".$this->fields["right"]."` FROM `".$this->table."` WHERE `".$this->fields["title"]."` LIKE '%".$this->db->escape($data["search_str"])."%'");
550  if($this->db->nf() === 0) return "[]";
551  $q = "SELECT DISTINCT `".$this->fields["id"]."` FROM `".$this->table."` WHERE 0 ";
552  while($this->db->nextr()) {
553  $q .= " OR (`".$this->fields["left"]."` < ".(int)$this->db->f(0)." AND `".$this->fields["right"]."` > ".(int)$this->db->f(1).") ";
554  }
555  $result = array();
556  $this->db->query($q);
557  while($this->db->nextr()) { $result[] = "#node_".$this->db->f(0); }
558  return json_encode($result);
559  }
560 
561  function _create_default() {
562  $this->_drop();
563  $this->create_node(array(
564  "id" => 1,
565  "position" => 0,
566  "title" => "C:",
567  "type" => "drive"
568  ));
569  $this->create_node(array(
570  "id" => 1,
571  "position" => 1,
572  "title" => "D:",
573  "type" => "drive"
574  ));
575  $this->create_node(array(
576  "id" => 2,
577  "position" => 0,
578  "title" => "_demo",
579  "type" => "folder"
580  ));
581  $this->create_node(array(
582  "id" => 2,
583  "position" => 1,
584  "title" => "_docs",
585  "type" => "folder"
586  ));
587  $this->create_node(array(
588  "id" => 4,
589  "position" => 0,
590  "title" => "index.html",
591  "type" => "default"
592  ));
593  $this->create_node(array(
594  "id" => 5,
595  "position" => 1,
596  "title" => "doc.html",
597  "type" => "default"
598  ));
599  }
600 }
601 
602 ?>
_create_default()
Definition: class.tree.php:561
search($data)
Definition: class.tree.php:548
_fix_copy($id, $position)
Definition: class.tree.php:241
$result
__construct($table="tree", $fields=array())
Definition: class.tree.php:15
create_node($data)
Definition: class.tree.php:484
_get_children($id, $recursive=false)
Definition: class.tree.php:43
if(!array_key_exists('StateId', $_REQUEST)) $id
rename_node($data)
Definition: class.tree.php:504
$s
Definition: pwgen.php:45
$errors fields
Definition: imgupload.php:51
$counter
if(!is_dir( $entity_dir)) exit("Fatal Error ([A-Za-z0-9]+)\+" &#(? foreach( $entity_files as $file) $output
_get_path($id)
Definition: class.tree.php:55
_get_node($id)
Definition: class.tree.php:38
_create($parent, $position)
Definition: class.tree.php:64
_move($id, $ref_id, $position=0, $is_copy=false)
Definition: class.tree.php:103
$n
Definition: RandomTest.php:85
get_children($data)
Definition: class.tree.php:531
Create styles array
The data for the language used.
_dump($output=false)
Definition: class.tree.php:440
__construct($table="tree", $fields=array(), $add_fields=array("title"=> "title", "type"=> "type"))
Definition: class.tree.php:478
$i
Definition: disco.tpl.php:19
move_node($data)
Definition: class.tree.php:506
$key
Definition: croninfo.php:18
set_data($data)
Definition: class.tree.php:493
remove_node($data)
Definition: class.tree.php:527