Showing 491 of 903 total issues
File base.py has 2244 lines of code (exceeds 400 allowed). Consider refactoring. Open
from collections import defaultdict, OrderedDict
from contextlib import contextmanager
import typing
from typing import (
Any, Optional,File api.py has 1483 lines of code (exceeds 400 allowed). Consider refactoring. Open
from typing import (
TYPE_CHECKING, Any, Optional, Union, overload
)
from collections.abc import Iterable, Generator, Coroutine
from typing_extensions import LiteralFile pipelined.py has 1005 lines of code (exceeds 400 allowed). Consider refactoring. Open
import itertools
import os
import sys
import logging
import functoolsFile mib.py has 1005 lines of code (exceeds 400 allowed). Consider refactoring. Open
import re
import os
import platform
from glob import glob, escape
import loggingFile k2is.py has 849 lines of code (exceeds 400 allowed). Consider refactoring. Open
import os
import re
import glob
import math
import typingFile buffers.py has 825 lines of code (exceeds 400 allowed). Consider refactoring. Open
from typing import Any, Optional, Union, TYPE_CHECKING, Generic, TypeVar
from collections.abc import Iterable
from typing_extensions import Literal
import mmap
import mathFunction _execution_plan has a Cognitive Complexity of 64 (exceeds 5 allowed). Consider refactoring. Open
def _execution_plan(
udfs, ds: Union[DataSet, DataSetMeta], device_class: Optional[DeviceClass] = None,
available_backends: Iterable[ArrayBackend] = BACKENDS
) -> tuple[ArrayBackend, ExecutionPlan]:
'''- 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
File hdf5.py has 729 lines of code (exceeds 400 allowed). Consider refactoring. Open
import os
import contextlib
import typing
from typing import Optional
import warningsFunction DatasetOpen has a Cognitive Complexity of 59 (exceeds 5 allowed). Consider refactoring. Open
const DatasetOpen = () => {
const dispatch = useDispatch();
const openState = useSelector((state: RootReducer) => state.openDataset);
const [didReset, setReset] = React.useState(false);- 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
File dask.py has 693 lines of code (exceeds 400 allowed). Consider refactoring. Open
import os
import contextlib
from copy import deepcopy
import functools
import loggingFile messages.ts has 609 lines of code (exceeds 400 allowed). Consider refactoring. Open
import { JobList } from "./analysis/types"
/*
* Common
*/Function _correct_numba_inplace has a Cognitive Complexity of 45 (exceeds 5 allowed). Consider refactoring. Open
def _correct_numba_inplace(buffer, dark_image, gain_map, exclude_pixels, repair_environments,
repair_counts):
'''
Numerical work horse to perform detector corrections
- 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
File frms6.py has 596 lines of code (exceeds 400 allowed). Consider refactoring. Open
import os
import re
import csv
from glob import glob, escape
import typingFile com.py has 595 lines of code (exceeds 400 allowed). Consider refactoring. Open
from enum import IntEnum
from typing import NamedTuple, Optional, Union
from typing_extensions import Literal
import numpy as npFile executor.py has 567 lines of code (exceeds 400 allowed). Consider refactoring. Open
import queue
from typing import (
Callable, Optional, Any, TYPE_CHECKING,
TypeVar,
)File seq.py has 565 lines of code (exceeds 400 allowed). Consider refactoring. Open
# Based on the SEQ reader of the PIMS project, with the following license:
#
# Copyright (c) 2013-2014 PIMS contributors
# https://github.com/soft-matter/pims
# All rights reservedCyclomatic complexity is too high in method sync_sectors. (30) Open
def sync_sectors(self):
for b in self.first_blocks():
assert b.is_valid, "first block is not valid!"
# sync up all sectors to start with the same `block_count`
block_with_max_idx = sorted(self.first_blocks(), key=lambda b: b.header['block_count'])[-1]- 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 function worker_loop. (24) Open
def worker_loop(
queues: WorkerQueues,
work_mem: dict,
worker_idx: int,
env: Environment- 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 radial_bins has a Cognitive Complexity of 32 (exceeds 5 allowed). Consider refactoring. Open
def radial_bins(centerX, centerY, imageSizeX, imageSizeY,
radius=None, radius_inner=0, n_bins=None, normalize=False, use_sparse=None, dtype=None):
'''
Generate antialiased rings
'''- 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 _adapt_chunking. (23) Open
def _adapt_chunking(self, array, sig_dims):
n_dimension = array.ndim
# Handle chunked signal dimensions by merging just in case
sig_dim_idxs = [*range(n_dimension)[-sig_dims:]]
if any([len(array.chunks[c]) > 1 for c in sig_dim_idxs]):- 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. |