国产av日韩一区二区三区精品,成人性爱视频在线观看,国产,欧美,日韩,一区,www.成色av久久成人,2222eeee成人天堂

Home php教程 php手冊 表格展示無限級分類(PHP版)

表格展示無限級分類(PHP版)

Jun 13, 2016 am 11:59 AM
php Classification Cell merge and accomplish right Hierarchy exhibit unlimited Version of sheet pass

TreeTable通過對單元格的行合并和列合并實現(xiàn)了無限層級也能較好的展示層級架構。
1.構建ID/PID/NAME的數(shù)組,后期可通過數(shù)據(jù)庫生成的動態(tài)數(shù)據(jù)。Tree算法請點擊

復制代碼 代碼如下:


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'=>'三級欄目二')
* )


 2. 導入TreeTable類庫。

復制代碼 代碼如下:


import('@.ORG.Util.TableTree'); //Thinkphp導入方法


3. 生成TreeTable HTML代碼

復制代碼 代碼如下:


$treeTable->init($treearr);
echo $treeTable->get_treetable();


注意:get_treetable()只生產表體部門,請自行構建。
完整代碼

復制代碼 代碼如下:


/**
* File name: TreeTable.class.php
* Author: run.gao 312854458@qq.com Date: 2012-07-24 23:22 GMT+8
* Description: 通用的表格無限級分類
* */
/**
* 表格展示無限分類是將無線分類已表格的形式表現(xiàn)出來,更好的能體現(xiàn)出分類的所屬關系
* 使用方法:
* 1. 實例化分類
* $treeTable = new TreeTable();
* 2. 初始化分類,$treearr必須是一個多維數(shù)組且包含 id,parentid,name字段
* $treeTable->init($treearr);
* 3. 獲取無限分類HTML代碼
* echo $treeTable->get_treetable();
* */
class TreeTable {
/**
* 生成樹型結構所需要的2維數(shù)組
* @var array
*/
public $arr = array();
/**
* 表格列數(shù)
* @var int
*/
public $columns = 0;
/**
* 表格行數(shù)
* @var int
*/
public $rows = 0;
/**
* 初始化TreeTable數(shù)據(jù)
* @param array 2維數(shù)組
* 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'=>'三級欄目二')
* )
*/
public function init($arr=array()){
if(!is_array($arr)) return false;
foreach ($arr as $k=>$v) {
$this->arr[$v['id']] = $v;
}
foreach ($this->arr as $k => $v){
$this->arr[$k]['column'] = $this->get_level($v['id']); // Y軸位置
$this->arr[$k]['arrchildid'] = $this->get_arrchildid($v['id']); // 所有子節(jié)點
$this->arr[$k]['arrparentid'] = $this->get_arrparentid($v['id']); // 所有父節(jié)點
$this->arr[$k]['child_bottom_num'] = $this->get_child_count($v['id']); // 所有底層元素節(jié)點
}
$this->columns = $this->get_columns(); // 總行數(shù)
$this->rows = $this->get_rows(); // 總列數(shù)
// 按照arrparentid和id號進行排序
$this->sort_arr();
foreach ($this->arr as $k => $v){
$this->arr[$k]['row'] = $this->get_row_location($v['id']); // X軸位置
$this->arr[$k]['rowspan'] = $v['child_bottom_num']; // 行合并數(shù)
$this->arr[$k]['colspan'] = $v['child_bottom_num'] == 0 ? $this->columns - $v['column'] + 1 : 0; //列合并數(shù)
}
return $this->get_tree_arr();
}
/**
* 獲取數(shù)組
* */
public function get_tree_arr(){
return is_array($this->arr) ? $this->arr : false;
}
/**
* 按arrparentid/id號依次重新排序數(shù)組
* */
public function sort_arr(){
// 要進行排序的字段
foreach ($this->arr as $k => $v){
$order_pid_arr[$k] = $v['arrparentid'];
$order_iscost[] = $v['sort'];
$order_id_arr[$k] = $v['id'];
}
// 先根據(jù)arrparentid排序,再根據(jù)排序,id號排序
array_multisort(
$order_pid_arr, SORT_ASC, SORT_STRING,
$order_iscost, SORT_DESC, SORT_NUMERIC,
$order_id_arr, SORT_ASC, SORT_NUMERIC,
$this->arr);
// 獲取每一個節(jié)點層次
for ($column = 1; $column columns; $column++) {
$row_level = 0;
foreach ($this->arr as $key => $node){
if ($node['column'] == $column){
$row_level++;
$this->arr[$key]['column_level'] = $row_level;
}
}
}
// 重新計算以ID作為鍵名
foreach ($this->arr as $k=>$v) {
$arr[$v['id']] = $v;
}
$this->arr = $arr;
}
/**
* 得到父級數(shù)組
* @param int
* @return array
*/
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;
}
/**
* 得到子級數(shù)組
* @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['parentid'] == $myid) $newarr[$id] = $a;
}
}
return $newarr ? $newarr : false;
}
/**
* 獲取當前節(jié)點所在的層級
* @param $myid 當前節(jié)點ID號
* */
public function get_level($myid, $init = true){
static $level = 1;
if($init) $level = 1;
if ($this->arr[$myid]['parentid']) {
$level++;
$this->get_level($this->arr[$myid]['parentid'], false);
}
return $level;
}
/**
* 獲取當前節(jié)點所有底層節(jié)點(沒有子節(jié)點的節(jié)點)的數(shù)量
* @param $myid 節(jié)點ID號
* @param $init 第一次加載將情況static變量
* */
public function get_child_count($myid, $init = true){
static $count = 0;
if($init) $count = 0;
if(!$this->get_child($myid) && $init) return 0;
if($childarr = $this->get_child($myid)){
foreach ($childarr as $v){
$this->get_child_count($v['id'], false);
}
}else{
$count++;
}
return $count;
}
/**
* 獲取節(jié)點所有子節(jié)點ID號
* @param $catid 節(jié)點ID號
* @param $init 第一次加載將情況static初始化
* */
public function get_arrchildid($myid, $init = true) {
static $childid;
if($init) $childid = '';
if(!is_array($this->arr)) return false;
foreach($this->arr as $id => $a){
if($a['parentid'] == $myid) {
$childid = $childid ? $childid.','.$a['id'] : $a['id'];
$this->get_arrchildid($a['id'], false);
}
}
return $childid ;
}
/**
* 獲取該節(jié)點所有父節(jié)點ID號
* @param $id 節(jié)點ID號
* */
public function get_arrparentid($id, $arrparentid = '') {
if(!is_array($this->arr)) return false;
$parentid = $this->arr[$id]['parentid'];
if($parentid > 0) $arrparentid = $arrparentid ? $parentid.','.$arrparentid : $parentid;
if($parentid) $arrparentid = $this->get_arrparentid($parentid, $arrparentid);
return $arrparentid;
}
/**
* 獲取節(jié)點所在地行定位
* @param $myid 節(jié)點ID號
*/
public function get_row_location($myid){
$nodearr = $this->arr;
// 獲取每一個節(jié)點所在行的位置
foreach ($nodearr as $key => $node){
if($myid == $node['id']) {
$node_row_count = 0;
$arrparentid = explode(',', $node['arrparentid']);
// 所有父節(jié)點小于當前節(jié)點層次的底層節(jié)點等于0的元素
foreach ($arrparentid as $pid){
foreach ($nodearr as $node_row){
if($node_row['column'] == $nodearr[$pid]['column'] && $nodearr[$pid]['column_level'] > $node_row['column_level'] && $node_row['child_bottom_num'] == 0){
$node_row_count ++;
}
}
}
// 所有當前節(jié)點并且節(jié)點層次(rowid_level)小于當前節(jié)點層次的個數(shù)
foreach ($nodearr as $node_row){
if($node['column'] == $node_row['column'] && $node_row['column_level'] $node_row_count += $node_row['child_bottom_num'] ? $node_row['child_bottom_num'] : 1;
}
}
$node_row_count++;
break;
}
}
return $node_row_count;
}
/**
* 獲取表格的行數(shù)
* */
public function get_rows(){
$row = 0;
foreach ($this->arr as $key => $node){
if($node['child_bottom_num'] == 0){
$rows++; // 總行數(shù)
}
}
return $rows;
}
/**
* 獲取表格的列數(shù)
* */
public function get_columns(){
$columns = 0 ;
foreach ($this->arr as $key => $node){
if($node['column'] > $columns){
$columns = $node['column']; // 總列數(shù)
}
}
return $columns;
}
/**
* 獲取分類的表格展現(xiàn)形式(不包含表頭)
* */
public function get_treetable(){
$table_string = '';
for($row = 1; $row rows; $row++){
$table_string .= "\r\t

";
foreach ($this->arr as $v){
if($v['row'] == $row){
$rowspan = $v['rowspan'] ? "rowspan='{$v['rowspan']}'" : '';
$colspan = $v['colspan'] ? "colspan='{$v['colspan']}'" : '';
$table_string .= "\r\t\t
{$v['name']}
";
}
}
$table_string .= "\r\t";
}
return $table_string;
}
}
?>
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undress AI Tool

