通用的树型类,可以生成任何树型结构

2013-08-17   来源:站长日记       编辑:沧海桑田   类别:PHP 教程    转载到:    发表评论

通用的树型类,可以生成任何树型结构

< ?php

class tree {

var $arr = array();


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


var $ret = '';
var $parentid = 'parentid';

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][$this->parentid]; 
  if(isset($this->arr[$pid][$this->parentid])) {
      $pid = $this->arr[$pid][$this->parentid];
   foreach($this->arr as $id => $a) {
    if($a[$this->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[$this->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][$this->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;
}

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 = $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;',$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' : '';
    //echo $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.','));
}
}
? >
< ?php

$a = $newarr = array();
echo $newarr ? '1' : '2';
$category = 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'=>'三级栏目二')
);
$tree = new tree($category);
//$tree->parentid = 'fid';
$str  = $tree->get_tree(0, "< option value=\$id \$selected>\$spacer\$name< /option>");
echo '< select name="myselect">',$str,'< /select>

';

$str  = $tree->get_tree_multi(0, "< option  value=\$id \$selected>\$spacer\$name< /option>", '1,3,5' );
echo '< select size="5"  name="yourlike[]"  multiple>',$str,'< /select>

';

//print_r( $tree->get_parent(5));
//print_r( $tree->get_child(3));
//print_r( $tree->get_pos(7,$category));
? >

21

1
21|1 | 鲜花 VS 砸蛋 | 171阅读 0评论
 
不想登录?直接点击发布即可作为游客留言。
昵称  邮箱 网站 验证码 = 1+1