Gemeinschaft Lernen Tools-Bibliothek Freizeit
suchen
Deutsch
Heim > Backend-Entwicklung > PHP-Tutorial > 格式化节点树的类,写得不好,没有算法,但可以用

格式化节点树的类,写得不好,没有算法,但可以用

WBOY
Freigeben： 2016-07-25 09:09:57
Original
1089 Leute haben es durchsucht
将数据库取的分类数据格式化,如:

新闻
--体育新闻
--娱乐新闻
财经
--外汇
--金融
  1. class tree
  2. {
  4. /**原始数据*/
  5. public $original;
  7. /**id的键名*/
  8. public $id;
  10. /**父id的键名*/
  11. public $parentId;
  13. /**初始化时的id*/
  14. protected $initId;
  16. /**节点的级别*/
  17. protected $thisLevel = 0;
  19. /**最终树*/
  20. protected $tree = array();
  23. /**
  24. * 构造函数
  25. +------------------------------------------
  26. * @access public
  27. +------------------------------------------
  28. * @param array $original 原始数据
  29. * @param string $id id的键名
  30. * @param string $parentId 父id的键名
  31. +------------------------------------------
  32. * @return void
  33. */
  34. public function __construct($original='',$id='',$parentId='')
  35. {
  36. if($original && $id && $parentId)
  37. {
  38. $this->initialize($original,$id,$parentId);
  39. }
  40. }
  43. /**
  44. * 初始化
  45. +------------------------------------------
  46. * @access public
  47. +------------------------------------------
  48. * @param array $original 原始数据
  49. * @param string $id id的键名
  50. * @param string $parentId 父id的键名
  51. +------------------------------------------
  52. * @return void
  53. */
  54. public function initialize($original,$id,$parentId)
  55. {
  56. $this->original = $original;
  57. $this->id = $id;
  58. $this->parentId = $parentId;
  59. }
  62. /**
  63. * 获取初始节点
  64. +----------------------------------------------
  65. * @access protected
  66. +----------------------------------------------
  67. * @param int $parentId 初始节点的级别
  68. +----------------------------------------------
  69. * @return array $parentTree
  70. */
  71. protected function getParentTree($parentId)
  72. {
  73. $parentTree = array();
  75. foreach($this->original as $key=>$value)
  76. {
  77. if($value[$this->parentId] == $parentId)
  78. {
  79. array_push($parentTree,$value);
  80. }
  81. }
  83. return $parentTree;
  84. }
  87. /**
  88. * 获取子树
  89. +----------------------------------------------
  90. * @access protected
  91. +----------------------------------------------
  92. * @param int $id 节点的id
  93. * @param string $levelTag 缩进标记
  94. +----------------------------------------------
  95. * @return void
  96. */
  97. protected function getChildrenTree($id,$levelTag)
  98. {
  99. foreach($this->original as $key=>$value)
  100. {
  101. if($id == $value[$this->parentId])
  102. {
  103. if($levelTag)
  104. {
  105. $this->getLevel($value[$this->parentId]);
  106. $value['levelTag'] = str_repeat($levelTag,$this->thisLevel);
  107. $this->thisLevel = 0;
  108. }
  109. $this->tree[] = $value;
  110. $this->getChildrenTree($value[$this->id],$levelTag);
  111. }
  112. }
  113. }
  116. /**
  117. * 获取节点的级别
  118. +-------------------------------------------------
  119. * @access protected
  120. +-------------------------------------------------
  121. * @param int $parentId 节点的父id
  122. +-------------------------------------------------
  123. * @return void
  124. */
  125. protected function getLevel($parentId)
  126. {
  127. foreach($this->original as $key=>$value)
  128. {
  129. if($parentId == $value[$this->id] && $parentId != $this->initId)
  130. {
  131. $this->thisLevel++;
  132. $this->getLevel($value[$this->parentId]);
  133. }
  134. }
  135. }
  138. /**
  139. * 获取完整的树
  140. +-------------------------------------------------
  141. * @access public
  142. +-------------------------------------------------
  143. * @param int $level 从什么级别开始获取
  144. * @param string $levelTag 缩进标记
  145. +-------------------------------------------------
  146. * @return array $this->tree 完整的树
  147. */
  148. public function getTree($parentId=0,$levelTag='')
  149. {
  150. $this->initId = $parentId;
  151. $parentTree = $this->getParentTree($parentId);
  153. foreach($parentTree as $key=>$value)
  154. {
  155. $this->tree[] = $value;
  156. $this->getChildrenTree($value[$this->id],$levelTag);
  157. }
  159. return $this->tree;
  160. }
  162. }
  167. $conf = array(
  168. 1 => array('id'=>'1','parentid'=>0,'name'=>'1'),
  169. 2 => array('id'=>'2','parentid'=>0,'name'=>'2'),
  170. 3 => array('id'=>'3','parentid'=>1,'name'=>'1-1'),
  171. 4 => array('id'=>'4','parentid'=>1,'name'=>'1-2'),
  172. 5 => array('id'=>'5','parentid'=>2,'name'=>'2-1'),
  173. 6 => array('id'=>'6','parentid'=>3,'name'=>'1-1-1'),
  174. 7 => array('id'=>'7','parentid'=>4,'name'=>'1-2-1'),
  175. 8 => array('id'=>'8','parentid'=>5,'name'=>'2-1-1'),
  176. 9 => array('id'=>'9','parentid'=>8,'name'=>'2-1-1-1')
  177. );
  179. $tree = new tree($conf,'id','parentid');
  180. $arr = $tree->getTree(0,'   ');
  181. foreach($arr as $val)
  182. {
  183. if($val['levelTag'])
  184. {
  185. echo $val['levelTag'].'|- ';
  186. }
  187. echo $val['name'].'
    ';
  188. }
  190. ?>