Undress AI Tool

Undress images for free

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

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

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

How to upgrade PHP version? How to upgrade PHP version? Jun 27, 2025 am 02:14 AM

Upgrading the PHP version is actually not difficult, but the key lies in the operation steps and precautions. The following are the specific methods: 1. Confirm the current PHP version and running environment, use the command line or phpinfo.php file to view; 2. Select the suitable new version and install it. It is recommended to install it with 8.2 or 8.1. Linux users use package manager, and macOS users use Homebrew; 3. Migrate configuration files and extensions, update php.ini and install necessary extensions; 4. Test whether the website is running normally, check the error log to ensure that there is no compatibility problem. Follow these steps and you can successfully complete the upgrade in most situations.

How do I prevent cross-site request forgery (CSRF) attacks in PHP? How do I prevent cross-site request forgery (CSRF) attacks in PHP? Jun 28, 2025 am 02:25 AM

TopreventCSRFattacksinPHP,implementanti-CSRFtokens.1)Generateandstoresecuretokensusingrandom_bytes()orbin2hex(random_bytes(32)),savethemin$_SESSION,andincludetheminformsashiddeninputs.2)ValidatetokensonsubmissionbystrictlycomparingthePOSTtokenwiththe

PHP beginner guide: Detailed explanation of local environment configuration PHP beginner guide: Detailed explanation of local environment configuration Jun 27, 2025 am 02:09 AM

