频道导航

表格展示无限级分类(PHP版)

2018-12-30 PHP 前端之家

前端之家收集整理的这篇文章主要介绍了表格展示无限级分类(PHP版)，前端之家小编觉得挺不错的，现在分享给大家，也给大家做个参考。

TreeTable通过对单元格的行合并和列合并实现了无限层级也能较好的展示层级架构。
1.构建ID/PID/NAME的数组，后期可通过@R_301_457@生成的动态数据。Tree算法请点击
<div class="codetitle"><a style="CURSOR: pointer" data="48240" class="copybut" id="copybut48240" onclick="doCopy('code48240')"> 代码如下:

<div class="codebody" id="code48240">
array(
1 => array('id'=>'1','parentid'=>0,'name'=>'一级栏目一'),
2 => array('id'=>'2','name'=>'一级栏目二'),
3 => array('id'=>'3','parentid'=>1,'name'=>'二级栏目一'),
4 => array('id'=>'4','name'=>'二级栏目二'),
5 => array('id'=>'5','parentid'=>2,'name'=>'二级栏目三'),
6 => array('id'=>'6','parentid'=>3,'name'=>'三级栏目一'),
7 => array('id'=>'7','name'=>'三级栏目二')
)

　2. 导入TreeTable类库。
<div class="codetitle"><a style="CURSOR: pointer" data="39954" class="copybut" id="copybut39954" onclick="doCopy('code39954')"> 代码如下:

<div class="codebody" id="code39954">
import('@.ORG.Util.TableTree'); //ThinkPHP导入方法

3. 生成TreeTable HTML代码
<div class="codetitle"><a style="CURSOR: pointer" data="17928" class="copybut" id="copybut17928" onclick="doCopy('code17928')"> 代码如下:

<div class="codebody" id="code17928">
$treeTable->init($treearr);
echo $treeTable->get_treetable();

注意：get_treetable()只生产表体部门，请自行构建。
完整代码
<div class="codetitle"><a style="CURSOR: pointer" data="57448" class="copybut" id="copybut57448" onclick="doCopy('code57448')"> 代码如下:

