php 无限极分类 不递归有好的办法么

[yuptyy]

$arr = [
1 => ['name' => '江苏', 'pid' => 0],
2 => ['name' => '徐州', 'pid' => 1],
3 => ['name' => '南京', 'pid' => 1],
4 => ['name' => '泰州', 'pid' => 1],
5 => ['name' => '靖江', 'pid' => 4],
6 => ['name' => '西来', 'pid' => 5],
7 => ['name' => '常州', 'pid' => 1],
8 => ['name' => '新北区', 'pid' => 7],
9 => ['name' => '百草苑', 'pid' => 8],
10 => ['name' => '天宁区', 'pid' => 7]
];

不使用递归, 引用 该怎么实现呢 0.0

[mhycy]

你想达到怎样的输出效果?

[ksc010]

给每个分类记录他的parentid 和所有子类id

[yuptyy]

这样的效果

[
name => 江苏,
pid => 0,
child => [
[
name => 徐州,
pid => 1,
child => []
],
[
name => 泰州,
pid => 1,
child => [
[
name => 靖江,
pid => 4,
child => [
name => 西来
pid => 5,
child => []
]
]
]
]
...
]
@mhycy
@mhycy

[alex321]

https://v2ex.com/t/137183#reply5

[zhujinliang]

用类

[invite]

这个跟目录一个道理：

用绝对路径，直接可以搜索以XX打头。
否则相对路径都需要类似递归的吧。

[tabris17]

左右值

[cevincheung]

http://www.oschina.net/code/snippet_173183_11767

function genTree5($items) {
foreach ($items as $item)
$items[$item['pid']]['son'][$item['id']] = &$items[$item['id']];
return isset($items[0]['son']) ? $items[0]['son'] : array();
}

function genTree9($items) {
$tree = array(); //格式化好的树
foreach ($items as $item)
if (isset($items[$item['pid']]))
$items[$item['pid']]['son'][] = &$items[$item['id']];
else
$tree[] = &$items[$item['id']];
return $tree;
}

[sambohuang]

左右键

[ywisax]

上面也提到了，用mptt吧。

[imink]

楼主参考这个包。https://github.com/etrepat/baum

[elvba]

http://en.wikipedia.org/wiki/Nested_set_model
嵌套集合模型，左右值

[Septembers]

扔前端处理吧