复制代码
  1. class tree
  2. {
  4. /**原始数据*/
  5. public $original;
  7. /**id的键名*/
  8. public $id;
  10. /**父id的键名*/
  11. public $parentId;
  13. /**初始化时的id*/
  14. protected $initId;
  16. /**节点的级别*/
  17. protected $thisLevel = 0;
  19. /**最终树*/
  20. protected $tree = array();
  23. /**
  24. * 构造函数
  25. +------------------------------------------
  26. * @access public
  27. +------------------------------------------
  28. * @param array $original 原始数据
  29. * @param string $id id的键名
  30. * @param string $parentId 父id的键名
  31. +------------------------------------------
  32. * @return void
  33. */
  34. public function __construct($original='',$id='',$parentId='')
  35. {
  36. if($original && $id && $parentId)
  37. {
  38. $this->initialize($original,$id,$parentId);
  39. }
  40. }
  43. /**
  44. * 初始化
  45. +------------------------------------------
  46. * @access public
  47. +------------------------------------------
  48. * @param array $original 原始数据
  49. * @param string $id id的键名
  50. * @param string $parentId 父id的键名
  51. +------------------------------------------
  52. * @return void
  53. */
  54. public function initialize($original,$id,$parentId)
  55. {
  56. $this->original = $original;
  57. $this->id = $id;
  58. $this->parentId = $parentId;
  59. }
  62. /**
  63. * 获取初始节点
  64. +----------------------------------------------
  65. * @access protected
  66. +----------------------------------------------
  67. * @param int $parentId 初始节点的级别
  68. +----------------------------------------------
  69. * @return array $parentTree
  70. */
  71. protected function getParentTree($parentId)
  72. {
  73. $parentTree = array();
  75. foreach($this->original as $key=>$value)
  76. {
  77. if($value[$this->parentId] == $parentId)
  78. {
  79. array_push($parentTree,$value);
  80. }
  81. }
  83. return $parentTree;
  84. }
  87. /**
  88. * 获取子树
  89. +----------------------------------------------
  90. * @access protected
  91. +----------------------------------------------
  92. * @param int $id 节点的id
  93. * @param string $levelTag 缩进标记
  94. +----------------------------------------------
  95. * @return void
  96. */
  97. protected function getChildrenTree($id,$levelTag)
  98. {
  99. foreach($this->original as $key=>$value)
  100. {
  101. if($id == $value[$this->parentId])
  102. {
  103. if($levelTag)
  104. {
  105. $this->getLevel($value[$this->parentId]);
  106. $value['levelTag'] = str_repeat($levelTag,$this->thisLevel);
  107. $this->thisLevel = 0;
  108. }
  109. $this->tree[] = $value;
  110. $this->getChildrenTree($value[$this->id],$levelTag);
  111. }
  112. }
  113. }
  116. /**
  117. * 获取节点的级别
  118. +-------------------------------------------------
  119. * @access protected
  120. +-------------------------------------------------
  121. * @param int $parentId 节点的父id
  122. +-------------------------------------------------
  123. * @return void
  124. */
  125. protected function getLevel($parentId)
  126. {
  127. foreach($this->original as $key=>$value)
  128. {
  129. if($parentId == $value[$this->id] && $parentId != $this->initId)
  130. {
  131. $this->thisLevel++;
  132. $this->getLevel($value[$this->parentId]);
  133. }
  134. }
  135. }
  138. /**
  139. * 获取完整的树
  140. +-------------------------------------------------
  141. * @access public
  142. +-------------------------------------------------
  143. * @param int $level 从什么级别开始获取
  144. * @param string $levelTag 缩进标记
  145. +-------------------------------------------------
  146. * @return array $this->tree 完整的树
  147. */
  148. public function getTree($parentId=0,$levelTag='')
  149. {
  150. $this->initId = $parentId;
  151. $parentTree = $this->getParentTree($parentId);
  153. foreach($parentTree as $key=>$value)
  154. {
  155. $this->tree[] = $value;
  156. $this->getChildrenTree($value[$this->id],$levelTag);
  157. }
  159. return $this->tree;
  160. }
  162. }
  167. $conf = array(
  168. 1 => array('id'=>'1','parentid'=>0,'name'=>'1'),
  169. 2 => array('id'=>'2','parentid'=>0,'name'=>'2'),
  170. 3 => array('id'=>'3','parentid'=>1,'name'=>'1-1'),
  171. 4 => array('id'=>'4','parentid'=>1,'name'=>'1-2'),
  172. 5 => array('id'=>'5','parentid'=>2,'name'=>'2-1'),
  173. 6 => array('id'=>'6','parentid'=>3,'name'=>'1-1-1'),
  174. 7 => array('id'=>'7','parentid'=>4,'name'=>'1-2-1'),
  175. 8 => array('id'=>'8','parentid'=>5,'name'=>'2-1-1'),
  176. 9 => array('id'=>'9','parentid'=>8,'name'=>'2-1-1-1')
  177. );
  179. $tree = new tree($conf,'id','parentid');
  180. $arr = $tree->getTree(0,'   ');
  181. foreach($arr as $val)
  182. {
  183. if($val['levelTag'])
  184. {
  185. echo $val['levelTag'].'|- ';
  186. }
  187. echo $val['name'].'
    ';
  188. }
  190. ?>
