NodeTraverser::traverseArray() - Code Metrics - Inspection of "forced version of phar" - phpmetrics/PhpMetrics - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — master ( bdaaad...4f4372 )

by personal

created 2017-01-30 05:16 UTC

NodeTraverser::traverseArray() C

↳ Parent: NodeTraverser

Complexity

Conditions	14
Paths	70

Size

Total Lines	46
Code Lines	29

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	14
eloc	29
nc	70
nop	1
dl	0
loc	46
rs	5.0744
c	0
b	0
f	0

How to fix Complexity

<?php

/*
 * (c) Jean-François Lépine <https://twitter.com/Halleck45>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Hal\Component\Ast;

use PhpParser\Node;
use PhpParser\NodeTraverser as Mother;

/**
 * Custom Ast Traverser
 *
 * @author Jean-François Lépine <https://twitter.com/Halleck45>
 */
class NodeTraverser extends Mother
{
    protected $stopCondition;

    public function __construct($cloneNodes = false, $stopCondition = null)
    {
        parent::__construct($cloneNodes);

        if(null === $stopCondition) {
            $stopCondition = function($node) {
                if($node instanceof Node\Stmt\Class_ || $node instanceof Node\Stmt\Interface_) {
                    return false;
                }

                return true;
            };
        }

        $this->stopCondition = $stopCondition;
    }

    protected function traverseArray(array $nodes) {
        $doNodes = array();

        foreach ($nodes as $i => &$node) {
            if (is_array($node)) {
                $node = $this->traverseArray($node);
            } elseif ($node instanceof Node) {
                $traverseChildren = call_user_func($this->stopCondition, $node);

                foreach ($this->visitors as $visitor) {
                    $return = $visitor->enterNode($node);
                    if (self::DONT_TRAVERSE_CHILDREN === $return) {
                        $traverseChildren = false;
                    } else if (null !== $return) {
                        $node = $return;
                    }
                }

                if ($traverseChildren) {
                    $node = $this->traverseNode($node);
                }

                foreach ($this->visitors as $visitor) {
                    $return = $visitor->leaveNode($node);

                    if (self::REMOVE_NODE === $return) {
                        $doNodes[] = array($i, array());
                        break;
                    } elseif (is_array($return)) {
                        $doNodes[] = array($i, $return);
                        break;
                    } elseif (null !== $return) {
                        $node = $return;
                    }
                }
            }
        }

        if (!empty($doNodes)) {
            while (list($i, $replace) = array_pop($doNodes)) {
                array_splice($nodes, $i, 1, $replace);
            }
        }

        return $nodes;
    }



}


1			<?php
2
3			/*
4			* (c) Jean-François Lépine <https://twitter.com/Halleck45>
5			*
6			* For the full copyright and license information, please view the LICENSE
7			* file that was distributed with this source code.
8			*/
9
10			namespace Hal\Component\Ast;
11
12			use PhpParser\Node;
13			use PhpParser\NodeTraverser as Mother;
14
15			/**
16			* Custom Ast Traverser
17			*
18			* @author Jean-François Lépine <https://twitter.com/Halleck45>
19			*/
20			class NodeTraverser extends Mother
21			{
22			protected $stopCondition;
23
24			public function __construct($cloneNodes = false, $stopCondition = null)
25			{
26			parent::__construct($cloneNodes);
27
28			if(null === $stopCondition) {
29			$stopCondition = function($node) {
30			if($node instanceof Node\Stmt\Class_ \|\| $node instanceof Node\Stmt\Interface_) {
31			return false;
32			}
33
34			return true;
35			};
36			}
37
38			$this->stopCondition = $stopCondition;
39			}
40
41			protected function traverseArray(array $nodes) {
42			$doNodes = array();
43
44			foreach ($nodes as $i => &$node) {
45			if (is_array($node)) {
46			$node = $this->traverseArray($node);
47			} elseif ($node instanceof Node) {
48			$traverseChildren = call_user_func($this->stopCondition, $node);
49
50			foreach ($this->visitors as $visitor) {
51			$return = $visitor->enterNode($node);
52			if (self::DONT_TRAVERSE_CHILDREN === $return) {
53			$traverseChildren = false;
54			} else if (null !== $return) {
55			$node = $return;
56			}
57			}
58
59			if ($traverseChildren) {
60			$node = $this->traverseNode($node);
61			}
62
63			foreach ($this->visitors as $visitor) {
64			$return = $visitor->leaveNode($node);
65
66			if (self::REMOVE_NODE === $return) {
67			$doNodes[] = array($i, array());
68			break;
69			} elseif (is_array($return)) {
70			$doNodes[] = array($i, $return);
71			break;
72			} elseif (null !== $return) {
73			$node = $return;
74			}
75			}
76			}
77			}
78
79			if (!empty($doNodes)) {
80			while (list($i, $replace) = array_pop($doNodes)) {
81			array_splice($nodes, $i, 1, $replace);
82			}
83			}
84
85			return $nodes;
86			}
87
88
89
90			}
91

phpmetrics / PhpMetrics

Push — master ( bdaaad...4f4372 )

NodeTraverser::traverseArray() C

Complexity

Size

Duplication

Importance

How to fix Complexity

Long Method

Duplication Side-by-Side

Filter issues like