Tree class data representation in hierachical trees using the Nested Set Model with Gaps by Joe Celco. More...
Inheritance diagram for ilTree:
Public Member Functions | |
| ilTree ($a_tree_id, $a_root_id=0) | |
| Constructor public. | |
| useCache ($a_use=true) | |
| Use Cache (usually not activated). | |
| initLangCode () | |
| Store user language. | |
| setTableNames ($a_table_tree, $a_table_obj_data, $a_table_obj_reference="") | |
| set table names The primary key of the table containing your object_data must be 'obj_id' You may use a reference table. | |
| setReferenceTablePK ($a_column_name) | |
| set column containing primary key in reference table public | |
| setObjectTablePK ($a_column_name) | |
| set column containing primary key in object table public | |
| setTreeTablePK ($a_column_name) | |
| set column containing primary key in tree table public | |
| buildJoin () | |
| build join depending on table settings private | |
| getChilds ($a_node_id, $a_order="", $a_direction="ASC") | |
| get child nodes of given node public | |
| getFilteredChilds ($a_filter, $a_node, $a_order="", $a_direction="ASC") | |
| get child nodes of given node (exclude filtered obj_types) public | |
| getChildsByType ($a_node_id, $a_type) | |
| get child nodes of given node by object type public | |
| insertNode ($a_node_id, $a_parent_id, $a_pos=IL_LAST_NODE, $a_reset_deletion_date=false) | |
| insert new node with node_id under parent node with parent_id public | |
| getSubTree ($a_node, $a_with_data=true, $a_type="") | |
| get all nodes in the subtree under specified node | |
| getSubTreeTypes ($a_node, $a_filter=0) | |
| get types of nodes in the subtree under specified node | |
| deleteTree ($a_node) | |
| delete node and the whole subtree under this node public | |
| getPathFull ($a_endnode_id, $a_startnode_id=0) | |
| get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode. | |
| getPathIdsUsingNestedSets ($a_endnode_id, $a_startnode_id=0) | |
| get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public | |
| getPathIdsUsingAdjacencyMap ($a_endnode_id, $a_startnode_id=0) | |
| get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public | |
| getPathId ($a_endnode_id, $a_startnode_id=0) | |
| get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public | |
| checkTree () | |
| check consistence of tree all left & right values are checked if they are exists only once public | |
| checkTreeChilds ($a_no_zero_child=true) | |
| check, if all childs of tree nodes exist in object table | |
| getMaximumDepth () | |
| Return the maximum depth in tree public. | |
| getDepth ($a_node_id) | |
| return depth of a node in tree private | |
| getNodeData ($a_node_id) | |
| get all information of a node. | |
| fetchNodeData ($a_row) | |
| get data of parent node from tree and object_data private | |
| isInTree ($a_node_id) | |
| get all information of a node. | |
| getParentNodeData ($a_node_id) | |
| get data of parent node from tree and object_data public | |
| isGrandChild ($a_startnode_id, $a_querynode_id) | |
| checks if a node is in the path of an other node public | |
| addTree ($a_tree_id, $a_node_id=-1) | |
| create a new tree to do: ??? | |
| getNodeDataByType ($a_type) | |
| get nodes by type // TODO: method needs revision | |
| removeTree ($a_tree_id) | |
| remove an existing tree | |
| saveSubTree ($a_node_id, $a_set_deleted=false) | |
| save subtree: delete a subtree (defined by node_id) to a new tree with $this->tree_id -node_id. | |
| isDeleted ($a_node_id) | |
| This is a wrapper for isSaved() with a more useful name. | |
| isSaved ($a_node_id) | |
| check if node is saved | |
| getSavedNodeData ($a_parent_id) | |
| get data saved/deleted nodes | |
| getParentId ($a_node_id) | |
| get parent id of given node public | |
| getLeftValue ($a_node_id) | |
| get left value of given node public | |
| getChildSequenceNumber ($a_node, $type="") | |
| get sequence number of node in sibling sequence public | |
| readRootId () | |
| read root id from database | |
| getRootId () | |
| get the root id of tree public | |
| setRootId ($a_root_id) | |
| getTreeId () | |
| get tree id public | |
| setTreeId ($a_tree_id) | |
| set tree id public | |
| fetchSuccessorNode ($a_node_id, $a_type="") | |
| get node data of successor node | |
| fetchPredecessorNode ($a_node_id, $a_type="") | |
| get node data of predecessor node | |
| renumber ($node_id=1, $i=1) | |
| Wrapper for renumber. | |
| __renumber ($node_id=1, $i=1) | |
| This method is private. | |
| checkForParentType ($a_ref_id, $a_type) | |
| Check for parent type e.g check if a folder (ref_id 3) is in a parent course obj => checkForParentType(3,'crs');. | |
| _removeEntry ($a_tree, $a_child, $a_db_table="tree") | |
| STATIC METHOD Removes a single entry from a tree. | |
| moveSubTreeAlex ($a_source_id, $a_target_id) | |
| public | |
| __isMainTree () | |
| Check if operations are done on main tree. | |
| __checkDelete ($a_node) | |
| Check for deleteTree() compares a subtree of a given node by checking lft, rgt against parent relation. | |
| __getSubTreeByParentRelation ($a_node_id, &$parent_childs) | |
| __validateSubtrees (&$lft_childs, $parent_childs) | |
| moveTree ($a_source_id, $a_target_id, $a_location=IL_LAST_NODE) | |
| Move Tree Implementation. | |
Data Fields | |
| $ilias | |
| $log | |
| $root_id | |
| $tree_id | |
| $table_tree | |
| $table_obj_data | |
| $table_obj_reference | |
| $ref_pk | |
| $obj_pk | |
| $tree_pk | |
| $gap | |
Detailed Description
Tree class data representation in hierachical trees using the Nested Set Model with Gaps by Joe Celco.
- Version:
- Id:
- class.ilTree.php 16424 2008-04-18 15:16:54Z wrandels
Definition at line 41 of file class.ilTree.php.
Member Function Documentation
| ilTree::__checkDelete | ( | $ | a_node | ) |
Check for deleteTree() compares a subtree of a given node by checking lft, rgt against parent relation.
private
- Parameters:
-
array node data from ilTree::getNodeData()
- Returns:
- boolean
Definition at line 2138 of file class.ilTree.php.
References $res, __getSubTreeByParentRelation(), and __validateSubtrees().
Referenced by deleteTree().
{
// get subtree by lft,rgt
$query = "SELECT * FROM ".$this->table_tree." ".
"WHERE lft >= ".$a_node['lft']." ".
"AND rgt <= ".$a_node['rgt']." ".
"AND ".$this->tree_pk." = '".$a_node[$this->tree_pk]."'";
$res = $this->ilDB->query($query);
$counter = (int) $lft_childs = array();
while($row = $res->fetchRow(DB_FETCHMODE_OBJECT))
{
$lft_childs[$row->child] = $row->parent;
++$counter;
}
// CHECK FOR DUPLICATE CHILD IDS
if($counter != count($lft_childs))
{
$message = sprintf('%s::__checkTree(): Duplicate entries for "child" in maintree! $a_node_id: %s',
get_class($this),
$a_node['child']);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
// GET SUBTREE BY PARENT RELATION
$parent_childs = array();
$this->__getSubTreeByParentRelation($a_node['child'],$parent_childs);
$this->__validateSubtrees($lft_childs,$parent_childs);
return true;
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::__getSubTreeByParentRelation | ( | $ | a_node_id, | |
| &$ | parent_childs | |||
| ) |
Definition at line 2174 of file class.ilTree.php.
References $res.
Referenced by __checkDelete().
{
// GET PARENT ID
$query = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_node_id."' ".
"AND tree = '".$this->tree_id."'";
$res = $this->ilDB->query($query);
$counter = 0;
while($row = $res->fetchRow(DB_FETCHMODE_OBJECT))
{
$parent_childs[$a_node_id] = $row->parent;
++$counter;
}
// MULTIPLE ENTRIES
if($counter > 1)
{
$message = sprintf('%s::__getSubTreeByParentRelation(): Multiple entries in maintree! $a_node_id: %s',
get_class($this),
$a_node_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
// GET ALL CHILDS
$query = "SELECT * FROM ".$this->table_tree." ".
"WHERE parent = '".$a_node_id."'";
$res = $this->ilDB->query($query);
while($row = $res->fetchRow(DB_FETCHMODE_OBJECT))
{
// RECURSION
$this->__getSubTreeByParentRelation($row->child,$parent_childs);
}
return true;
}
Here is the caller graph for this function:
| ilTree::__isMainTree | ( | ) |
Check if operations are done on main tree.
private
- Returns:
- boolean
Definition at line 2125 of file class.ilTree.php.
Referenced by addTree(), deleteTree(), getNodeData(), insertNode(), moveTree(), removeTree(), renumber(), and saveSubTree().
{
return $this->table_tree === 'tree';
}
Here is the caller graph for this function:
| ilTree::__renumber | ( | $ | node_id = 1, |
|
| $ | i = 1 | |||
| ) |
This method is private.
Always call ilTree->renumber() since it locks the tree table renumber left/right values and close the gaps in numbers (recursive) private
- Parameters:
-
integer node_id where to start (usually the root node) integer first left value of start node (usually 1)
- Returns:
- integer current left value of recursive call
Definition at line 2013 of file class.ilTree.php.
References getChilds().
Referenced by renumber().
{
$q = "UPDATE ".$this->table_tree." SET lft='".$i."' WHERE child='".$node_id."'";
$this->ilDB->query($q);
$childs = $this->getChilds($node_id);
foreach ($childs as $child)
{
$i = $this->__renumber($child["child"],$i+1);
}
$i++;
// Insert a gap at the end of node, if the node has children
if (count($childs) > 0)
{
$i += $this->gap * 2;
}
$q = "UPDATE ".$this->table_tree." SET rgt='".$i."' WHERE child='".$node_id."'";
$this->ilDB->query($q);
return $i;
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::__validateSubtrees | ( | &$ | lft_childs, | |
| $ | parent_childs | |||
| ) |
Definition at line 2211 of file class.ilTree.php.
Referenced by __checkDelete().
{
// SORT BY KEY
ksort($lft_childs);
ksort($parent_childs);
if(count($lft_childs) != count($parent_childs))
{
$message = sprintf('%s::__validateSubtrees(): (COUNT) Tree is corrupted! Left/Right subtree does not comply .'.
'with parent relation',
get_class($this));
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
foreach($lft_childs as $key => $value)
{
if($parent_childs[$key] != $value)
{
$message = sprintf('%s::__validateSubtrees(): (COMPARE) Tree is corrupted! Left/Right subtree does not comply '.
'with parent relation',
get_class($this));
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
if($key == ROOT_FOLDER_ID)
{
$message = sprintf('%s::__validateSubtrees(): (ROOT_FOLDER) Tree is corrupted! Tried to delete root folder',
get_class($this));
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
}
return true;
}
Here is the caller graph for this function:
| ilTree::_removeEntry | ( | $ | a_tree, | |
| $ | a_child, | |||
| $ | a_db_table = "tree" | |||
| ) |
STATIC METHOD Removes a single entry from a tree.
The tree structure is NOT updated!
public
- Parameters:
-
integer tree id integer child id string db_table name. default is 'tree' (optional)
Definition at line 2076 of file class.ilTree.php.
References $ilErr, and $ilLog.
Referenced by ilValidator::purgeObjects().
{
global $ilDB,$ilLog,$ilErr;
if($a_db_table === 'tree')
{
if($a_tree == 1 and $a_child == ROOT_FOLDER_ID)
{
$message = sprintf('%s::_removeEntry(): Tried to delete root node! $a_tree: %s $a_child: %s',
get_class($this),
$a_tree,
$a_child);
$ilLog->write($message,$ilLog->FATAL);
$ilErr->raiseError($message,$ilErr->WARNING);
}
}
$q = "DELETE from ".$a_db_table." WHERE tree='".$a_tree."' AND child='".$a_child."'";
$ilDB->query($q);
}
Here is the caller graph for this function:
| ilTree::addTree | ( | $ | a_tree_id, | |
| $ | a_node_id = -1 | |||
| ) |
create a new tree to do: ???
- Parameters:
-
integer a_tree_id: obj_id of object where tree belongs to integer a_node_id: root node of tree (optional; default is tree_id itself)
- Returns:
- boolean true on success public
Definition at line 1491 of file class.ilTree.php.
References __isMainTree().
{
// FOR SECURITY addTree() IS NOT ALLOWED ON MAIN TREE
// IF SOMEONE WILL NEED FEATURES LIKE $tree->addTree(2) ON THE MAIN TREE PLEASE CONTACT ME (smeyer@databay.de)
if($this->__isMainTree())
{
$message = sprintf('%s::addTree(): Operation not allowed on main tree! $a_tree_if: %s $a_node_id: %s',
get_class($this),
$a_tree_id,
$a_node_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
if (!isset($a_tree_id))
{
$this->ilErr->raiseError(get_class($this)."::addTree(): No tree_id given! ",$this->ilErr->WARNING);
}
if ($a_node_id <= 0)
{
$a_node_id = $a_tree_id;
}
$q = "INSERT INTO ".$this->table_tree." (".$this->tree_pk.", child, parent, lft, rgt, depth) ".
"VALUES ".
"('".$a_tree_id."','".$a_node_id."', 0, 1, 2, 1)";
$this->ilDB->query($q);
return true;
}
Here is the call graph for this function:
| ilTree::buildJoin | ( | ) |
build join depending on table settings private
- Returns:
- string
Definition at line 311 of file class.ilTree.php.
Referenced by getChilds(), ilSCORMTree::getChilds(), getChildsByType(), getChildSequenceNumber(), getNodeData(), getNodeDataByType(), getSavedNodeData(), and getSubTree().
{
if ($this->table_obj_reference)
{
return "LEFT JOIN ".$this->table_obj_reference." ON ".$this->table_tree.".child=".$this->table_obj_reference.".".$this->ref_pk." ".
"LEFT JOIN ".$this->table_obj_data." ON ".$this->table_obj_reference.".".$this->obj_pk."=".$this->table_obj_data.".".$this->obj_pk." ";
}
else
{
return "LEFT JOIN ".$this->table_obj_data." ON ".$this->table_tree.".child=".$this->table_obj_data.".".$this->obj_pk." ";
}
}
Here is the caller graph for this function:
| ilTree::checkForParentType | ( | $ | a_ref_id, | |
| $ | a_type | |||
| ) |
Check for parent type e.g check if a folder (ref_id 3) is in a parent course obj => checkForParentType(3,'crs');.
public
- Parameters:
-
integer ref_id string type int ref_id of last parent type
Definition at line 2049 of file class.ilTree.php.
References getPathFull(), and isInTree().
{
if(!$this->isInTree($a_ref_id))
{
return false;
}
$path = array_reverse($this->getPathFull($a_ref_id));
foreach($path as $node)
{
if($node["type"] == $a_type)
{
return $node["child"];
}
}
return 0;
}
Here is the call graph for this function:
| ilTree::checkTree | ( | ) |
check consistence of tree all left & right values are checked if they are exists only once public
- Returns:
- boolean true if tree is ok; otherwise throws error object
Definition at line 1132 of file class.ilTree.php.
{
$q = "SELECT lft,rgt FROM ".$this->table_tree." ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_OBJECT))
{
$lft[] = $row->lft;
$rgt[] = $row->rgt;
}
$all = array_merge($lft,$rgt);
$uni = array_unique($all);
if (count($all) != count($uni))
{
$message = sprintf('%s::checkTree(): Tree is corrupted!',
get_class($this));
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
return true;
}
| ilTree::checkTreeChilds | ( | $ | a_no_zero_child = true |
) |
check, if all childs of tree nodes exist in object table
Definition at line 1163 of file class.ilTree.php.
{
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."' ".
"ORDER BY lft";
$r1 = $this->ilDB->query($q);
while ($row = $r1->fetchRow(DB_FETCHMODE_ASSOC))
{
//echo "tree:".$row[$this->tree_pk].":lft:".$row["lft"].":rgt:".$row["rgt"].":child:".$row["child"].":<br>";
if (($row["child"] == 0) && $a_no_zero_child)
{
$this->ilErr->raiseError(get_class($this)."::checkTreeChilds(): Tree contains child with ID 0!",$this->ilErr->WARNING);
}
if ($this->table_obj_reference)
{
// get object reference data
$q = "SELECT * FROM ".$this->table_obj_reference." WHERE ".$this->ref_pk."='".$row["child"]."'";
$r2 = $this->ilDB->query($q);
//echo "num_childs:".$r2->numRows().":<br>";
if ($r2->numRows() == 0)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): No Object-to-Reference entry found for ID ".
$row["child"]."!",$this->ilErr->WARNING);
}
if ($r2->numRows() > 1)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): More Object-to-Reference entries found for ID ".
$row["child"]."!",$this->ilErr->WARNING);
}
// get object data
$obj_ref = $r2->fetchRow(DB_FETCHMODE_ASSOC);
$q = "SELECT * FROM ".$this->table_obj_data." WHERE ".$this->obj_pk."='".$obj_ref[$this->obj_pk]."'";
$r3 = $this->ilDB->query($q);
if ($r3->numRows() == 0)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): No child found for ID ".
$obj_ref[$this->obj_pk]."!",$this->ilErr->WARNING);
}
if ($r3->numRows() > 1)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): More childs found for ID ".
$obj_ref[$this->obj_pk]."!",$this->ilErr->WARNING);
}
}
else
{
// get only object data
$q = "SELECT * FROM ".$this->table_obj_data." WHERE ".$this->obj_pk."='".$row["child"]."'";
$r2 = $this->ilDB->query($q);
//echo "num_childs:".$r2->numRows().":<br>";
if ($r2->numRows() == 0)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): No child found for ID ".
$row["child"]."!",$this->ilErr->WARNING);
}
if ($r2->numRows() > 1)
{
$this->ilErr->raiseError(get_class($this)."::checkTree(): More childs found for ID ".
$row["child"]."!",$this->ilErr->WARNING);
}
}
}
return true;
}
| ilTree::deleteTree | ( | $ | a_node | ) |
delete node and the whole subtree under this node public
- Parameters:
-
array node_data of a node
Definition at line 832 of file class.ilTree.php.
References $res, __checkDelete(), __isMainTree(), ilDBx::_lockTables(), and ilDBx::_unlockTables().
{
if (!is_array($a_node))
{
$this->ilErr->raiseError(get_class($this)."::deleteTree(): Wrong datatype for node_data! ",$this->ilErr->WARNING);
}
if($this->__isMainTree() and $a_node[$this->tree_pk] === 1)
{
if($a_node['lft'] <= 1 or $a_node['rgt'] <= 2)
{
$message = sprintf('%s::deleteTree(): Invalid parameters given: $a_node["lft"]: %s, $a_node["rgt"] %s',
get_class($this),
$a_node['lft'],
$a_node['rgt']);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
else if(!$this->__checkDelete($a_node))
{
$message = sprintf('%s::deleteTree(): Check delete failed: $a_node["lft"]: %s, $a_node["rgt"] %s',
get_class($this),
$a_node['lft'],
$a_node['rgt']);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
}
$diff = $a_node["rgt"] - $a_node["lft"] + 1;
// LOCKED ###########################################################
// get lft and rgt values. Don't trust parameter lft/rgt values of $a_node
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
$query = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_node['child']."' ".
"AND ".$this->tree_pk." = '".$a_node[$this->tree_pk]."'";
$res = $this->ilDB->query($query);
while($row = $res->fetchRow(DB_FETCHMODE_OBJECT))
{
$a_node['lft'] = $row->lft;
$a_node['rgt'] = $row->rgt;
$diff = $a_node["rgt"] - $a_node["lft"] + 1;
}
// delete subtree
$q = "DELETE FROM ".$this->table_tree." ".
"WHERE lft BETWEEN '".$a_node["lft"]."' AND '".$a_node["rgt"]."' ".
"AND rgt BETWEEN '".$a_node["lft"]."' AND '".$a_node["rgt"]."' ".
"AND ".$this->tree_pk." = '".$a_node[$this->tree_pk]."'";
$this->ilDB->query($q);
// We only close the gap, if the resulting gap will be larger then the gap value
if ($a_node['rgt'] - $a_node['lft'] >= $this->gap * 2)
{
$this->log->write('ilTree.deleteTree('.$a_node['child'].') closing gap at '.$a_node['lft'].'...'.$a_node['rgt']);
// close gaps
$q = "UPDATE ".$this->table_tree." SET ".
"lft = CASE ".
"WHEN lft > '".$a_node["lft"]." '".
"THEN lft - '".$diff." '".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt > '".$a_node["lft"]." '".
"THEN rgt - '".$diff." '".
"ELSE rgt ".
"END ".
"WHERE ".$this->tree_pk." = '".$a_node[$this->tree_pk]."'";
$this->ilDB->query($q);
}
else
{
$this->log->write('ilTree.deleteTree('.$a_node['child'].') leaving gap open '.$a_node['lft'].'...'.$a_node['rgt']);
}
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
// LOCKED ###########################################################
}
Here is the call graph for this function:
| ilTree::fetchNodeData | ( | $ | a_row | ) |
get data of parent node from tree and object_data private
- Parameters:
-
object db db result object containing node_data
- Returns:
- array 2-dim (int/str) node_data TODO: select description twice for compability. Please use 'desc' in future only
Definition at line 1318 of file class.ilTree.php.
References $data, $ilBench, $lng, and ilUtil::shortenText().
Referenced by fetchPredecessorNode(), fetchSuccessorNode(), getChilds(), ilSCORMTree::getChilds(), getChildsByType(), getNodeData(), getNodeDataByType(), getParentNodeData(), getSavedNodeData(), and getSubTree().
{
global $objDefinition, $lng, $ilBench;
//$ilBench->start("Tree", "fetchNodeData_getRow");
$data = $a_row;
$data["desc"] = $a_row["description"]; // for compability
//$ilBench->stop("Tree", "fetchNodeData_getRow");
// multilingual support systemobjects (sys) & categories (db)
//$ilBench->start("Tree", "fetchNodeData_readDefinition");
if (is_object($objDefinition))
{
$translation_type = $objDefinition->getTranslationType($data["type"]);
}
//$ilBench->stop("Tree", "fetchNodeData_readDefinition");
if ($translation_type == "sys")
{
//$ilBench->start("Tree", "fetchNodeData_getLangData");
if ($data["type"] == "rolf" and $data["obj_id"] != ROLE_FOLDER_ID)
{
$data["description"] = $lng->txt("obj_".$data["type"]."_local_desc").$data["title"].$data["desc"];
$data["desc"] = $lng->txt("obj_".$data["type"]."_local_desc").$data["title"].$data["desc"];
$data["title"] = $lng->txt("obj_".$data["type"]."_local");
}
else
{
$data["title"] = $lng->txt("obj_".$data["type"]);
$data["description"] = $lng->txt("obj_".$data["type"]."_desc");
$data["desc"] = $lng->txt("obj_".$data["type"]."_desc");
}
//$ilBench->stop("Tree", "fetchNodeData_getLangData");
}
elseif ($translation_type == "db")
{
//$ilBench->start("Tree", "fetchNodeData_getTranslation");
$q = "SELECT title,description FROM object_translation ".
"WHERE obj_id = ".$data["obj_id"]." ".
"AND lang_code = '".$this->lang_code."' ".
"AND NOT lang_default = 1";
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_OBJECT);
if ($row)
{
$data["title"] = $row->title;
$data["description"] = ilUtil::shortenText($row->description,MAXLENGTH_OBJ_DESC,true);
$data["desc"] = $row->description;
}
//$ilBench->stop("Tree", "fetchNodeData_getTranslation");
}
return $data ? $data : array();
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::fetchPredecessorNode | ( | $ | a_node_id, | |
| $ | a_type = "" | |||
| ) |
get node data of predecessor node
public
- Parameters:
-
integer node id
- Returns:
- array node data array
Definition at line 1939 of file class.ilTree.php.
References fetchNodeData().
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getNodeData(): No node_id given! ",$this->ilErr->WARNING);
}
// get lft value for current node
$q = "SELECT lft FROM ".$this->table_tree." ".
"WHERE ".$this->table_tree.".child = '".$a_node_id."' ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
$curr_node = $r->fetchRow(DB_FETCHMODE_ASSOC);
// get data of predecessor node
$type_where = ($a_type != "")
? "AND ".$this->table_obj_data.".type = '$a_type' "
: "";
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE lft < '".$curr_node["lft"]."' ".
$type_where.
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'".
"ORDER BY lft DESC LIMIT 1";
$r = $this->ilDB->query($q);
if ($r->numRows() < 1)
{
return false;
}
else
{
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
return $this->fetchNodeData($row);
}
}
Here is the call graph for this function:
| ilTree::fetchSuccessorNode | ( | $ | a_node_id, | |
| $ | a_type = "" | |||
| ) |
get node data of successor node
public
- Parameters:
-
integer node id
- Returns:
- array node data array
Definition at line 1895 of file class.ilTree.php.
References fetchNodeData().
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getNodeData(): No node_id given! ",$this->ilErr->WARNING);
}
// get lft value for current node
$q = "SELECT lft FROM ".$this->table_tree." ".
"WHERE ".$this->table_tree.".child = '".$a_node_id."' ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
$curr_node = $r->fetchRow(DB_FETCHMODE_ASSOC);
// get data of successor node
$type_where = ($a_type != "")
? "AND ".$this->table_obj_data.".type = '$a_type' "
: "";
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE lft > '".$curr_node["lft"]."' ".
$type_where.
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'".
"ORDER BY lft LIMIT 1";
$r = $this->ilDB->query($q);
if ($r->numRows() < 1)
{
return false;
}
else
{
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
return $this->fetchNodeData($row);
}
}
Here is the call graph for this function:
| ilTree::getChilds | ( | $ | a_node_id, | |
| $ | a_order = "", |
|||
| $ | a_direction = "ASC" | |||
| ) |
get child nodes of given node public
- Parameters:
-
integer node_id string sort order of returned childs, optional (possible values: 'title','desc','last_update' or 'type') string sort direction, optional (possible values: 'DESC' or 'ASC'; defalut is 'ASC')
- Returns:
- array with node data of all childs or empty array
Reimplemented in ilSCORMTree.
Definition at line 332 of file class.ilTree.php.
References $ilBench, buildJoin(), and fetchNodeData().
Referenced by __renumber(), and getFilteredChilds().
{
global $ilBench;
if (!isset($a_node_id))
{
$message = get_class($this)."::getChilds(): No node_id given!";
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
// init childs
$childs = array();
// number of childs
$count = 0;
// init order_clause
$order_clause = "";
// set order_clause if sort order parameter is given
if (!empty($a_order))
{
$order_clause = "ORDER BY ".$a_order." ".$a_direction;
}
else
{
$order_clause = "ORDER BY ".$this->table_tree.".lft";
}
//666
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE parent = ".$this->ilDB->quote($a_node_id)." ".
"AND ".$this->table_tree.".".$this->tree_pk." = ".$this->ilDB->quote($this->tree_id)." ".
$order_clause;
//$ilBench->start("Tree", "getChilds_Query");
$r = $this->ilDB->query($q);
//$ilBench->stop("Tree", "getChilds_Query");
$count = $r->numRows();
if ($count > 0)
{
//$ilBench->start("Tree", "getChilds_fetchNodeData");
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
$childs[] = $this->fetchNodeData($row);
}
//$ilBench->stop("Tree", "getChilds_fetchNodeData");
// mark the last child node (important for display)
$childs[$count - 1]["last"] = true;
return $childs;
}
else
{
return $childs;
}
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::getChildsByType | ( | $ | a_node_id, | |
| $ | a_type | |||
| ) |
get child nodes of given node by object type public
- Parameters:
-
integer node_id string object type
- Returns:
- array with node data of all childs or empty array
Definition at line 425 of file class.ilTree.php.
References buildJoin(), and fetchNodeData().
{
if (!isset($a_node_id) or !isset($a_type))
{
$message = get_class($this)."::getChildsByType(): Missing parameter! node_id:".$a_node_id." type:".$a_type;
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
// init childs
$childs = array();
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE parent = '".$a_node_id."' ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."' ".
"AND ".$this->table_obj_data.".type='".$a_type."' ".
"ORDER BY ".$this->table_tree.".lft";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
$childs[] = $this->fetchNodeData($row);
}
return $childs;
}
Here is the call graph for this function:
| ilTree::getChildSequenceNumber | ( | $ | a_node, | |
| $ | type = "" | |||
| ) |
get sequence number of node in sibling sequence public
- Parameters:
-
array node
- Returns:
- integer sequence number
Definition at line 1813 of file class.ilTree.php.
References buildJoin().
{
if (!isset($a_node))
{
$this->ilErr->raiseError(get_class($this)."::getChildSequenceNumber(): No node_id given! ",$this->ilErr->WARNING);
}
$type_str = ($type != "")
? "AND type='$type'"
: "";
$q = "SELECT count(*) AS cnt FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE lft <=".$this->ilDB->quote($a_node["lft"])." ".
$type_str.
"AND parent=".$this->ilDB->quote($a_node["parent"])." ".
"AND ".$this->table_tree.".".$this->tree_pk."=".$this->ilDB->quote($this->tree_id);
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
return $row["cnt"];
}
Here is the call graph for this function:
| ilTree::getDepth | ( | $ | a_node_id | ) |
return depth of a node in tree private
- Parameters:
-
integer node_id of parent's node_id
- Returns:
- integer depth of node in tree
Definition at line 1254 of file class.ilTree.php.
References $res.
Referenced by insertNode().
{
if ($a_node_id)
{
$q = "SELECT depth FROM ".$this->table_tree." ".
"WHERE child = '".$a_node_id."' ".
"AND ".$this->tree_pk." = '".$this->tree_id."'";
$res = $this->ilDB->query($q);
$row = $res->fetchRow(DB_FETCHMODE_OBJECT);
return $row->depth;
}
else
{
return 1;
}
}
Here is the caller graph for this function:
| ilTree::getFilteredChilds | ( | $ | a_filter, | |
| $ | a_node, | |||
| $ | a_order = "", |
|||
| $ | a_direction = "ASC" | |||
| ) |
get child nodes of given node (exclude filtered obj_types) public
- Parameters:
-
array objects to filter (e.g array('rolf')) integer node_id string sort order of returned childs, optional (possible values: 'title','desc','last_update' or 'type') string sort direction, optional (possible values: 'DESC' or 'ASC'; defalut is 'ASC')
- Returns:
- array with node data of all childs or empty array
Definition at line 403 of file class.ilTree.php.
References getChilds().
{
$childs = $this->getChilds($a_node,$a_order,$a_direction);
foreach($childs as $child)
{
if(!in_array($child["type"],$a_filter))
{
$filtered[] = $child;
}
}
return $filtered ? $filtered : array();
}
Here is the call graph for this function:
| ilTree::getLeftValue | ( | $ | a_node_id | ) |
get left value of given node public
- Parameters:
-
integer node id
- Returns:
- integer left value
Definition at line 1790 of file class.ilTree.php.
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getLeftValued(): No node_id given! ",$this->ilErr->WARNING);
}
$q = "SELECT lft FROM ".$this->table_tree." ".
"WHERE child='".$a_node_id."' ".
"AND ".$this->tree_pk."='".$this->tree_id."'";
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_OBJECT);
return $row->lft;
}
| ilTree::getMaximumDepth | ( | ) |
Return the maximum depth in tree public.
- Returns:
- integer max depth level of tree
Definition at line 1238 of file class.ilTree.php.
{
$q = "SELECT MAX(depth) FROM ".$this->table_tree;
$r = $this->ilDB->query($q);
$row = $r->fetchRow();
return $row[0];
}
| ilTree::getNodeData | ( | $ | a_node_id | ) |
get all information of a node.
get data of a specific node from tree and object_data public
- Parameters:
-
integer node id
- Returns:
- array 2-dim (int/str) node_data
Definition at line 1281 of file class.ilTree.php.
References __isMainTree(), buildJoin(), and fetchNodeData().
Referenced by getPathFull(), and getSubTreeTypes().
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getNodeData(): No node_id given! ",$this->ilErr->WARNING);
}
if($this->__isMainTree())
{
if($a_node_id < 1)
{
$message = sprintf('%s::getNodeData(): No valid parameter given! $a_node_id: %s',
get_class($this),
$a_node_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
}
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE ".$this->table_tree.".child = ".$this->ilDB->quote($a_node_id)." ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
$row[$this->tree_pk] = $this->tree_id;
return $this->fetchNodeData($row);
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::getNodeDataByType | ( | $ | a_type | ) |
get nodes by type // TODO: method needs revision
- Parameters:
-
integer a_tree_id: obj_id of object where tree belongs to integer a_type_id: type of object public
Definition at line 1531 of file class.ilTree.php.
References $data, $left, $right, buildJoin(), and fetchNodeData().
{
if (!isset($a_type) or (!is_string($a_type)))
{
$this->ilErr->raiseError(get_class($this)."::getNodeDataByType(): Type not given or wrong datatype!",$this->ilErr->WARNING);
}
$data = array(); // node_data
$row = ""; // fetched row
$left = ""; // tree_left
$right = ""; // tree_right
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'".
"AND parent = '0'";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_OBJECT))
{
$left = $row->lft;
$right = $row->rgt;
}
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE ".$this->table_obj_data.".type = '".$a_type."' ".
"AND ".$this->table_tree.".lft BETWEEN '".$left."' AND '".$right."' ".
"AND ".$this->table_tree.".rgt BETWEEN '".$left."' AND '".$right."' ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
$data[] = $this->fetchNodeData($row);
}
return $data;
}
Here is the call graph for this function:
| ilTree::getParentId | ( | $ | a_node_id | ) |
get parent id of given node public
- Parameters:
-
integer node id
- Returns:
- integer parent id
Definition at line 1767 of file class.ilTree.php.
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getParentId(): No node_id given! ",$this->ilErr->WARNING);
}
$q = "SELECT parent FROM ".$this->table_tree." ".
"WHERE child='".$a_node_id."' ".
"AND ".$this->tree_pk."='".$this->tree_id."'";
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_OBJECT);
return $row->parent;
}
| ilTree::getParentNodeData | ( | $ | a_node_id | ) |
get data of parent node from tree and object_data public
- Parameters:
-
integer node id
- Returns:
- array
Definition at line 1422 of file class.ilTree.php.
References fetchNodeData().
{
if (!isset($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::getParentNodeData(): No node_id given! ",$this->ilErr->WARNING);
}
if ($this->table_obj_reference)
{
$leftjoin = "LEFT JOIN ".$this->table_obj_reference." ON v.child=".$this->table_obj_reference.".".$this->ref_pk." ".
"LEFT JOIN ".$this->table_obj_data." ON ".$this->table_obj_reference.".".$this->obj_pk."=".$this->table_obj_data.".".$this->obj_pk." ";
}
else
{
$leftjoin = "LEFT JOIN ".$this->table_obj_data." ON v.child=".$this->table_obj_data.".".$this->obj_pk." ";
}
$q = "SELECT * FROM ".$this->table_tree." s,".$this->table_tree." v ".
$leftjoin.
"WHERE s.child = '".$a_node_id."' ".
"AND s.parent = v.child ".
"AND s.lft > v.lft ".
"AND s.rgt < v.rgt ".
"AND s.".$this->tree_pk." = '".$this->tree_id."' ".
"AND v.".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
return $this->fetchNodeData($row);
}
Here is the call graph for this function:
| ilTree::getPathFull | ( | $ | a_endnode_id, | |
| $ | a_startnode_id = 0 | |||
| ) |
get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode.
This function chooses the algorithm to be used.
public
- Parameters:
-
integer node_id of endnode integer node_id of startnode (optional)
- Returns:
- array ordered path info (id,title,parent) from start to end
Definition at line 931 of file class.ilTree.php.
References getNodeData(), and getPathId().
Referenced by checkForParentType().
{
$pathIds =& $this->getPathId($a_endnode_id, $a_startnode_id);
$dataPath = array();
foreach ($pathIds as $id) {
$dataPath[] = $this->getNodeData($id);
}
return $dataPath;
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::getPathId | ( | $ | a_endnode_id, | |
| $ | a_startnode_id = 0 | |||
| ) |
get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public
- Parameters:
-
integer node_id of endnode integer node_id of startnode (optional)
- Returns:
- array all path ids from startnode to endnode
Definition at line 1110 of file class.ilTree.php.
References getPathIdsUsingAdjacencyMap().
Referenced by getPathFull().
{
// path id cache
if ($this->use_cache && isset($this->path_id_cache[$a_endnode_id][$a_startnode_id]))
{
//echo "<br>getPathIdhit";
return $this->path_id_cache[$a_endnode_id][$a_startnode_id];
}
//echo "<br>miss";
$pathIds =& $this->getPathIdsUsingAdjacencyMap($a_endnode_id, $a_startnode_id);
$this->path_id_cache[$a_endnode_id][$a_startnode_id] = $pathIds;
return $pathIds;
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::getPathIdsUsingAdjacencyMap | ( | $ | a_endnode_id, | |
| $ | a_startnode_id = 0 | |||
| ) |
get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public
- Parameters:
-
integer node_id of endnode integer node_id of startnode (optional)
- Returns:
- array all path ids from startnode to endnode
Definition at line 992 of file class.ilTree.php.
References $log, and getPathIdsUsingNestedSets().
Referenced by getPathId().
{
// The adjacency map algorithm is harder to implement than the nested sets algorithm.
// This algorithms performs an index search for each of the path element.
// This algorithms performs well for large trees which are not deeply nested.
// The $takeId variable is used, to determine if a given id shall be included in the path
$takeId = $a_startnode_id == 0;
if (!isset($a_endnode_id))
{
$this->ilErr->raiseError(get_class($this)."::getPathId(): No endnode_id given! ",$this->ilErr->WARNING);
}
global $log, $ilDB;
// Determine the depth of the endnode, and fetch its parent field also.
$q = 'SELECT t.depth,t.parent '.
'FROM '.$this->table_tree.' AS t '.
'WHERE child='.$this->ilDB->quote($a_endnode_id).' '.
'AND '.$this->tree_pk.' = '.$this->tree_id.' '.
'LIMIT 1';
//$this->writelog('getIdsUsingAdjacencyMap q='.$q);
$r = $this->ilDB->query($q);
if ($r->numRows() == 0)
{
return array();
}
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
$nodeDepth = $row['depth'];
$parentId = $row['parent'];
//$this->writelog('getIdsUsingAdjacencyMap depth='.$nodeDepth);
// Fetch the node ids. For shallow depths we can fill in the id's directly.
$pathIds = array();
if ($nodeDepth == 1)
{
$takeId = $takeId || $a_endnode_id == $a_startnode_id;
if ($takeId) $pathIds[] = $a_endnode_id;
}
else if ($nodeDepth == 2)
{
$takeId = $takeId || $parentId == $a_startnode_id;
if ($takeId) $pathIds[] = $parentId;
$takeId = $takeId || $a_endnode_id == $a_startnode_id;
if ($takeId) $pathIds[] = $a_endnode_id;
}
else if ($nodeDepth == 3)
{
$takeId = $takeId || $this->root_id == $a_startnode_id;
if ($takeId) $pathIds[] = $this->root_id;
$takeId = $takeId || $parentId == $a_startnode_id;
if ($takeId) $pathIds[] = $parentId;
$takeId = $takeId || $a_endnode_id == $a_startnode_id;
if ($takeId) $pathIds[] = $a_endnode_id;
}
else if ($nodeDepth < 32)
{
// Adjacency Map Tree performs better than
// Nested Sets Tree even for very deep trees.
// The following code construct nested self-joins
// Since we already know the root-id of the tree and
// we also know the id and parent id of the current node,
// we only need to perform $nodeDepth - 3 self-joins.
// We can further reduce the number of self-joins by 1
// by taking into account, that each row in table tree
// contains the id of itself and of its parent.
$qSelect = 't1.child as c0';
$qJoin = '';
for ($i = 1; $i < $nodeDepth - 2; $i++)
{
$qSelect .= ', t'.$i.'.parent as c'.$i;
$qJoin .= ' JOIN '.$this->table_tree.' AS t'.$i.' ON '.
't'.$i.'.child=t'.($i - 1).'.parent AND '.
't'.$i.'.'.$this->tree_pk.' = '.$this->tree_id;
}
$q = 'SELECT '.$qSelect.' '.
'FROM '.$this->table_tree.' AS t0 '.$qJoin.' '.
'WHERE t0.'.$this->tree_pk.' = '.$this->tree_id.' '.
'AND t0.child='.$parentId.' '.
'LIMIT 1';
$r = $this->ilDB->query($q);
if ($r->numRows() == 0)
{
return array();
}
$row = $r->fetchRow(DB_FETCHMODE_ASSOC);
$takeId = $takeId || $this->root_id == $a_startnode_id;
if ($takeId) $pathIds[] = $this->root_id;
for ($i = $nodeDepth - 4; $i >=0; $i--)
{
$takeId = $takeId || $row['c'.$i] == $a_startnode_id;
if ($takeId) $pathIds[] = $row['c'.$i];
}
$takeId = $takeId || $parentId == $a_startnode_id;
if ($takeId) $pathIds[] = $parentId;
$takeId = $takeId || $a_endnode_id == $a_startnode_id;
if ($takeId) $pathIds[] = $a_endnode_id;
}
else
{
// Fall back to nested sets tree for extremely deep tree structures
return $this->getPathIdsUsingNestedSets($a_endnode_id, $a_startnode_id);
}
return $pathIds;
}
Here is the call graph for this function:
Here is the caller graph for this function:
| ilTree::getPathIdsUsingNestedSets | ( | $ | a_endnode_id, | |
| $ | a_startnode_id = 0 | |||
| ) |
get path from a given startnode to a given endnode if startnode is not given the rootnode is startnode public
- Parameters:
-
integer node_id of endnode integer node_id of startnode (optional)
- Returns:
- array all path ids from startnode to endnode
Definition at line 949 of file class.ilTree.php.
Referenced by getPathIdsUsingAdjacencyMap().
{
// The nested sets algorithm is very easy to implement.
// Unfortunately it always does a full table space scan to retrieve the path
// regardless whether indices on lft and rgt are set or not.
// (At least, this is what happens on MySQL 4.1).
// This algorithms performs well for small trees which are deeply nested.
if (!isset($a_endnode_id))
{
$this->ilErr->raiseError(get_class($this)."::getPathId(): No endnode_id given! ",$this->ilErr->WARNING);
}
$q = "SELECT T2.child ".
"FROM ".$this->table_tree." AS T1, ".$this->table_tree." AS T2 ".
"WHERE T1.child = '".$a_endnode_id."' ".
"AND T1.lft BETWEEN T2.lft AND T2.rgt ".
"AND T1.".$this->tree_pk." = '".$this->tree_id." '".
"AND T2.".$this->tree_pk." = '".$this->tree_id." '".
"ORDER BY T2.depth";
$r = $this->ilDB->query($q);
$takeId = $a_startnode_id == 0;
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
if ($takeId || $row['child'] == $a_startnode_id)
{
$takeId = true;
$pathIds[] = $row['child'];
}
}
return $pathIds;
}
Here is the caller graph for this function:
| ilTree::getRootId | ( | ) |
get the root id of tree public
- Returns:
- integer root node id
Definition at line 1859 of file class.ilTree.php.
{
return $this->root_id;
}
| ilTree::getSavedNodeData | ( | $ | a_parent_id | ) |
get data saved/deleted nodes
- Returns:
- array data
- Parameters:
-
integer id of parent object of saved object public
Definition at line 1740 of file class.ilTree.php.
References buildJoin(), and fetchNodeData().
{
if (!isset($a_parent_id))
{
$this->ilErr->raiseError(get_class($this)."::getSavedNodeData(): No node_id given!",$this->ilErr->WARNING);
}
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE ".$this->table_tree.".".$this->tree_pk." < 0 ".
"AND ".$this->table_tree.".parent = '".$a_parent_id."' ";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
$saved[] = $this->fetchNodeData($row);
}
return $saved ? $saved : array();
}
Here is the call graph for this function:
| ilTree::getSubTree | ( | $ | a_node, | |
| $ | a_with_data = true, |
|||
| $ | a_type = "" | |||
| ) |
get all nodes in the subtree under specified node
public
- Parameters:
-
array node_data boolean with data: default is true otherwise this function return only a ref_id array
- Returns:
- array 2-dim (int/array) key, node_data of each subtree node including the specified node
Definition at line 752 of file class.ilTree.php.
References buildJoin(), and fetchNodeData().
{
if (!is_array($a_node))
{
$this->ilErr->raiseError(get_class($this)."::getSubTree(): Wrong datatype for node_data! ",$this->ilErr->WARNING);
}
if($a_node['lft'] < 1 or $a_node['rgt'] < 2)
{
$message = sprintf('%s::getSubTree(): Invalid node given! $a_node["lft"]: %s $a_node["rgt"]: %s',
get_class($this),
$a_node['lft'],
$a_node['rgt']);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
$subtree = array();
$type_str = "";
if ($a_type != "")
{
$type_str = "AND ".$this->table_obj_data.".type='".$a_type."' ";
}
$q = "SELECT * FROM ".$this->table_tree." ".
$this->buildJoin().
"WHERE ".$this->table_tree.".lft BETWEEN '".$a_node["lft"]."' AND '".$a_node["rgt"]."' ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."' ".
$type_str.
"ORDER BY ".$this->table_tree.".lft";
$r = $this->ilDB->query($q);
while ($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
if($a_with_data)
{
$subtree[] = $this->fetchNodeData($row);
}
else
{
$subtree[] = $row['child'];
}
$this->in_tree_cache[$row['child']] = true;
}
return $subtree ? $subtree : array();
}
Here is the call graph for this function:
| ilTree::getSubTreeTypes | ( | $ | a_node, | |
| $ | a_filter = 0 | |||
| ) |
get types of nodes in the subtree under specified node
public
- Parameters:
-
array node_id array object types to filter e.g array('rolf')
- Returns:
- array 2-dim (int/array) key, node_data of each subtree node including the specified node
Definition at line 812 of file class.ilTree.php.
References getNodeData().
{
$a_filter = $a_filter ? $a_filter : array();
foreach($this->getSubtree($this->getNodeData($a_node)) as $node)
{
if(in_array($node["type"],$a_filter))
{
continue;
}
$types["$node[type]"] = $node["type"];
}
return $types ? $types : array();
}
Here is the call graph for this function:
| ilTree::getTreeId | ( | ) |
get tree id public
- Returns:
- integer tree id
Definition at line 1873 of file class.ilTree.php.
{
return $this->tree_id;
}
| ilTree::ilTree | ( | $ | a_tree_id, | |
| $ | a_root_id = 0 | |||
| ) |
Constructor public.
- Parameters:
-
integer $a_tree_id tree_id integer $a_root_id root_id (optional)
Definition at line 146 of file class.ilTree.php.
References $ilErr, $ilias, $ilLog, and if.
Referenced by ilAICCTree::ilAICCTree(), and ilSCORMTree::ilSCORMTree().
{
global $ilDB,$ilErr,$ilias,$ilLog;
// set db & error handler
(isset($ilDB)) ? $this->ilDB =& $ilDB : $this->ilDB =& $ilias->db;
if (!isset($ilErr))
{
$ilErr = new ilErrorHandling();
$ilErr->setErrorHandling(PEAR_ERROR_CALLBACK,array($ilErr,'errorHandler'));
}
else
{
$this->ilErr =& $ilErr;
}
$this->lang_code = "en";
if (!isset($a_tree_id) or (func_num_args() == 0) )
{
$this->ilErr->raiseError(get_class($this)."::Constructor(): No tree_id given!",$this->ilErr->WARNING);
}
if (func_num_args() > 2)
{
$this->ilErr->raiseError(get_class($this)."::Constructor(): Wrong parameter count!",$this->ilErr->WARNING);
}
// CREATE LOGGER INSTANCE
$this->log =& $ilLog;
//init variables
if (empty($a_root_id))
{
$a_root_id = ROOT_FOLDER_ID;
}
$this->tree_id = $a_tree_id;
$this->root_id = $a_root_id;
$this->table_tree = 'tree';
$this->table_obj_data = 'object_data';
$this->table_obj_reference = 'object_reference';
$this->ref_pk = 'ref_id';
$this->obj_pk = 'obj_id';
$this->tree_pk = 'tree';
$this->use_cache = false;
// By default, we create gaps in the tree sequence numbering for 50 nodes
$this->gap = 50;
}
Here is the caller graph for this function:
| ilTree::initLangCode | ( | ) |
Store user language.
This function is used by the "main" tree only (during initialisation).
Definition at line 210 of file class.ilTree.php.
{
global $ilUser;
// lang_code is only required in $this->fetchnodedata
if (!is_object($ilUser))
{
$this->lang_code = "en";
}
else
{
$this->lang_code = $ilUser->getCurrentLanguage();
}
}
| ilTree::insertNode | ( | $ | a_node_id, | |
| $ | a_parent_id, | |||
| $ | a_pos = IL_LAST_NODE, |
|||
| $ | a_reset_deletion_date = false | |||
| ) |
insert new node with node_id under parent node with parent_id public
- Parameters:
-
integer node_id integer parent_id integer IL_LAST_NODE | IL_FIRST_NODE | node id of preceding child
Definition at line 461 of file class.ilTree.php.
References $left, $res, $right, __isMainTree(), ilDBx::_lockTables(), ilObject::_resetDeletedDate(), ilDBx::_unlockTables(), getDepth(), and isInTree().
{
//echo "+$a_node_id+$a_parent_id+";
// CHECK node_id and parent_id > 0 if in main tree
if($this->__isMainTree())
{
if($a_node_id <= 1 or $a_parent_id <= 0)
{
$message = sprintf('%s::insertNode(): Invalid parameters! $a_node_id: %s $a_parent_id: %s',
get_class($this),
$a_node_id,
$a_parent_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
}
if (!isset($a_node_id) or !isset($a_parent_id))
{
$this->ilErr->raiseError(get_class($this)."::insertNode(): Missing parameter! ".
"node_id: ".$a_node_id." parent_id: ".$a_parent_id,$this->ilErr->WARNING);
}
if ($this->isInTree($a_node_id))
{
$this->ilErr->raiseError(get_class($this)."::insertNode(): Node ".$a_node_id." already in tree ".
$this->table_tree."!",$this->ilErr->WARNING);
}
//
switch ($a_pos)
{
case IL_FIRST_NODE:
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
// get left value of parent
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_parent_id."' ".
"AND ".$this->tree_pk." = '".$this->tree_id."'";
$res = $this->ilDB->query($q);
$r = $res->fetchRow(DB_FETCHMODE_OBJECT);
if ($r->parent == NULL)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->ilErr->raiseError(get_class($this)."::insertNode(): Parent with ID ".$a_parent_id." not found in ".
$this->table_tree."!",$this->ilErr->WARNING);
}
$left = $r->lft;
$lft = $left + 1;
$rgt = $left + 2;
// spread tree
$q = "UPDATE ".$this->table_tree." SET ".
"lft = CASE ".
"WHEN lft > ".$left." ".
"THEN lft + 2 ".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt > ".$left." ".
"THEN rgt + 2 ".
"ELSE rgt ".
"END ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'";
$this->ilDB->query($q);
break;
case IL_LAST_NODE:
// Special treatment for trees with gaps
if ($this->gap > 0)
{
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
// get lft and rgt value of parent
$q = 'SELECT rgt,lft,parent FROM '.$this->table_tree.' '.
'WHERE child = '.$a_parent_id.' '.
'AND '.$this->tree_pk.' = '.$this->tree_id;
$res = $this->ilDB->query($q);
$r = $res->fetchRow(DB_FETCHMODE_ASSOC);
if ($r['parent'] == NULL)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->ilErr->raiseError(get_class($this)."::insertNode(): Parent with ID ".
$a_parent_id." not found in ".$this->table_tree."!",$this->ilErr->WARNING);
}
$parentRgt = $r['rgt'];
$parentLft = $r['lft'];
// Get the available space, without taking children into account yet
$availableSpace = $parentRgt - $parentLft;
if ($availableSpace < 2)
{
// If there is not enough space between parent lft and rgt, we don't need
// to look any further, because we must spread the tree.
$lft = $parentRgt;
}
else
{
// If there is space between parent lft and rgt, we need to check
// whether there is space left between the rightmost child of the
// parent and parent rgt.
$q = 'SELECT MAX(rgt) AS max_rgt FROM '.$this->table_tree.' '.
'WHERE parent = '.$a_parent_id.' '.
'AND '.$this->tree_pk.' = '.$this->tree_id;
$res = $this->ilDB->query($q);
$r = $res->fetchRow(DB_FETCHMODE_ASSOC);
if (isset($r['max_rgt']))
{
// If the parent has children, we compute the available space
// between rgt of the rightmost child and parent rgt.
$availableSpace = $parentRgt - $r['max_rgt'];
$lft = $r['max_rgt'] + 1;
}
else
{
// If the parent has no children, we know now, that we can
// add the new node at parent lft + 1 without having to spread
// the tree.
$lft = $parentLft + 1;
}
}
$rgt = $lft + 1;
// spread tree if there is not enough space to insert the new node
if ($availableSpace < 2)
{
$this->log->write('ilTree.insertNode('.$a_node_id.','.$a_parent_id.') creating gap at '.$a_parent_id.' '.$parentLft.'..'.$parentRgt.'+'.(2 + $this->gap * 2));
$q = "UPDATE ".$this->table_tree." SET ".
"lft = CASE ".
"WHEN lft > ".$parentRgt." ".
"THEN lft + ".(2 + $this->gap * 2).' '.
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt >= ".$parentRgt." ".
"THEN rgt + ".(2 + $this->gap * 2).' '.
"ELSE rgt ".
"END ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'";
$this->ilDB->query($q);
}
else
{
$this->log->write('ilTree.insertNode('.$a_node_id.','.$a_parent_id.') reusing gap at '.$a_parent_id.' '.$parentLft.'..'.$parentRgt.' for node '.$a_node_id.' '.$lft.'..'.$rgt);
}
}
// Treatment for trees without gaps
else
{
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
// get right value of parent
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_parent_id."' ".
"AND ".$this->tree_pk." = '".$this->tree_id."'";
$res = $this->ilDB->query($q);
$r = $res->fetchRow(DB_FETCHMODE_OBJECT);
if ($r->parent == NULL)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->ilErr->raiseError(get_class($this)."::insertNode(): Parent with ID ".
$a_parent_id." not found in ".$this->table_tree."!",$this->ilErr->WARNING);
}
$right = $r->rgt;
$lft = $right;
$rgt = $right + 1;
// spread tree
$q = "UPDATE ".$this->table_tree." SET ".
"lft = CASE ".
"WHEN lft > ".$right." ".
"THEN lft + 2 ".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt >= ".$right." ".
"THEN rgt + 2 ".
"ELSE rgt ".
"END ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'";
$this->ilDB->query($q);
}
break;
default:
// this code shouldn't be executed
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
// get right value of preceeding child
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_pos."' ".
"AND ".$this->tree_pk." = '".$this->tree_id."'";
$res = $this->ilDB->query($q);
$r = $res->fetchRow(DB_FETCHMODE_OBJECT);
// crosscheck parents of sibling and new node (must be identical)
if ($r->parent != $a_parent_id)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->ilErr->raiseError(get_class($this)."::insertNode(): Parents mismatch! ".
"new node parent: ".$a_parent_id." sibling parent: ".$r->parent,$this->ilErr->WARNING);
}
$right = $r->rgt;
$lft = $right + 1;
$rgt = $right + 2;
// update lft/rgt values
$q = "UPDATE ".$this->table_tree." SET ".
"lft = CASE ".
"WHEN lft > ".$right." ".
"THEN lft + 2 ".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt > ".$right." ".
"THEN rgt + 2 ".
"ELSE rgt ".
"END ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."'";
$this->ilDB->query($q);
break;
}
// get depth
$depth = $this->getDepth($a_parent_id) + 1;
// insert node
$this->log->write('ilTree.insertNode('.$a_node_id.','.$a_parent_id.') inserting node:'.$a_node_id.' parent:'.$a_parent_id." ".$lft."..".$rgt." depth:".$depth);
$q = "INSERT INTO ".$this->table_tree." (".$this->tree_pk.",child,parent,lft,rgt,depth) ".
"VALUES ".
"('".$this->tree_id."','".$a_node_id."','".$a_parent_id."','".$lft."','".$rgt."','".$depth."')";
$this->ilDB->query($q);
// Finally unlock tables
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
// reset deletion date
if ($a_reset_deletion_date)
{
ilObject::_resetDeletedDate($a_node_id);
}
}
Here is the call graph for this function:
| ilTree::isDeleted | ( | $ | a_node_id | ) |
This is a wrapper for isSaved() with a more useful name.
Definition at line 1698 of file class.ilTree.php.
References isSaved().
{
return $this->isSaved($a_node_id);
}
Here is the call graph for this function:
| ilTree::isGrandChild | ( | $ | a_startnode_id, | |
| $ | a_querynode_id | |||
| ) |
checks if a node is in the path of an other node public
- Parameters:
-
integer object id of start node integer object id of query node
- Returns:
- integer number of entries
Definition at line 1461 of file class.ilTree.php.
{
if (!isset($a_startnode_id) or !isset($a_querynode_id))
{
return false;
// No raise error, since it is a already a check function
#$this->ilErr->raiseError(get_class($this)."::isGrandChild(): Missing parameter! startnode: ".$a_startnode_id." querynode: ".
# $a_querynode_id,$this->ilErr->WARNING);
}
$q = "SELECT * FROM ".$this->table_tree." s,".$this->table_tree." v ".
"WHERE s.child = '".$a_startnode_id."' ".
"AND v.child = '".$a_querynode_id."' ".
"AND s.".$this->tree_pk." = '".$this->tree_id."' ".
"AND v.".$this->tree_pk." = '".$this->tree_id."' ".
"AND v.lft BETWEEN s.lft AND s.rgt ".
"AND v.rgt BETWEEN s.lft AND s.rgt";
$r = $this->ilDB->query($q);
return $r->numRows();
}
| ilTree::isInTree | ( | $ | a_node_id | ) |
get all information of a node.
get data of a specific node from tree and object_data public
- Parameters:
-
integer node id
- Returns:
- boolean true, if node id is in tree
Definition at line 1383 of file class.ilTree.php.
Referenced by checkForParentType(), and insertNode().
{
if (!isset($a_node_id))
{
return false;
#$this->ilErr->raiseError(get_class($this)."::getNodeData(): No node_id given! ",$this->ilErr->WARNING);
}
// is in tree cache
if ($this->use_cache && isset($this->in_tree_cache[$a_node_id]))
{
//echo "<br>in_tree_hit";
return $this->in_tree_cache[$a_node_id];
}
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE ".$this->table_tree.".child = ".$this->ilDB->quote($a_node_id)." ".
"AND ".$this->table_tree.".".$this->tree_pk." = '".$this->tree_id."'";
$r = $this->ilDB->query($q);
if ($r->numRows() > 0)
{
$this->in_tree_cache[$a_node_id] = true;
return true;
}
else
{
$this->in_tree_cache[$a_node_id] = false;
return false;
}
}
Here is the caller graph for this function:
| ilTree::isSaved | ( | $ | a_node_id | ) |
check if node is saved
Definition at line 1706 of file class.ilTree.php.
Referenced by isDeleted().
{
// is saved cache
if ($this->use_cache && isset($this->is_saved_cache[$a_node_id]))
{
//echo "<br>issavedhit";
return $this->is_saved_cache[$a_node_id];
}
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE child = '".$a_node_id."'";
$s = $this->ilDB->query($q);
$r = $s->fetchRow(DB_FETCHMODE_ASSOC);
if ($r[$this->tree_pk] < 0)
{
$this->is_saved_cache[$a_node_id] = true;
return true;
}
else
{
$this->is_saved_cache[$a_node_id] = false;
return false;
}
}
Here is the caller graph for this function:
| ilTree::moveSubTreeAlex | ( | $ | a_source_id, | |
| $ | a_target_id | |||
| ) |
public
DO NOT USE THIS FUNCTION YET. It is a proposal
Definition at line 2103 of file class.ilTree.php.
{
// check if both IDs are > 0
if($a_source_id <= 0 or $a_target_id <= 0)
{
$message = sprintf('%s::insertNode(): Invalid parameters! $a_source_id: %s $a_target_id: %s',
get_class($this),
$a_source_id,
$a_target_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
}
| ilTree::moveTree | ( | $ | a_source_id, | |
| $ | a_target_id, | |||
| $ | a_location = IL_LAST_NODE | |||
| ) |
Move Tree Implementation.
public
- Parameters:
-
int source ref_id int target ref_id int location IL_LAST_NODE or IL_FIRST_NODE (IL_FIRST_NODE not implemented yet)
DO NOT USE THIS FUNCTION YET. It is a proposal
Definition at line 2257 of file class.ilTree.php.
References $res, __isMainTree(), ilDBx::_lockTables(), and ilDBx::_unlockTables().
{
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE'));
}
// Receive node infos for source and target
$query = "SELECT * FROM ".$this->table_tree." ".
"WHERE (child = ".$this->ilDB->quote($a_source_id)." ".
"OR child = ".$this->ilDB->quote($a_target_id).") ".
"AND tree = ".$this->ilDB->quote($this->tree_id);
$res = $this->ilDB->query($query);
#var_dump("<pre>",$query,"<pre>");
// Check in tree
if($res->numRows() != 2)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->log->write(__METHOD__.' Objects not found in tree!',$this->log->FATAL);
$this->ilErr->raiseError('Error moving node',$this->ilErr->WARNING);
}
while($row = $res->fetchRow(DB_FETCHMODE_OBJECT))
{
if($row->child == $a_source_id)
{
$source_lft = $row->lft;
$source_rgt = $row->rgt;
$source_depth = $row->depth;
$source_parent = $row->parent;
}
else
{
$target_lft = $row->lft;
$target_rgt = $row->rgt;
$target_depth = $row->depth;
}
}
#var_dump("<pre>",$source_lft,$source_rgt,$source_depth,$target_lft,$target_rgt,$target_depth,"<pre>");
// Check target not child of source
if($target_lft >= $source_lft and $target_rgt <= $source_rgt)
{
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
$this->log->write(__METHOD__.' Target is child of source',$this->log->FATAL);
$this->ilErr->raiseError('Error moving node',$this->ilErr->WARNING);
}
// Now spread the tree at the target location. After this update the table should be still in a consistent state.
// implementation for IL_LAST_NODE
$spread_diff = $source_rgt - $source_lft + 1;
#var_dump("<pre>","SPREAD_DIFF: ",$spread_diff,"<pre>");
$query = "UPDATE ".$this->table_tree ." SET ".
"lft = CASE ".
"WHEN lft > ".$this->ilDB->quote($target_rgt)." ".
"THEN lft + ".$this->ilDB->quote($spread_diff)." ".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt >= ".$this->ilDB->quote($target_rgt)." ".
"THEN rgt + ".$this->ilDB->quote($spread_diff)." ".
"ELSE rgt ".
"END ".
"WHERE tree = ".$this->ilDB->quote($this->tree_id);
#var_dump("<pre>",$query,"<pre>");
$res = $this->ilDB->query($query);
// Ok, maybe the source node has been updated, too.
// Check this:
if($source_lft > $target_rgt)
{
$where_offset = $spread_diff;
$move_diff = $target_rgt - $source_lft - $spread_diff;
}
else
{
$where_offset = 0;
$move_diff = $target_rgt - $source_lft;
}
$depth_diff = $target_depth - $source_depth + 1;
// Update source subtree:
$query = "UPDATE ".$this->table_tree ." SET ".
"parent = CASE ".
"WHEN parent = ".$this->ilDB->quote($source_parent)." ".
"THEN ".$this->ilDB->quote($a_target_id)." ".
"ELSE parent ".
"END, ".
"rgt = rgt + ".$this->ilDB->quote($move_diff).", ".
"lft = lft + ".$this->ilDB->quote($move_diff).", ".
"depth = depth + ".$this->ilDB->quote($depth_diff)." ".
"WHERE lft >= ".$this->ilDB->quote(($source_lft + $where_offset))." ".
"AND rgt <= ".$this->ilDB->quote(($source_rgt + $where_offset))." ".
"AND tree = ".$this->ilDB->quote($this->tree_id);
#var_dump("<pre>",$query,"<pre>");
$res = $this->ilDB->query($query);
// done: close old gap
$query = "UPDATE ".$this->table_tree ." SET ".
"lft = CASE ".
"WHEN lft >= ".$this->ilDB->quote(($source_lft + $where_offset))." ".
"THEN lft - ".$this->ilDB->quote($spread_diff)." ".
"ELSE lft ".
"END, ".
"rgt = CASE ".
"WHEN rgt >= ".$this->ilDB->quote(($source_rgt + $where_offset))." ".
"THEN rgt - ".$this->ilDB->quote($spread_diff)." ".
"ELSE rgt ".
"END ".
"WHERE tree = ".$this->tree_id;
#var_dump("<pre>",$query,"</pre>");
$res = $this->ilDB->query($query);
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
return true;
}
Here is the call graph for this function:
| ilTree::readRootId | ( | ) |
read root id from database
- Parameters:
-
root_id public
- Returns:
- int new root id
Definition at line 1843 of file class.ilTree.php.
{
$query = "SELECT child FROM $this->table_tree ".
"WHERE parent = '0'".
"AND ".$this->tree_pk." = '".$this->tree_id."'";
$row = $this->ilDB->getRow($query,DB_FETCHMODE_OBJECT);
$this->root_id = $row->child;
return $this->root_id;
}
| ilTree::removeTree | ( | $ | a_tree_id | ) |
remove an existing tree
- Parameters:
-
integer a_tree_id: tree to be removed
- Returns:
- boolean true on success public
Definition at line 1577 of file class.ilTree.php.
References __isMainTree().
{
// OPERATION NOT ALLOWED ON MAIN TREE
if($this->__isMainTree())
{
$message = sprintf('%s::removeTree(): Operation not allowed on main tree! $a_tree_if: %s',
get_class($this),
$a_tree_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
if (!$a_tree_id)
{
$this->ilErr->raiseError(get_class($this)."::removeTree(): No tree_id given! Action aborted",$this->ilErr->MESSAGE);
}
$q = "DELETE FROM ".$this->table_tree." WHERE ".$this->tree_pk." = '".$a_tree_id."'";
$this->ilDB->query($q);
return true;
}
Here is the call graph for this function:
| ilTree::renumber | ( | $ | node_id = 1, |
|
| $ | i = 1 | |||
| ) |
Wrapper for renumber.
This method locks the table tree (recursive) public
- Parameters:
-
integer node_id where to start (usually the root node) integer first left value of start node (usually 1)
- Returns:
- integer current left value of recursive call
Definition at line 1984 of file class.ilTree.php.
References __isMainTree(), __renumber(), ilDBx::_lockTables(), and ilDBx::_unlockTables().
{
// LOCKED ###################################
if($this->__isMainTree())
{
ilDBx::_lockTables(array($this->table_tree => 'WRITE',
$this->table_obj_data => 'WRITE',
$this->table_obj_reference => 'WRITE',
'object_translation' => 'WRITE'));
}
$return = $this->__renumber($node_id,$i);
if($this->__isMainTree())
{
ilDBx::_unlockTables();
}
// LOCKED ###################################
return $return;
}
Here is the call graph for this function:
| ilTree::saveSubTree | ( | $ | a_node_id, | |
| $ | a_set_deleted = false | |||
| ) |
save subtree: delete a subtree (defined by node_id) to a new tree with $this->tree_id -node_id.
This is neccessary for undelete functionality
- Parameters:
-
integer node_id
- Returns:
- integer public
Definition at line 1606 of file class.ilTree.php.
References $res, __isMainTree(), ilDBx::_lockTables(), and ilObject::_setDeletedDate().
{
global $ilDB;
if (!$a_node_id)
{
$message = sprintf('%s::saveSubTree(): No valid parameter given! $a_node_id: %s',
get_class($this),
$a_node_id);
$this->log->write($message,$this->log->FATAL);
$this->ilErr->raiseError($message,$this->ilErr->WARNING);
}
// LOCKED ###############################################
if($this->__isMainTree())
{
ilDBx::_lockTables(array('tree' => 'WRITE',
'object_reference' => 'WRITE'));
}
// GET LEFT AND RIGHT VALUE
$q = "SELECT * FROM ".$this->table_tree." ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."' ".
"AND child = '".$a_node_id."' ";
$r = $this->ilDB->query($q);
while($row = $r->fetchRow(DB_FETCHMODE_OBJECT))
{
$lft = $row->lft;
$rgt = $row->rgt;
}
// GET ALL SUBNODES
$q = "SELECT child FROM ".$this->table_tree." ".
"WHERE ".$this->tree_pk." = '".$this->tree_id."' ".
"AND lft BETWEEN '".$lft."' AND '".$rgt."'";
$r = $this->ilDB->query($q);
$subnodes = array();
while($row = $r->fetchRow(DB_FETCHMODE_ASSOC))
{
$subnodes[] = $row['child'];
}
if(!count($subnodes))
{
// possibly already deleted
// Unlock locked tables before returning
if($this->__isMainTree())
{
ilDBX::_unlockTables();
}
return false;
}
// SAVE SUBTREE
foreach($subnodes as $child)
{
#$q = "INSERT INTO ".$this->table_tree." ".
# "VALUES ('".-$a_node_id."','".$node["child"]."','".$node["parent"]."','".
# $node["lft"]."','".$node["rgt"]."','".$node["depth"]."')";
#$r = $this->ilDB->query($q);
// set node as deleted
if ($a_set_deleted)
{
ilObject::_setDeletedDate($child);
}
}
// Set the nodes deleted (negative tree id)
$query = "UPDATE ".$this->table_tree." ".
"SET tree = ".$ilDB->quote(-$a_node_id)." ".
"WHERE ".$this->tree_pk." = ".$ilDB->quote($this->tree_id)." ".
"AND lft BETWEEN ".$ilDB->quote($lft)." AND ".$ilDB->quote($rgt)." ";
$res = $ilDB->query($query);
if($this->__isMainTree())
{
ilDBX::_unlockTables();
}
// LOCKED ###############################################
return true;
}
Here is the call graph for this function:
| ilTree::setObjectTablePK | ( | $ | a_column_name | ) |
set column containing primary key in object table public
- Parameters:
-
string column name
- Returns:
- boolean true, when successfully set
Definition at line 278 of file class.ilTree.php.
{
if (!isset($a_column_name))
{
$this->ilErr->raiseError(get_class($this)."::setObjectTablePK(): No column name given!",$this->ilErr->WARNING);
}
$this->obj_pk = $a_column_name;
return true;
}
| ilTree::setReferenceTablePK | ( | $ | a_column_name | ) |
set column containing primary key in reference table public
- Parameters:
-
string column name
- Returns:
- boolean true, when successfully set
Definition at line 261 of file class.ilTree.php.
{
if (!isset($a_column_name))
{
$this->ilErr->raiseError(get_class($this)."::setReferenceTablePK(): No column name given!",$this->ilErr->WARNING);
}
$this->ref_pk = $a_column_name;
return true;
}
| ilTree::setRootId | ( | $ | a_root_id | ) |
Definition at line 1863 of file class.ilTree.php.
{
$this->root_id = $a_root_id;
}
| ilTree::setTableNames | ( | $ | a_table_tree, | |
| $ | a_table_obj_data, | |||
| $ | a_table_obj_reference = "" | |||
| ) |
set table names The primary key of the table containing your object_data must be 'obj_id' You may use a reference table.
If no reference table is specified the given tree table is directly joined with the given object_data table. The primary key in object_data table and its foreign key in reference table must have the same name!
- Parameters:
-
string table name of tree table string table name of object_data table string table name of object_reference table (optional) public
- Returns:
- boolean
Definition at line 240 of file class.ilTree.php.
Referenced by ilAICCTree::ilAICCTree(), and ilSCORMTree::ilSCORMTree().
{
if (!isset($a_table_tree) or !isset($a_table_obj_data))
{
$this->ilErr->raiseError(get_class($this)."::setTableNames(): Missing parameter! ".
"tree table: ".$a_table_tree." object data table: ".$a_table_obj_data,$this->ilErr->WARNING);
}
$this->table_tree = $a_table_tree;
$this->table_obj_data = $a_table_obj_data;
$this->table_obj_reference = $a_table_obj_reference;
return true;
}
Here is the caller graph for this function:
| ilTree::setTreeId | ( | $ | a_tree_id | ) |
set tree id public
- Returns:
- integer tree id
Definition at line 1883 of file class.ilTree.php.
{
$this->tree_id = $a_tree_id;
}
| ilTree::setTreeTablePK | ( | $ | a_column_name | ) |
set column containing primary key in tree table public
- Parameters:
-
string column name
- Returns:
- boolean true, when successfully set
Definition at line 295 of file class.ilTree.php.
Referenced by ilAICCTree::ilAICCTree(), and ilSCORMTree::ilSCORMTree().
{
if (!isset($a_column_name))
{
$this->ilErr->raiseError(get_class($this)."::setTreeTablePK(): No column name given!",$this->ilErr->WARNING);
}
$this->tree_pk = $a_column_name;
return true;
}
Here is the caller graph for this function:
| ilTree::useCache | ( | $ | a_use = true |
) |
Use Cache (usually not activated).
Definition at line 201 of file class.ilTree.php.
{
$this->use_cache = $a_use;
}
Field Documentation
| ilTree::$gap |
Definition at line 138 of file class.ilTree.php.
| ilTree::$ilias |
Definition at line 48 of file class.ilTree.php.
Referenced by ilTree().
| ilTree::$log |
Definition at line 56 of file class.ilTree.php.
Referenced by getPathIdsUsingAdjacencyMap().
| ilTree::$obj_pk |
Definition at line 105 of file class.ilTree.php.
| ilTree::$ref_pk |
Definition at line 98 of file class.ilTree.php.
| ilTree::$root_id |
Definition at line 63 of file class.ilTree.php.
| ilTree::$table_obj_data |
Definition at line 84 of file class.ilTree.php.
| ilTree::$table_obj_reference |
Definition at line 91 of file class.ilTree.php.
| ilTree::$table_tree |
Definition at line 77 of file class.ilTree.php.
| ilTree::$tree_id |
Definition at line 70 of file class.ilTree.php.
| ilTree::$tree_pk |
Definition at line 112 of file class.ilTree.php.
The documentation for this class was generated from the following file:
- Services/Tree/classes/class.ilTree.php
