我正在使用Laravel 8,目前我在我的projet中有这个函数来构建json树,但是它是客户端的,我想在json响应laravel端点上创建这个树。
makeTree = (nodes, parentId) => {
return nodes
.filter((node) => node.parent_id === parentId)
.reduce(
(tree, node) => [
...tree,
{
...node,
children: this.makeTree(nodes, node.id),
},
],
[]
);
};实际上,端点返回如下所示的平面数据:
[{"id":1,"parent_id":null,"value":"Val1"} {"id":2,"parent_id":1,"value":"Val2"} ...]然后,在我的makeTree函数中发送接收到的数组来构建树:
[
{
"id":1,
"parent_id":null,
"value":"Val1",
"children":[
{
"id":2,
"parent_id":1,
"value":"Val2",
"children":[]
},
{
"id":3,
"parent_id":1,
"value":"Val3",
"children":[]
},
]
}
...
]这是我的模型:
class MyTree extends Model
{
protected $table = 'my_tree';
public $timestamps = true;
protected $fillable = [
'parent_id',
'value',
];
/**
* A child belongs to a parent.
*
* @return MyTree
*/
public function parent()
{
return $this->belongsTo(MyTree::class, 'parent_id');
}
/**
* An Parent has many Children.
* *
* @return MyTree[]
*/
public function children()
{
return $this->hasMany(MyTree::class, 'parent_id');
}
}您能帮助我用php和laravel关系构建makeTree函数服务器端吗?有一种方法可以用像makeTree这样的递归函数来完成吗?
发布于 2022-07-07 15:32:36
老实说,我并没有深入研究javascript代码片段,但我可以在这里分享一些我在过去使用过的代码,它运行得非常好。实际上,我以前已经找到了一些片段,并对其进行了改进。没有确切的链接currenty (如果有此链接,将进行更新),但这就是我所得到的:
在这里,你可以使用无限深的树枝.
假设我们遵循了MyTree模型:
<?php
namespace App\Models;
use Illuminate\Database\Eloquent\Model;
class MyTree extends Model
{
protected $table = 'my_tree';
protected $fillable = [
'id',
'parent_id',
'value',
];
}因此,我们可以使用查询从DB中获取所有MyTree项,并使用下面的getNestedItems方法将其转换为树数组:
注意:这里有一些附加的内容,但它不会阻止您获得解决方案。这里有一个额外的参数来排除某些根项:
public function getNestedItems($exclude_parent_id = null): array
{
$arr = MyTree::select([
'id',
'parent_id',
'value',
])
->when(isset($exclude_parent_id), function ($query_id) use ($exclude_parent_id) {
return $query_id->where('id', '!=', $exclude_parent_id);
})
->get()
->toArray();
if (count($arr) > 0) {
$new = [];
foreach ($arr as $a) {
$parent_id = empty($a['parent_id']) ? 0 : $a['parent_id'];
$new[$parent_id][] = $a;
}
$tree = $this->mekeTree($new, $new[0], $exclude_parent_id);
return [
'count' => count($arr),
'tree' => $tree,
];
} else {
return [
'count' => 0,
'tree' => [],
];
}
}如您所见,我们从makeTree方法中调用getNestedItems,它将递归地创建树“分支”。所以是的,它是一个使用PHP引用的递归函数
protected function mekeTree(&$list, $parent, $exclude_parent_id): array
{
$tree = [];
foreach ($parent as $k => $l) {
if(isset($list[$l['id']])) {
if ($l['id'] == $exclude_parent_id) {
continue;
}
$l['children'] = $this->mekeTree($list, $list[$l['id']], $exclude_parent_id);
}
$tree[] = $l;
}
return $tree;
}也是我刚刚创建的这是一个吉斯特。
享受吧!
发布于 2022-07-07 15:41:43
您可以尝试使用Collection和方法groupBy()来获得您的结构,以简化代码。
$myTrees = Mytree::get();
$groupedTree = $myTrees->groupBy('parent_id');
foreach ($myTrees as $myTree) {
if ( ! $myTree->parent_id) {
$myTree->setRelation('parent', null);
}
$children = $groupedTree->get($myTree->id, [ ]);
foreach ($children as $child) {
$child->setRelation('parent', $myTree);
}
$myTree->setRelation('children',collect($children));
}
$finalTree = [];
foreach ($myTrees as $myTree) {
if ($myTrees->getParentId() == null) {
$finalTree[] = $myTree;
}
}
return collect($finalTree);一个限制是,只有当树根有parent_id = null时才能工作。
我还建议您使用拉拉巢式并简单地运行
$finalTree = Mytree::get()->toTree();https://stackoverflow.com/questions/72900042
复制相似问题