Completed
Branch master (c5ceed)
by Tomáš
33:54 queued 13:17
created

Router::getClassFromSniffName()   A

Complexity

Conditions 2
Paths 2

Size

Total Lines 12
Code Lines 7

Duplication

Lines 0
Ratio 0 %

Code Coverage

Tests 6
CRAP Score 2.0116

Importance

Changes 0
Metric Value
dl 0
loc 12
ccs 6
cts 7
cp 0.8571
rs 9.4285
c 0
b 0
f 0
cc 2
eloc 7
nc 2
nop 1
crap 2.0116
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\SniffFinder\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 2
    public function __construct(SniffFinder $sniffFinder)
25
    {
26 2
        $this->sniffFinder = $sniffFinder;
27 2
    }
28
29 1
    public function getClassFromSniffName(string $sniffName) : string
30
    {
31 1
        if (isset($this->foundClasses[$sniffName])) {
32
            return $this->foundClasses[$sniffName];
33
        }
34
35 1
        $sniffClasses = $this->sniffFinder->findAllSniffClasses();
36 1
        $sniffClass = $this->findClosesMatch($sniffClasses, $sniffName);
37 1
        $this->foundClasses[$sniffName] = $sniffClass;
38
39 1
        return $sniffClass;
40
    }
41
42 1
    private function findClosesMatch(array $words, string $input)
43
    {
44 1
        $shortestDistance = -1;
45 1
        $closest = '';
46 1
        foreach ($words as $word) {
47 1
            $levenshtein = levenshtein($input, $word);
48 1
            if ($levenshtein <= $shortestDistance || $shortestDistance < 0) {
49 1
                $closest = $word;
50 1
                $shortestDistance = $levenshtein;
51
            }
52
        }
53
54 1
        if ($shortestDistance <= 60) {
55 1
            return $closest;
56
        }
57
58
        return '';
59
    }
60
}
61