NodeCollection::atPosition() - Code Metrics - KnpLabs/FriendlyContexts - Measure and Improve Code Quality continuously with Scrutinizer

NodeCollection::atPosition() C
last analyzed 2017-07-04 16:51 UTC

↳ Parent: NodeCollection

Complexity

Conditions	13
Paths	9

Size

Total Lines	26
Code Lines	18

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
dl	0
loc	26
rs	5.1234
c	0
b	0
f	0
cc	13
eloc	18
nc	9
nop	2

How to fix Complexity

<?php

namespace Knp\FriendlyContexts\Table;

use Knp\FriendlyContexts\Table\Node;

class NodeCollection
{
    private $nodes = [];

    public function getNodes()
    {
        return array_reduce(
            $this->nodes,
            function ($previous, $line) {
                return array_merge($previous, $line);
            },
            []
        );
    }

    public function addNode(Node $node, $line, $column)
    {
        $this->nodes[$line][$column] = $node;

        return $this;
    }

    public function atPosition($line = null, $column = null)
    {
        switch (true) {
            case null === $line && null === $column:
                return $this->getNodes();
            case null !== $line && null === $column:
                return array_key_exists($line, $this->nodes)
                    ? $this->nodes[$line]
                    : []
                ;
            case null === $line && null !== $column:
                $nodes = [];
                foreach ($this->nodes as $i => $nodes) {
                    if (array_key_exists($column, $nodes)) {
                        $nodes[$i] = $nodes[$column];
                    }
                }
                return $nodes;
            case null !== $line && null !== $column:
                $nodes = $this->atPosition($line);
                return array_key_exists($column, $nodes)
                    ? $nodes[$column]
                    : null
                ;
        }
    }

    public function search($content)
    {
        return array_filter(
            $this->getNodes(),
            function ($e) use ($content) {
                return $e->getContent() === $content;
            }
        );
    }
}


1			<?php
2
3			namespace Knp\FriendlyContexts\Table;
4
5			use Knp\FriendlyContexts\Table\Node;
6
7			class NodeCollection
8			{
9			private $nodes = [];
10
11			public function getNodes()
12			{
13			return array_reduce(
14			$this->nodes,
15			function ($previous, $line) {
16			return array_merge($previous, $line);
17			},
18			[]
19			);
20			}
21
22			public function addNode(Node $node, $line, $column)
23			{
24			$this->nodes[$line][$column] = $node;
25
26			return $this;
27			}
28
29			public function atPosition($line = null, $column = null)
30			{
31			switch (true) {
32			case null === $line && null === $column:
33			return $this->getNodes();
34			case null !== $line && null === $column:
35			return array_key_exists($line, $this->nodes)
36			? $this->nodes[$line]
37			: []
38			;
39			case null === $line && null !== $column:
40			$nodes = [];
41			foreach ($this->nodes as $i => $nodes) {
42			if (array_key_exists($column, $nodes)) {
43			$nodes[$i] = $nodes[$column];
44			}
45			}
46			return $nodes;
47			case null !== $line && null !== $column:
48			$nodes = $this->atPosition($line);
49			return array_key_exists($column, $nodes)
50			? $nodes[$column]
51			: null
52			;
53			}
54			}
55
56			public function search($content)
57			{
58			return array_filter(
59			$this->getNodes(),
60			function ($e) use ($content) {
61			return $e->getContent() === $content;
62			}
63			);
64			}
65			}
66

KnpLabs / FriendlyContexts

NodeCollection::atPosition() C last analyzed 2017-07-04 16:51 UTC

Complexity

Size

Duplication

Importance

How to fix Complexity

Long Method

Duplication Side-by-Side

Filter issues like

NodeCollection::atPosition() C
last analyzed 2017-07-04 16:51 UTC