如何递归地构建< select>树深未知 [英] How to recursively build a <select> with unknown tree depth
问题描述
我有一个带有树数据结构的MySQL表.字段是_id，name和parentId.当记录没有父记录时，parentId默认为0.这样，我可以构建一个数组，然后递归地打印每条记录.
I have a MySQL table with a tree data structure. The fields are _id, name and parentId. When the record hasn't a parent, parentId defaults as 0. This way I can build an array and then recursively print each record.
构建的数组如下:
Array
(
[1] => Array
(
[parentId] => 0
[name] => Countries
[_id] => 1
[children] => Array
(
[2] => Array
(
[parentId] => 1
[name] => America
[_id] => 2
[children] => Array
(
[3] => Array
(
[parentId] => 2
[name] => Canada
[_id] => 3
[children] => Array
(
[4] => Array
(
[parentId] => 3
[name] => Ottawa
[_id] => 4
)
)
)
)
)
[5] => Array
(
[parentId] => 1
[name] => Asia
[_id] => 5
)
[6] => Array
(
[parentId] => 1
[name] => Europe
[_id] => 6
[children] => Array
(
[7] => Array
(
[parentId] => 6
[name] => Italy
[_id] => 7
)
[11] => Array
(
[parentId] => 6
[name] => Germany
[_id] => 11
)
[12] => Array
(
[parentId] => 6
[name] => France
[_id] => 12
)
)
)
[8] => Array
(
[parentId] => 1
[name] => Oceania
[_id] => 8
)
)
)
)
打印无序列表<ul>通过递归非常简单.这是我使用的功能:
Printing an unordered list <ul> is very simple with recursion. Here's the function I use:
function toUL ($arr) {
$html = '<ul>' . PHP_EOL;
foreach ( $arr as $v ) {
$html.= '<li>' . $v['name'] . '</li>' . PHP_EOL;
if ( array_key_exists('children', $v) ) {
$html.= toUL($v['children']);
}
}
$html.= '</ul>' . PHP_EOL;
return $html;
}
但是我一直坚持以树结构的方式打印<select>:
But I'm stuck at printing a <select> in a tree-structured way:
Countries
-- America
---- Canada
------ Ottawa
-- Asia
-- Europe
---- Italy
---- Germany
---- France
-- Oceania
我想打印--的次数是元素的深度，但是我不知道如何计算深度.
I thought to print -- as many times as the element's depth, but I don't know how to calculate the depth.
我的问题是:是否可以在不知道深度的情况下构建<select>?
My question is: is it possible to build a <select> without knowing the depth?
谢谢.
推荐答案
传递参数以计算迭代次数，例如$pass
Pass a parameter to count the iteration like $pass
function toUL ($arr, $pass = 0) {
$html = '<ul>' . PHP_EOL;
foreach ( $arr as $v ) {
$html.= '<li>';
$html .= str_repeat("--", $pass); // use the $pass value to create the --
$html .= $v['name'] . '</li>' . PHP_EOL;
if ( array_key_exists('children', $v) ) {
$html.= toUL($v['children'], $pass+1);
}
}
$html.= '</ul>' . PHP_EOL;
return $html;
}
这篇关于如何递归地构建< select>树深未知的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
