찾다

집 >백엔드 개발 >PHP 튜토리얼 >PHP에서 트리 클래스를 사용하는 방법

PHP에서 트리 클래스를 사용하는 방법

小云云
小云云원래의
2018-03-19 15:07:062236검색

本文主要和大家分享php中tree类的使用方法，希望能帮助到大家。

<?php
include &#39;tree.class.php&#39;;
//模拟数据库
$data=array(
    array(&#39;id&#39;=>1,&#39;pid&#39;=>0,&#39;name&#39;=>&#39;一级栏目一&#39;),
    array(&#39;id&#39;=>2,&#39;pid&#39;=>0,&#39;name&#39;=>&#39;一级栏目二&#39;),
    array(&#39;id&#39;=>3,&#39;pid&#39;=>1,&#39;name&#39;=>&#39;二级栏目一&#39;),
    array(&#39;id&#39;=>4,&#39;pid&#39;=>3,&#39;name&#39;=>&#39;三级栏目一&#39;),
    array(&#39;id&#39;=>5,&#39;pid&#39;=>4,&#39;name&#39;=>&#39;四级栏目一&#39;),
);
//转换数据
$tree_data=array();
foreach ($data as $key=>$value){
    $tree_data[$value[&#39;id&#39;]]=array(
        &#39;id&#39;=>$value[&#39;id&#39;],
        &#39;parentid&#39;=>$value[&#39;pid&#39;],
        &#39;name&#39;=>$value[&#39;name&#39;]
    );
}
/**
 * 输出树形结构
 */
$str="<tr>
    <td><input type=&#39;checkbox&#39; name=&#39;list[\$id]&#39; value=&#39;\$id&#39;></td>
    <td>\$id</td>
    <td>\$spacer\$name</td>
    <td><a href=&#39;add.php?id=\$id&#39;>添加</a></td>
    <td><a href=&#39;del.php?id=\$id&#39;>删除</a></td>
    <td><a href=&#39;update.php?id=&#39;\$id&#39;>修改</a></td>
    </tr>";
$tree=new Tree();
$tree->init($tree_data);
echo "<table>";
echo $tree->get_tree(0, $str);
echo "</table>";
echo "<br/>";
echo "<br/>";
echo "<br/>";
echo "<br/>";
/**
 * 输出下拉列表
 */
$str="<option value=\$id \$selected>\$spacer\$name</option>";
$tree=new Tree();
$tree->init($tree_data);
echo "<select>";
echo $tree->get_tree(0, $str,2);
echo "</select>";

tree.class.php

<?php
/**
* 通用的树型类，可以生成任何树型结构
*/
class tree {
	/**
	* 生成树型结构所需要的2维数组
	* @var array
	*/
	public $arr = array();

	/**
	* 生成树型结构所需修饰符号，可以换成图片
	* @var array
	*/
	public $icon = array(&#39;│&#39;,&#39;├&#39;,&#39;└&#39;);
	public $nbsp = " ";

	/**
	* @access private
	*/
	public $ret = &#39;&#39;;

	/**
	* 构造函数，初始化类
	* @param array 2维数组，例如：
	* array(
	*      1 => array(&#39;id&#39;=>&#39;1&#39;,&#39;parentid&#39;=>0,&#39;name&#39;=>&#39;一级栏目一&#39;),
	*      2 => array(&#39;id&#39;=>&#39;2&#39;,&#39;parentid&#39;=>0,&#39;name&#39;=>&#39;一级栏目二&#39;),
	*      3 => array(&#39;id&#39;=>&#39;3&#39;,&#39;parentid&#39;=>1,&#39;name&#39;=>&#39;二级栏目一&#39;),
	*      4 => array(&#39;id&#39;=>&#39;4&#39;,&#39;parentid&#39;=>1,&#39;name&#39;=>&#39;二级栏目二&#39;),
	*      5 => array(&#39;id&#39;=>&#39;5&#39;,&#39;parentid&#39;=>2,&#39;name&#39;=>&#39;二级栏目三&#39;),
	*      6 => array(&#39;id&#39;=>&#39;6&#39;,&#39;parentid&#39;=>3,&#39;name&#39;=>&#39;三级栏目一&#39;),
	*      7 => array(&#39;id&#39;=>&#39;7&#39;,&#39;parentid&#39;=>3,&#39;name&#39;=>&#39;三级栏目二&#39;)
	*      )
	*/
	public function init($arr=array()){
       $this->arr = $arr;
	   $this->ret = &#39;&#39;;
	   return is_array($arr);
	}

    /**
	* 得到父级数组
	* @param int
	* @return array
	*/
	public function get_parent($myid){
		$newarr = array();
		if(!isset($this->arr[$myid])) return false;
		$pid = $this->arr[$myid][&#39;parentid&#39;];
		$pid = $this->arr[$pid][&#39;parentid&#39;];
		if(is_array($this->arr)){
			foreach($this->arr as $id => $a){
				if($a[&#39;parentid&#39;] == $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[&#39;parentid&#39;] == $myid) $newarr[$id] = $a;
			}
		}
		return $newarr ? $newarr : false;
	}

    /**
	* 得到当前位置数组
	* @param int
	* @return array
	*/
	public function get_pos($myid,&$newarr){
		$a = array();
		if(!isset($this->arr[$myid])) return false;
        $newarr[] = $this->arr[$myid];
		$pid = $this->arr[$myid][&#39;parentid&#39;];
		if(isset($this->arr[$pid])){
		    $this->get_pos($pid,$newarr);
		}
		if(is_array($newarr)){
			krsort($newarr);
			foreach($newarr as $v){
				$a[$v[&#39;id&#39;]] = $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 = &#39;&#39;, $str_group = &#39;&#39;){
		$number=1;
		$child = $this->get_child($myid);
		if(is_array($child)){
		    $total = count($child);
			foreach($child as $id=>$value){
				$j=$k=&#39;&#39;;
				if($number==$total){
					$j .= $this->icon[2];
				}else{
					$j .= $this->icon[1];
					$k = $adds ? $this->icon[0] : &#39;&#39;;
				}
				$spacer = $adds ? $adds.$j : &#39;&#39;;
				$selected = $id==$sid ? &#39;selected&#39; : &#39;&#39;;
				@extract($value);
				$parentid == 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;
	}
    /**
	* 同上一方法类似,但允许多选
	*/
	public function get_tree_multi($myid, $str, $sid = 0, $adds = &#39;&#39;){
		$number=1;
		$child = $this->get_child($myid);
		if(is_array($child)){
		    $total = count($child);
			foreach($child as $id=>$a){
				$j=$k=&#39;&#39;;
				if($number==$total){
					$j .= $this->icon[2];
				}else{
					$j .= $this->icon[1];
					$k = $adds ? $this->icon[0] : &#39;&#39;;
				}
				$spacer = $adds ? $adds.$j : &#39;&#39;;
				
				$selected = $this->have($sid,$id) ? &#39;selected&#39; : &#39;&#39;;
				@extract($a);
				eval("\$nstr = \"$str\";");
				$this->ret .= $nstr;
				$this->get_tree_multi($id, $str, $sid, $adds.$k.&#39; &#39;);
				$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, $str, $str2, $sid = 0, $adds = &#39;&#39;){
		$number=1;
		$child = $this->get_child($myid);
		if(is_array($child)){
		    $total = count($child);
			foreach($child as $id=>$a){
				$j=$k=&#39;&#39;;
				if($number==$total){
					$j .= $this->icon[2];
				}else{
					$j .= $this->icon[1];
					$k = $adds ? $this->icon[0] : &#39;&#39;;
				}
				$spacer = $adds ? $adds.$j : &#39;&#39;;
				
				$selected = $this->have($sid,$id) ? &#39;selected&#39; : &#39;&#39;;
				@extract($a);
				if (empty($html_disabled)) {
					eval("\$nstr = \"$str\";");
				} else {
					eval("\$nstr = \"$str2\";");
				}
				$this->ret .= $nstr;
				$this->get_tree_category($id, $str, $str2, $sid, $adds.$k.&#39; &#39;);
				$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 可增加其他样式如&#39;filetree treeview-famfamfam&#39;
	 * @param $currentlevel 计算当前层级，递归使用 适用改函数时不需要用该参数
	 * @param $recursion 递归使用 外部调用时为FALSE
	 */
    function get_treeview($myid,$effected_id=&#39;example&#39;,$str="<span class=&#39;file&#39;>\$name</span>", $str2="<span class=&#39;folder&#39;>\$name</span>" ,$showlevel = 0 ,$style=&#39;filetree &#39; , $currentlevel = 1,$recursion=FALSE) {
        $child = $this->get_child($myid);
        if(!defined(&#39;EFFECTED_INIT&#39;)){
           $effected = &#39; id="&#39;.$effected_id.&#39;"&#39;;
           define(&#39;EFFECTED_INIT&#39;, 1);
        } else {
           $effected = &#39;&#39;;
        }
		$placeholder = 	&#39;<ul><li><span class="placeholder"></span></li></ul>&#39;;
        if(!$recursion) $this->str .=&#39;<ul&#39;.$effected.&#39;  class="&#39;.$style.&#39;">&#39;;
        foreach($child as $id=>$a) {

        	@extract($a);
			if($showlevel > 0 && $showlevel == $currentlevel && $this->get_child($id)) $folder = &#39;hasChildren&#39;; //如设置显示层级模式@2011.07.01
        	$floder_status = isset($folder) ? &#39; class="&#39;.$folder.&#39;"&#39; : &#39;&#39;;		
            $this->str .= $recursion ? &#39;<ul><li&#39;.$floder_status.&#39; id=\&#39;&#39;.$id.&#39;\&#39;>&#39; : &#39;<li&#39;.$floder_status.&#39; id=\&#39;&#39;.$id.&#39;\&#39;>&#39;;
            $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 ? &#39;</li></ul>&#39;: &#39;</li>&#39;;
        }
        if(!$recursion)  $this->str .=&#39;</ul>&#39;;
        return $this->str;
    }
	
	/**
	 * 获取子栏目json
	 * Enter description here ...
	 * @param unknown_type $myid
	 */
	public function creat_sub_json($myid, $str=&#39;&#39;) {
		$sub_cats = $this->get_child($myid);
		$n = 0;
		if(is_array($sub_cats)) foreach($sub_cats as $c) {			
			$data[$n][&#39;id&#39;] = iconv(CHARSET,&#39;utf-8&#39;,$c[&#39;catid&#39;]);
			if($this->get_child($c[&#39;catid&#39;])) {
				$data[$n][&#39;liclass&#39;] = &#39;hasChildren&#39;;
				$data[$n][&#39;children&#39;] = array(array(&#39;text&#39;=>&#39; &#39;,&#39;classes&#39;=>&#39;placeholder&#39;));
				$data[$n][&#39;classes&#39;] = &#39;folder&#39;;
				$data[$n][&#39;text&#39;] = iconv(CHARSET,&#39;utf-8&#39;,$c[&#39;catname&#39;]);
			} else {				
				if($str) {
					@extract(array_iconv($c,CHARSET,&#39;utf-8&#39;));
					eval("\$data[$n][&#39;text&#39;] = \"$str\";");
				} else {
					$data[$n][&#39;text&#39;] = iconv(CHARSET,&#39;utf-8&#39;,$c[&#39;catname&#39;]);
				}
			}
			$n++;
		}
		return json_encode($data);		
	}
	private function have($list,$item){
		return(strpos(&#39;,,&#39;.$list.&#39;,&#39;,&#39;,&#39;.$item.&#39;,&#39;));
	}
}
?>

相关推荐：

php写的无限级selectTree类

위 내용은 PHP에서 트리 클래스를 사용하는 방법의 상세 내용입니다. 자세한 내용은 PHP 중국어 웹사이트의 기타 관련 기사를 참조하세요!

성명：
본 글의 내용은 네티즌들의 자발적인 기여로 작성되었으며, 저작권은 원저작자에게 있습니다. 본 사이트는 이에 상응하는 법적 책임을 지지 않습니다. 표절이나 침해가 의심되는 콘텐츠를 발견한 경우 admin@php.cn으로 문의하세요.
이전 기사：PHP가 직면할 수 있는 함정 2다음 기사：PHP가 직면할 수 있는 함정 2

관련 기사

더보기