Tree.php 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. <?php
  2. namespace ba;
  3. /**
  4. * 树
  5. */
  6. class Tree
  7. {
  8. /**
  9. * 实例
  10. * @var ?Tree
  11. */
  12. protected static ?Tree $instance = null;
  13. /**
  14. * 生成树型结构所需修饰符号
  15. * @var array
  16. */
  17. public static array $icon = array('│', '├', '└');
  18. /**
  19. * 子级数据(树枝)
  20. * @var array
  21. */
  22. protected array $children = [];
  23. /**
  24. * 初始化
  25. * @access public
  26. * @return Tree
  27. */
  28. public static function instance(): Tree
  29. {
  30. if (is_null(self::$instance)) {
  31. self::$instance = new static();
  32. }
  33. return self::$instance;
  34. }
  35. /**
  36. * 将数组某个字段渲染为树状,需自备children children可通过$this->assembleChild()方法组装
  37. * @param array $arr 要改为树状的数组
  38. * @param string $field '树枝'字段
  39. * @param int $level 递归数组层次,无需手动维护
  40. * @param bool $superiorEnd 递归上一级树枝是否结束,无需手动维护
  41. * @return array
  42. */
  43. public static function getTreeArray(array $arr, string $field = 'name', int $level = 0, bool $superiorEnd = false): array
  44. {
  45. $level++;
  46. $number = 1;
  47. $total = count($arr);
  48. foreach ($arr as $key => $item) {
  49. $prefix = ($number == $total) ? self::$icon[2] : self::$icon[1];
  50. if ($level == 2) {
  51. $arr[$key][$field] = str_pad('', 4) . $prefix . $item[$field];
  52. } elseif ($level >= 3) {
  53. $arr[$key][$field] = str_pad('', 4) . ($superiorEnd ? '' : self::$icon[0]) . str_pad('', ($level - 2) * 4) . $prefix . $item[$field];
  54. }
  55. if (isset($item['children']) && $item['children']) {
  56. $arr[$key]['children'] = self::getTreeArray($item['children'], $field, $level, $number == $total);
  57. }
  58. $number++;
  59. }
  60. return $arr;
  61. }
  62. /**
  63. * 递归合并树状数组(根据children多维变二维方便渲染)
  64. * @param array $data 要合并的数组 ['id' => 1, 'pid' => 0, 'title' => '标题1', 'children' => ['id' => 2, 'pid' => 1, 'title' => ' └标题1-1']]
  65. * @return array [['id' => 1, 'pid' => 0, 'title' => '标题1'], ['id' => 2, 'pid' => 1, 'title' => ' └标题1-1']]
  66. */
  67. public static function assembleTree(array $data): array
  68. {
  69. $arr = [];
  70. foreach ($data as $v) {
  71. $children = $v['children'] ?? [];
  72. unset($v['children']);
  73. $arr[] = $v;
  74. if ($children) {
  75. $arr = array_merge($arr, self::assembleTree($children));
  76. }
  77. }
  78. return $arr;
  79. }
  80. /**
  81. * 递归的根据指定字段组装 children 数组
  82. * @param array $data 数据源 例如:[['id' => 1, 'pid' => 0, title => '标题1'], ['id' => 2, 'pid' => 1, title => '标题1-1']]
  83. * @param string $pid 存储上级id的字段
  84. * @param string $pk 主键字段
  85. * @return array ['id' => 1, 'pid' => 0, 'title' => '标题1', 'children' => ['id' => 2, 'pid' => 1, 'title' => '标题1-1']]
  86. */
  87. public function assembleChild(array $data, string $pid = 'pid', string $pk = 'id'): array
  88. {
  89. if (!$data) return [];
  90. $pks = [];
  91. $topLevelData = []; // 顶级数据
  92. $this->children = []; // 置空子级数据
  93. foreach ($data as $item) {
  94. $pks[] = $item[$pk];
  95. // 以pid组成children
  96. $this->children[$item[$pid]][] = $item;
  97. }
  98. // 上级不存在的就是顶级,只获取它们的 children
  99. foreach ($data as $item) {
  100. if (!in_array($item[$pid], $pks)) {
  101. $topLevelData[] = $item;
  102. }
  103. }
  104. if (count($this->children) > 0) {
  105. foreach ($topLevelData as $key => $item) {
  106. $topLevelData[$key]['children'] = $this->getChildren($this->children[$item[$pk]] ?? [], $pk);
  107. }
  108. return $topLevelData;
  109. } else {
  110. return $data;
  111. }
  112. }
  113. /**
  114. * 获取 children 数组
  115. * 辅助 assembleChild 组装 children
  116. * @param array $data
  117. * @param string $pk
  118. * @return array
  119. */
  120. protected function getChildren(array $data, string $pk = 'id'): array
  121. {
  122. if (!$data) return [];
  123. foreach ($data as $key => $item) {
  124. if (array_key_exists($item[$pk], $this->children)) {
  125. $data[$key]['children'] = $this->getChildren($this->children[$item[$pk]], $pk);
  126. }
  127. }
  128. return $data;
  129. }
  130. }