lexicalDistance() - Code Metrics - Inspection of "ExecutableDefinitions validation rule" - digiaonline/graphql-php - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Pull Request — master (#54)

by Christoffer

created 2018-03-11 16:58 UTC

lexicalDistance() C

↳ Parent: Project

Complexity

Conditions	12
Paths	26

Size

Total Lines	39
Code Lines	20

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	12
eloc	20
nc	26
nop	2
dl	0
loc	39
rs	5.1612
c	0
b	0
f	0

How to fix Complexity

<?php

namespace Digia\GraphQL\Util;

/**
 * @param string $input
 * @param array  $options
 * @return array
 */
function suggestionList(string $input, array $options): array
{
    $optionsByDistance = [];
    $oLength = count($options);
    $inputThreshold = strlen($input) / 2;

    /** @noinspection ForeachInvariantsInspection */
    for ($i = 0; $i < $oLength; $i++) {
        $distance = lexicalDistance($input, $options[$i]);
        $threshold = max($inputThreshold, strlen($options[$i]) / 2, 1);
        if ($distance <= $threshold) {
            $optionsByDistance[$options[$i]] = $distance;
        }
    }

    $result = array_keys($optionsByDistance);

    usort($result, function ($a, $b) use ($optionsByDistance) {
        return $optionsByDistance[$a] - $optionsByDistance[$b];
    });

    return $result;
}

/**
 * @param string $aStr
 * @param string $bStr
 * @return int
 */
function lexicalDistance(string $aStr, string $bStr): int
{
    if ($aStr === $bStr) {
        return 0;
    }

    $d = [];
    $a = strtolower($aStr);
    $b = strtolower($bStr);
    $aLength = strlen($a);
    $bLength = strlen($b);

    if ($a === $b) {
        return 1;
    }

    /** @noinspection ForeachInvariantsInspection */
    for ($i = 0; $i <= $aLength; $i++) {
        $d[$i] = [$i];
    }

    /** @noinspection ForeachInvariantsInspection */
    for ($j = 1; $j <= $bLength; $j++) {
        $d[0][$j] = $i;
    }

    for ($i = 1; $i <= $aLength; $i++) {
        for ($j = 1; $j <= $bLength; $j++) {
            $cost = $a[$i - 1] === $b[$j - 1] ? 0 : 1;

            $d[$i][$j] = min($d[$i - 1][$j] + 1, $d[$i][$j - 1] + 1, $d[$i - 1][$j - 1] + $cost);

            if ($i > 1 && $j > 1 && $a[$i - 1] === $b[$j - 2] && $a[$i - 2] === $b[$j - 1]) {
                $d[$i][$j] = min($d[$i][$j], $d[$i - 2][$j - 2] + $cost);
            }
        }
    }

    return $d[$aLength][$bLength];
}


1			<?php
2
3			namespace Digia\GraphQL\Util;
4
5			/**
6			* @param string $input
7			* @param array $options
8			* @return array
9			*/
10			function suggestionList(string $input, array $options): array
11			{
12			$optionsByDistance = [];
13			$oLength = count($options);
14			$inputThreshold = strlen($input) / 2;
15
16			/** @noinspection ForeachInvariantsInspection */
17			for ($i = 0; $i < $oLength; $i++) {
18			$distance = lexicalDistance($input, $options[$i]);
19			$threshold = max($inputThreshold, strlen($options[$i]) / 2, 1);
20			if ($distance <= $threshold) {
21			$optionsByDistance[$options[$i]] = $distance;
22			}
23			}
24
25			$result = array_keys($optionsByDistance);
26
27			usort($result, function ($a, $b) use ($optionsByDistance) {
28			return $optionsByDistance[$a] - $optionsByDistance[$b];
29			});
30
31			return $result;
32			}
33
34			/**
35			* @param string $aStr
36			* @param string $bStr
37			* @return int
38			*/
39			function lexicalDistance(string $aStr, string $bStr): int
40			{
41			if ($aStr === $bStr) {
42			return 0;
43			}
44
45			$d = [];
46			$a = strtolower($aStr);
47			$b = strtolower($bStr);
48			$aLength = strlen($a);
49			$bLength = strlen($b);
50
51			if ($a === $b) {
52			return 1;
53			}
54
55			/** @noinspection ForeachInvariantsInspection */
56			for ($i = 0; $i <= $aLength; $i++) {
57			$d[$i] = [$i];
58			}
59
60			/** @noinspection ForeachInvariantsInspection */
61			for ($j = 1; $j <= $bLength; $j++) {
62			$d[0][$j] = $i;
63			}
64
65			for ($i = 1; $i <= $aLength; $i++) {
66			for ($j = 1; $j <= $bLength; $j++) {
67			$cost = $a[$i - 1] === $b[$j - 1] ? 0 : 1;
68
69			$d[$i][$j] = min($d[$i - 1][$j] + 1, $d[$i][$j - 1] + 1, $d[$i - 1][$j - 1] + $cost);
70
71			if ($i > 1 && $j > 1 && $a[$i - 1] === $b[$j - 2] && $a[$i - 2] === $b[$j - 1]) {
72			$d[$i][$j] = min($d[$i][$j], $d[$i - 2][$j - 2] + $cost);
73			}
74			}
75			}
76
77			return $d[$aLength][$bLength];
78			}
79

digiaonline / graphql-php

Pull Request — master (#54)

lexicalDistance() C

Complexity

Size

Duplication

Importance

How to fix Complexity

Long Method

Duplication Side-by-Side

Filter issues like