首页
所有分类
TAGS
文字工具 EMOJI BIBLE
编程 PHP

PHP带节点操作的无限分类实现方法详解

Posted in PHP onNovember 09, 2016

本文实例讲述了PHP带节点操作的无限分类实现方法。分享给大家供大家参考，具体如下：

包含（移动多个节点；移动单个节点；删除多个节点；删除单个节点；新增节点），另附数据库表结构

一、db sql语句

//db used for php无限分类
create table tree(
  id int(10) not null primary key auto_increment,
  name varchar(255) not null,
  lft int(10) not null default 0,
  rgt int(10) not null default 0,
  status int(1) not null default 0,
  index lft (`lft`),
  index rgt (`rgt`),
  index status(`status`)
)charset utf8;
insert into tree value (null,'Food',1,18,0);
insert into tree value (null,'Fruit',2,11,0);
insert into tree value (null,'Red',3,6,0);
insert into tree value (null,'Cherry',4,5,0);
insert into tree value (null,'Yellow',7,10,0);
insert into tree value (null,'Banana',8,9,0);
insert into tree value (null,'Meat',12,17,0);
insert into tree value (null,'Beef',13,14,0);
insert into tree value (null,'Pork',15,16,0);

二、php文件

<?php
error_reporting(0);
/*
             1 Food 18
      +------------------------------+
    2 Fruit 11           12 Meat 17
  +-------------+         +------------+
3 Red 6   7 Yellow 10    13 Beef 14  15 Pork 16
4 Cherry 5  8 Banana 9
descendants = (right ? left - 1) / 2
*/
/**
 *用于移动一个节点（包括子节点）
 *@param array $pdata = array('id'=>主键,'root'=>名称) 二选一 父节点(为空时插入最大的父节点)
 *@param array $ndata = array('id'=>主键,'root'=>名称) 二选一 下一个兄弟节点（没有兄弟的时候就不用）
 *@param array $cdata = array('id'=>主键,'root'=>名称) 二选一 当前待移动的节点
 */
function move_tree_all($pdata=array(),$ndata=array(),$cdata=array()) {
  $cid  = $cdata['id'] ? intval($cdata['id']) : '';
  $croot = $cdata['root'];
  if(!$cid && !$croot) return;
  //需自加判断
  //1、cdata不能为顶级
  //2、cdata不能比$pdata等级高
  $adata = get_tree_all($cdata); //获取当前移动节点的所有节点
  delete_tree_all($cdata,1); //逻辑删除当前移动节点的所有节点
  foreach($adata as $k => $val) {
    if($k != 0) {
      $pdata = array('root'=>$val['parent']);
      insert_tree($pdata,'',$val['name'],1);
    } else { //first
      insert_tree($pdata,$ndata,$val['name'],1);
    }
  }
}
/**
 *用于移动一个节点（不包括子节点）
 *@param array $pdata = array('id'=>主键,'root'=>名称) 二选一 父节点(为空时插入最大的父节点)
 *@param array $ndata = array('id'=>主键,'root'=>名称) 二选一 下一个兄弟节点（没有兄弟的时候就不用）
 *@param array $cdata = array('id'=>主键,'root'=>名称) 二选一 当前待移动的节点
 */
function move_tree_item($pdata=array(),$ndata=array(),$cdata=array()) {
  $cid  = $cdata['id'] ? intval($cdata['id']) : '';
  $croot = $cdata['root'];
  if(!$cid && !$croot) return;
  //需自加判断
  //1、cdata不能为顶级
  if(!$croot) {
    $sql = "SELECT name from tree where id = $cid";
    $result = mysql_query($sql);
    $row = mysql_fetch_assoc($result);
    $croot = $row['name'];
    unset($sql);
  }
  delete_tree_item($cdata,1);
  insert_tree($pdata,$ndata,$croot,1);
}
/**
 *用于插入一个节点
 *@param array $pdata = array('id'=>主键,'root'=>名称) 二选一 父节点(为空时插入最大的父节点)
 *@param array $ndata = array('id'=>主键,'root'=>名称) 二选一 下一个兄弟节点（没有兄弟的时候就不用）
 *@param string $name string 新插入的名称
 *@param int $update 默认为空，为1时更新插入
 */
