php实现将数据库查询的结果生成树形列表

这篇文章主要介绍了php从数据库查询结果生成树形列表的方法,涉及php操作html元素生成树形列表的技巧,非常具有实用价值,需要的朋友可以参考下

本文实例讲述了php从数据库查询结果生成树形列表的方法。具体分析如下：

本代码可以从数据库读取数据生成一个类似于windows的资源管理器的树形列表

<?php
/* Here are the database definitions (for Solid) that i use in this code.
 * It should not be hard to adapt it to another database.
 */
/*
CREATE TABLE dirent_types (
 id INTEGER NOT NULL,
 icon VARCHAR(50),
 name VARCHAR(50),
 PRIMARY KEY(id)
);
INSERT INTO dirent_types VALUES(1, &#39;folderclosed&#39;, &#39;Directory&#39;);
INSERT INTO dirent_types VALUES(2, &#39;document&#39;, &#39;File&#39;);
CREATE TABLE directory (
 id INTEGER NOT NULL,
 parent INTEGER REFERENCES directory(id),
 name VARCHAR(200),
 icon VARCHAR(50),
 type INTEGER REFERENCES dirent_types(id),
 url VARCHAR(200),
 PRIMARY KEY(id)
);
DROP INDEX directory_idx;
CREATE UNIQUE INDEX directory_idx ON directory(parent, name);
CREATE SEQUENCE dirent_id;
"CREATE PROCEDURE insert_dir_entry
 (name VARCHAR, parent INTEGER, type INTEGER)
 RETURNS(id INTEGER)
BEGIN
 EXEC SQL WHENEVER SQLERROR ABORT;
 EXEC SEQUENCE dirent_id.NEXT INTO id;
 EXEC SQL PREPARE c_insert
 INSERT INTO directory
 (id, parent, type, name)
 VALUES(?, ?, ?, ?);
 EXEC SQL EXECUTE c_insert USING (id, parent, type, name);
 EXEC SQL DROP c_insert;
END";
CALL insert_dir_entry(&#39;My Computer&#39;, NULL, 1);
CALL insert_dir_entry(&#39;Network Neighbourhood&#39;, NULL, 1);
CALL insert_dir_entry(&#39;lucifer.guardian.no&#39;, 2, 1);
CALL insert_dir_entry(&#39;rafael.guardian.no&#39;, 2, 1);
CALL insert_dir_entry(&#39;uriel.guardian.no&#39;, 2, 1);
CALL insert_dir_entry(&#39;Control Panel&#39;, NULL, 1);
CALL insert_dir_entry(&#39;Services&#39;, 6, 1);
CALL insert_dir_entry(&#39;Apache&#39;, 7, 2);
CALL insert_dir_entry(&#39;Solid Server 2.2&#39;, 7, 2);
*/
function icon($icon, $name = &#39;&#39;, $width = 0, $height = 0) {
 global $DOCUMENT_ROOT;
 $icon_loc = &#39;/pics/menu&#39;;
 $file = "$DOCUMENT_ROOT$icon_loc/$icon.gif";
 if (!$width || !$height) {
 $iconinfo = getimagesize($file);
 if (!$width) {
 $width = $iconinfo[0];
 }
 if (!$height) {
 $height = $iconinfo[1];
 }
 }
 printf( &#39;<img%s border=0 align=top src="/pics/menu/%s.gif" &#39;.
 &#39;width="%d" height="%d">&#39;, $name ? " name=\"$name\"" : &#39;&#39;,
 $icon, $width, $height);
}
function display_directory($parent,$showdepth=0,$ancestors=false){
 global $child_nodes, $node_data, $last_child;
 reset($child_nodes[$parent]);
 $size = sizeof($child_nodes[$parent]);
 $lastindex = $size - 1;
 if (!$ancestors) {
 $ancestors = array();
 }
 $depth = sizeof($ancestors);
 printf( &#39;<p id="node_%d" class="dirEntry" visibility="%s">&#39;,
 $parent, $showdepth > 0 ? &#39;show&#39; : &#39;hide&#39;);
 while (list($index, $node) = each($child_nodes[$parent])) {
 for ($i = 0; $i < $depth; $i++) {
 $up_parent = (int)$node_data[$ancestors[$i]][ &#39;parent&#39;];
 $last_node_on_generation = $last_child[$up_parent];
 $uptree_node_on_generation = $ancestors[$i];
 if ($last_node_on_generation == $uptree_node_on_generation) {
 icon( "blank");
 } else {
 icon( "line");
 }
 }
 if ($child_nodes[$node]) {
 // has children, i.e. it is a folder
 $conn_icon = "plus";
 $expand = true;
 } else {
 $conn_icon = "join";
 $expand = false;
 }
 if ($index == $lastindex) {
 $conn_icon .= "bottom";
 } elseif ($depth == 0 && $index == 0) {
 $conn_icon .= "top";
 }
 if ($expand) {
 printf( "<a href=\"javascript:document.layers[&#39;node_%d&#39;].visibility=&#39;show&#39;\">", $node);
 }
 icon($conn_icon, "connImg_$node");
 if ($expand) {
 print( "</a>");
 }
 $icon = $node_data[$node][ &#39;icon&#39;];
 if (!$icon) {
 $type = $node_data[$node][ &#39;type&#39;];
 $icon = $GLOBALS[ &#39;dirent_icons&#39;][$type];
 }
 icon($icon, "nodeImg_$node");
 $name = $node_data[$node][ &#39;name&#39;];
 printf( &#39;?<font size="%d">%s</font><br%c>&#39;, -1, $name, 10);
 if ($child_nodes[$node]) {
 $newdepth = $showdepth;
 if ($newdepth > 0) {
 $newdepth--;
 }
 $new_ancestors = $ancestors;
 $new_ancestors[] = $node;
 display_directory($node, $newdepth, $new_ancestors);
 }
 }
 print( "</p\n>");
}
function setup_directory($parent, $maxdepth)
{
 global $dirent_icons, $child_nodes, $node_data, $last_child;
 $dirent_icons = sql_assoc(&#39;SELECT id,icon FROM dirent_types&#39;);
 $query = &#39;SELECT id,parent,type,icon,name &#39;.
 &#39;FROM directory &#39;.
 &#39;ORDER BY parent,name&#39;;
 $child_nodes = array();
 $node_data = array();
 $res = sql($query);
 while (list($id,$parent,$type,$icon,$name)=db_fetch_row($res)){
 $child_nodes[(int)$parent][] = $id;
 $node_data[$id] = array( &#39;id&#39; => $id,
 &#39;parent&#39; => $parent,
 &#39;type&#39; => $type,
 &#39;icon&#39; => $icon,
 &#39;name&#39; => $name);
 $last_child[(int)$parent] = $id;
 }
}
?>

总结：以上就是本篇文的全部内容，希望能对大家的学习有所帮助。

相关推荐：

php针对错误处理的常用技巧

php结合html5的websocket通讯的使用方法

php图片上传及javascript插件的使用

Atas ialah kandungan terperinci php实现将数据库查询的结果生成树形列表. Untuk maklumat lanjut, sila ikut artikel berkaitan lain di laman web China PHP!