lint

convexengineering · Aug 16, 2021 · f9f588a · f9f588a
1 parent 8eac752
commit f9f588a
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/gpkit/constraints/prog_factories.py b/gpkit/constraints/prog_factories.py
@@ -140,7 +140,7 @@ def solvefn(self, solver=None, *, verbosity=1, skipsweepfailures=False,
     return solvefn
 
 
-# pylint: disable=too-many-locals,too-many-arguments,too-many-branches
+# pylint: disable=too-many-locals,too-many-arguments,too-many-branches,too-many-statements
 def run_sweep(genfunction, self, solution, skipsweepfailures,
               constants, sweep, linked, solver, verbosity, **kwargs):
     "Runs through a sweep."

diff --git a/gpkit/solvers/cvxopt.py b/gpkit/solvers/cvxopt.py
@@ -5,7 +5,7 @@
 from gpkit.exceptions import UnknownInfeasible, DualInfeasible
 
 
-# pylint: disable=too-many-locals
+# pylint: disable=too-many-locals,too-many-statements
 def optimize(*, c, A, k, meq_idxs, use_leqs=True, **kwargs):
     """Interface to the CVXOPT solver
 
@@ -47,11 +47,11 @@ def optimize(*, c, A, k, meq_idxs, use_leqs=True, **kwargs):
     for i, n_monomials in enumerate(k):
         start = sum(k[:i])
         mons = range(start, start+k[i])
-        A_m = A[mons,:].tocoo()
+        A_m = A[mons, :].tocoo()
         chash = hash((c[i], tuple(A_m.data), tuple(A_m.row), tuple(A_m.col)))
         if chash in constraint_hashes:
             continue  # already got it
-        elif i:  # skip cost posy
+        if i:  # skip cost posy
             constraint_hashes.add(chash)
         if use_leqs and start in meq_idxs.all:
             if start in meq_idxs.first_half: