src/libertem/io/dataset/base/file.py
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert self._frame_footer % itemsize == 0- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert self._frame_header % itemsize == 0- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert skip_end >= 0
- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert len(mem) // itemsize // self.num_frames % (
slicing.frame_size + (self._frame_header + self._frame_footer) // itemsize
) == 0, "len(mem) must fit the sig shape"- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert len(mem) // itemsize % self.num_frames == 0, \
"len(mem) must fit the number of frames"- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert len(mem) % itemsize == 0, \
"len(mem) must fit the dtype"- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert arr.shape[1] == slicing.frame_size, \
"array shape must fit the signal shape"- Exclude checks
Use of assert detected. The enclosed code will be removed when compiling to optimised byte code. Open
Open
assert arr.size > 0- Exclude checks
Cyclomatic complexity is too high in method get_array_from_memview. (7) Open
Open
def get_array_from_memview(self, mem: memoryview, slicing: OffsetsSizes) -> np.ndarray:
"""
Convert a memoryview of the file's data into an ndarray, cutting away
frame headers and footers as defined by `start` and `stop` 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. |