无限分类 递归
2016-05-12
1558
简介:
在所有栏目、地区等下拉菜单中,这个类非常好用。
- <?php
- include("tree.class.php");
-
-
- $list = array(
- 1 => array('id' => '1', 'pid' => 0, 'name' => '一级栏目一'),
- 2 => array('id' => '2', 'pid' => 0, 'name' => '一级栏目二'),
- 3 => array('id' => '3', 'pid' => 1, 'name' => '二级栏目一'),
- 4 => array('id' => '4', 'pid' => 1, 'name' => '二级栏目二'),
- 5 => array('id' => '5', 'pid' => 2, 'name' => '二级栏目三'),
- 6 => array('id' => '6', 'pid' => 3, 'name' => '三级栏目一'),
- 7 => array('id' => '7', 'pid' => 3, 'name' => '三级栏目二')
- );
-
- $tree = new tree($list);
- $html = "<select name='cat'>";
- $str = "<option value=\$id \$selected>\$spacer\$name</option>";
- $html .= $tree->get_tree(0, $str);
- $html .= "</select>";
-
- echo($html);
- ?>
tree.class.php
- <?php
-
-
-
- class tree {
-
-
-
-
- public $arr = array();
-
-
-
-
-
- public $icon = array('│','├','└');
- public $nbsp = " ";
-
-
-
-
- public $ret = '';
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- public function __construct($arr=array()){
- $this->arr = $arr;
- $this->ret = '';
- return is_array($arr);
- }
-
-
-
-
-
-
- public 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;
- }
-
-
-
-
-
-
- public 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;
- }
-
-
-
-
-
-
- public 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;
- }
-
-
-
-
-
-
-
-
- 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' : '';
- @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 = ''){
- $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;
- }
-
-
-
-
-
-
-
- public function get_tree_category($myid, $str, $str2, $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($html_disabled)) {
- eval("\$nstr = \"$str\";");
- } else {
- eval("\$nstr = \"$str2\";");
- }
- $this->ret .= $nstr;
- $this->get_tree_category($id, $str, $str2, $sid, $adds.$k.' ');
- $number++;
- }
- }
- return $this->ret;
- }
-
-
-
-
-
-
-
-
-
-
-
-
- function get_treeview($myid,$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';
- $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;
- }
-
-
-
-
-
-
- public function creat_sub_json($myid, $str='') {
- $sub_cats = $this->get_child($myid);
- $n = 0;
- if(is_array($sub_cats)) foreach($sub_cats as $c) {
- $data[$n]['id'] = iconv(CHARSET,'utf-8',$c['catid']);
- if($this->get_child($c['catid'])) {
- $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']);
- } 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']);
- }
- }
- $n++;
- }
- return json_encode($data);
- }
- private 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 . $this->nbsp;
- $this->getArray($id, $sid, $fd);
- $number++;
- }
- }
-
- return $this->ret;
- }
- ?>
递归实现层级树状展现数据
- <?php
-
- function arr2tree($tree, $rootId = 0, $idName='id', $parentIdName='pid') {
- $return = array();
- foreach ($tree as $leaf) {
- if ($leaf[$parentIdName] == $rootId) {
- foreach ($tree as $subleaf) {
- if ($subleaf[$parentIdName] == $leaf[$idName]) {
- $leaf['children'] = arr2tree($tree, $leaf[$idName]);
- break;
- }
- }
- $return[] = $leaf;
- }
- }
- return $return;
- }
-
- $tree = arr2tree($data);
- print_r($tree);
- echo '<br/>-----------------------------------------------------------------------<br/>';
-
-
- function tree2html($tree) {
- echo '<ul>';
- foreach ($tree as $leaf) {
- echo '<li>' . $leaf['name'];
- if (!empty($leaf['children'])) tree2html($leaf['children']);
- echo '</li>';
- }
- echo '</ul>';
- }
-
- tree2html($tree);
版权声明:本文内容由阿里云实名注册用户自发贡献,版权归原作者所有,阿里云开发者社区不拥有其著作权,亦不承担相应法律责任。具体规则请查看《阿里云开发者社区用户服务协议》和《阿里云开发者社区知识产权保护指引》。如果您发现本社区中有涉嫌抄袭的内容,填写侵权投诉表单进行举报,一经查实,本社区将立刻删除涉嫌侵权内容。