PostOrderVisitor::visit() - Code Metrics - seboettg/Forest - Measure and Improve Code Quality continuously with Scrutinizer

PostOrderVisitor::visit() A
last analyzed 2020-02-07 19:01 UTC

↳ Parent: PostOrderVisitor

Complexity

Conditions	3
Paths	2

Size

Total Lines	10
Code Lines	6

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	7
CRAP Score	3

Importance

Changes	1
Bugs	0	Features	1

Metric	Value
eloc	6
c	1
b	0
f	1
dl	0
loc	10
ccs	7
cts	7
cp	1
rs	10
cc	3
nc	2
nop	1
crap	3

<?php
declare(strict_types=1);
/*
 * Copyright (C) 2019 Sebastian Böttger <[email protected]>
 * You may use, distribute and modify this code under the
 * terms of the MIT license.
 *
 * You should have received a copy of the MIT license with
 * this file. If not, please visit: https://opensource.org/licenses/mit-license.php
 */

namespace Seboettg\Forest\Visitor;

use Seboettg\Collection\ArrayList;
use Seboettg\Collection\ArrayList\ArrayListInterface;
use Seboettg\Forest\General\TreeNodeInterface;

/**
 * Class PostOrderVisitor
 * Implements the tree traversal strategy Post-order.
 * In this traversal strategy, the root node is visited last. First we traverse the subtrees from left to right
 * and finally the root node.
 *
 * @package Seboettg\Forest\Visitor
 */
class PostOrderVisitor implements VisitorInterface
{
    /**
     * @param TreeNodeInterface $node
     * @return ArrayListInterface
     */
    public function visit(TreeNodeInterface $node): ArrayListInterface
    {
        $resultList = new ArrayList();
        if ($node !== null) {
            foreach($node->getChildren() as $child) {
                $resultList->merge($child->accept($this));
            }
            $resultList->append($node->getItem());
        }
        return $resultList;
    }
}


1		<?php
2		declare(strict_types=1);
3		/*
4		* Copyright (C) 2019 Sebastian Böttger <[email protected]>
5		* You may use, distribute and modify this code under the
6		* terms of the MIT license.
7		*
8		* You should have received a copy of the MIT license with
9		* this file. If not, please visit: https://opensource.org/licenses/mit-license.php
10		*/
11
12		namespace Seboettg\Forest\Visitor;
13
14		use Seboettg\Collection\ArrayList;
15		use Seboettg\Collection\ArrayList\ArrayListInterface;
16		use Seboettg\Forest\General\TreeNodeInterface;
17
18		/**
19		* Class PostOrderVisitor
20		* Implements the tree traversal strategy Post-order.
21		* In this traversal strategy, the root node is visited last. First we traverse the subtrees from left to right
22		* and finally the root node.
23		*
24		* @package Seboettg\Forest\Visitor
25		*/
26		class PostOrderVisitor implements VisitorInterface
27		{
28		/**
29		* @param TreeNodeInterface $node
30		* @return ArrayListInterface
31		*/
32	2	public function visit(TreeNodeInterface $node): ArrayListInterface
33		{
34	2	$resultList = new ArrayList();
35	2	if ($node !== null) {
36	2	foreach($node->getChildren() as $child) {
37	2	$resultList->merge($child->accept($this));
38		}
39	2	$resultList->append($node->getItem());
40		}
41	2	return $resultList;
42		}
43		}
44

seboettg / Forest

PostOrderVisitor::visit() A last analyzed 2020-02-07 19:01 UTC

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like

PostOrderVisitor::visit() A
last analyzed 2020-02-07 19:01 UTC