Router::findClosesMatch() - Code Metrics - Inspection of "Merge pull request #4 from Symplify/exclude-option" - Symplify/PHP7_CodeSniffer - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Branch — master (f7eb77)

by Tomáš

created 2016-08-04 18:11 UTC

Router::findClosesMatch() B

↳ Parent: Router

Complexity

Conditions	5
Paths	6

Size

Total Lines	18
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	10
CRAP Score	5.0187

Importance

Changes

Metric	Value
dl	0
loc	18
ccs	10
cts	11
cp	0.9091
rs	8.8571
c	0
b	0
f	0
cc	5
eloc	11
nc	6
nop	2
crap	5.0187

<?php

/*
 * This file is part of Symplify
 * Copyright (c) 2016 Tomas Votruba (http://tomasvotruba.cz).
 */

namespace Symplify\PHP7_CodeSniffer\Ruleset\Routing;

use Symplify\PHP7_CodeSniffer\Sniff\Finder\SniffFinder;

final class Router
{
    /**
     * @var SniffFinder
     */
    private $sniffFinder;

    /**
     * @var string[]
     */
    private $foundClasses = [];

    public function __construct(SniffFinder $sniffFinder)
    {
        $this->sniffFinder = $sniffFinder;
    }

    public function getClassFromSniffName(string $sniffName) : string
    {
        if (isset($this->foundClasses[$sniffName])) {
            return $this->foundClasses[$sniffName];
        }

        $sniffClasses = $this->sniffFinder->findAllSniffClasses();
        $sniffClass = $this->findClosesMatch($sniffClasses, $sniffName);

        return $this->foundClasses[$sniffName] = $sniffClass;
    }

    private function findClosesMatch(array $words, string $input)
    {
        $shortestDistance = -1;
        $closest = '';
        foreach ($words as $word) {
            $levenshtein = levenshtein($input, $word);
            if ($levenshtein <= $shortestDistance || $shortestDistance < 0) {
                $closest = $word;
                $shortestDistance = $levenshtein;
            }
        }

        if ($shortestDistance <= 60) {
            return $closest;
        }

        return '';
    }
}


1		<?php
2
3		/*
4		* This file is part of Symplify
5		* Copyright (c) 2016 Tomas Votruba (http://tomasvotruba.cz).
6		*/
7
8		namespace Symplify\PHP7_CodeSniffer\Ruleset\Routing;
9
10		use Symplify\PHP7_CodeSniffer\Sniff\Finder\SniffFinder;
11
12		final class Router
13		{
14		/**
15		* @var SniffFinder
16		*/
17		private $sniffFinder;
18
19		/**
20		* @var string[]
21		*/
22		private $foundClasses = [];
23
24	6	public function __construct(SniffFinder $sniffFinder)
25		{
26	6	$this->sniffFinder = $sniffFinder;
27	6	}
28
29	4	public function getClassFromSniffName(string $sniffName) : string
30		{
31	4	if (isset($this->foundClasses[$sniffName])) {
32		return $this->foundClasses[$sniffName];
33		}
34
35	4	$sniffClasses = $this->sniffFinder->findAllSniffClasses();
36	4	$sniffClass = $this->findClosesMatch($sniffClasses, $sniffName);
37
38	4	return $this->foundClasses[$sniffName] = $sniffClass;
39		}
40
41	4	private function findClosesMatch(array $words, string $input)
42		{
43	4	$shortestDistance = -1;
44	4	$closest = '';
45	4	foreach ($words as $word) {
46	4	$levenshtein = levenshtein($input, $word);
47	4	if ($levenshtein <= $shortestDistance \|\| $shortestDistance < 0) {
48	4	$closest = $word;
49	4	$shortestDistance = $levenshtein;
50		}
51		}
52
53	4	if ($shortestDistance <= 60) {
54	4	return $closest;
55		}
56
57		return '';
58		}
59		}
60

Symplify / PHP7_CodeSniffer

Branch — master (f7eb77)

Router::findClosesMatch() B

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like