PHPTree - php quickly generates unlimited classifications_php skills

Tree data is often used in development, such as infinite multi-level classification, which is a typical tree structure. The algorithm here uses recursive thinking. In order to simplify the development process, I wrote a tool to improve development efficiency. Friends in need can refer to

It is PHPTree.

git address: https://git.oschina.net/jiusem/PHPTree.git

or download from Script Home http://www.jb51.net/codes/606002. html

The simplest example:

<?php 
require(&#39;PHPTree.class.php&#39;);

//原始数据, 从数据库读出
$data = array(
	array(
		&#39;id&#39;=>1,
		&#39;name&#39;=>&#39;book&#39;,
		&#39;parent_id&#39;=>0
	),
	array(
		&#39;id&#39;=>2,
		&#39;name&#39;=>&#39;music&#39;,
		&#39;parent_id&#39;=>0
	),
	array(
		&#39;id&#39;=>3,
		&#39;name&#39;=>&#39;book1&#39;,
		&#39;parent_id&#39;=>1
	),
	array(
		&#39;id&#39;=>4,
		&#39;name&#39;=>&#39;book2&#39;,
		&#39;parent_id&#39;=>3
	)
);

$r = PHPTree::makeTree($data);
echo json_encode($r);

?>

Output:

[
                                                                                               "id": 1,
"name": "book",
"parent_id": 0,
"children": [
                                                                                                                                                         "expanded": false,
"children": [
                                                                                                                                         "parent_id": 3,
"leaf": true
#             }
                                                     : 0,
"leaf": true
       }
]



The generated data is a tree structure, which can be used in conjunction with front-end frameworks such as ExtJS. Git contains a demo of ExtJS, which you can refer to.

Demonstration:




If you don’t need to use the front-end framework and just use HTML output, you can use the following method:

$r = PHPTree::makeTreeForHtml($data);


Get a one-dimensional array, use the level field to identify the level of classification:

array(
 array(
  'id'=>1,
  'name'=>'用户管理',
  'parent_id'=>0,
  'level'=>0 //一级分类
 ),
 array(
  'id'=>1,
  'name'=>'用户列表',
  'parent_id'=>1,
  'level'=>1 //二级分类
 )
 ....
);

The output is select tag:

echo &#39;<h1>PHPTree树形结构</h1>&#39;;
echo &#39;<select style="width:300px;">&#39;;
foreach($r as $item){
	echo &#39;<option>&#39;;
	//根据所在的层次缩进
	echo str_repeat(&#39;......&#39;,$item[&#39;level&#39;]);
	echo $item[&#39;name&#39;];
	echo &#39;</option>&#39;;
}
echo &#39;</select>&#39;;

Demo:

included in git A demo that outputs HTML, you can refer to it.

Regarding the design of the database, you only need to ensure that the id and parent_id fields are included. Other fields can be added by yourself without affecting data generation. parent_id is the parent ID. If it is a first-level classification, set it to 0. Of course, fields are also configurable. Please read on, I will introduce some advanced usage methods.

Expand child nodes:

PHPTree::makeTree( $data, array(
 'expanded' => true
));

输出的数据为：

[
{
id:1,
name:'book1',
expanded:true,//展开子节点
children:[
...
]
}
]

自定义主键和父键：

//数据库读出
$data = array(
 array(
  'order_id'=>1, //主键
  'name'=>'book1',
  'pid'=>0, //父键
  ...
 )
);
PHPTree::makeTree( $data, array(
 'primary_key' => 'order_id',
 'parent_key' => 'pid'
));

输出的数据为：

[
{
order_id:1,
name:'book1',
pid:0,
...
}
]

makeTreeForHtml 方法也支持配置主键和父键。

还有其他字段也可以自定义，但下面这些参数仅支持 makeTree 方法：

$r = PHPTree::makeTree($data, array(
 'expanded_key' => 'expanded',
 'children_key' => 'children',
 'leaf_key'  => 'leaf'
));

默认，这些字段的配置都是以ExtJS为参考的，如果你使用zTree框架的话，这些字段就需要重新配置了。

zTree 是一款强大的国产树形框架，它还支持 简单JSON格式，是一维数据格式，实际上就不需要用到PHPTree了。当然，PHPTree输出的数据层次感清晰，zTree也是支持的。

相关推荐：

php递归实现无限级分类的开发过程及示例代码

php 实现无限级分类的三种方式

php无限级分类实现方法分析

The above is the detailed content of PHPTree - php quickly generates unlimited classifications_php skills. For more information, please follow other related articles on the PHP Chinese website!