PHP帶節(jié)點操作的無限分類實現(xiàn)方法詳解
更新時間：2016年11月09日 11:57:05 作者：AndyYang
這篇文章主要介紹了PHP帶節(jié)點操作的無限分類實現(xiàn)方法,可實現(xiàn)無限分類及針對節(jié)點的添加、刪除、移動等功能,需要的朋友可以參考下
本文實例講述了PHP帶節(jié)點操作的無限分類實現(xiàn)方法。分享給大家供大家參考，具體如下：
包含（移動多個節(jié)點；移動單個節(jié)點；刪除多個節(jié)點；刪除單個節(jié)點；新增節(jié)點），另附數(shù)據(jù)庫表結(jié)構(gòu)
一、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
*/
/**
*用于移動一個節(jié)點（包括子節(jié)點）
*@param array $pdata = array('id'=>主鍵,'root'=>名稱) 二選一 父節(jié)點(為空時插入最大的父節(jié)點)
*@param array $ndata = array('id'=>主鍵,'root'=>名稱) 二選一 下一個兄弟節(jié)點（沒有兄弟的時候就不用）
*@param array $cdata = array('id'=>主鍵,'root'=>名稱) 二選一 當前待移動的節(jié)點
*/
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); //獲取當前移動節(jié)點的所有節(jié)點
delete_tree_all($cdata,1); //邏輯刪除當前移動節(jié)點的所有節(jié)點
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);
}
}
}
/**
*用于移動一個節(jié)點（不包括子節(jié)點）
*@param array $pdata = array('id'=>主鍵,'root'=>名稱) 二選一 父節(jié)點(為空時插入最大的父節(jié)點)
*@param array $ndata = array('id'=>主鍵,'root'=>名稱) 二選一 下一個兄弟節(jié)點（沒有兄弟的時候就不用）
*@param array $cdata = array('id'=>主鍵,'root'=>名稱) 二選一 當前待移動的節(jié)點
*/
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);
}
/**
*用于插入一個節(jié)點
*@param array $pdata = array('id'=>主鍵,'root'=>名稱) 二選一 父節(jié)點(為空時插入最大的父節(jié)點)
*@param array $ndata = array('id'=>主鍵,'root'=>名稱) 二選一 下一個兄弟節(jié)點（沒有兄弟的時候就不用）
*@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'];
//有父無兄（最小的子節(jié)點，父節(jié)點的最后一個兒子）
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);
//新節(jié)點
$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);
//新節(jié)點
$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);
//新節(jié)點
$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
}
}
/**
*用于刪除一個節(jié)點(包括子節(jié)點)
*@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);
}
/**
*用于刪除一個節(jié)點(不包括子節(jié)點)
*@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);
}
/**
*用于獲取所有的節(jié)點
*@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(); //所有數(shù)據(jù)
$right = array(); //計數(shù)
$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']) { // 檢查我們是否應(yīng)該將節(jié)點移出堆棧
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) { // 檢查我們是否應(yīng)該將節(jié)點移出堆棧
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'));
更多關(guān)于PHP相關(guān)內(nèi)容感興趣的讀者可查看本站專題：《php字符串(string)用法總結(jié)》、《PHP數(shù)組(Array)操作技巧大全》、《PHP基本語法入門教程》、《PHP運算與運算符用法總結(jié)》、《php面向?qū)ο蟪绦蛟O(shè)計入門教程》、《PHP網(wǎng)絡(luò)編程技巧總結(jié)》、《php+mysql數(shù)據(jù)庫操作入門教程》及《php常見數(shù)據(jù)庫操作技巧匯總》
希望本文所述對大家PHP程序設(shè)計有所幫助。
您可能感興趣的文章:
相關(guān)文章
本文講的是php無限級評論嵌套實例介紹， 我在設(shè)計BB的過程中，也一直在思考是否可以不通過遞歸來實現(xiàn)無限級分類的結(jié)構(gòu)展現(xiàn)和父子結(jié)構(gòu)查找，因為如果不對這里的算法進行優(yōu)化后果可能是致命的2018-04-04
php實現(xiàn)插入數(shù)組但不影響原有順序的方法
這篇文章主要介紹了php實現(xiàn)插入數(shù)組但不影響原有順序的方法,實例分析了php數(shù)組操作的技巧,具有一定參考借鑒價值,需要的朋友可以參考下2015-03-03
圖片上傳是網(wǎng)站常用的程序模塊，本文淺析php判斷圖片后綴格式的7種方式2013-06-06
這篇文章主要介紹了PHP觀察者模式,結(jié)合實例形式分析了php觀察者模式的簡單定義與使用操作技巧,需要的朋友可以參考下2018-06-06
pack/unpack的摸板字符字符含義，需要的朋友可以參考下。2009-10-10
這篇文章主要介紹了php快速查找數(shù)據(jù)庫中惡意代碼的方法,可實現(xiàn)針對特殊字符的過濾功能,非常具有實用價值,需要的朋友可以參考下2015-04-04
Windows中安裝Apache2和PHP4權(quán)威指南
Windows中安裝Apache2和PHP4權(quán)威指南...2006-11-11
本篇文章主要介紹了AJAX的使用的相關(guān)知識。具有很好的參考價值。下面跟著小編一起來看下吧2017-04-04
php全排列遞歸算法代碼，需要的朋友可以參考下2012-10-10
本文給大家匯總介紹了7種php常用的打印輸出函數(shù)，分別是echo，print，printf，sprintf，print_r，var_dump，die，希望對大家學習php能夠有所幫助2016-08-08