paradoxysm/kdtrees

View on GitHub

Showing 4 of 4 total issues

Function delete has a Cognitive Complexity of 13 (exceeds 10 allowed). Consider refactoring.
Open

    def delete(self, point):
        """
        Delete a point from the KDTree and return the new
        KDTree. Returns the same tree if the point was not found.

Severity: Minor
Found in kdtrees/_kdtree.py - About 45 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

Function insert has a Cognitive Complexity of 12 (exceeds 10 allowed). Consider refactoring.
Open

    def insert(self, point):
        """
        Insert a point into the KDTree.

        Parameters
Severity: Minor
Found in kdtrees/_kdtree.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

Function proximal_neighbor has a Cognitive Complexity of 11 (exceeds 10 allowed). Consider refactoring.
Open

    def proximal_neighbor(self, point, d=0, neighbors=[]):
        """
        Determine the KDTree nodes that are within `d` distance
        to `point` and their distances.

Severity: Minor
Found in kdtrees/_kdtree.py - About 25 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

Function search has a Cognitive Complexity of 11 (exceeds 10 allowed). Consider refactoring.
Open

    def search(self, point):
        """
        Search the KDTree for a point.
        Returns the KDTree node if found, None otherwise.

Severity: Minor
Found in kdtrees/_kdtree.py - About 25 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