Symplify\PHP7_CodeSniffer\Ruleset\Routing\Router

Complexity

Total Complexity

8

Size/Duplication

Total Lines	49
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Test Coverage

Coverage

90.48%

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	4	1
A	getClassFromSniffName()	0	12	2
B	findClosesMatch()	0	18	5

<?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\SniffFinder\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);
        $this->foundClasses[$sniffName] = $sniffClass;

        return $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 '';
    }
}