


How to use php to create an infinite tree menu [general tree type]
生成树型结构所需要的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 生成树形结构基本代码, 例如: "";$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.' ',$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.' '); $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.' '; $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>\n", 0, '' , "<optgroup label='\$name'></optgroup>"); echo $data; echo "</select>";
The above is the detailed content of How to use php to create an infinite tree menu [general tree type]. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.
