php+mysql如何实现的无限分类方法类定义-创新互联
这篇文章主要介绍了php+mysql如何实现的无限分类方法类定义,具有一定借鉴价值,感兴趣的朋友可以参考下,希望大家阅读完这篇文章之后大有收获,下面让小编带着大家一起了解一下。
创新互联建站主要从事做网站、成都做网站、网页设计、企业做网站、公司建网站等业务。立足成都服务郊区,10多年网站建设经验,价格优惠、服务专业,欢迎来电咨询建站服务:028-86922220php+mysql实现的无限分类方法类定义与使用,具体如下:
创建数据库以及表
CREATE DATABASE `sortclass`DEFAULT CHARSET utf8; CREATE TABLE IF NOT EXISTS `class` ( `cid` mediumint(8) unsigned NOT NULL auto_increment, `pid` mediumint(8) unsigned NOT NULL, `cname` varchar(50) NOT NULL, PRIMARY KEY (`cid`), KEY `pid` (`pid`) ) ENGINE=MyISAM DEFAULT CHARSET=utf8;
header("Content-type: text/html; charset=utf-8"); //连接数据库 $link = mysql_connect('localhost','root','eric') or die(mysql_error()); mysql_select_db('sortclass',$link); //无限分类类库 class SortClass{ var $data = array(); var $child = array(-1=>array()); var $layer = array(-1=>-1); var $parent = array(); var $link; var $table; 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; } function addNode($name,$pid){ mysql_query("insert into $this->table (`pid`,`cname`) values ('$pid','$name')",$this->link); } function modNode($cid, $newName){ mysql_query("update $this->table set `cname`='$newName' where `cid` = $cid",$this->link); } 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); } function moveNode($cid, $topid){ mysql_query("update $this->table set `pid`=$topid where `cid` = $cid", $this->link); } } //函数 function back(){ echo ''; exit; } //声成select function makeSelect($array,$formName){ global $tree; $select = ''; } $tree = new SortClass($link,'`class`'); $op = !empty($_POST['op']) ? $_POST['op'] : $_GET['op']; if(!empty($op)){ if($op=='add'){ $tree->addNode($_POST['cname'],$_POST['pid']); back(); } if($op=='mod'){ $tree->modNode($_POST['cid'],$_POST['cname']); back(); } if($op=='del'){ $tree->delNode($_GET['cid']); back(); } if($op=='move'){ $tree->moveNode($_POST['who'],$_POST['to']); back(); } } $category = $tree->getChilds(); ?>
移动分类
感谢你能够认真阅读完这篇文章,希望小编分享的“php+mysql如何实现的无限分类方法类定义”这篇文章对大家有帮助,同时也希望大家多多支持创新互联网站建设公司,,关注创新互联行业资讯频道,更多相关知识等着你来学习!
当前标题:php+mysql如何实现的无限分类方法类定义-创新互联
转载来源:http://azwzsj.com/article/pdgcc.html