<div class="codebody" id="code57448">
<?PHP
/
File name: TreeTable.class.PHP
Author: run.gao 312854458@qq.com Date: 2012-07-24 23:22 GMT+8
Description: 通用的表格无限级分类
*/
/
表格展示无限分类是将无线分类已表格的形式表现出来，更好的能体现出分类的所属关系
使用方法：
1. 实例化分类
$treeTable = new TreeTable();
2. 初始化分类，$treearr必须是一个多维数组且包含 id,parentid,name字段
$treeTable->init($treearr);
3. 获取无限分类 HTML代码
echo $treeTable->get_treetable();
/
class TreeTable {
/
生成树型结构所需要的2维数组
@var array
*/
public $arr = array();
/
表格列数
@var int
*/
public $columns = 0;
/
表格行数
@var int
*/
public $rows = 0;
/
初始化TreeTable数据
@param array 2维数组
array(
1 => array('id'=>'1','name'=>'三级栏目二')
)
/
public function init($arr=array()){
if(!is_array($arr)) return false;
foreach ($arr as $k=>$v) {
$this->arr[$v['id']] = $v;
}
foreach ($this->arr as $k => $v){
$this->arr[$k]['column'] = $this->get_level($v['id']); // Y轴位置
$this->arr[$k]['arrchildid'] = $this->get_arrchildid($v['id']); // 所有子节点
$this->arr[$k]['arrparentid'] = $this->get_arrparentid($v['id']); // 所有父节点
$this->arr[$k]['child_bottom_num'] = $this->get_child_count($v['id']); // 所有底层元素节点
}
$this->columns = $this->get_columns(); // 总行数
$this->rows = $this->get_rows(); // 总列数
// 按照arrparentid和id号进行排序
$this->sort_arr();
foreach ($this->arr as $k => $v){
$this->arr[$k]['row'] = $this->get_row_location($v['id']); // X轴位置
$this->arr[$k]['rowspan'] = $v['child_bottom_num']; // 行合并数
$this->arr[$k]['colspan'] = $v['child_bottom_num'] == 0 ? $this->columns - $v['column'] + 1 : 0; //列合并数
}
return $this->get_tree_arr();
}
/
获取数组
*/
public function get_tree_arr(){
return is_array($this->arr) ? $this->arr : false;
}
/
按arrparentid/id号依次重新排序数组
*/
public function sort_arr(){
// 要进行排序的字段
foreach ($this->arr as $k => $v){
$order_pid_arr[$k] = $v['arrparentid'];
$order_iscost[] = $v['sort'];
$order_id_arr[$k] = $v['id'];
}
// 先根据arrparentid排序，再根据排序,id号排序
array_multisort(
$order_pid_arr,SORT_ASC,SORT_STRING,
$order_iscost,SORT_DESC,SORT_NUMERIC,
$order_id_arr,
$this->arr);
// 获取每一个节点层次
for ($column = 1; $column <= $this->columns; $column++) {
$row_level = 0;
foreach ($this->arr as $key => $node){
if ($node['column'] == $column){
$row_level++;
$this->arr[$key]['column_level'] = $row_level;
}
}
}
// 重新计算以ID作为键名
foreach ($this->arr as $k=>$v) {
$arr[$v['id']] = $v;
}
$this->arr = $arr;
}
/
得到父级数组
@param int
@return array
/
public function get_parent($myid){
$newarr = array();
if(!isset($this->arr[$myid])) return false;
$pid = $this->arr[$myid]['parentid'];
$pid = $this->arr[$pid]['parentid'];
if(is_array($this->arr)){
foreach($this->arr as $id => $a){
if($a['parentid'] == $pid) $newarr[$id] = $a;
}
}
return $newarr;
}
/
得到子级数组
@param int
@return array
/
public function get_child($myid){
$a = $newarr = array();
if(is_array($this->arr)){
foreach($this->arr as $id => $a){
if($a['parentid'] == $myid) $newarr[$id] = $a;
}
}
return $newarr ? $newarr : false;
}
/
获取当前节点所在的层级
@param $myid 当前节点ID号
/
public function get_level($myid,$init = true){
static $level = 1;
if($init) $level = 1;
if ($this->arr[$myid]['parentid']) {
$level++;
$this->get_level($this->arr[$myid]['parentid'],false);
}
return $level;
}
/
获取当前节点所有底层节点（没有子节点的节点）的数量
@param $myid 节点ID号
@param $init 第一次加载将情况static变量
*/
public function get_child_count($myid,$init = true){
static $count = 0;
if($init) $count = 0;
if(!$this->get_child($myid) && $init) return 0;
if($childarr = $this->get_child($myid)){
foreach ($childarr as $v){
$this->get_child_count($v['id'],false);
}
}else{
$count++;
}
return $count;
}
/
获取节点所有子节点ID号
@param $catid 节点ID号
@param $init 第一次加载将情况static初始化
*/
public function get_arrchildid($myid,$init = true) {
static $childid;
if($init) $childid = '';
if(!is_array($this->arr)) return false;
foreach($this->arr as $id => $a){
if($a['parentid'] == $myid) {
$childid = $childid ? $childid.','.$a['id'] : $a['id'];
$this->get_arrchildid($a['id'],false);
}
}
return $childid ;
}
/
获取该节点所有父节点ID号
@param $id 节点ID号
/
public function get_arrparentid($id,$arrparentid = '') {
if(!is_array($this->arr)) return false;
$parentid = $this->arr[$id]['parentid'];
if($parentid > 0) $arrparentid = $arrparentid ? $parentid.','.$arrparentid : $parentid;
if($parentid) $arrparentid = $this->get_arrparentid($parentid,$arrparentid);
return $arrparentid;
}
/
获取节点所在地行定位
@param $myid 节点ID号
*/
public function get_row_location($myid){
$nodearr = $this->arr;
// 获取每一个节点所在行的位置
foreach ($nodearr as $key => $node){
if($myid == $node['id']) {
$node_row_count = 0;
$arrparentid = explode(',',$node['arrparentid']);
// 所有父节点小于当前节点层次的底层节点等于0的元素
foreach ($arrparentid as $pid){
foreach ($nodearr as $node_row){
if($node_row['column'] == $nodearr[$pid]['column'] && $nodearr[$pid]['column_level'] > $node_row['column_level'] && $node_row['child_bottom_num'] == 0){
$node_row_count ++;
}
}
}
// 所有当前节点并且节点层次（rowid_level）小于当前节点层次的个数
foreach ($nodearr as $node_row){
if($node['column'] == $node_row['column'] && $node_row['column_level'] < $node['column_level']){
$node_row_count += $node_row['child_bottom_num'] ? $node_row['child_bottom_num'] : 1;
}
}
$node_row_count++;
break;
}
}
return $node_row_count;
}
/
获取表格的行数
*/
public function get_rows(){
$row = 0;
foreach ($this->arr as $key => $node){
if($node['child_bottom_num'] == 0){
$rows++; // 总行数
}
}
return $rows;
}
/*
获取表格的列数
/
public function get_columns(){
$columns = 0 ;
foreach ($this->arr as $key => $node){
if($node['column'] > $columns){
$columns = $node['column']; // 总列数
}
}
return $columns;
}
/*
获取分类的表格展现形式(不包含表头)
/
public function get_treetable(){
$table_string = '';
for($row = 1; $row <= $this->rows; $row++){
$table_string .= "\r\t<tr>";
foreach ($this->arr as $v){
if($v['row'] == $row){
$rowspan = $v['rowspan'] ? "rowspan='{$v['rowspan']}'" : '';
$colspan = $v['colspan'] ? "colspan='{$v['colspan']}'" : '';
$table_string .= "\r\t\t<td {$rowspan} {$colspan}>
{$v['name']}
</td>";
}
}
$table_string .= "\r\t</tr>";
}
return $table_string;
}
}
?>

原文链接：https://www.f2er.com/php/27051.html

无限级分类