HasNesting::flattenTree() - Code Metrics - Inspection of "feat: Add support to generate nestable modules" - area17/twill - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Pull Request — 2.x (#1140)

unknown

created 2021-09-17 16:03 UTC

HasNesting::flattenTree() A

↳ Parent: HasNesting

Complexity

Conditions	3
Paths	3

Size

Total Lines	19
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
cc	3
eloc	11
c	1
b	0
f	0
nc	3
nop	2
dl	0
loc	19
rs	9.9

<?php

namespace A17\Twill\Models\Behaviors;

use Kalnoy\Nestedset\NodeTrait;

trait HasNesting
{
    use NodeTrait;

    public static function saveTreeFromIds($nodeTree)
    {
        $nodeModels = self::all();
        $nodeArrays = self::flattenTree($nodeTree);

        foreach ($nodeArrays as $nodeArray) {
            $nodeModel = $nodeModels->where('id', $nodeArray['id'])->first();

            if ($nodeArray['parent_id'] === null) {
                if (!$nodeModel->isRoot() || $nodeModel->position !== $nodeArray['position']) {
                    $nodeModel->position = $nodeArray['position'];
                    $nodeModel->saveAsRoot();
                }
            } else {
                if ($nodeModel->position !== $nodeArray['position'] || $nodeModel->parent_id !== $nodeArray['parent_id']) {
                    $nodeModel->position = $nodeArray['position'];
                    $nodeModel->parent_id = $nodeArray['parent_id'];
                    $nodeModel->save();
                }
            }
        }
    }

    public static function flattenTree(array $nodeTree, int $parentId = null)
    {
        $nodeArrays = [];
        $position = 0;

        foreach ($nodeTree as $node) {
            $nodeArrays[] = [
                'id' => $node['id'],
                'position' => $position++,
                'parent_id' => $parentId,
            ];

            if (count($node['children']) > 0) {
                $childArrays = self::flattenTree($node['children'], $node['id']);
                $nodeArrays = array_merge($nodeArrays, $childArrays);
            }
        }

        return $nodeArrays;
    }
}


1			<?php
2
3			namespace A17\Twill\Models\Behaviors;
4
5			use Kalnoy\Nestedset\NodeTrait;
6
7			trait HasNesting
8			{
9			use NodeTrait;
10
11			public static function saveTreeFromIds($nodeTree)
12			{
13			$nodeModels = self::all();
14			$nodeArrays = self::flattenTree($nodeTree);
15
16			foreach ($nodeArrays as $nodeArray) {
17			$nodeModel = $nodeModels->where('id', $nodeArray['id'])->first();
18
19			if ($nodeArray['parent_id'] === null) {
20			if (!$nodeModel->isRoot() \|\| $nodeModel->position !== $nodeArray['position']) {
21			$nodeModel->position = $nodeArray['position'];
22			$nodeModel->saveAsRoot();
23			}
24			} else {
25			if ($nodeModel->position !== $nodeArray['position'] \|\| $nodeModel->parent_id !== $nodeArray['parent_id']) {
26			$nodeModel->position = $nodeArray['position'];
27			$nodeModel->parent_id = $nodeArray['parent_id'];
28			$nodeModel->save();
29			}
30			}
31			}
32			}
33
34			public static function flattenTree(array $nodeTree, int $parentId = null)
35			{
36			$nodeArrays = [];
37			$position = 0;
38
39			foreach ($nodeTree as $node) {
40			$nodeArrays[] = [
41			'id' => $node['id'],
42			'position' => $position++,
43			'parent_id' => $parentId,
44			];
45
46			if (count($node['children']) > 0) {
47			$childArrays = self::flattenTree($node['children'], $node['id']);
48			$nodeArrays = array_merge($nodeArrays, $childArrays);
49			}
50			}
51
52			return $nodeArrays;
53			}
54			}
55

area17 / twill

Pull Request — 2.x (#1140)

HasNesting::flattenTree() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like