search
HomeBackend DevelopmentPHP TutorialThe class for formatting the node tree is not well written and has no algorithm, but it can be used.

Format the classified data fetched from the database, such as:

News
--Sports News
--Entertainment News
Finance
--Forex
--Finance
  1. class tree
  2. {
  3. /**Raw data*/
  4. public $original;
  5. /**key name of id*/
  6. public $id;
  7. /**父The key name of the parent id*/
  8. public $parentId;
  9. /**id during initialization*/
  10. protected $initId;
  11. /**node level*/
  12. protected $thisLevel = 0;
  13. /**final tree*/
  14. protected $tree = array();
  15. /**
  16. * 构造函数
  17. +------------------------------------------
  18. * @access public
  19. +------------------------------------------
  20. * @param array $original
  21. * Constructor
  22. +------------------------------------------------
  23. * @access public
  24. +------------------------------------------------
  25. * @ param array $original original data
  26. * @param string $id key name of id
  27. * @param string $parentId key name of parent id
  28. +------------------- -----------------------
  29. * @return void
  30. * @param string $id
  31. * Initialization
  32. +------------------------------------------------
  33. * @ access public
  34. +------------------------------------------------
  35. * @param array $original Original data
  36. * @param string $id The key name of id
  37. * @param string $parentId The key name of parent id
  38. +-------------------------- -----------------------
  39. * @return void
  40. * @param string $parentId 父
  41. * Get initial node
  42. +------------------------------------------------ ---
  43. * @access protected
  44. +---------------------------------------- ------
  45. * @param int $parentId The level of the initial node
  46. +---------------------------------- ---------------
  47. * @return array $parentTree
  48. +------------------------------------------
  49. * @return void
  50. */
  51. public function __construct($original='',$id='',$parentId='')
  52. {
  53. if($original && $id && $parentId)
  54. {
  55. $this->initialize($original,$id,$parentId);
  56. }
  57. }
  58. /**
  59. * 初始化
  60. +------------------------------------------
  61. * @access public
  62. +------------------------------------------
  63. * @param array $original
  64. * Get subtree
  65. +------------------------------------------------ ---
  66. * @access protected
  67. +---------------------------------------- ------
  68. * @param int $id node id
  69. * @param string $levelTag indentation mark
  70. +---------------------- --------------------------
  71. * @return void
  72. * @param string $id
  73. * Get the level of the node
  74. +--------------------------------------------- -------
  75. * @access protected
  76. +------------------------------------------------ -------------
  77. * @param int $parentId The parent id of the node
  78. +------------------------ ------------------------
  79. * @return void
  80. * @param string $parentId 父
  81. * Get the complete tree
  82. +--------------------------------------------- -------
  83. * @access public
  84. +------------------------------------------------ -------------
  85. * @param int $level From what level to get
  86. * @param string $levelTag Indent tag
  87. +------------- ------------------------------------
  88. * @return array $this->tree complete tree
  89. +------------------------------------------
  90. * @return void
  91. */
  92. public function initialize($original,$id,$parentId)
  93. {
  94. $this->original = $original;
  95. $this->id = $id;
  96. $this->parentId = $parentId;
  97. }
  98. /**
  99. * 获取初始节点
  100. +----------------------------------------------
  101. * @access protected
  102. +----------------------------------------------
  103. * @param int $parentId 初始&
  104. +----------------------------------------------
  105. * @return array $parentTree
  106. */
  107. protected function getParentTree($parentId)
  108. {
  109. $parentTree = array();
  110. foreach($this->original as $key=>$value)
  111. {
  112. if($value[$this->parentId] == $parentId)
  113. {
  114. array_push($parentTree,$value);
  115. }
  116. }
  117. return $parentTree;
  118. }
  119. /**&*/
  120. protected function getChildrenTree($id,$levelTag)
  121. {
  122. foreach($this->original as $key=>$value)
  123. {
  124. if($id == $value[$this->parentId])
  125. {
  126. if($levelTag)
  127. {
  128. $this->getLevel($value[$this->parentId]);
  129. $value['levelTag'] = str_repeat($levelTag,$this->thisLevel);
  130. $this->thisLevel = 0;
  131. }
  132. $this->tree[] = $value;
  133. $this->getChildrenTree($value[$this->id],$levelTag);
  134. }
  135. }
  136. }
  137. /**
  138. * 获取&🎜 +-------------------------------------------------🎜 * @access protected🎜 +-------------------------------------------------🎜 * @param int $parentId 节点的父id🎜 +-------------------------------------------------🎜 * @return void🎜 */🎜 protected function getLevel($parentId)🎜 {🎜 foreach($this->original as $key=>$value)🎜 {🎜 if($parentId == $value[$this->id] && $parentId != $this->initId)🎜 {🎜 $this->thisLevel++;🎜 $this->getLevel($value[$this->parentId]);🎜 }🎜 }🎜 }🎜🎜🎜 /**&*/🎜 public function getTree($parentId=0,$levelTag='')🎜 {🎜 $this->initId = $parentId;🎜 $parentTree = $this->getParentTree($parentId);🎜🎜 foreach($parentTree as $key=>$value)🎜 {🎜 $this->tree[] = $value;🎜 $this->getChildrenTree($value[$this->id],$levelTag);🎜 }🎜🎜 return $this->tree;🎜 }🎜🎜}
  139. $conf = array(
  140. 1 => array('id'=>'1','parentid'=>0,'name'=>'1'),
  141. 2 => array('id'=>'2','parentid'=>0,'name'=>'2'),
  142. 3 => array('id'=>'3','parentid'=>1,'name'=>'1-1'),
  143. 4 => array('id'=>'4','parentid'=>1,'name'=>'1-2'),
  144. 5 => array('id'=>'5','parentid'=>2,'name'=>'2-1'),
  145. 6 => array('id'=>'6','parentid'=>3,'name'=>'1-1-1'),
  146. 7 => array('id'=>'7','parentid'=>4,'name'=>'1-2-1'),
  147. 8 => array('id'=>'8','parentid'=>5,'name'=>'2-1-1'),
  148. 9 => array('id'=>'9','parentid'=>8,'name'=>'2-1-1-1')
  149. );
  150. $tree = new tree($conf,'id','parentid');
  151. $arr = $tree->getTree(0,'   ');
  152. foreach($arr as $val)
  153. {
  154. if($val['levelTag'])
  155. {
  156. echo $val['levelTag'].'|- ';
  157. }
  158. echo $val['name'].'
    ';
  159. }
  160. ?>
复制代码
  1. class tree
  2. {
  3. /**Raw data*/
  4. public $original;
  5. /**key name of id*/
  6. public $id;
  7. /**父The key name of the parent id*/
  8. public $parentId;
  9. /**id during initialization*/
  10. protected $initId;
  11. /**node level*/
  12. protected $thisLevel = 0;
  13. /**final tree*/
  14. protected $tree = array();
  15. /**
  16. * 构造函数
  17. +------------------------------------------
  18. * @access public
  19. +------------------------------------------
  20. * @param array $original
  21. * Constructor
  22. +------------------------------------------------
  23. * @access public
  24. +------------------------------------------------
  25. * @ param array $original original data
  26. * @param string $id key name of id
  27. * @param string $parentId key name of parent id
  28. +------------------- -----------------------
  29. * @return void
  30. * @param string $id
  31. * Initialization
  32. +------------------------------------------------
  33. * @ access public
  34. +------------------------------------------------
  35. * @param array $original Original data
  36. * @param string $id The key name of id
  37. * @param string $parentId The key name of parent id
  38. +-------------------------- -----------------------
  39. * @return void
  40. * @param string $parentId 父
  41. * Get initial node
  42. +------------------------------------------------ ---
  43. * @access protected
  44. +---------------------------------------- ------
  45. * @param int $parentId The level of the initial node
  46. +---------------------------------- ---------------
  47. * @return array $parentTree
  48. +------------------------------------------
  49. * @return void
  50. */
  51. public function __construct($original='',$id='',$parentId='')
  52. {
  53. if($original && $id && $parentId)
  54. {
  55. $this->initialize($original,$id,$parentId);
  56. }
  57. }
  58. /**
  59. * 初始化
  60. +------------------------------------------
  61. * @access public
  62. +------------------------------------------
  63. * @param array $original
  64. * Get subtree
  65. +------------------------------------------------ ---
  66. * @access protected
  67. +---------------------------------------- ------
  68. * @param int $id node id
  69. * @param string $levelTag indentation mark
  70. +---------------------- --------------------------
  71. * @return void
  72. * @param string $id
  73. * Get the level of the node
  74. +--------------------------------------------- -------
  75. * @access protected
  76. +------------------------------------------------ -------------
  77. * @param int $parentId The parent id of the node
  78. +------------------------ ------------------------
  79. * @return void
  80. * @param string $parentId 父
  81. * Get the complete tree
  82. +--------------------------------------------- -------
  83. * @access public
  84. +------------------------------------------------ -------------
  85. * @param int $level From what level to get
  86. * @param string $levelTag Indent tag
  87. +------------- ------------------------------------
  88. * @return array $this->tree complete tree
  89. +------------------------------------------
  90. * @return void
  91. */
  92. public function initialize($original,$id,$parentId)
  93. {
  94. $this->original = $original;
  95. $this->id = $id;
  96. $this->parentId = $parentId;
  97. }
  98. /**
  99. * 获取初始节点
  100. +----------------------------------------------
  101. * @access protected
  102. +----------------------------------------------
  103. * @param int $parentId 初始&
  104. +----------------------------------------------
  105. * @return array $parentTree
  106. */
  107. protected function getParentTree($parentId)
  108. {
  109. $parentTree = array();
  110. foreach($this->original as $key=>$value)
  111. {
  112. if($value[$this->parentId] == $parentId)
  113. {
  114. array_push($parentTree,$value);
  115. }
  116. }
  117. return $parentTree;
  118. }
  119. /**&*/
  120. protected function getChildrenTree($id,$levelTag)
  121. {
  122. foreach($this->original as $key=>$value)
  123. {
  124. if($id == $value[$this->parentId])
  125. {
  126. if($levelTag)
  127. {
  128. $this->getLevel($value[$this->parentId]);
  129. $value['levelTag'] = str_repeat($levelTag,$this->thisLevel);
  130. $this->thisLevel = 0;
  131. }
  132. $this->tree[] = $value;
  133. $this->getChildrenTree($value[$this->id],$levelTag);
  134. }
  135. }
  136. }
  137. /**
  138. * 获取&🎜 +-------------------------------------------------🎜 * @access protected🎜 +-------------------------------------------------🎜 * @param int $parentId 节点的父id🎜 +-------------------------------------------------🎜 * @return void🎜 */🎜 protected function getLevel($parentId)🎜 {🎜 foreach($this->original as $key=>$value)🎜 {🎜 if($parentId == $value[$this->id] && $parentId != $this->initId)🎜 {🎜 $this->thisLevel++;🎜 $this->getLevel($value[$this->parentId]);🎜 }🎜 }🎜 }🎜🎜🎜 /**&*/🎜 public function getTree($parentId=0,$levelTag='')🎜 {🎜 $this->initId = $parentId;🎜 $parentTree = $this->getParentTree($parentId);🎜🎜 foreach($parentTree as $key=>$value)🎜 {🎜 $this->tree[] = $value;🎜 $this->getChildrenTree($value[$this->id],$levelTag);🎜 }🎜🎜 return $this->tree;🎜 }🎜🎜}
  139. $conf = array(
  140. 1 => array('id'=>'1','parentid'=>0,'name'=>'1'),
  141. 2 => array('id'=>'2','parentid'=>0,'name'=>'2'),
  142. 3 => array('id'=>'3','parentid'=>1,'name'=>'1-1'),
  143. 4 => array('id'=>'4','parentid'=>1,'name'=>'1-2'),
  144. 5 => array('id'=>'5','parentid'=>2,'name'=>'2-1'),
  145. 6 => array('id'=>'6','parentid'=>3,'name'=>'1-1-1'),
  146. 7 => array('id'=>'7','parentid'=>4,'name'=>'1-2-1'),
  147. 8 => array('id'=>'8','parentid'=>5,'name'=>'2-1-1'),
  148. 9 => array('id'=>'9','parentid'=>8,'name'=>'2-1-1-1')
  149. );
  150. $tree = new tree($conf,'id','parentid');
  151. $arr = $tree->getTree(0,'   ');
  152. foreach($arr as $val)
  153. {
  154. if($val['levelTag'])
  155. {
  156. echo $val['levelTag'].'|- ';
  157. }
  158. echo $val['name'].'
    ';
  159. }
  160. ?>