To set up a PHP development environment, you need to select the appropriate tools and install the configuration correctly. ①The most basic PHP local environment requires three components: the web server (Apache or Nginx), the PHP itself and the database (such as MySQL/MariaDB); ② It is recommended that beginners use integration packages such as XAMPP or MAMP, which simplify the installation process. XAMPP is suitable for Windows and macOS. After installation, the project files are placed in the htdocs directory and accessed through localhost; ③MAMP is suitable for Mac users and supports convenient switching of PHP versions, but the free version has limited functions; ④ Advanced users can manually install them by Homebrew, in macOS/Linux systems

How to combine two php arrays unique values? How to combine two php arrays unique values? Jul 02, 2025 pm 05:18 PM

To merge two PHP arrays and keep unique values, there are two main methods. 1. For index arrays or only deduplication, use array_merge and array_unique combinations: first merge array_merge($array1,$array2) and then use array_unique() to deduplicate them to finally get a new array containing all unique values; 2. For associative arrays and want to retain key-value pairs in the first array, use the operator: $result=$array1 $array2, which will ensure that the keys in the first array will not be overwritten by the second array. These two methods are applicable to different scenarios, depending on whether the key name is retained or only the focus is on

How to use php exit function? How to use php exit function? Jul 03, 2025 am 02:15 AM

exit() is a function in PHP that is used to terminate script execution immediately. Common uses include: 1. Terminate the script in advance when an exception is detected, such as the file does not exist or verification fails; 2. Output intermediate results during debugging and stop execution; 3. Call exit() after redirecting in conjunction with header() to prevent subsequent code execution; In addition, exit() can accept string parameters as output content or integers as status code, and its alias is die().

Applying Semantic Structure with article, section, and aside in HTML Applying Semantic Structure with article, section, and aside in HTML Jul 05, 2025 am 02:03 AM

The rational use of semantic tags in HTML can improve page structure clarity, accessibility and SEO effects. 1. Used for independent content blocks, such as blog posts or comments, it must be self-contained; 2. Used for classification related content, usually including titles, and is suitable for different modules of the page; 3. Used for auxiliary information related to the main content but not core, such as sidebar recommendations or author profiles. In actual development, labels should be combined and other, avoid excessive nesting, keep the structure simple, and verify the rationality of the structure through developer tools.

How do I access session data in PHP? How do I access session data in PHP? Jun 30, 2025 am 01:33 AM

To access session data in PHP, you must first start the session and then operate through the $_SESSION hyperglobal array. 1. The session must be started using session_start(), and the function must be called before any output; 2. When accessing session data, check whether the key exists. You can use isset($_SESSION['key']) or array_key_exists('key',$_SESSION); 3. Set or update session variables only need to assign values ??to the $_SESSION array without manually saving; 4. Clear specific data with unset($_SESSION['key']), clear all data and set $_SESSION to an empty array.

What are recursive functions in PHP? What are recursive functions in PHP? Jun 29, 2025 am 02:02 AM

Recursive functions refer to self-call functions in PHP. The core elements are 1. Defining the termination conditions (base examples), 2. Decomposing the problem and calling itself recursively (recursive examples). It is suitable for dealing with hierarchical structures, disassembling duplicate subproblems, or improving code readability, such as calculating factorials, traversing directories, etc. However, it is necessary to pay attention to the risks of memory consumption and stack overflow. When writing, the exit conditions should be clarified, the basic examples should be gradually approached, the redundant parameters should be avoided, and small inputs should be tested. For example, when scanning a directory, the function encounters a subdirectory and calls itself recursively until all levels are traversed.

See all articles