• php通用的树型类创建无限级树型菜单


    生成树型结构所需要的2维数组,var $arr = array()数组格式如下:

    array(
    1 => array('id'=>'1','parentID'=>0,'name'=>'一级栏目一'),
    2 => array('id'=>'2','parentID'=>0,'name'=>'一级栏目二'),
    3 => array('id'=>'3','parentID'=>1,'name'=>'二级栏目一'),
    4 => array('id'=>'4','parentID'=>1,'name'=>'二级栏目二'),
    5 => array('id'=>'5','parentID'=>2,'name'=>'二级栏目三'),
    6 => array('id'=>'6','parentID'=>3,'name'=>'三级栏目一'),
    7 => array('id'=>'7','parentID'=>3,'name'=>'三级栏目二')
    )

    生成树型结构所需修饰符号,可以换成图片:

    var $icon = array('│','├','└');
    var $ret = '';
    var $html='';

    构造函数,初始化类:

    function tree($arr=array())
        {
           $this->arr = $arr;
           $this->ret = '';
           return is_array($arr);
        }

    得到父级数组函数:

    function get_parent($myid)
        {
            $newarr = array();
            if(!isset($this->arr[$myid])) return false;
            $pid = $this->arr[$myid]['parentID'];
            $pid = $this->arr[$pid]['parentID'];
            if(is_array($this->arr))
            {
                foreach($this->arr as $id => $a)
                {
                    if($a['parentID'] == $pid) $newarr[$id] = $a;
                }
            }
            return $newarr;
        }

    得到子级数组函数:

    function get_child($myid)
        {
            $a = $newarr = array();
            if(is_array($this->arr))
            {
                foreach($this->arr as $id => $a)
                {
                    if(@$a['parentID'] == $myid) {
                        $newarr[$id] = $a;
                    }
                }
            }
            return $newarr ? $newarr : false;
        }

    得到当前位置数组:

    function get_pos($myid,&$newarr)
        {
            $a = array();
            if(!isset($this->arr[$myid])) return false;
            $newarr[] = $this->arr[$myid];
            $pid = $this->arr[$myid]['parentID'];
            if(isset($this->arr[$pid]))
            {
                $this->get_pos($pid,$newarr);
            }
            if(is_array($newarr))
            {
                krsort($newarr);
                foreach($newarr as $v)
                {
                    $a[$v['id']] = $v;
                }
            }
            return $a;
        }

    得到树型结构:

      $myid 表示获得这个ID下的所有子级;$str 生成树形结构基本代码, 例如: "<option value=$id $select>$spacer$name</option>";$sid 被选中的ID, 比如在做树形下拉框的时候需要用到;函数如下:

    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=>$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 = $a["id"]==$sid ? 'selected' : '';
                    @extract($a);
                    @$parentID == 0 && $str_group ? eval("$nstr = "$str_group";") : eval("$nstr = "$str";");
                    $this->ret .= $nstr;
                    $this->get_tree($id, $str, $sid, $adds.$k.'&nbsp;&nbsp;',$str_group);
                    $number++;
                }
            }
            return $this->ret;
        }

    同上一方法类似,但允许多选:

    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.'&nbsp;');
                    $number++;
                }
            }
            return $this->ret;
        }
     
        function have($list,$item){
            return(strpos(',,'.$list.',',','.$item.','));
        }

    格式化数组函数:

    function getArray($myid=0, $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 : '';
                    @extract($a);
                    $a['name'] = $spacer.' '.$a['name'];
                    $this->ret[$a['id']] = $a;
                    $fd = $adds.$k.'&nbsp;';
                    $this->getArray($id, $sid, $fd);
                    $number++;
                }
            }
     
            return $this->ret;
        }

    将数组转化为树形数组函数:

    public function arrToTree($data,$pid){
            $tree = array();
            foreach($data as $k => $v){
                if($v['parentID'] == $pid){
                    $v['parentID'] = $this->arrToTree($data,$v['id']);
                    $tree[] = $v;
                }
            }   
            return $tree;
        }

    左边菜单栏输出函数:

    public function outToHtml($tree){
            $html = '';
            foreach($tree as $t){
                if(empty($t['parentID'])){
                    $html .= "<li><a href="javascript:" onclick="$.bringBack({id:'$t[id]',name:'$t[name]'})">$t[name]</a></li>";
                }else{
                    $html .='<li><a href="javascript:">'.$t['name'].'</a><ul>';
                    $html .= $this->outToHtml($t['parentID']);
                    $html  = $html.'</ul></li>';
                }
            } 
            return $html;
        }

    实例化调用tree类格式如下:

     $tree = new tree;
     $tree->tree($categorys);
     echo "<select name="f_id" >";
     echo "<option value='0' >添加一级分类</option>";
     //get_tree(父ID,格式化字符窜,默认选中哪个分类,修饰前缀,父级分类样式) 前面两个必填,后面三个可选
     $data .= $tree->get_tree(0, "<option value='$id' $selected>$spacer$name</option>
    ", 0, '' , "<optgroup label='$name'></optgroup>");
     echo $data;
     echo "</select>";

    tree完整类下载地址:http://pan.baidu.com/s/1gfai1qj

    密码:sah8

  • 相关阅读:
    Atitit.ide eclipse编译速度慢的解决
    Atitit.ide eclipse编译速度慢的解决
    Atitit.可视化与报表原理与概论
    Atitit.可视化与报表原理与概论
    Atitit.数据检索与网络爬虫与数据采集的原理概论
    Atitit.数据检索与网络爬虫与数据采集的原理概论
    Atitit 游戏的原理与概论attilax总结
    Atitit 游戏的原理与概论attilax总结
    Atiti.ui原理与gui理论
    Atiti.ui原理与gui理论
  • 原文地址:https://www.cnblogs.com/sztx/p/9499761.html
Copyright © 2020-2023  润新知