# LiberTEM/LiberTEM

src/libertem/executor/utils/delayed_unpack.py

### Summary

B
5 hrs

#### Cyclomatic complexity is too high in function insert_at_pos. (8) Open

``````def insert_at_pos(el: Any,
coords: List[Tuple[type, Any]],
nest: Iterable,
merge_fns: Dict[type, Callable[[Iterable, Any, Any], None]]):
"""``````

## 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 function build_mapping. (8) Open

``````def build_mapping(el: Any,
unpackable_types: Dict[type, Callable[[Iterable],
Iterable[Tuple[Any, Any]]]] = None,
ignore_types: Optional[Tuple[type, ...]] = None,
_pos: List[Tuple[type, Any]] = None) -> List[List[Tuple[type, Any]]]:``````

## 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 `insert_at_pos` has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring. Open

``````def insert_at_pos(el: Any,
coords: List[Tuple[type, Any]],
nest: Iterable,
merge_fns: Dict[type, Callable[[Iterable, Any, Any], None]]):
"""``````
Found in src/libertem/executor/utils/delayed_unpack.py - About 2 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"

#### Cyclomatic complexity is too high in function flatten_nested. (7) Open

``````def flatten_nested(el: Any,
unpackable_types: Dict[type, Callable[[Iterable],
Iterable[Tuple[Any, Any]]]] = None,
ignore_types: Optional[Tuple[type, ...]] = None) -> List[Any]:
"""``````

## 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 function rebuild_nested. (6) Open

``````def rebuild_nested(flat: List[Any],
flat_mapping: List[List[Tuple[type, Any]]],
merge_functions=None):
"""
Using the flattened version of a structure built by flatten_nested``````

## 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 `build_mapping` has a Cognitive Complexity of 12 (exceeds 5 allowed). Consider refactoring. Open

``````def build_mapping(el: Any,
unpackable_types: Dict[type, Callable[[Iterable],
Iterable[Tuple[Any, Any]]]] = None,
ignore_types: Optional[Tuple[type, ...]] = None,
_pos: List[Tuple[type, Any]] = None) -> List[List[Tuple[type, Any]]]:``````
Found in src/libertem/executor/utils/delayed_unpack.py - About 1 hr 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"

#### Function `rebuild_nested` has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring. Open

``````def rebuild_nested(flat: List[Any],
flat_mapping: List[List[Tuple[type, Any]]],
merge_functions=None):
"""
Using the flattened version of a structure built by flatten_nested``````
Found in src/libertem/executor/utils/delayed_unpack.py - About 1 hr 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"

#### Function `flatten_nested` has a Cognitive Complexity of 10 (exceeds 5 allowed). Consider refactoring. Open

``````def flatten_nested(el: Any,
unpackable_types: Dict[type, Callable[[Iterable],
Iterable[Tuple[Any, Any]]]] = None,
ignore_types: Optional[Tuple[type, ...]] = None) -> List[Any]:
"""``````
Found in src/libertem/executor/utils/delayed_unpack.py - About 1 hr 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"

``def insert_at_pos(el: Any,``