php栏目类，php分类类，php树类，tree.class.php
支持：1
* 得到父级数组
* 得到子级数组
* 得到当前位置数组
* 得到树型结构 4 种形式
文件：tree.class.php
<?php
/**
* 通用的树型类，可以生成任何树型结构
*/
class tree {
/**
* 生成树型结构所需要的2维数组
* @var array
*/
public $arr = array();
/**
* 生成树型结构所需修饰符号，可以换成图片
* @var array
*/
public $icon = array('│','├','└');
public $nbsp = " ";
public $id = 'tid';//分类id
public $pid = 'pid';//父id
/**
* @access private
*/
public $ret = '';
/**
* 构造函数，初始化类
* @param array 2维数组，例如：
* array(
* 1 => array('tid'=>'1','pid'=>0,'name'=>'一级栏目一'),
* 2 => array('tid'=>'2','pid'=>0,'name'=>'一级栏目二'),
* 3 => array('tid'=>'3','pid'=>1,'name'=>'二级栏目一'),
* 4 => array('tid'=>'4','pid'=>1,'name'=>'二级栏目二'),
* 5 => array('tid'=>'5','pid'=>2,'name'=>'二级栏目三'),
* 6 => array('tid'=>'6','pid'=>3,'name'=>'三级栏目一'),
* 7 => array('tid'=>'7','pid'=>3,'name'=>'三级栏目二')
* )
*/
public function init($arr=array()){
$this->arr = $arr;
$this->ret = '';
return is_array($arr);
}
public function setid($id){
$this->id = $id;
}
public function setpid($id){
$this->pid = $pid;
}
/**
* 得到父级数组
* @param int
* @return array
*/
public function get_parent($myid){
$newarr = array();
if(!isset($this->arr[$myid])) return false;
$pid = $this->arr[$myid][$this->pid];
$pid = $this->arr[$pid][$this->pid];
if(is_array($this->arr)){
foreach($this->arr as $id => $a){
if($a[$this->pid] == $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[$this->pid] == $myid) $newarr[$id] = $a;
}
}
return $newarr ? $newarr : false;
}
/**
* 得到当前位置数组
* @param int
* @return array
*/
public function get_pos($myid,&$newarr = array()){
$a = array();
if(!isset($this->arr[$myid])) return false;
$newarr[] = $this->arr[$myid];
$pid = $this->arr[$myid][$this->pid];
if(isset($this->arr[$pid])){
$this->get_pos($pid,$newarr);
}
if(is_array($newarr)){
krsort($newarr);
foreach($newarr as $v){
$a[$v[$this->id]] = $v;
}
}
return $a;
}
/**
* 得到树型结构
* @param int ID，表示获得这个ID下的所有子级
* @param string 生成树型结构的基本代码，例如："<option value=\$id \$selected>\$spacer\$name</option>"
* @param int 被选中的ID，比如在做树型下拉框的时候需要用到
* @return string
*/
public function get_tree($myid, $str, $sid = 0, $adds = '', $str_group = ''){
$number=1;
$child = $this->get_child($myid);
if(is_array($child)){
$total = count($child);
foreach($child as $id=>$value){
$j=$k='';
if($number==$total){
$j .= $this->icon[2];
}else{
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds.$j : '';
$selected = $id==$sid ? 'selected' : '';
#print_r($value);echo '<hr/>';
@extract($value);
$value[$this->pid] == 0 && $str_group ? eval("\$nstr = \"$str_group\";") : eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$nbsp = $this->nbsp;
$this->get_tree($id, $str, $sid, $adds.$k.$nbsp,$str_group);
$number++;
}
}
return $this->ret;
}
/**
* 同上一方法类似,但允许多选
* $str = "<option value=\$id \$selected>\$spacer \$name</option>".PHP_EOL; //生成的形式
* $tree->ret='';# ret 是 递归调用时 用到的变量 上边 tree 之后，ret有值
* $options = $tree->get_tree_multi(0,$str, $select_id = '1,2,3');
*/
public function get_tree_multi($myid, $str, $sid = 0, $adds = ''){
$number=1;
$child = $this->get_child($myid);
if(is_array($child)){
$total = count($child);
foreach($child as $id=>$a){
$j=$k='';
if($number==$total){
$j .= $this->icon[2];
}else{
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds.$j : '';
$selected = $this->have($sid,$id) ? 'selected' : '';
@extract($a);
eval("\$nstr = \"$str\";");
$this->ret .= $nstr;
$this->get_tree_multi($id, $str, $sid, $adds.$k.' ');
$number++;
}
}
return $this->ret;
}
/**
* @param integer $myid 要查询的ID
* @param string $str 第一种HTML代码方式
* @param string $str2 第二种HTML代码方式
* @param integer $sid 默认选中
* @param integer $adds 前缀
*/
public function get_tree_category($myid=0 , $str="<div class=''>\$name</div>", $str2="<div class='selected'>\$name</div>", $sid = 0, $adds = ''){
$number=1;
$child = $this->get_child($myid);
if(is_array($child)){
$total = count($child);
foreach($child as $id=>$a){
$j=$k='';
if($number==$total){
$j .= $this->icon[2];
}else{
$j .= $this->icon[1];
$k = $adds ? $this->icon[0] : '';
}
$spacer = $adds ? $adds.$j : '';
$selected = $this->have($sid,$id) ? 'selected' : '';
@extract($a);
if (empty($selected)) {
eval("\$nstr = \"$str\";");
} else {
eval("\$nstr = \"$str2\";");
}
$this->ret .= $nstr;
$this->get_tree_category($id, $str, $str2, $sid, $adds.$k.' ');
$number++;
}
}
return $this->ret;
}
/**
* 同上一类方法，jquery treeview 风格，可伸缩样式（需要treeview插件支持）
* @param $myid 表示获得这个ID下的所有子级
* @param $effected_id 需要生成treeview目录数的id
* @param $str 末级样式
* @param $str2 目录级别样式
* @param $showlevel 直接显示层级数，其余为异步显示，0为全部限制
* @param $style 目录样式 默认 filetree 可增加其他样式如'filetree treeview-famfamfam'
* @param $currentlevel 计算当前层级，递归使用 适用改函数时不需要用该参数
* @param $recursion 递归使用 外部调用时为FALSE
*/
function get_treeview($myid=0,$effected_id='example',$str="<span class='file'>\$name</span>", $str2="<span class='folder'>\$name</span>" ,$showlevel = 0 ,$style='filetree ' , $currentlevel = 1,$recursion=FALSE) {
$child = $this->get_child($myid);
if(!defined('EFFECTED_INIT')){
$effected = ' id="'.$effected_id.'"';
define('EFFECTED_INIT', 1);
} else {
$effected = '';
}
$placeholder = '<ul><li><span class="placeholder"></span></li></ul>';
if(!$recursion) $this->str .='<ul'.$effected.' class="'.$style.'">';
foreach($child as $id=>$a) {
@extract($a);
if($showlevel > 0 && $showlevel == $currentlevel && $this->get_child($id)) $folder = 'hasChildren'; //如设置显示层级模式@2011.07.01
$floder_status = isset($folder) ? ' class="'.$folder.'"' : '';
$this->str .= $recursion ? '<ul><li'.$floder_status.' id=\''.$id.'\'>' : '<li'.$floder_status.' id=\''.$id.'\'>';
$recursion = FALSE;
if($this->get_child($id)){
eval("\$nstr = \"$str2\";");
$this->str .= $nstr;
if($showlevel == 0 || ($showlevel > 0 && $showlevel > $currentlevel)) {
$this->get_treeview($id, $effected_id, $str, $str2, $showlevel, $style, $currentlevel+1, TRUE);
} elseif($showlevel > 0 && $showlevel == $currentlevel) {
$this->str .= $placeholder;
}
} else {
eval("\$nstr = \"$str\";");
$this->str .= $nstr;
}
$this->str .=$recursion ? '</li></ul>': '</li>';
}
if(!$recursion) $this->str .='</ul>';
return $this->str;
}
/**
* 获取子栏目json
* Enter description here ...
* @param unknown_type $myid
*/
public function creat_sub_json($myid=0, $str='') {
$sub_cats = $this->get_child($myid);
$n = 0;
if(is_array($sub_cats)) foreach($sub_cats as $c) {
#print_r($c);
# $data[$n][$this->id] = @iconv(CHARSET,'utf-8',$c[$this->id]);
$data[$n][$this->id] = $c[$this->id];
#var_dump( $this->get_child($c[$this->id]) );
if($this->get_child($c[$this->id])) {
$data[$n]['liclass'] = 'hasChildren';
$data[$n]['children'] = array(array('text'=>' ','classes'=>'placeholder'));
$data[$n]['classes'] = 'folder';
# $data[$n]['text'] = @iconv(CHARSET,'utf-8',$c['catname']);
$data[$n]['text'] = $c['name'];
} else {
if($str) {
@extract(array_iconv($c,CHARSET,'utf-8'));
eval("\$data[$n]['text'] = \"$str\";");
} else {
# $data[$n]['text'] = @iconv(CHARSET,'utf-8',$c['catname']);
$data[$n]['text'] = $c['name'];
}
}
$n++;
#echo '<hr/>';
}
return json_encode($data);
}
private function have($list,$item){
return(strpos(',,'.$list.',' , ','.$item.','));
}
}
?>
测试文件：test.php
<?php
header("Content-type:text/html;charset=utf-8");
include('tree.class.php');
$arr = array(
1 => array('tid'=>'1','pid'=>0,'name'=>'1'),
2 => array('tid'=>'2','pid'=>0,'name'=>'2'),
3 => array('tid'=>'3','pid'=>1,'name'=>'1-1'),
4 => array('tid'=>'4','pid'=>1,'name'=>'1-2'),
5 => array('tid'=>'5','pid'=>2,'name'=>'2-1'),
6 => array('tid'=>'6','pid'=>3,'name'=>'1-1-1'),
7 => array('tid'=>'7','pid'=>3,'name'=>'1-1-2')
);
/*把类 实力为 对象 */
$tree = new Tree();
# 初始化 类
$tree ->init($arr);
echo "get_tree() 生成树 <br/>".PHP_EOL;
$str = "<option value=\$id \$selected>\$spacer \$name</option>".PHP_EOL; //生成的形式
$options = $tree->get_tree(0,$str, $select_id = 5);
echo '<select>';
echo($options);
echo '</select>';
echo '<hr/>';##################################################################
echo 'get_parent( 6 )得到父级 数组 (6 de 父亲的兄弟姐妹)<br/>'.PHP_EOL;
print_r( $tree -> get_parent( 6 ) );
echo '<hr/>';##################################################################
echo 'get_child( 1 )得到子级数组 数组 (1 de 儿子的兄弟姐妹)<br/>'.PHP_EOL;
print_r( $tree -> get_child( 1 ) );
echo '<hr/>';##################################################################
echo 'get_pos( 6 )得到当前位置数组 <br/>'.PHP_EOL;
print_r( $tree -> get_pos( 6 ) );
$str = '';
foreach($tree -> get_pos( 6 ) as $k => $v){
$str .= "<a href=\"?tid={$v['tid']}\" >{$v['name']}</a> > ";
}
echo $str;
echo '<hr/>';##################################################################
echo "get_tree_multi() 生成树 多选 <br/>".PHP_EOL;
$str = "<option value=\$id \$selected>\$spacer \$name</option>".PHP_EOL; //生成的形式
$tree->ret='';# ret 是 递归调用时 用到的变量 上边 tree 之后，ret有值
$options = $tree->get_tree_multi(0,$str, $select_id = '1,2,3');
echo '<select size="10" multiple="multiple">';
echo($options);
echo '</select>';
echo '<hr/>';##################################################################
echo "get_tree_category() <br/>".PHP_EOL;
$str = "<option value=\$id \$selected>\$spacer \$name</option>".PHP_EOL; //生成的形式
$tree->ret='';# ret 是 递归调用时 用到的变量 上边 tree 之后，ret有值
$options = $tree->get_tree_category(0 , "<div class='' data-tid={\$id} > {\$spacer} {\$name} </div>", "<div class='selected' data-tid={\$id} > {\$spacer} {\$name} </div>", $sid = 5, $adds = '') ;
echo($options);
echo '<hr/>';##################################################################
echo "get_treeview() <br/>".PHP_EOL;
$str = "<option value=\$id \$selected>\$spacer \$name</option>".PHP_EOL; //生成的形式
$tree->ret='';# ret 是 递归调用时 用到的变量 上边 tree 之后，ret有值
$options = $tree->get_treeview() ;
echo($options);
echo '<hr/>';##################################################################
echo "creat_sub_json() 这个能干什么没看懂？？？<br/>".PHP_EOL;
$tree->ret='';# ret 是 递归调用时 用到的变量 上边 tree 之后，ret有值
$options = $tree->creat_sub_json() ;
echo($options);
下载地址：http://pan.baidu.com/s/1i3xg6fb