HazyResearch/fonduer

View on GitHub
src/fonduer/parser/preprocessors/hocr_doc_preprocessor.py

Summary

Maintainability
D
1 day
Test Coverage

Function _parse_file has a Cognitive Complexity of 72 (exceeds 5 allowed). Consider refactoring.
Open

    def _parse_file(self, fp: str, file_name: str) -> Iterator[Document]:
        # Adapted from https://github.com/ocropus/hocr-tools/blob/v1.3.0/hocr-check
        def get_prop(node: Tag, name: str) -> Optional[str]:
            title = node["title"]
            if not title:
Severity: Minor
Found in src/fonduer/parser/preprocessors/hocr_doc_preprocessor.py - About 1 day 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"

Further reading

Cyclomatic complexity is too high in method _parse_file. (23)
Open

    def _parse_file(self, fp: str, file_name: str) -> Iterator[Document]:
        # Adapted from https://github.com/ocropus/hocr-tools/blob/v1.3.0/hocr-check
        def get_prop(node: Tag, name: str) -> Optional[str]:
            title = node["title"]
            if not title:

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.

Source: http://radon.readthedocs.org/en/latest/intro.html

Cyclomatic complexity is too high in class HOCRDocPreprocessor. (7)
Open

class HOCRDocPreprocessor(DocPreprocessor):
    """A ``Document`` generator for hOCR files.

    hOCR should comply with `hOCR v1.2`_.
    Note that *ppageno* property of *ocr_page* is optional by `hOCR v1.2`_,

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.

Source: http://radon.readthedocs.org/en/latest/intro.html

Avoid deeply nested control flow statements.
Open

                        if "x_wconf" not in parent.attrs:
                            parent["x_wconf"] = []
                        parent["x_wconf"].append(x_wconf)
Severity: Major
Found in src/fonduer/parser/preprocessors/hocr_doc_preprocessor.py - About 45 mins to fix

    Avoid deeply nested control flow statements.
    Open

                            if self.space:
                                word.string.replace_with(" ".join(tokens))
                            else:
                                word.string.replace_with("".join(tokens))
                        word.unwrap()
    Severity: Major
    Found in src/fonduer/parser/preprocessors/hocr_doc_preprocessor.py - About 45 mins to fix

      Avoid deeply nested control flow statements.
      Open

                              if child.strip() == "":  # remove if space or linebreak
                                  child.extract()
                              else:
                                  tmp = re.sub(r"[\n\s]+", " " if self.space else "", child)
                                  n = NavigableString(tmp.strip())
      Severity: Major
      Found in src/fonduer/parser/preprocessors/hocr_doc_preprocessor.py - About 45 mins to fix

        Refactor this function to reduce its Cognitive Complexity from 72 to the 15 allowed.
        Open

            def _parse_file(self, fp: str, file_name: str) -> Iterator[Document]:

        Cognitive Complexity is a measure of how hard the control flow of a function is to understand. Functions with high Cognitive Complexity will be difficult to maintain.

        See

        There are no issues that match your filters.

        Category
        Status