function insert_tree($pdata=array(),$ndata=array(),$name,$update='') {
  if(!$name) return;
  $pid  = $pdata['id'] ? intval($pdata['id']) : '';
  $proot = $pdata['root'];
  $nid  = $ndata['id'] ? intval($ndata['id']) : '';
  $nroot = $ndata['root'];
  //有父无兄（最小的子节点，父节点的最后一个儿子）
  if(($pid || $proot) && !($nid || $nroot)) {
    $sql  = $pid ? "SELECT lft, rgt FROM tree WHERE id = '{$pid}';" : "SELECT lft, rgt FROM tree WHERE name = '{$proot}';";
    $result = mysql_query($sql);
    $row  = mysql_fetch_assoc($result);
    unset($sql);
    //新节点
    $lft = $row['rgt'];
    $rgt = $lft+1;
    if(!$update) {
      $sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
      $sql1 = "update tree set rgt = rgt+2 where rgt >= {$row['rgt']}";
      $sql2 = "update tree set lft = lft+2 where lft >= {$row['rgt']}";
    } else {
      $sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
      $sql1 = "update tree set rgt = rgt+2 where status =0 and rgt >= {$row['rgt']}";
      $sql2 = "update tree set lft = lft+2 where status =0 and lft >= {$row['rgt']}";
    }
    mysql_query($sql1);
    mysql_query($sql2);
    mysql_query($sql); //last add new data
  }
  //有父有兄
  if(($pid || $proot) && ($nid || $nroot)) {
    $sql  = $nid ? "SELECT lft, rgt FROM tree WHERE id = '{$nid}';" : "SELECT lft, rgt FROM tree WHERE name = '{$nroot}';";
    $result = mysql_query($sql);
    $row  = mysql_fetch_assoc($result);
    unset($sql);
    //新节点
    $lft = $row['lft'];
    $rgt = $lft+1;
    if(!$update) {
      $sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
      $sql1 = "update tree set rgt = rgt+2 where rgt >= {$row['lft']};";
      $sql2 = "update tree set lft = lft+2 where lft >= {$row['lft']};";
    } else {
      $sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
      $sql1 = "update tree set rgt = rgt+2 where status = 0 and rgt >= {$row['lft']};";
      $sql2 = "update tree set lft = lft+2 where status = 0 and lft >= {$row['lft']};";
    }
    mysql_query($sql1);
    mysql_query($sql2);
    mysql_query($sql); //last add new data
  }
  //无父无兄(大佬)
  if(!($pid || $proot) && !($nid || $nroot)) {
    $sql  = "SELECT max(`rgt`) as rgt FROM tree;";
    $result = mysql_query($sql);
    $row  = mysql_fetch_assoc($result);
    unset($sql);
    //新节点
    $lft = 1;
    $rgt = $row['rgt']+2;
    if(!$update) {
      $sql = "insert into tree values (null,'{$name}',$lft,$rgt,0);";
      $sql1 = "update tree set rgt = rgt+1";
      $sql2 = "update tree set lft = lft+1";
    } else {
      $sql = "update tree set lft=$lft,rgt=$rgt,status=0 where name ='{$name}';";
      $sql1 = "update tree set rgt = rgt+1 where status = 0";
      $sql2 = "update tree set lft = lft+1 where status = 0";
    }
    mysql_query($sql1);
    mysql_query($sql2);
    mysql_query($sql); //last add new data
  }
}
/**
 *用于删除一个节点(包括子节点)
 *@param array $data = array('id'=>主键,'root'=>名称) 二选一
 *@param int $update 默认为空，为1时逻辑删除
 */
function delete_tree_all($data,$update='') {
  $id  = $data['id'] ? intval($data['id']) : '';
  $root = $data['root'];
  if(!$id && !$root) return;
  $sql  = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
  $result = mysql_query($sql);
  $row  = mysql_fetch_assoc($result);
  unset($sql);
  $middle = $row['rgt']-$row['lft']+1;
  if(!$update) {
    $sql  = "delete from tree where lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."'";
    $sql1  = "update tree set rgt = rgt-{$middle} where rgt > {$row['rgt']}";
    $sql2  = "update tree set lft = lft-{$middle} where lft > {$row['rgt']}";
  } else {
    $sql  = "update tree set status = 1 where lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."'";
    $sql1  = "update tree set rgt = rgt-{$middle} where status=0 and rgt > {$row['rgt']}";
    $sql2  = "update tree set lft = lft-{$middle} where status=0 and lft > {$row['rgt']}";
  }
  mysql_query($sql);
  mysql_query($sql1);
  mysql_query($sql2);
}
/**
 *用于删除一个节点(不包括子节点)
 *@param array $data = array('id'=>主键,'root'=>名称) 二选一
 *@param int $update 默认为空，为1时逻辑删除
 */
