Function walk_and_save has a Cognitive Complexity of 32 (exceeds 5 allowed). Consider refactoring.

Open

def walk_and_save(path: str, dir_list_path: str, file_list_path: str, return_dirs_instead_of_regular_files: bool,
                  extensions: Optional[List[str]]) -> Generator[bytes, None, None]:
    with open(dir_list_path, 'w') as d, open(file_list_path, 'w') as f:
        path_bin = path.encode()
        extensions_bin = list(map(lambda e: e.encode(), extensions)) if extensions else None

• Read up
  Read up

Function get_dir_last_modification has a Cognitive Complexity of 29 (exceeds 5 allowed). Consider refactoring.

Open

def get_dir_last_modification(path: str, limit: int = LIMIT_FILES_ON_LAST_MODIFICATION_CHECK) -> datetime:

    def walk_path(path):
        counter = 0
        if os.path.isfile(path) or len(os.listdir(path)) == 0:

• Read up
  Read up

Function walk has a Cognitive Complexity of 13 (exceeds 5 allowed). Consider refactoring.

Open

def walk(path:bytes, extension: Optional[bytes] = None) -> Generator[bytes, None, None]:
    if os.path.isfile(path) and (not extension or path.endswith(extension)):
        yield path
    else:
        for root, dirs, files in os.walk(path):

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                    if return_dirs_instead_of_regular_files:
                        yield bin_name
                for file in files:

Avoid deeply nested control flow statements.

Open

                    if not extensions or has_one_of_extensions(bin_name, extensions_bin):
                        if not os.path.islink(os.path.join(root, file)):
                            f.write(f'{bin_name}\n')
                            if not return_dirs_instead_of_regular_files:
                                yield bin_name

Function walk_and_save has 5 arguments (exceeds 4 allowed). Consider refactoring.

Open

def walk_and_save(path: str, dir_list_path: str, file_list_path: str, return_dirs_instead_of_regular_files: bool,