NodeMap::lookup() - Code Metrics - letournel/path-finder - Measure and Improve Code Quality continuously with Scrutinizer

NodeMap::lookup() A
last analyzed 2017-07-23 14:48 UTC

↳ Parent: NodeMap

Complexity

Conditions	2
Paths	2

Size

Total Lines	11
Code Lines	5

Duplication

Lines	11
Ratio	100 %

Importance

Changes

Metric	Value
dl	11
loc	11
rs	9.4285
c	0
b	0
f	0
cc	2
eloc	5
nc	2
nop	1

<?php

namespace Letournel\PathFinder\Core;

class NodeMap implements \Countable, \Iterator
{
    private
        $map;
class A {
    var $property;
}
    
    public function __contruct()
    {
        $this->map = array();
    }
    
    public function count()
    {
        return count($this->map);
    }
    
    public function isEmpty()
    {
        return empty($this->map);
    }
    
    public function rewind()
    {
        rewind($this->map);
    }
    
    public function current()
    {
        return current($this->map);
    }
    
    public function key()
    {
        return key($this->map);
    }
    
    public function next()
    {
        return next($this->map);
    }
    
    public function valid()
    {
        return valid($this->map);
    }
    
    public function lookup(Node $node)

    {
        $id = $node->getId();
        
        if(array_key_exists($id, $this->map))
        {
            return $this->map[$id];
        }
        
        return null;
    }
    
    public function lookupFrom(Node $node)
    {
        $path = array();
        while($node instanceof Node)
        {
            array_unshift($path, $node);
            $node = $this->lookup($node);
            
            if(in_array($node, $path))
            {
                break;
            }
        }
        
        return $path;
    }
    
    public function delete(Node $node)
    {
        $id = $node->getId();
        $value = null;
        
        if(array_key_exists($id, $this->map))
        {
            $value = $this->map[$id];
            unset($this->map[$id]);
        }
        
        return $value;
    }
    
    public function exists(Node $node)
    {
        return array_key_exists($node->getId(), $this->map);
    }
    
    public function insert(Node $node, $value = true)
    {
        $this->map[$node->getId()] = $value;
    }
}


1		<?php
2
3		namespace Letournel\PathFinder\Core;
4
5		class NodeMap implements \Countable, \Iterator
6		{
7		private
8		$map;
		0 ignored issues – show Coding Style introduced 2015-12-08 23:25 UTC by Report Bug Copy Issue Report The visibility should be declared for property `$map`. The PSR-2 coding standard requires that all properties in a class have their visibility explicitly declared. If you declare a property using class A { var $property; } the property is implicitly global. To learn more about the PSR-2, please see the PHP-FIG site on the PSR-2. Loading history...
9
10		public function __contruct()
11		{
12		$this->map = array();
13		}
14
15		public function count()
16		{
17		return count($this->map);
18		}
19
20		public function isEmpty()
21		{
22		return empty($this->map);
23		}
24
25		public function rewind()
26		{
27		rewind($this->map);
28		}
29
30		public function current()
31		{
32		return current($this->map);
33		}
34
35		public function key()
36		{
37		return key($this->map);
38		}
39
40		public function next()
41		{
42		return next($this->map);
43		}
44
45		public function valid()
46		{
47		return valid($this->map);
48		}
49
50	View Code Duplication	public function lookup(Node $node)
		0 ignored issues – show Duplication introduced 2015-12-08 23:25 UTC by Report Bug Copy Issue Report This method seems to be duplicated in your project. Duplicated code is one of the most pungent code smells. If you need to duplicate the same code in three or more different places, we strongly encourage you to look into extracting the code into a single class or operation. You can also find more detailed suggestions in the “Code” section of your repository. Loading history...
51		{
52		$id = $node->getId();
53
54		if(array_key_exists($id, $this->map))
55		{
56		return $this->map[$id];
57		}
58
59		return null;
60		}
61
62		public function lookupFrom(Node $node)
63		{
64		$path = array();
65		while($node instanceof Node)
66		{
67		array_unshift($path, $node);
68		$node = $this->lookup($node);
69
70		if(in_array($node, $path))
71		{
72		break;
73		}
74		}
75
76		return $path;
77		}
78
79		public function delete(Node $node)
80		{
81		$id = $node->getId();
82		$value = null;
83
84		if(array_key_exists($id, $this->map))
85		{
86		$value = $this->map[$id];
87		unset($this->map[$id]);
88		}
89
90		return $value;
91		}
92
93		public function exists(Node $node)
94		{
95		return array_key_exists($node->getId(), $this->map);
96		}
97
98		public function insert(Node $node, $value = true)
99		{
100		$this->map[$node->getId()] = $value;
101		}
102		}
103

letournel / path-finder

GitHub Access Token became invalid

NodeMap::lookup() A last analyzed 2017-07-23 14:48 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

NodeMap::lookup() A
last analyzed 2017-07-23 14:48 UTC