function delete_tree_item($data,$update='') {
  $id  = $data['id'] ? intval($data['id']) : '';
  $root = $data['root'];
  if(!$id && !$root) return;
  $sql  = $id ? "SELECT id,lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT id,lft, rgt FROM tree WHERE name = '{$root}';";
  $result = mysql_query($sql);
  $row  = mysql_fetch_assoc($result);
  unset($sql);
  if(!$update) {
    $sql = "delete from tree where id = {$row['id']};";
    $sql1 = "update tree set rgt = rgt-1,lft = lft -1 where lft > {$row['lft']} and rgt < {$row['rgt']}";
    $sql2 = "update tree set lft = lft-2 where lft > {$row['rgt']}";
    $sql3 = "update tree set rgt = rgt-2 where rgt > {$row['rgt']}";
  } else {
    $sql = "update tree set status = 1 where id = {$row['id']};";
    $sql1 = "update tree set rgt = rgt-1,lft = lft -1 where status = 0 and lft > {$row['lft']} and rgt < {$row['rgt']}";
    $sql2 = "update tree set lft = lft-2 where status = 0 and lft > {$row['rgt']}";
    $sql3 = "update tree set rgt = rgt-2 where status = 0 and rgt > {$row['rgt']}";
  }
  mysql_query($sql);
  mysql_query($sql1);
  //can do or not do just right,but not do load empty 2 number in middle
  mysql_query($sql2);
  mysql_query($sql3);
}
/**
 *用于获取所有的节点
 *@param array $data = array('id'=>主键,'root'=>名称) 二选一
 */
