File ulid.py has 274 lines of code (exceeds 250 allowed). Consider refactoring. Wontfix
"""
ulid/ulid
~~~~~~~~~
Object representation of a ULID.MemoryView has 23 functions (exceeds 20 allowed). Consider refactoring. Wontfix
class MemoryView:
"""
Wraps a buffer object, typically :class:`~bytes`, with a :class:`~memoryview` and provides easy
type comparisons and conversions between presentation formats.
"""Cyclomatic complexity is too high in method __le__. (7) Wontfix
def __le__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int <= other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes <= other- 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 __gt__. (7) Wontfix
def __gt__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int > other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes > other- 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 __lt__. (7) Wontfix
def __lt__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int < other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes < other- 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 __ge__. (7) Wontfix
def __ge__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int >= other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes >= other- 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 __eq__. (6) Wontfix
def __eq__(self, other: MemoryViewPrimitive) -> hints.Bool: # type: ignore[override]
if isinstance(other, MemoryView):
return self.memory == other.memory
if isinstance(other, (bytes, bytearray, memoryview)):
return self.memory == other- 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 __ne__. (6) Wontfix
def __ne__(self, other: MemoryViewPrimitive) -> hints.Bool: # type: ignore[override]
if isinstance(other, MemoryView):
return self.memory != other.memory
if isinstance(other, (bytes, bytearray, memoryview)):
return self.memory != other- 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. |
Avoid too many return statements within this function. Wontfix
return self.float > otherAvoid too many return statements within this function. Wontfix
return NotImplementedAvoid too many return statements within this function. Wontfix
return NotImplementedAvoid too many return statements within this function. Wontfix
return self.float >= otherAvoid too many return statements within this function. Wontfix
return self.str >= otherAvoid too many return statements within this function. Wontfix
return self.str < otherAvoid too many return statements within this function. Wontfix
return self.float < otherAvoid too many return statements within this function. Wontfix
return NotImplementedAvoid too many return statements within this function. Wontfix
return self.str <= otherAvoid too many return statements within this function. Wontfix
return NotImplementedAvoid too many return statements within this function. Wontfix
return self.str != otherAvoid too many return statements within this function. Wontfix
return self.str > otherAvoid too many return statements within this function. Wontfix
return NotImplementedAvoid too many return statements within this function. Wontfix
return self.float <= otherAvoid too many return statements within this function. Wontfix
return self.str == otherAvoid too many return statements within this function. Wontfix
return NotImplementedFunction __lt__ has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring. Wontfix
def __lt__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int < other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes < other- 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
Function __gt__ has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring. Wontfix
def __gt__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int > other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes > other- 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
Function __le__ has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring. Wontfix
def __le__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int <= other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes <= other- 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
Function __ge__ has a Cognitive Complexity of 6 (exceeds 5 allowed). Consider refactoring. Wontfix
def __ge__(self, other: MemoryViewPrimitive) -> hints.Bool:
if isinstance(other, MemoryView):
return self.int >= other.int
if isinstance(other, (bytes, bytearray)):
return self.bytes >= other- 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"