chrislit/abydos

View on GitHub
abydos/distance/_editex.py

Summary

Maintainability
B
4 hrs
Test Coverage

Function dist_abs has a Cognitive Complexity of 27 (exceeds 5 allowed). Consider refactoring.
Open

    def dist_abs(self, src: str, tar: str) -> float:
        """Return the Editex distance between two strings.

        Parameters
        ----------
Severity: Minor
Found in abydos/distance/_editex.py - About 3 hrs to fix

Cognitive Complexity

Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.

A method's cognitive complexity is based on a few simple rules:

  • Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
  • Code is considered more complex for each "break in the linear flow of the code"
  • Code is considered more complex when "flow breaking structures are nested"

Further reading

Cyclomatic complexity is too high in method dist_abs. (12)
Open

    def dist_abs(self, src: str, tar: str) -> float:
        """Return the Editex distance between two strings.

        Parameters
        ----------
Severity: Minor
Found in abydos/distance/_editex.py by radon

Cyclomatic Complexity

Cyclomatic Complexity corresponds to the number of decisions a block of code contains plus 1. This number (also called McCabe number) is equal to the number of linearly independent paths through the code. This number can be used as a guide when testing conditional logic in blocks.

Radon analyzes the AST tree of a Python program to compute Cyclomatic Complexity. Statements have the following effects on Cyclomatic Complexity:

Construct Effect on CC Reasoning
if +1 An if statement is a single decision.
elif +1 The elif statement adds another decision.
else +0 The else statement does not cause a new decision. The decision is at the if.
for +1 There is a decision at the start of the loop.
while +1 There is a decision at the while statement.
except +1 Each except branch adds a new conditional path of execution.
finally +0 The finally block is unconditionally executed.
with +1 The with statement roughly corresponds to a try/except block (see PEP 343 for details).
assert +1 The assert statement internally roughly equals a conditional statement.
Comprehension +1 A list/set/dict comprehension of generator expression is equivalent to a for loop.
Boolean Operator +1 Every boolean operator (and, or) adds a decision point.

Source: http://radon.readthedocs.org/en/latest/intro.html

Avoid too many return statements within this function.
Open

            return cast(float, d_mat[src_len, tar_len])
Severity: Major
Found in abydos/distance/_editex.py - About 30 mins to fix

    Refactor this function to reduce its Cognitive Complexity from 29 to the 15 allowed.
    Open

        def dist_abs(self, src: str, tar: str) -> float:
    Severity: Critical
    Found in abydos/distance/_editex.py by sonar-python

    Cognitive Complexity is a measure of how hard the control flow of a function is to understand. Functions with high Cognitive Complexity will be difficult to maintain.

    See

    Consider merging these comparisons with in to ch1 in ('H', 'W')
    Open

                if ch1 != ch2 and (ch1 == 'H' or ch1 == 'W'):
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    To check if a variable is equal to one of many values,combine the values into a tuple and check if the variable is contained in it instead of checking for equality against each of the values.This is faster and less verbose.

    Unnecessary else after return
    Open

            if int(d_mat[src_len, tar_len]) == d_mat[src_len, tar_len]:
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    Used in order to highlight an unnecessary block of code following an if containing a return statement. As such, it will warn when it encounters an else following a chain of ifs, all of them containing a return statement.

    Unused variable 'group_cost'
    Open

            match_cost, group_cost, mismatch_cost = self._cost
    Severity: Minor
    Found in abydos/distance/_editex.py by pylint

    Used when a variable is defined but not used.

    Unused variable 'match_cost'
    Open

            match_cost, group_cost, mismatch_cost = self._cost
    Severity: Minor
    Found in abydos/distance/_editex.py by pylint

    Used when a variable is defined but not used.

    Unable to import 'numpy'
    Open

    from numpy import float_ as np_float
    Severity: Critical
    Found in abydos/distance/_editex.py by pylint

    Used when pylint has been unable to import a module.

    Unable to import 'numpy'
    Open

    from numpy import zeros as np_zeros
    Severity: Critical
    Found in abydos/distance/_editex.py by pylint

    Used when pylint has been unable to import a module.

    Wrong hanging indentation before block (add 4 spaces).
    Open

            taper: bool = False,
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    TODO taper: bool = False, ^ |

    Wrong hanging indentation before block (add 4 spaces).
    Open

            **kwargs: Any
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    TODO **kwargs: Any ^ |

    Wrong hanging indentation before block (add 4 spaces).
    Open

            cost: Tuple[int, int, int] = (0, 1, 2),
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    TODO cost: Tuple[int, int, int] = (0, 1, 2), ^ |

    Wrong hanging indentation before block (add 4 spaces).
    Open

            self,
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    TODO self, ^ |

    Wrong hanging indentation before block (add 4 spaces).
    Open

            local: bool = False,
    Severity: Info
    Found in abydos/distance/_editex.py by pylint

    TODO local: bool = False, ^ |

    There are no issues that match your filters.

    Category
    Status