function get_tree_all($data) {
  $id  = $data['id'] ? intval($data['id']) : '';
  $root = $data['root'];
  if(!$id && !$root) return;
  $sql  = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
  $result = mysql_query($sql);
  $row  = mysql_fetch_assoc($result);
  $adata = array(); //所有数据
  $right = array(); //计数
  $prev  = array();
  $result = mysql_query("SELECT id,name, lft, rgt FROM tree WHERE lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."' ORDER BY lft ASC ;");
  while ($row = mysql_fetch_assoc($result)) {
    if (count($right) > 0) {
      while ($right[count($right) - 1] < $row['rgt']) { // 检查我们是否应该将节点移出堆栈
        array_pop($right);
        array_pop($prev);
      }
    }
    $parent = $prev ? end($prev) : '';
    $adata[] = array('id'=>$row['id'],'name'=>$row['name'],'level'=>count($right),'parent'=>$parent);
    $right[] = $row['rgt'];
    $prev[] = $row['name'];
  }
  return $adata;
}
/**
 *用于展示分类
 *@param array $data = array('id'=>主键,'root'=>名称) 二选一
 */
function display_tree($data) {
  $id  = $data['id'] ? intval($data['id']) : '';
  $root = $data['root'];
  if(!$id && !$root) return;
  $sql  = $id ? "SELECT lft, rgt FROM tree WHERE id = '{$id}';" : "SELECT lft, rgt FROM tree WHERE name = '{$root}';";
  $result = mysql_query($sql);
  $row  = mysql_fetch_assoc($result);
  $right = array();
  $result = mysql_query("SELECT name, lft, rgt FROM tree WHERE lft BETWEEN '" . $row['lft'] . "' AND '" . $row['rgt'] ."' ORDER BY lft ASC ;");
  while ($row = mysql_fetch_assoc($result)) {
    if (count($right) > 0) { // 检查我们是否应该将节点移出堆栈
      while ($right[count($right) - 1] < $row['rgt']) {
        array_pop($right);
      }
    }
    echo str_repeat(' ',count($right)) . $row['name'] . "\n";
    $right[] = $row['rgt'];
  }
}
mysql_connect('localhost','root','') or die('connect error');
mysql_select_db('test') or die('database error');
mysql_query('set names utf8');
display_tree(array('root'=>'Food'));
//display_tree(array('root'=>'bigboss'));
//move_tree_all($pdata=array('root'=>'Fruit'),$ndata=array('root'=>'Red'),$cdata=array('root'=>'Meat'));
//move_tree_all('','',$cdata=array('root'=>'Meat'));
//move_tree_item('','',array('root'=>'Red'));
//move_tree_item(array('root'=>'Red'),array('root'=>'Cherry'),array('root'=>'Fruit'));
//delete_tree_all(array('root'=>'Yellow'));
//delete_tree_all(array('root'=>'Meat'));
//delete_tree_item(array('root'=>'Meat'));
//insert_tree('','','bigboss');
//insert_tree(array('root'=>'Red'),'','dalao');
//insert_tree(array('root'=>'Red'),array('root'=>'Cherry'),'baddalao');
//insert_tree(array('root'=>'Fruit'),array('root'=>'Red'),'Redbother');
display_tree(array('root'=>'Food'));

希望本文所述对大家PHP程序设计有所帮助。

PHP带节点操作的无限分类实现方法详解

- Author -

AndyYang

声明：登载此文出于传递更多信息之目的，并不意味着赞同其观点或证实其描述。

PHP 相关文章推荐
phpmyadmin安装时提示：Warning: require_once(./libraries/common.inc.php)错误解决办法
Aug 18 PHP
php调用google接口生成二维码示例
Apr 28 PHP
PHP不用递归遍历目录下所有文件的代码
Jul 04 PHP
使用PHPMailer实现邮件发送代码分享
Oct 23 PHP
php使用session二维数组实例
Nov 06 PHP
php实现window平台的checkdnsrr函数
May 27 PHP
php利用header函数下载各种文件
Aug 24 PHP
php源码 fsockopen获取网页内容实例详解
Sep 24 PHP
php简单实现多维数组排序的方法
Sep 30 PHP
通过chrome浏览器控制台(Console)进行PHP Debug的方法
Oct 19 PHP
PHP实现的DES加密解密类定义与用法示例
Nov 02 PHP
Laravel 解决419错误 -ajax请求错误的问题(CSRF验证)
Oct 25 PHP
thinkPHP批量删除的实现方法分析
Nov 09 #PHP
基于jQueryUI和Corethink实现百度的搜索提示功能
Nov 09 #PHP
php 计算两个时间相差的天数、小时数、分钟数、秒数详解及实例代码
Nov 09 #PHP
php mysql procedure实现获取多个结果集的方法【基于thinkPHP】
Nov 09 #PHP
php利用gd库为图片添加水印
Nov 09 #PHP
php 输出json及显示json中的中文汉字详解及实例
Nov 09 #PHP
Yii2框架制作RESTful风格的API快速入门教程
Nov 08 #PHP
MySQL面试题(19) 自我鉴定(671) Servlet面试题(20) SOA面试题(9) 自我评价(886) PYTHON面试题(27) Ruby面试题(15) Delphi面试题(13) J2EE面试题(19) UNIX面试题(27)
You might like
php中设置index.php文件为只读的方法
2013/02/06 PHP
php文件包含目录配置open_basedir的使用与性能详解
2017/04/03 PHP
PHP 中使用explode()函数切割字符串为数组的示例
2017/05/06 PHP
javascript 获取网页参数系统
2008/07/19 Javascript
JQuery 获取和设置Select选项的代码
2010/02/07 Javascript
JavaScript不刷新实现浏览器的前进后退功能
2014/11/05 Javascript
高性能JavaScript DOM编程（1）
2015/08/11 Javascript
JS实现简单的二维矩阵乘积运算
2016/01/26 Javascript
jQuery内容折叠效果插件用法实例分析(附demo源码)
2016/04/28 Javascript
jquery仿京东侧边栏导航效果
2017/03/02 Javascript
JavaScript条件判断_动力节点Java学院整理
2017/06/26 Javascript
收藏AngularJS中最重要的核心功能
2017/07/09 Javascript
JavaScrip关于创建常量的知识点
2017/12/07 Javascript
详解ECMAScript typeof用法
2018/07/25 Javascript
js中自定义react数据验证组件实例详解
2018/10/19 Javascript
[49:21]2018DOTA2亚洲邀请赛3月30日 小组赛B组 Effect VS iG
2018/03/31 DOTA
Python入门篇之数字
2014/10/20 Python
Python网络编程 Python套接字编程
2017/09/13 Python
浅谈python日志的配置文件路径问题
2018/04/28 Python
python 请求服务器的实现代码(http请求和https请求)
2018/05/25 Python
Python交互环境下实现输入代码
2018/06/22 Python
python 平衡二叉树实现代码示例
2018/07/07 Python
python 简单照相机调用系统摄像头实现方法 pygame
2018/08/03 Python
在python环境下运用kafka对数据进行实时传输的方法
2018/12/27 Python
Django框架实现的普通登录案例【使用POST方法】
2019/05/15 Python
使用PyTorch训练一个图像分类器实例
2020/01/08 Python
Python matplotlib读取excel数据并用for循环画多个子图subplot操作
2020/07/14 Python
Python钉钉报警及Zabbix集成钉钉报警的示例代码
2020/08/17 Python
CSS3制作hover下划线动画
2017/03/27 HTML / CSS
PHP高级工程师面试问题推荐
2013/01/18 面试题
高一英语教学反思
2014/01/22 职场文书
学生安全教育材料
2014/02/14 职场文书
电子商务助理求职自荐信
2014/04/10 职场文书
关于拾金不昧的感谢信
2015/01/21 职场文书
opencv-python图像配准(匹配和叠加)的实现
2021/06/23 Python
mybatis源码解读之executor包语句处理功能
2022/02/15 Java/Android