Sign upLogin

globocom/async-pluct

View on GitHub
Star

Showing 5 of 5 total issues

Cyclomatic complexity is too high in method rel. (11)
Open

    async def rel(self, name, **kwargs):
        link = self.get_link(name)
        method = link.get('method', 'GET')
        href = link.get('href', '')
Severity: Minor
Found in async_pluct/schema.py by radon

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 method expand_refs. (6)
Open

    def expand_refs(self, item):
        if self._is_simple_dict(item):
            iterator = iter(item.items())
        elif isinstance(item, list):
            iterator = enumerate(item)
Severity: Minor
Found in async_pluct/schema.py by radon

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

Function init has 6 arguments (exceeds 4 allowed). Consider refactoring.
Open

    def init(self, url, data=None, schema=None, session=None, response=None,
Severity: Minor
Found in async_pluct/resource.py - About 45 mins to fix

    Function from_data has 6 arguments (exceeds 4 allowed). Consider refactoring.
    Open

        def from_data(cls, url, data=None, schema=None, session=None,
    Severity: Minor
    Found in async_pluct/resource.py - About 45 mins to fix

      Function expand_refs has a Cognitive Complexity of 7 (exceeds 5 allowed). Consider refactoring.
      Open

          def expand_refs(self, item):
        if self._is_simple_dict(item):
            iterator = iter(item.items())
        elif isinstance(item, list):
            iterator = enumerate(item)
      Severity: Minor
      Found in async_pluct/schema.py - About 35 mins 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

      Severity
      Category
      Status
      Source
      Language