复制代码


Verwandte Etiketten：
格式化节点树的类 写得不好 没有算法 但可以用
Quelle：php.cn
Vorheriger Artikel：带同步令牌的表单工具包 Nächster Artikel：虚代理实现延迟加载
Erklärung dieser Website
Der Inhalt dieses Artikels wird freiwillig von Internetnutzern beigesteuert und das Urheberrecht liegt beim ursprünglichen Autor. Diese Website übernimmt keine entsprechende rechtliche Verantwortung. Wenn Sie Inhalte finden, bei denen der Verdacht eines Plagiats oder einer Rechtsverletzung besteht, wenden Sie sich bitte an admin@php.cn
Neueste Artikel des Autors
Aktuelle Ausgaben
Konvertieren Sie neo4j-Abfrageergebnisse in graphjson wie Knoten und Links in nodejs Ich habe den Neo4j-Treiber in der Node-App verwendet, um Neo4j-Abfrageergebnisse abzurufen...
Aus 2024-04-02 18:29:29
0
1
341
verwandte Themen
Mehr>
Beliebte Empfehlungen
Beliebte Tutorials
Mehr>
Verwandte Tutorials
Beliebte Empfehlungen
Aktuelle Kurse
Neueste Downloads
Mehr>
Web-Effekte
Quellcode der Website
Website-Materialien
Frontend-Vorlage