Function encode has a Cognitive Complexity of 38 (exceeds 5 allowed). Consider refactoring. Open
def encode(self, word: str) -> str:
"""Return the SfinxBis code for a word.
Parameters
----------- Read upRead up
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 encode. (23) Open
def encode(self, word: str) -> str:
"""Return the SfinxBis code for a word.
Parameters
----------- Read upRead up
- Exclude checks
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. |
File _sfinx_bis.py has 315 lines of code (exceeds 250 allowed). Consider refactoring. Open
# Copyright 2014-2020 by Christopher C. Little.
# This file is part of Abydos.
#
# Abydos is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published byCyclomatic complexity is too high in class SfinxBis. (9) Open
class SfinxBis(_Phonetic):
"""SfinxBis code.
SfinxBis is a Soundex-like algorithm defined in :cite:`Axelsson:2009`.
- Read upRead up
- Exclude checks
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. |
Consider simplifying this complex logical expression. Open
if (
lokal_ordet[0:1] in self._mjuka_vokaler
or lokal_ordet[0:1] in self._harde_vokaler
):
lokal_ordet = '$' + lokal_ordet[1:]Refactor this function to reduce its Cognitive Complexity from 39 to the 15 allowed. Open
def encode(self, word: str) -> str:- Read upRead up
- Exclude checks
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
Too many branches (13/12) Open
def _koda_foersta_ljudet(lokal_ordet: str) -> str:- Read upRead up
- Exclude checks
Used when a function or method has too many branches, making it hard to follow.
Too many statements (66/50) Open
def encode(self, word: str) -> str:- Read upRead up
- Exclude checks
Used when a function or method has too many statements. You should then split it in smaller functions / methods.
Either merge this branch with the identical one on line "326" or change one of the implementations. Open
lokal_ordet = 'S' + lokal_ordet[1:]- Read upRead up
- Exclude checks
Having two branches in the same if structure with the same implementation is at best duplicate code, and at worst a coding error. If
the same logic is truly needed for both instances, then they should be combined.
Noncompliant Code Example
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_thing() # Noncompliant; duplicates first condition
else:
do_the_rest()
b = 4 if a > 12 else 4
Compliant Solution
if (0 <= a < 10) or (20 <= a < 50):
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
else:
do_the_rest()
b = 4
or
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_third_thing()
else:
do_the_rest()
b = 8 if a > 12 else 4
Either merge this branch with the identical one on line "311" or change one of the implementations. Open
lokal_ordet = 'K' + lokal_ordet[1:]- Read upRead up
- Exclude checks
Having two branches in the same if structure with the same implementation is at best duplicate code, and at worst a coding error. If
the same logic is truly needed for both instances, then they should be combined.
Noncompliant Code Example
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_thing() # Noncompliant; duplicates first condition
else:
do_the_rest()
b = 4 if a > 12 else 4
Compliant Solution
if (0 <= a < 10) or (20 <= a < 50):
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
else:
do_the_rest()
b = 4
or
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_third_thing()
else:
do_the_rest()
b = 8 if a > 12 else 4
Either merge this branch with the identical one on line "315" or change one of the implementations. Open
lokal_ordet = '#' + lokal_ordet[2:]- Read upRead up
- Exclude checks
Having two branches in the same if structure with the same implementation is at best duplicate code, and at worst a coding error. If
the same logic is truly needed for both instances, then they should be combined.
Noncompliant Code Example
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_thing() # Noncompliant; duplicates first condition
else:
do_the_rest()
b = 4 if a > 12 else 4
Compliant Solution
if (0 <= a < 10) or (20 <= a < 50):
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
else:
do_the_rest()
b = 4
or
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_third_thing()
else:
do_the_rest()
b = 8 if a > 12 else 4
Either merge this branch with the identical one on line "315" or change one of the implementations. Open
lokal_ordet = '#' + lokal_ordet[2:]- Read upRead up
- Exclude checks
Having two branches in the same if structure with the same implementation is at best duplicate code, and at worst a coding error. If
the same logic is truly needed for both instances, then they should be combined.
Noncompliant Code Example
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_thing() # Noncompliant; duplicates first condition
else:
do_the_rest()
b = 4 if a > 12 else 4
Compliant Solution
if (0 <= a < 10) or (20 <= a < 50):
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
else:
do_the_rest()
b = 4
or
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_third_thing()
else:
do_the_rest()
b = 8 if a > 12 else 4
Either merge this branch with the identical one on line "311" or change one of the implementations. Open
lokal_ordet = 'K' + lokal_ordet[1:]- Read upRead up
- Exclude checks
Having two branches in the same if structure with the same implementation is at best duplicate code, and at worst a coding error. If
the same logic is truly needed for both instances, then they should be combined.
Noncompliant Code Example
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_thing() # Noncompliant; duplicates first condition
else:
do_the_rest()
b = 4 if a > 12 else 4
Compliant Solution
if (0 <= a < 10) or (20 <= a < 50):
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
else:
do_the_rest()
b = 4
or
if 0 <= a < 10:
do_the_thing()
elif 10 <= a < 20:
do_the_other_thing()
elif 20 <= a < 50:
do_the_third_thing()
else:
do_the_rest()
b = 8 if a > 12 else 4
Wrong hanging indentation before block (add 4 spaces). Open
and lokal_ordet[1:2] in self._harde_vokaler- Read upRead up
- Exclude checks
TODO and lokalordet[1:2] in self.harde_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] == 'C'- Read upRead up
- Exclude checks
TODO lokal_ordet[0:1] == 'C' ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:2] == 'SK'- Read upRead up
- Exclude checks
TODO lokal_ordet[0:2] == 'SK' ^ |
Wrong hanging indentation before block (add 4 spaces). Open
and lokal_ordet[1:2] in self._mjuka_vokaler- Read upRead up
- Exclude checks
TODO and lokalordet[1:2] in self.mjuka_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
and lokal_ordet[1:2] in self._mjuka_vokaler- Read upRead up
- Exclude checks
TODO and lokalordet[1:2] in self.mjuka_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
or lokal_ordet[0:1] in self._harde_vokaler- Read upRead up
- Exclude checks
TODO or lokalordet[0:1] in self.harde_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] == 'C'- Read upRead up
- Exclude checks
TODO lokal_ordet[0:1] == 'C' ^ |
Wrong hanging indentation before block (add 4 spaces). Open
and lokal_ordet[1:2] in self._mjuka_vokaler- Read upRead up
- Exclude checks
TODO and lokalordet[1:2] in self.mjuka_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] == 'C' and lokal_ordet[1:2] in self._uc_c_set- Read upRead up
- Exclude checks
TODO lokalordet[0:1] == 'C' and lokalordet[1:2] in self.ucc_set ^ |
Wrong hanging indentation before block (add 4 spaces). Open
and lokal_ordet[2:3] in self._mjuka_vokaler- Read upRead up
- Exclude checks
TODO and lokalordet[2:3] in self.mjuka_vokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] == 'G'- Read upRead up
- Exclude checks
TODO lokal_ordet[0:1] == 'G' ^ |
Wrong hanging indentation before block (add 4 spaces). Open
self._mjuka_vokaler | self._harde_vokaler- Read upRead up
- Exclude checks
TODO self.mjukavokaler | self.hardevokaler ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] == 'K'- Read upRead up
- Exclude checks
TODO lokal_ordet[0:1] == 'K' ^ |
Wrong hanging indentation before block (add 4 spaces). Open
lokal_ordet[0:1] in self._mjuka_vokaler- Read upRead up
- Exclude checks
TODO lokalordet[0:1] in self.mjuka_vokaler ^ |