Cyclomatic complexity is too high in class SnowballSwedish. (16) Open
class SnowballSwedish(_Snowball):
"""Snowball Swedish stemmer.
The Snowball Swedish stemmer is defined at:
http://snowball.tartarus.org/algorithms/swedish/stemmer.html
- 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. |
Cyclomatic complexity is too high in method stem. (16) Open
def stem(self, word: str) -> str:
"""Return Snowball Swedish stem.
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. |
Function stem
has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring. Open
def stem(self, word: str) -> str:
"""Return Snowball Swedish stem.
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
Refactor this function to reduce its Cognitive Complexity from 16 to the 15 allowed. Open
def stem(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 few public methods (1/2) Open
class SnowballSwedish(_Snowball):
- Read upRead up
- Exclude checks
Used when class has too few public methods, so be sure it's really worth it.
Too many branches (14/12) Open
def stem(self, word: str) -> str:
- Read upRead up
- Exclude checks
Used when a function or method has too many branches, making it hard to follow.
Either merge this branch with the identical one on line "140" or change one of the implementations. Open
word = word[:-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
Merge this if statement with the enclosing one. Open
if len(word) > 1 and word[-2] in self._s_endings:
- Read upRead up
- Exclude checks
Merging collapsible if
statements increases the code's readability.
Noncompliant Code Example
if condition1: if condition2: # ...
Compliant Solution
if condition1 and condition2: # ...
Wrong hanging indentation before block (add 4 spaces). Open
'heter',
- Read upRead up
- Exclude checks
TODO 'heter', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'anden',
- Read upRead up
- Exclude checks
TODO 'anden', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'arnas',
- Read upRead up
- Exclude checks
TODO 'arnas', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'ernas',
- Read upRead up
- Exclude checks
TODO 'ernas', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'ornas',
- Read upRead up
- Exclude checks
TODO 'ornas', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'andes',
- Read upRead up
- Exclude checks
TODO 'andes', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'heten',
- Read upRead up
- Exclude checks
TODO 'heten', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'ande',
- Read upRead up
- Exclude checks
TODO 'ande', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'aste',
- Read upRead up
- Exclude checks
TODO 'aste', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'arne',
- Read upRead up
- Exclude checks
TODO 'arne', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'arens',
- Read upRead up
- Exclude checks
TODO 'arens', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'erna',
- Read upRead up
- Exclude checks
TODO 'erna', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'aren',
- Read upRead up
- Exclude checks
TODO 'aren', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'orna',
- Read upRead up
- Exclude checks
TODO 'orna', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'andet',
- Read upRead up
- Exclude checks
TODO 'andet', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'arna',
- Read upRead up
- Exclude checks
TODO 'arna', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'ades',
- Read upRead up
- Exclude checks
TODO 'ades', ^ |
Wrong hanging indentation before block (add 4 spaces). Open
'erns',
- Read upRead up
- Exclude checks
TODO 'erns', ^ |