给你一个类吧,这个类网上有的,与你的结构差不多吧 只有cid, pid, cname三个字段 <?php /** * @author YangHuan,Fonqing * @datetime * @version 1.0.0 * This class base at Yanghuan's PHP Tree * Modify By Fonqing: * Memo: * 1,Add some method functions */ class SortClass{ public $data = array(); public $child = array(-1=>array()); public $layer = array(-1=>-1); public $parent = array(); public $link; public $table; /** * void SortClass($link, $table) * The constructor of the class * @param $link resource MySQL link identifier * @param $table string The name of the category talbe * @return void */ function SortClass($link, $table){ $this->setNode(0, -1, '顶极节点'); $this->link = $link; $this->table = $table; $node = array(); $results = mysql_query('select * from '.$this->table.'',$this->link); while($node = mysql_fetch_assoc($results)){ $this->setNode($node['cid'],$node['pid'],$node['cname']); } } function setNode ($id, $parent, $value){ $parent = $parent?$parent:0; $this->data[$id] = $value; $this->child[$id] = array(); $this->child[$parent][] = $id; $this->parent[$id] = $parent; $this->layer[$id] = !isset($this->layer[$parent])? 0 : $this->layer[$parent] + 1; } function getList (&$tree, $root= 0){ foreach ($this->child[$root] as $key=>$id){ $tree[] = $id; if ($this->child[$id]) $this->getList($tree, $id); } } function getValue ($id){return $this->data[$id];} function getLayer ($id, $space = false){ return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id]; } function getParent ($id){return $this->parent[$id];} function getParents ($id){ while ($this->parent[$id] != -1){ $id = $parent[$this->layer[$id]] = $this->parent[$id]; } ksort($parent); reset($parent); return $parent; } function getChild ($id){return $this->child[$id];} function getChilds ($id = 0){ $child = array($id); $this->getList($child, $id); return $child; } /** * void addNode($name, $pid) * Add a new Node to the tree and insert into the database * @param $name string The node name * @param $pid integer The parent node of this new node * @return void */ function addNode($name, $pid){ mysql_query("insert into $this->table (`pid`,`cname`) values ('$pid','$name')", $this->link); } /** * void modNode($cid, $newName) * Modify a node to a new name * @param $cid integer The `cid` of the node which to modify * @param $newName string The new name * @return void */ function modNode($cid, $newName){ mysql_query("update $this->table set `cname`='$newName' where `cid` = $cid", $this->link); } /** * void delNode($cid) * Delete a node and all of its childs * @param $cid integer The node to delete * @return void */ function delNode($cid){ $allChilds = $this->getChilds($cid); $sql =''; if(empty($allChilds)){ $sql = "delete from $this->table where `cid` = $cid"; }else{ $sql = 'delete from '.$this->table.' where `cid` in ('.implode(',',$allChilds).','.$cid.')'; } mysql_query($sql, $this->link); } /** * void moveNode($cid, $topid) * Add a new Node to the tree and insert into the database * @param $cid integer The node id which to move * @param $topid integer New parent id * @return void */ function moveNode($cid, $topid){ $tos = $this->getChilds($cid); if(in_array($topid,$tos)) return;//不能移动到其子分类 mysql_query("update $this->table set `pid`=$topid where `cid` = $cid", $this->link); }
function __destruct(){ unset($this->data, $this->child, $this->parent, $this->layer); } } ?>
你$db->query("delete from dptmsg where dptid=".$dptid."");
都执行删除了
$fdb->query("select dptid from dptmsg where dptfid=".$dptid."");
这个哪还有数据?
另外,编码这种很个人风格的东西,楼主应该更明确地说明一下,如next_rs(),delptcs()的内部语句,虽然我们知道它应该怎么去工作
再一次过根据ID删除!
这不是更高效~更简单吗?
为什么要一边找一边删
只有cid, pid, cname三个字段
<?php
/**
* @author YangHuan,Fonqing
* @datetime
* @version 1.0.0
* This class base at Yanghuan's PHP Tree
* Modify By Fonqing:
* Memo:
* 1,Add some method functions
*/
class SortClass{
public $data = array();
public $child = array(-1=>array());
public $layer = array(-1=>-1);
public $parent = array();
public $link;
public $table;
/**
* void SortClass($link, $table)
* The constructor of the class
* @param $link resource MySQL link identifier
* @param $table string The name of the category talbe
* @return void
*/
function SortClass($link, $table){
$this->setNode(0, -1, '顶极节点');
$this->link = $link;
$this->table = $table;
$node = array();
$results = mysql_query('select * from '.$this->table.'',$this->link);
while($node = mysql_fetch_assoc($results)){
$this->setNode($node['cid'],$node['pid'],$node['cname']);
}
}
function setNode ($id, $parent, $value){
$parent = $parent?$parent:0;
$this->data[$id] = $value;
$this->child[$id] = array();
$this->child[$parent][] = $id;
$this->parent[$id] = $parent;
$this->layer[$id] = !isset($this->layer[$parent])? 0 : $this->layer[$parent] + 1;
}
function getList (&$tree, $root= 0){
foreach ($this->child[$root] as $key=>$id){
$tree[] = $id;
if ($this->child[$id]) $this->getList($tree, $id);
}
}
function getValue ($id){return $this->data[$id];}
function getLayer ($id, $space = false){
return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id];
}
function getParent ($id){return $this->parent[$id];}
function getParents ($id){
while ($this->parent[$id] != -1){
$id = $parent[$this->layer[$id]] = $this->parent[$id];
}
ksort($parent);
reset($parent);
return $parent;
}
function getChild ($id){return $this->child[$id];}
function getChilds ($id = 0){
$child = array($id);
$this->getList($child, $id);
return $child;
}
/**
* void addNode($name, $pid)
* Add a new Node to the tree and insert into the database
* @param $name string The node name
* @param $pid integer The parent node of this new node
* @return void
*/
function addNode($name, $pid){
mysql_query("insert into $this->table (`pid`,`cname`) values ('$pid','$name')", $this->link);
}
/**
* void modNode($cid, $newName)
* Modify a node to a new name
* @param $cid integer The `cid` of the node which to modify
* @param $newName string The new name
* @return void
*/
function modNode($cid, $newName){
mysql_query("update $this->table set `cname`='$newName' where `cid` = $cid", $this->link);
}
/**
* void delNode($cid)
* Delete a node and all of its childs
* @param $cid integer The node to delete
* @return void
*/
function delNode($cid){
$allChilds = $this->getChilds($cid);
$sql ='';
if(empty($allChilds)){
$sql = "delete from $this->table where `cid` = $cid";
}else{
$sql = 'delete from '.$this->table.' where `cid` in ('.implode(',',$allChilds).','.$cid.')';
}
mysql_query($sql, $this->link);
}
/**
* void moveNode($cid, $topid)
* Add a new Node to the tree and insert into the database
* @param $cid integer The node id which to move
* @param $topid integer New parent id
* @return void
*/
function moveNode($cid, $topid){
$tos = $this->getChilds($cid);
if(in_array($topid,$tos)) return;//不能移动到其子分类
mysql_query("update $this->table set `pid`=$topid where `cid` = $cid", $this->link);
}
function __destruct(){
unset($this->data,
$this->child,
$this->parent,
$this->layer);
}
}
?>
$tree->delNode($_GET['cid']);
这样调用即可了
我已经找其他的办法做了,但是我还是没弄清楚我那两个函数有什么问题,在递归里,它应该算很简单的了,我觉得思想没问题,数据库连接用的是一个独立的类,是不是问题出在这呢?
问题在你那个每次只删一个