search
HomeBackend DevelopmentPHP TutorialTree structure data access class instance implemented by PHP, tree instance_PHP tutorial

Instance of tree structure data access class implemented by PHP, tree instance

The example in this article describes the tree structure data access class implemented by PHP. Share it with everyone for your reference.

The specific implementation code is as follows:

Copy code The code is as follows:
/**
 * Tanphp framework
 *
 *
 * @category   Tanphp
 * @package    Data_structure
 * @version    $Id: Tree.php 25024 2012-11-26 22:22:22 tanbo $
 */

/**
* Tree structure data access class
*
* Used for fast access to tree structure data
*
* @param array $arr The parameter must be a standard two-dimensional array, including the index field (id) and the field representing the tree structure (path), as shown in example
*
* @example <br> * $arr = array( <br> * array( 'id' => 1, 'name' => 'php', 'path' => '1' ), <br> * array( 'id' => 3, 'name' => 'php1', 'path' => '1-3' ), <br> * array( 'id' => 2, 'name' => 'mysql', 'path' => '2' ), <br> * array( 'id' => 6, 'name' => 'mysql1', 'path' => '2-6' ), <br> * array( 'id' => 7, 'name' => 'mysql2', 'path' => '2-7' ), <br> * array( 'id' => 5, 'name' => 'php11', 'path' => '1-3-5' ), <br> * array( 'id' => 4, 'name' => 'php2', 'path' => '1-4' ), <br> * ); <br> * $cate = new Tree($arr); <br> * <br> * $data = $cate->getChild(2); <br> * <br> * print_r($data->toArray()); <br> *
*
​*/
class Tree
{
Public $_info; //Node information
Public $_child = array(); //Child node
private $_parent; //Parent node
private $_data; //Temporary data for the current operation
Private static $_indexs = array(); //Indices of all nodes
Private static $_index_key = 'id'; //Index key
Private static $_tree_key = 'path'; //Tree structure expression key
Private static $_tree_delimiter = '-'; //Attribute structure expression delimiter
     
/**
* Constructor
* *
* @param array $arr
* @param boole $force_sort If true, $arr will be forced to be sorted
* @return void
​​*/
Public function __construct(array $arr = array(), $force_sort=true)
{
If ($force_sort === true) {
                  $arr=$this->_array_sort($arr, self::$_tree_key);
          }
If (!emptyempty($arr)) {
                  $this->_init($arr);
          }
}
     
/**
* Initial storage of tree data
* *
* @param array $arr
* @return void
​​*/
Private function _init(array $arr)
{
foreach ($arr as $item) {
                                                                                                                                                                                                                                                                                                                                                                                             $count_paths = count($paths);
$parent_id = isset($paths[$count_paths-2]) ? $paths[$count_paths-2] : NULL;
                                                                          if ( $count_paths>1                                                                                                                                                                                                             && array_key_exists($parent_id, self::$_indexs)                                                                  ​                                                                                                                                                                                                                                          && self::$_indexs[$parent_id] instanceof Tree                          ) {
                                                            self::$_indexs[$parent_id]->addChild($item);
                } elseif ($count_paths == 1) {
$this->addChild($item);
                } else {
                      throw new Exception("path data error".var_export($item, true));
               }
          }
                                   
​​​​ //print_r(self::$_indexs);
}
     
/**
* Add child node
* *
* @param array $item
* @return void
​​*/
Public function addChild(array $item, $parent = NULL)
{
$child = new Tree();
$child->_info = $item;
$child->_parent = $parent == NULL ? $this : $parent;
$child->_parent->_child[] = $child;
                                   
            $this->_addIndex($item, $child->_getSelf());
}
     
/**
* Add node to index
* *
* @param array $item
* @param mix $value
* @return void
​​*/
Private function _addIndex(array $item, $value)
{
If (array_key_exists(self::$_index_key, $item) && is_int($item[self::$_index_key])) {
                  self::$_indexs[$item[self::$_index_key]] = $value;
         } else {
                  throw new Exception("The id field does not exist or is not a string");
          }
}
     
/**
* Get a reference to yourself
* *
* @return Tree object quote
​​*/
Private function _getSelf()
{
          return $this;
}
     
/**
* * Get the child nodes of the node with the specified id
* *
* @param int $id
* @return Tree object
​​*/
Public function getChild($id)
{
        $data       = self::$_indexs[$id]->_child;
        $this->_data = $data;
        return $this;
    }
    
