fix W391 in tests, modules, rings

Author: fchapoton

src/sage/modules/free_module.py

@@ -8243,4 +8243,3 @@ def __richcmp__(self, other, op):
             True
         """
         return self.obj._echelon_matrix_richcmp(other.obj, op)
-

src/sage/modules/module_functors.py

@@ -75,7 +75,7 @@ class QuotientModuleFunctor(ConstructionFunctor):
         sage: Q2 = A2 / B2
         sage: q3 = Q1.an_element() + Q2.an_element()
     """
-    rank = 5 # ranking of functor, not rank of module
+    rank = 5  # ranking of functor, not rank of module
 
     def __init__(self, relations):
         """
@@ -187,4 +187,3 @@ def merge(self, other):
         """
         if isinstance(other, QuotientModuleFunctor):
             return QuotientModuleFunctor(self._relations + other._relations)
-

src/sage/modules/submodule.py

@@ -243,4 +243,3 @@ def ambient_module(self):
             True
         """
         return self._ambient
-

src/sage/modules/with_basis/cell_module.py

@@ -473,4 +473,3 @@ def _acted_upon_(self, scalar, self_on_left=False):
         # For backward compatibility
         _lmul_ = _acted_upon_
         _rmul_ = _acted_upon_
-

src/sage/modules/with_basis/morphism.py

@@ -1551,6 +1551,7 @@ def pointwise_inverse_function(f):
         return f.pointwise_inverse()
     return PointwiseInverseFunction(f)
 
+
 from sage.structure.sage_object import SageObject
 class PointwiseInverseFunction(SageObject):
     r"""
@@ -1630,4 +1631,3 @@ def pointwise_inverse(self):
             True
         """
         return self._pointwise_inverse
-

src/sage/rings/ideal.py

@@ -1847,12 +1847,8 @@ def FieldIdeal(R):
         Multivariate Polynomial Ring in x1, x2, x3, x4 over Finite
         Field in alpha of size 2^4
     """
-
     q = R.base_ring().order()
-
     import sage.rings.infinity
     if q is sage.rings.infinity.infinity:
         raise TypeError("Cannot construct field ideal for R.base_ring().order()==infinity")
-
-    return R.ideal([x**q - x for x in R.gens() ])
-
+    return R.ideal([x**q - x for x in R.gens()])

src/sage/rings/polynomial/msolve.py

@@ -290,7 +290,7 @@ def to_poly(p, d=1, *, upol=PolynomialRing(base, 't')):
         variety = []
         for rt in elim_roots:
             den_of_rt = den(rt)
-            point = [-p(rt)/den_of_rt for p in param]
+            point = [-p(rt) / den_of_rt for p in param]
             if len(param) != len(vars):
                 point.append(rt)
             assert len(point) == len(vars)
@@ -313,4 +313,3 @@ def to_poly(p, d=1, *, upol=PolynomialRing(base, 't')):
                    for point in l]
 
     return [KeyConvertingDict(out_ring, zip(vars, point)) for point in variety]
-

src/sage/rings/polynomial/multi_polynomial_ideal.py

@@ -5458,4 +5458,3 @@ def __richcmp__(self, other, op):
                 return not (contained and contains)
             else:  # remaining case <
                 return contained and not contains
-

src/sage/rings/polynomial/polynomial_quotient_ring_element.py

@@ -737,4 +737,3 @@ def rational_reconstruction(self, *args, **kwargs):
         R = m.parent()
         f = R(self._polynomial)
         return f.rational_reconstruction(m, *args, **kwargs)
-

src/sage/rings/tate_algebra.py

@@ -1295,4 +1295,3 @@ def is_integral_domain(self, proof=True):
             True
         """
         return True
-