复制代码


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
PHP Dependency Injection Container: A Quick StartPHP Dependency Injection Container: A Quick StartMay 13, 2025 am 12:11 AM

APHPDependencyInjectionContainerisatoolthatmanagesclassdependencies,enhancingcodemodularity,testability,andmaintainability.Itactsasacentralhubforcreatingandinjectingdependencies,thusreducingtightcouplingandeasingunittesting.

Dependency Injection vs. Service Locator in PHPDependency Injection vs. Service Locator in PHPMay 13, 2025 am 12:10 AM

Select DependencyInjection (DI) for large applications, ServiceLocator is suitable for small projects or prototypes. 1) DI improves the testability and modularity of the code through constructor injection. 2) ServiceLocator obtains services through center registration, which is convenient but may lead to an increase in code coupling.

PHP performance optimization strategies.PHP performance optimization strategies.May 13, 2025 am 12:06 AM

PHPapplicationscanbeoptimizedforspeedandefficiencyby:1)enablingopcacheinphp.ini,2)usingpreparedstatementswithPDOfordatabasequeries,3)replacingloopswitharray_filterandarray_mapfordataprocessing,4)configuringNginxasareverseproxy,5)implementingcachingwi

PHP Email Validation: Ensuring Emails Are Sent CorrectlyPHP Email Validation: Ensuring Emails Are Sent CorrectlyMay 13, 2025 am 12:06 AM