    /**
* Get the parent node of the node with the specified id
* *
* @param int $id
* @return Tree object
​​*/
    public function getParent($id)
    {
        $data = self::$_indexs[$id]->_parent;
        $this->_data = $data;
        return $this;
    }
    
    /**
* Get the sibling nodes of the node with the specified id
* *
* @param int $id
* @return Tree object
​​*/
    public function getBrother($id)
    {
        $data = self::$_indexs[$id]->_parent->_child;
        $this->_data = $data;
        return $this;
    }
    
    /**
* Convert Tree object into array
* *
* @param object $object
* @return array
​​*/
     public function toArray($obj = NULL)
     {
        $obj  = ($obj === NULL) ? $this->_data : $obj;
        $arr  = array();
        $_arr = is_object($obj) ? $this->_getBaseInfo($obj) : $obj;
        
        if (is_array($_arr)) {
            foreach ($_arr as $key => $val){
                
                $val = (is_array($val) || is_object($val)) ? $this->toArray($val) : $val;
                $arr[$key] = $val;
            }
        } else {
            throw new Exception("_arr不是数组");
        }
     
        return $arr;
    }
    
    /**
* * Filter fields such as _parent to avoid infinite loops
* *
* @param object $obj
* @return void
​​*/
    private function _getBaseInfo($obj)
    {
        $vars = get_object_vars($obj);
        $baseInfo['_info']  =  $vars['_info'];
        $baseInfo['_child'] =  $vars['_child'];
        return $baseInfo;
    }
    
    /**
* * Two-dimensional array sorting
* *
* Arrange the two-dimensional array in ascending or descending order according to the specified key name
* *
* @param array $arr two-dimensional array
* @param string $keys
* @param string $type must be asc or desc
* @throws throws an exception when the parameter is illegal
* @return Returns the sorted array
​​*/
    private function _array_sort(array $arr, $keys, $type = 'asc') {
If (!is_string($keys)) {
                  throw new Exception("Illegal parameter keys: The type of parameter keys must be string");
          }
     
          $keysvalue = $new_array = array();
foreach ($arr as $k=>$v) {
If (!is_array($v) || !isset($v[$keys])) {
                      throw new Exception("The parameter arr is not a two-dimensional array or the key '{$keys}' does not exist in the arr sub-element");
               }
               $keysvalue[$k] = $v[$keys];
          }
     
          switch ($type) {
case 'asc':
asort($keysvalue);
break;
case 'desc':
                 arsort($keysvalue);
break;
                  default:
                         throw new Exception("Illegal parameter type: the value of parameter type must be 'asc' or 'desc'");
          }
     
          reset($keysvalue);
foreach ($keysvalue as $k=>$v) {
                $new_array[$k] = $arr[$k];
          }
          return $new_array;
}
}
?>

I hope this article will be helpful to everyone’s PHP programming design.

www.bkjia.comtruehttp: //www.bkjia.com/PHPjc/919620.htmlTechArticleExamples of tree structure data access classes implemented by php, tree examples. This example describes the tree structure implemented by php. Structural data access classes. Share it with everyone for your reference. The specific implementation code is as follows...
Statement
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
The Continued Use of PHP: Reasons for Its EnduranceThe Continued Use of PHP: Reasons for Its EnduranceApr 19, 2025 am 12:23 AM

What’s still popular is the ease of use, flexibility and a strong ecosystem. 1) Ease of use and simple syntax make it the first choice for beginners. 2) Closely integrated with web development, excellent interaction with HTTP requests and database. 3) The huge ecosystem provides a wealth of tools and libraries. 4) Active community and open source nature adapts them to new needs and technology trends.

PHP and Python: Exploring Their Similarities and DifferencesPHP and Python: Exploring Their Similarities and DifferencesApr 19, 2025 am 12:21 AM

