tree level */ /* tree[x][1] -> item text */ /* tree[x][2] -> item link */ /* tree[x][3] -> link target */ /* tree[x][4] -> last item in subtree */ /*********************************************/ $maxlevel=0; $cnt=0; $p=$_GET['p']; $fd = fopen($treefile, "r"); if ($fd==0) die("treemenu.inc : Unable to open file ".$treefile); while ($buffer = fgets($fd, 4096)) { $tree[$cnt][0]=strspn($buffer,"."); $tmp=rtrim(substr($buffer,$tree[$cnt][0])); $node=explode("|",$tmp); $tree[$cnt][1]=$node[0]; $tree[$cnt][2]=$node[1]; $tree[$cnt][3]=$node[2]; $tree[$cnt][4]=0; if ($tree[$cnt][0] > $maxlevel) $maxlevel=$tree[$cnt][0]; $cnt++; } fclose($fd); //echo "
".print_r($tree,true)."
"; for ($i=0; $i".print_r($expand,true).""; /*********************************************/ /* Find last nodes of subtrees */ /*********************************************/ $lastlevel=$maxlevel; for ($i=count($tree)-1; $i>=0; $i--) { if ( $tree[$i][0] < $lastlevel ) { for ($j=$tree[$i][0]+1; $j <= $maxlevel; $j++) { $levels[$j]=0; } } if ( $levels[$tree[$i][0]]==0 ) { $levels[$tree[$i][0]]=1; $tree[$i][4]=1; } else $tree[$i][4]=0; $lastlevel=$tree[$i][0]; } /*********************************************/ /* Determine visible nodes */ /*********************************************/ // all root nodes are always visible for ($i=0; $i < count($tree); $i++) if ($tree[$i][0]==1) $visible[$i]=1; for ($i=0; $i < count($explevels); $i++) { $n=$explevels[$i]; if ( ($visible[$n]==1) && ($expand[$n]==1) ) { $j=$n+1; while ( $tree[$j][0] > $tree[$n][0] ) { if ($tree[$j][0]==$tree[$n][0]+1) $visible[$j]=1; $j++; } } } /*********************************************/ /* Output nicely formatted tree */ /*********************************************/ for ($i=0; $i<$maxlevel; $i++) $levels[$i]=1; $maxlevel++; echo "\n"; echo ""; for ($i=0; $i<$maxlevel; $i++) echo ""; echo "\n"; $cnt=0; while ($cnt"; /****************************************/ /* vertical lines from higher levels */ /****************************************/ $i=0; while ($i<$tree[$cnt][0]-1) { if ($levels[$i]==1) echo ""; else echo ""; $i++; } /****************************************/ /* corner at end of subtree or t-split */ /****************************************/ if ($tree[$cnt][4]==1) { echo ""; $levels[$tree[$cnt][0]-1]=0; } else { echo ""; $levels[$tree[$cnt][0]-1]=1; } /********************************************/ /* Node (with subtree) or Leaf (no subtree) */ /********************************************/ if ($tree[$cnt+1][0]>$tree[$cnt][0]) { /****************************************/ /* Create expand/collapse parameters */ /****************************************/ $i=0; $params="?p="; while($i"; else echo ""; } else { /*************************/ /* Tree Leaf */ /*************************/ echo ""; } /****************************************/ /* output item text */ /****************************************/ if ($tree[$cnt][2]=="") echo ""; else { if ($tree[$cnt+1][0]>$tree[$cnt][0]) echo ""; else echo ""; } /****************************************/ /* end row */ /****************************************/ echo "\n"; } $cnt++; } echo "
 
".$tree[$cnt][1]."".$tree[$cnt][1]."".$tree[$cnt][1]."
\n"; ?>