* Copyright (C) 2007-2012 Laurent Destailleur * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see . */ /** * \file htdocs/core/lib/treeview.lib.php * \ingroup core * \brief Libraries for tree views */ // ------------------------------- Used by category tree view ----------------- /** * Return if a child id is in descendance of parentid * * @param array $fulltree Full tree. Tree must be an array of records that looks like: * id = id record * id_mere = id record mother * id_children = array of direct child id * label = record label * fullpath = Full path of id * level = Level of record * @param int $parentid Parent id * @param int $childid Child id * @return int 1=Yes, 0=No */ function is_in_subtree($fulltree,$parentid,$childid) { if ($parentid == $childid) return 1; // Get fullpath of parent $fullpathparent=''; foreach($fulltree as $key => $val) { //print $val['id']."-".$section."
"; if ($val['id'] == $parentid) { $fullpathparent=$val['fullpath']; break; } } //print '> parent='.$parentid.' - child='.$childid.' - '.$fullpathparent.'
'; foreach($fulltree as $record) { if ($record['id'] == $childid) { //print $record['fullpath'].'_'.' - '.$fullpathparent.'_'; if (preg_match('/'.$fullpathparent.'_/i',$record['fullpath'].'_')) { //print 'DEL='.$childid; return 1; } } } return 0; } /** * Show indent and picto of a tree line. Return array with information of line. * * @param array &$fulltree Array of entries in correct order * @param string $key Key of entry into fulltree to show picto * @param int $silent Do not output indent and picto, returns only value * @return array array(0 or 1 if at least one of this level after, 0 or 1 if at least one of higher level after, nbofdirinsub, nbofdocinsub) */ function tree_showpad(&$fulltree,$key,$silent=0) { $pos=1; // Loop on each pos, because we will output an img for each pos while ($pos <= $fulltree[$key]['level'] && $fulltree[$key]['level'] > 0) { // Process for column $pos $atleastoneofthislevelafter=0; $nbofdirinsub=0; $nbofdocinsub=0; $found=0; //print 'x'.$key; foreach($fulltree as $key2 => $val2) { //print "x".$pos." ".$key2." ".$found." ".$fulltree[$key2]['level']; if ($found == 1) // We are after the entry to show { if ($fulltree[$key2]['level'] > $pos) { $nbofdirinsub++; if (isset($fulltree[$key2]['cachenbofdoc']) && $fulltree[$key2]['cachenbofdoc'] > 0) $nbofdocinsub+=$fulltree[$key2]['cachenbofdoc']; } if ($fulltree[$key2]['level'] == $pos) { $atleastoneofthislevelafter=1; } if ($fulltree[$key2]['level'] <= $pos) { break; } } if ($key2 == $key) // We found ourself, so now every lower level will be counted { $found=1; } } //print $atleastoneofthislevelafter; if (! $silent) { if ($atleastoneofthislevelafter) { if ($fulltree[$key]['level'] == $pos) print img_picto_common('','treemenu/branch.gif'); else print img_picto_common('','treemenu/line.gif'); } else { if ($fulltree[$key]['level'] == $pos) print img_picto_common('','treemenu/branchbottom.gif'); else print img_picto_common('','treemenu/linebottom.gif'); } } $pos++; } return array($atleastoneofthislevelafter,$nbofdirinsub,$nbofdocinsub); } // ------------------------------- Used by menu editor ----------------- /** * Show an element with correct offset * * @param array $tab Array of element * @param int $rang Level of offset * @return void */ function tree_showline($tab,$rang) { global $conf, $rangLast, $idLast, $menu_handler; // Content of line print '

'; print ' '.$tab['title'].''; print '

'; print ''.img_edit('default',0,'class="menuEdit" id="edit'.$tab['rowid'].'"').' '; print ''.img_edit_add('default',0,'class="menuNew" id="new'.$tab['rowid'].'"').' '; print ''.img_delete('default',0,'class="menuDel" id="del'.$tab['rowid'].'"').' '; print ''.img_picto("Monter","1uparrow").''.img_picto("Descendre","1downarrow").''; print '

'; $rangLast = $rang; $idLast = $tab['rowid']; } /** * Recursive function to output menu tree * * @param array $tab Array of all elements * @param int $pere Array with parent ids ('rowid'=>,'mainmenu'=>,'leftmenu'=>,'fk_mainmenu=>,'fk_leftmenu=>) * @param int $rang Level of element * @return void */ function tree_recur($tab,$pere,$rang) { if (empty($pere['rowid'])) { // Test also done with jstree and dynatree (not able to have inside label) print ''; print '

'; $ulprinted++; } print "\n".'

'; // We shot it with an offset tree_showline($tab[$x],$rang); // And now we search all its sons of lower level tree_recur($tab,$tab[$x],$rang+1); print '

'; } elseif (! empty($tab[$x]['rowid']) && $tab[$x]['fk_menu'] == -1 && $tab[$x]['fk_mainmenu'] == $pere['mainmenu'] && $tab[$x]['fk_leftmenu'] == $pere['leftmenu']) { if (empty($ulprinted) && ! empty($pere['rowid'])) { print ''; $ulprinted++; } print "\n".'

'; // We shot it with an offset tree_showline($tab[$x],$rang); // And now we search all its sons of lower level tree_recur($tab,$tab[$x],$rang+1); print '

'; } } if (! empty($ulprinted) && ! empty($pere['rowid'])) { print '

'."\n"; } if (empty($pere['rowid'])) print ''; } ?>