PHP and Python are both high-level programming languages ​​that are widely used in web development, data processing and automation tasks. 1.PHP is often used to build dynamic websites and content management systems, while Python is often used to build web frameworks and data science. 2.PHP uses echo to output content, Python uses print. 3. Both support object-oriented programming, but the syntax and keywords are different. 4. PHP supports weak type conversion, while Python is more stringent. 5. PHP performance optimization includes using OPcache and asynchronous programming, while Python uses cProfile and asynchronous programming.

PHP and Python: Different Paradigms ExplainedPHP and Python: Different Paradigms ExplainedApr 18, 2025 am 12:26 AM

PHP is mainly procedural programming, but also supports object-oriented programming (OOP); Python supports a variety of paradigms, including OOP, functional and procedural programming. PHP is suitable for web development, and Python is suitable for a variety of applications such as data analysis and machine learning.

PHP and Python: A Deep Dive into Their HistoryPHP and Python: A Deep Dive into Their HistoryApr 18, 2025 am 12:25 AM

PHP originated in 1994 and was developed by RasmusLerdorf. It was originally used to track website visitors and gradually evolved into a server-side scripting language and was widely used in web development. Python was developed by Guidovan Rossum in the late 1980s and was first released in 1991. It emphasizes code readability and simplicity, and is suitable for scientific computing, data analysis and other fields.

Choosing Between PHP and Python: A GuideChoosing Between PHP and Python: A GuideApr 18, 2025 am 12:24 AM

PHP is suitable for web development and rapid prototyping, and Python is suitable for data science and machine learning. 1.PHP is used for dynamic web development, with simple syntax and suitable for rapid development. 2. Python has concise syntax, is suitable for multiple fields, and has a strong library ecosystem.

PHP and Frameworks: Modernizing the LanguagePHP and Frameworks: Modernizing the LanguageApr 18, 2025 am 12:14 AM

PHP remains important in the modernization process because it supports a large number of websites and applications and adapts to development needs through frameworks. 1.PHP7 improves performance and introduces new features. 2. Modern frameworks such as Laravel, Symfony and CodeIgniter simplify development and improve code quality. 3. Performance optimization and best practices further improve application efficiency.

PHP's Impact: Web Development and BeyondPHP's Impact: Web Development and BeyondApr 18, 2025 am 12:10 AM

PHPhassignificantlyimpactedwebdevelopmentandextendsbeyondit.1)ItpowersmajorplatformslikeWordPressandexcelsindatabaseinteractions.2)PHP'sadaptabilityallowsittoscaleforlargeapplicationsusingframeworkslikeLaravel.3)Beyondweb,PHPisusedincommand-linescrip

How does PHP type hinting work, including scalar types, return types, union types, and nullable types?How does PHP type hinting work, including scalar types, return types, union types, and nullable types?Apr 17, 2025 am 12:25 AM

PHP type prompts to improve code quality and readability. 1) Scalar type tips: Since PHP7.0, basic data types are allowed to be specified in function parameters, such as int, float, etc. 2) Return type prompt: Ensure the consistency of the function return value type. 3) Union type prompt: Since PHP8.0, multiple types are allowed to be specified in function parameters or return values. 4) Nullable type prompt: Allows to include null values ​​and handle functions that may return null values.

See all articles

Hot AI Tools

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.

Undress AI Tool

Undress AI Tool

Undress images for free

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

SublimeText3 English version

SublimeText3 English version

Recommended: Win version, supports code prompts!

mPDF

mPDF

mPDF is a PHP library that can generate PDF files from UTF-8 encoded HTML. The original author, Ian Back, wrote mPDF to output PDF files "on the fly" from his website and handle different languages. It is slower than original scripts like HTML2FPDF and produces larger files when using Unicode fonts, but supports CSS styles etc. and has a lot of enhancements. Supports almost all languages, including RTL (Arabic and Hebrew) and CJK (Chinese, Japanese and Korean). Supports nested block-level elements (such as P, DIV),

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

MinGW - Minimalist GNU for Windows

MinGW - Minimalist GNU for Windows

This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

Atom editor mac version download

Atom editor mac version download

The most popular open source editor