PHPemailvalidationinvolvesthreesteps:1)Formatvalidationusingregularexpressionstochecktheemailformat;2)DNSvalidationtoensurethedomainhasavalidMXrecord;3)SMTPvalidation,themostthoroughmethod,whichchecksifthemailboxexistsbyconnectingtotheSMTPserver.Impl

How to make PHP applications fasterHow to make PHP applications fasterMay 12, 2025 am 12:12 AM

TomakePHPapplicationsfaster,followthesesteps:1)UseOpcodeCachinglikeOPcachetostoreprecompiledscriptbytecode.2)MinimizeDatabaseQueriesbyusingquerycachingandefficientindexing.3)LeveragePHP7 Featuresforbettercodeefficiency.4)ImplementCachingStrategiessuc

PHP Performance Optimization Checklist: Improve Speed NowPHP Performance Optimization Checklist: Improve Speed NowMay 12, 2025 am 12:07 AM

ToimprovePHPapplicationspeed,followthesesteps:1)EnableopcodecachingwithAPCutoreducescriptexecutiontime.2)ImplementdatabasequerycachingusingPDOtominimizedatabasehits.3)UseHTTP/2tomultiplexrequestsandreduceconnectionoverhead.4)Limitsessionusagebyclosin

PHP Dependency Injection: Improve Code TestabilityPHP Dependency Injection: Improve Code TestabilityMay 12, 2025 am 12:03 AM

Dependency injection (DI) significantly improves the testability of PHP code by explicitly transitive dependencies. 1) DI decoupling classes and specific implementations make testing and maintenance more flexible. 2) Among the three types, the constructor injects explicit expression dependencies to keep the state consistent. 3) Use DI containers to manage complex dependencies to improve code quality and development efficiency.

PHP Performance Optimization: Database Query OptimizationPHP Performance Optimization: Database Query OptimizationMay 12, 2025 am 12:02 AM

DatabasequeryoptimizationinPHPinvolvesseveralstrategiestoenhanceperformance.1)Selectonlynecessarycolumnstoreducedatatransfer.2)Useindexingtospeedupdataretrieval.3)Implementquerycachingtostoreresultsoffrequentqueries.4)Utilizepreparedstatementsforeffi

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 Article

Hot Tools

Dreamweaver Mac version

Dreamweaver Mac version

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

EditPlus Chinese cracked version

EditPlus Chinese cracked version

Small size, syntax highlighting, does not support code prompt function

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.

SecLists

SecLists

SecLists is the ultimate security tester's companion. It is a collection of various types of lists that are frequently used during security assessments, all in one place. SecLists helps make security testing more efficient and productive by conveniently providing all the lists a security tester might need. List types include usernames, passwords, URLs, fuzzing payloads, sensitive data patterns, web shells, and more. The tester can simply pull this repository onto a new test machine and he will have access to every type of list he needs.