HazyResearch/numbskull

View on GitHub
numbskull/factorgraph.py

Summary

Maintainability
D
1 day
Test Coverage

Cyclomatic complexity is too high in method inference. (9)
Open

    def inference(self, burnin_epochs, epochs, sample_evidence=False,
                  diagnostics=False, var_copy=0, weight_copy=0):
        """TODO."""
        # Burn-in
        if burnin_epochs > 0:
Severity: Minor
Found in numbskull/factorgraph.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 learn. (8)
Open

    def learn(self, burnin_epochs, epochs, stepsize, decay, regularization,
              reg_param, truncation, diagnostics=False, verbose=False,
              learn_non_evidence=False, var_copy=0, weight_copy=0):
        """TODO."""
        # Burn-in
Severity: Minor
Found in numbskull/factorgraph.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 dump_probabilities. (6)
Open

    def dump_probabilities(self, fout, epochs):
        """Dump <vid, value, prob> text file in DW format."""
        epochs = epochs or 1
        with open(fout, 'w') as out:
            for i, v in enumerate(self.variable):
Severity: Minor
Found in numbskull/factorgraph.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 diagnostics. (6)
Open

    def diagnostics(self, epochs):
        """TODO."""
        print('Inference took %.03f sec.' % self.inference_total_time)
        epochs = epochs or 1
        bins = 10
Severity: Minor
Found in numbskull/factorgraph.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 learn has 12 arguments (exceeds 4 allowed). Consider refactoring.
Open

    def learn(self, burnin_epochs, epochs, stepsize, decay, regularization,
Severity: Major
Found in numbskull/factorgraph.py - About 1 hr to fix

    Function __init__ has 10 arguments (exceeds 4 allowed). Consider refactoring.
    Open

        def __init__(self, weight, variable, factor, fmap, vmap,
    Severity: Major
    Found in numbskull/factorgraph.py - About 1 hr to fix

      Function __init__ has 28 lines of code (exceeds 25 allowed). Consider refactoring.
      Open

          def __init__(self, weight, variable, factor, fmap, vmap,
                       factor_index, var_copies, weight_copies, fid, workers):
              """TODO."""
              self.weight = weight
              self.variable = variable
      Severity: Minor
      Found in numbskull/factorgraph.py - About 1 hr to fix

        Function learn has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.
        Open

            def learn(self, burnin_epochs, epochs, stepsize, decay, regularization,
                      reg_param, truncation, diagnostics=False, verbose=False,
                      learn_non_evidence=False, var_copy=0, weight_copy=0):
                """TODO."""
                # Burn-in
        Severity: Minor
        Found in numbskull/factorgraph.py - About 55 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 inference has 6 arguments (exceeds 4 allowed). Consider refactoring.
        Open

            def inference(self, burnin_epochs, epochs, sample_evidence=False,
        Severity: Minor
        Found in numbskull/factorgraph.py - About 45 mins to fix

          Function inference has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.
          Open

              def inference(self, burnin_epochs, epochs, sample_evidence=False,
                            diagnostics=False, var_copy=0, weight_copy=0):
                  """TODO."""
                  # Burn-in
                  if burnin_epochs > 0:
          Severity: Minor
          Found in numbskull/factorgraph.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 dump_probabilities has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.
          Open

              def dump_probabilities(self, fout, epochs):
                  """Dump <vid, value, prob> text file in DW format."""
                  epochs = epochs or 1
                  with open(fout, 'w') as out:
                      for i, v in enumerate(self.variable):
          Severity: Minor
          Found in numbskull/factorgraph.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 burnIn has 5 arguments (exceeds 4 allowed). Consider refactoring.
          Open

              def burnIn(self, epochs, sample_evidence, diagnostics=False,
          Severity: Minor
          Found in numbskull/factorgraph.py - About 35 mins to fix

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

            def run_pool(threadpool, threads, func, args):
                """TODO."""
                if threads == 1:
                    func(0, *args)
                else:
            Severity: Minor
            Found in numbskull/factorgraph.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

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

            """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                    """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            TODO found
            Open

                """TODO."""
            Severity: Minor
            Found in numbskull/factorgraph.py by fixme

            Similar blocks of code found in 2 locations. Consider refactoring.
            Open

                    for ep in range(epochs):
                        args = (self.threads, var_copy, weight_copy,
                                self.weight, self.variable, self.factor,
                                self.fmap, self.vmap,
                                self.factor_index, self.Z, self.cstart, self.count,
            Severity: Major
            Found in numbskull/factorgraph.py and 1 other location - About 2 hrs to fix
            numbskull/factorgraph.py on lines 157..163

            Duplicated Code

            Duplicated code can lead to software that is hard to understand and difficult to change. The Don't Repeat Yourself (DRY) principle states:

            Every piece of knowledge must have a single, unambiguous, authoritative representation within a system.

            When you violate DRY, bugs and maintenance problems are sure to follow. Duplicated code has a tendency to both continue to replicate and also to diverge (leaving bugs as two similar implementations differ in subtle ways).

            Tuning

            This issue has a mass of 61.

            We set useful threshold defaults for the languages we support but you may want to adjust these settings based on your project guidelines.

            The threshold configuration represents the minimum mass a code block must have to be analyzed for duplication. The lower the threshold, the more fine-grained the comparison.

            If the engine is too easily reporting duplication, try raising the threshold. If you suspect that the engine isn't catching enough duplication, try lowering the threshold. The best setting tends to differ from language to language.

            See codeclimate-duplication's documentation for more information about tuning the mass threshold in your .codeclimate.yml.

            Refactorings

            Further Reading

            Similar blocks of code found in 2 locations. Consider refactoring.
            Open

                        with Timer() as timer:
                            args = (self.threads, var_copy, weight_copy, self.weight,
                                    self.variable, self.factor, self.fmap,
                                    self.vmap, self.factor_index, self.Z,
                                    self.cstart, self.count, self.var_value,
            Severity: Major
            Found in numbskull/factorgraph.py and 1 other location - About 2 hrs to fix
            numbskull/factorgraph.py on lines 135..141

            Duplicated Code

            Duplicated code can lead to software that is hard to understand and difficult to change. The Don't Repeat Yourself (DRY) principle states:

            Every piece of knowledge must have a single, unambiguous, authoritative representation within a system.

            When you violate DRY, bugs and maintenance problems are sure to follow. Duplicated code has a tendency to both continue to replicate and also to diverge (leaving bugs as two similar implementations differ in subtle ways).

            Tuning

            This issue has a mass of 61.

            We set useful threshold defaults for the languages we support but you may want to adjust these settings based on your project guidelines.

            The threshold configuration represents the minimum mass a code block must have to be analyzed for duplication. The lower the threshold, the more fine-grained the comparison.

            If the engine is too easily reporting duplication, try raising the threshold. If you suspect that the engine isn't catching enough duplication, try lowering the threshold. The best setting tends to differ from language to language.

            See codeclimate-duplication's documentation for more information about tuning the mass threshold in your .codeclimate.yml.

            Refactorings

            Further Reading

            There are no issues that match your filters.

            Category
            Status