TreeHelper::reorderNodes() - Code Metrics - Inspection of "Updating tests" - ARCANEDEV/LaravelNestedSet - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — master ( 9383fe...482732 )

by ARCANEDEV

created 2016-02-24 10:36 UTC

TreeHelper::reorderNodes() B

↳ Parent: TreeHelper

Complexity

Conditions	4
Paths	4

Size

Total Lines	28
Code Lines	17

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	15
CRAP Score	4

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
c	1
b	0
f	0
dl	0
loc	28
ccs	15
cts	15
cp	1
rs	8.5806
cc	4
eloc	17
nc	4
nop	4
crap	4

<?php namespace Arcanedev\LaravelNestedSet\Utilities;

use Arcanedev\LaravelNestedSet\Traits\NodeTrait;

/**
 * Class     TreeHelper
 *
 * @package  Arcanedev\LaravelNestedSet\Utilities
 * @author   ARCANEDEV <[email protected]>
 */
class TreeHelper
{
    /**
     * Fix nodes.
     *
     * @param  array  $dictionary
     *
     * @return int
     */
    public static function fixNodes(array &$dictionary)
    {
        $fixed = 0;
        $cut   = self::reorderNodes($dictionary, $fixed);

        // Save nodes that have invalid parent as roots
        while ( ! empty($dictionary)) {
            $dictionary[null] = reset($dictionary);
            unset($dictionary[key($dictionary)]);

            $cut = self::reorderNodes($dictionary, $fixed, null, $cut);
        }

        return $fixed;
    }

    /**
     * Reorder nodes.
     *
     * @param  array     $dictionary
     * @param  int       $fixed
     * @param  int|null  $parentId
     * @param  int       $cut
     *
     * @return int
     */
    protected static function reorderNodes(
        array &$dictionary,
        &$fixed,
        $parentId = null,
        $cut = 1
    ) {
        if ( ! isset($dictionary[$parentId])) {
            return $cut;
        }

        /** @var NodeTrait $model */
        foreach ($dictionary[$parentId] as $model) {
            $lft = $cut;
            $cut = self::reorderNodes($dictionary, $fixed, $model->getKey(), $cut + 1);
            $rgt = $cut;

            if ($model->rawNode($lft, $rgt, $parentId)->isDirty()) {
                $model->save();
                $fixed++;
            }

            ++$cut;
        }

        unset($dictionary[$parentId]);

        return $cut;
    }
}


1		<?php namespace Arcanedev\LaravelNestedSet\Utilities;
2
3		use Arcanedev\LaravelNestedSet\Traits\NodeTrait;
4
5		/**
6		* Class TreeHelper
7		*
8		* @package Arcanedev\LaravelNestedSet\Utilities
9		* @author ARCANEDEV <[email protected]>
10		*/
11		class TreeHelper
12		{
13		/**
14		* Fix nodes.
15		*
16		* @param array $dictionary
17		*
18		* @return int
19		*/
20	8	public static function fixNodes(array &$dictionary)
21		{
22	8	$fixed = 0;
23	8	$cut = self::reorderNodes($dictionary, $fixed);
24
25		// Save nodes that have invalid parent as roots
26	8	while ( ! empty($dictionary)) {
27	4	$dictionary[null] = reset($dictionary);
28	4	unset($dictionary[key($dictionary)]);
29
30	4	$cut = self::reorderNodes($dictionary, $fixed, null, $cut);
31	3	}
32
33	8	return $fixed;
34		}
35
36		/**
37		* Reorder nodes.
38		*
39		* @param array $dictionary
40		* @param int $fixed
41		* @param int\|null $parentId
42		* @param int $cut
43		*
44		* @return int
45		*/
46	8	protected static function reorderNodes(
47		array &$dictionary,
48		&$fixed,
49		$parentId = null,
50		$cut = 1
51		) {
52	8	if ( ! isset($dictionary[$parentId])) {
53	8	return $cut;
54		}
55
56		/** @var NodeTrait $model */
57	8	foreach ($dictionary[$parentId] as $model) {
58	8	$lft = $cut;
59	8	$cut = self::reorderNodes($dictionary, $fixed, $model->getKey(), $cut + 1);
60	8	$rgt = $cut;
61
62	8	if ($model->rawNode($lft, $rgt, $parentId)->isDirty()) {
63	8	$model->save();
64	8	$fixed++;
65	6	}
66
67	8	++$cut;
68	6	}
69
70	8	unset($dictionary[$parentId]);
71
72	8	return $cut;
73		}
74		}
75

ARCANEDEV / LaravelNestedSet

Push — master ( 9383fe...482732 )

TreeHelper::reorderNodes() B

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like