poliastro/poliastro

View on GitHub

Showing 95 of 95 total issues

File orbit.py has 1094 lines of code (exceeds 250 allowed). Consider refactoring.
Open

from typing import List, Union
from warnings import warn

import numpy as np
from astropy import time, units as u
Severity: Major
Found in src/poliastro/twobody/orbit.py - About 2 days to fix

    File test_orbit.py has 808 lines of code (exceeds 250 allowed). Consider refactoring.
    Open

    import pickle
    
    import matplotlib
    import numpy as np
    import pytest
    Severity: Major
    Found in src/poliastro/tests/tests_twobody/test_orbit.py - About 1 day to fix

      File propagation.py has 743 lines of code (exceeds 250 allowed). Consider refactoring.
      Open

      import numpy as np
      
      from poliastro.core.angles import (
          D_to_nu,
          E_to_nu,
      Severity: Major
      Found in src/poliastro/core/propagation.py - About 1 day to fix

        File test_czml.py has 612 lines of code (exceeds 250 allowed). Consider refactoring.
        Open

        import pytest  # noqa: E402 isort:skip
        import sys
        
        from astropy import units as u  # noqa: E402
        
        
        Severity: Major
        Found in src/poliastro/tests/test_czml.py - About 1 day to fix

          File general.py has 551 lines of code (exceeds 250 allowed). Consider refactoring.
          Open

          """Astronomical and physics constants.
          
          This module complements constants defined in `astropy.constants`,
          with gravitational paremeters and radii.
          
          
          Severity: Major
          Found in src/poliastro/constants/general.py - About 1 day to fix

            File dastcom5.py has 515 lines of code (exceeds 250 allowed). Consider refactoring.
            Open

            """NEOs orbit from DASTCOM5 database.
            
            """
            import os
            import re
            Severity: Major
            Found in src/poliastro/neos/dastcom5.py - About 1 day to fix

              File integrators.py has 471 lines of code (exceeds 250 allowed). Consider refactoring.
              Open

              from copy import copy
              
              import numpy as np
              from scipy.integrate import DenseOutput, OdeSolver
              from scipy.integrate._ivp.common import (
              Severity: Minor
              Found in src/poliastro/integrators.py - About 7 hrs to fix

                File test_perturbations.py has 448 lines of code (exceeds 250 allowed). Consider refactoring.
                Open

                import functools
                
                import numpy as np
                import pytest
                from astropy import units as u
                Severity: Minor
                Found in src/poliastro/tests/tests_twobody/test_perturbations.py - About 6 hrs to fix

                  File propagation.py has 412 lines of code (exceeds 250 allowed). Consider refactoring.
                  Open

                  """The following script holds the different high level functions for the
                  different propagators available at poliastro:
                  
                  +-------------+------------+-----------------+-----------------+
                  |  Propagator | Elliptical |    Parabolic    |    Hyperbolic   |
                  Severity: Minor
                  Found in src/poliastro/twobody/propagation.py - About 5 hrs to fix

                    File extract_czml.py has 396 lines of code (exceeds 250 allowed). Consider refactoring.
                    Open

                    from typing import Any, List
                    
                    import numpy as np
                    from astropy import units as u
                    from astropy.coordinates import CartesianRepresentation
                    Severity: Minor
                    Found in src/poliastro/czml/extract_czml.py - About 5 hrs to fix

                      File angles.py has 370 lines of code (exceeds 250 allowed). Consider refactoring.
                      Open

                      import numpy as np
                      
                      from ._jit import jit
                      
                      
                      
                      Severity: Minor
                      Found in src/poliastro/core/angles.py - About 4 hrs to fix

                        File elements.py has 360 lines of code (exceeds 250 allowed). Consider refactoring.
                        Open

                        """This module contains a set of functions that can be used
                            to convert between different elements that define the orbit
                            of a body.
                            """
                        
                        
                        Severity: Minor
                        Found in src/poliastro/core/elements.py - About 4 hrs to fix

                          Orbit has 35 functions (exceeds 20 allowed). Consider refactoring.
                          Open

                          class Orbit(object):
                              """Position and velocity of a body with respect to an attractor
                              at a given time (epoch).
                          
                              Regardless of how the Orbit is created, the implicit
                          Severity: Minor
                          Found in src/poliastro/twobody/orbit.py - About 4 hrs to fix

                            File fixed.py has 333 lines of code (exceeds 250 allowed). Consider refactoring.
                            Open

                            import math
                            
                            from astropy import units as u
                            from astropy.coordinates import (
                                HCRS,
                            Severity: Minor
                            Found in src/poliastro/frames/fixed.py - About 4 hrs to fix

                              File iod.py has 329 lines of code (exceeds 250 allowed). Consider refactoring.
                              Open

                              import numpy as np
                              from numpy import cross, pi
                              from numpy.linalg import norm
                              
                              from poliastro.core.hyper import hyp2f1b
                              Severity: Minor
                              Found in src/poliastro/core/iod.py - About 3 hrs to fix

                                Function pimienta has 95 lines of code (exceeds 25 allowed). Consider refactoring.
                                Open

                                def pimienta(k, r0, v0, tof):
                                    """ Raw algorithm for Adonis' Pimienta and John L. Crassidis 15th order
                                    polynomial Kepler solver.
                                
                                    Parameters
                                Severity: Major
                                Found in src/poliastro/core/propagation.py - About 3 hrs to fix

                                  File angles.py has 310 lines of code (exceeds 250 allowed). Consider refactoring.
                                  Open

                                  """Angles and anomalies.
                                  
                                  """
                                  import numpy as np
                                  from astropy import coordinates, units as u
                                  Severity: Minor
                                  Found in src/poliastro/twobody/angles.py - About 3 hrs to fix

                                    Cyclomatic complexity is too high in method heliosynchronous. (15)
                                    Open

                                        @classmethod
                                        def heliosynchronous(
                                            cls,
                                            a=None,
                                            ecc=None,
                                    Severity: Minor
                                    Found in src/poliastro/twobody/orbit.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 add_orbit. (14)
                                    Open

                                        def add_orbit(
                                            self,
                                            orbit,
                                            rtol=1e-10,
                                            N=None,
                                    Severity: Minor
                                    Found in src/poliastro/czml/extract_czml.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 function porkchop. (13)
                                    Open

                                    def porkchop(
                                        departure_body,
                                        target_body,
                                        launch_span,
                                        arrival_span,
                                    Severity: Minor
                                    Found in src/poliastro/plotting/porkchop.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

                                    Severity
                                    Category
                                    Status
                                    Source
                                    Language