Trac #34753: fix all W391 in pyx files

namely, no empty final lines

already done for py files, and will be added to the linter later

URL: https://trac.sagemath.org/34753
Reported by: chapoton
Ticket author(s): Frédéric Chapoton
Reviewer(s): Matthias Koeppe

src/sage/coding/ag_code_decoders.pyx

@@ -2636,4 +2636,3 @@ cdef class DifferentialAGCodeDecoder_K_extension(Decoder_K_extension):
             sage: TestSuite(circuit).run(skip='_test_pickling')               # long time
         """
         super().__init__(pls, G, Q, DifferentialAGCodeDecoder_K, verbose=verbose)
-

src/sage/coding/binary_code.pyx

@@ -4182,6 +4182,3 @@ cdef class BinaryCodeClassifier:
         sig_free(ortho_basis)
         sig_free(temp_basis)
         return output
-
-
-

src/sage/geometry/integral_points.pyx

@@ -1450,4 +1450,3 @@ cpdef print_cache(InequalityCollection inequality_collection):
     print('Cached next-to-inner loop: ' +
           str(ieq.coeff) + ' * x_0 + ' +
           str(ieq.coeff_next) + ' * x_1 + ' + str(ieq.cache_next) + ' >= 0')
-

src/sage/libs/arb/arith.pyx

@@ -57,6 +57,7 @@ def bernoulli(n):
     fmpq_clear(x)
     return q
 
+
 def hilbert_class_polynomial(D):
     """
     Return the Hilbert class polynomial for discriminant ``D`` using ``arb``.
@@ -82,4 +83,3 @@ def hilbert_class_polynomial(D):
     poly = PolynomialRing(ZZ, "x", implementation="FLINT")()
     acb_modular_hilbert_class_poly(poly.__poly, n)
     return poly
-

src/sage/libs/braiding.pyx

@@ -384,12 +384,10 @@ def sliding_circuits(braid):
         [[[0], [2, 1], [1, 2], [2]]],
         [[[0], [1, 2], [2], [2, 1]]],
         [[[0], [2, 1], [1], [1, 2]]]]
-
     """
     nstrands = braid.parent().strands()
     l = braid.Tietze()
     sig_on()
     cdef list[list[list[list[int]]]] rop = SlidingCircuits(nstrands, l)
     sig_off()
     return rop
-

src/sage/libs/eclib/homspace.pyx

@@ -283,6 +283,4 @@ cdef class ModularSymbols:
                 inc(iter)
         MS = MatrixSpace(base_ring, n, sparse=True)
         # The next step is the bottleneck.
-        ans = MS(d)
-        return ans
-
+        return MS(d)

src/sage/libs/flint/fmpz_poly.pyx

@@ -440,7 +440,6 @@ cdef class Fmpz_poly(SageObject):
         cdef long nn = n
         fmpz_poly_truncate(self.poly, nn) # mutating!
 
-
     def _sage_(self, var='x'):
         """
         Return self as an element of the sage ZZ[var].
@@ -456,4 +455,3 @@ cdef class Fmpz_poly(SageObject):
         """
         from sage.rings.integer_ring import ZZ
         return ZZ[var](self.list())
-

src/sage/libs/homfly.pyx

@@ -102,9 +102,8 @@ def homfly_polynomial_dict(link):
     cdef Poly* c_output = homfly(link)
     sig_off()
     cdef int l = c_output.len
-    d = dict()
+    d = {}
     for i in range(l):
         ter = c_output.term[i]
         d[(int(ter.l), int(ter.m))] = int(ter.coef)
     return d
-

src/sage/libs/ntl/ntl_GF2.pyx

@@ -266,6 +266,7 @@ def unpickle_class_value(cls, x):
     """
     return cls(x)
 
+
 def unpickle_class_args(cls, x):
     """
     Here for unpickling.
@@ -278,4 +279,3 @@ def unpickle_class_args(cls, x):
         <class 'sage.libs.ntl.ntl_GF2.ntl_GF2'>
     """
     return cls(*x)
-

src/sage/libs/sirocco.pyx

@@ -292,4 +292,3 @@ cpdef list[list] contpath_comps(int deg, list values, double y0r, double y0i, li
     free(c_otherdegrees)
     free(c_othercoefs)
     return l
-

src/sage/matrix/action.pyx

@@ -580,4 +580,3 @@ cdef class MatrixSchemePointAction(MatrixMulAction):
             (2 : 1)
         """
         return P._matrix_times_point_(mat, self._codomain)
-

src/sage/matrix/change_ring.pyx

@@ -38,8 +38,5 @@ def integer_to_real_double_dense(Matrix_integer_dense A):
                                          S, None, None, None)
     for i from 0 <= i < A._nrows:
         for j from 0 <= j < A._ncols:
-            M.set_unsafe_double(i,j,A.get_unsafe_double(i,j))
+            M.set_unsafe_double(i, j, A.get_unsafe_double(i, j))
     return M
-
-
-

src/sage/matrix/echelon_matrix.pyx

@@ -151,4 +151,3 @@ def reduced_echelon_matrix_iterator(K, k, n, bint sparse=False, bint copy=True,
                 yield m
             del v   # hack: Python itertools reuses the tuple if nobody else uses it
         del pivots  # hack: Python itertools reuses the tuple if nobody else uses it
-

src/sage/matrix/matrix_cyclo_dense.pyx

@@ -1961,4 +1961,3 @@ cdef class Matrix_cyclo_dense(Matrix_dense):
         if subdivide:
             M.subdivide([Anr*i for i in range(1,nr)], [Anc*i for i in range(1,nc)])
         return M
-

src/sage/matrix/matrix_rational_sparse.pyx

@@ -805,4 +805,3 @@ cdef class Matrix_rational_sparse(Matrix_sparse):
 cdef mpq_t minus_one
 mpq_init(minus_one)
 mpq_set_si(minus_one, -1,1)
-

src/sage/matrix/strassen.pyx

@@ -867,4 +867,3 @@ def test(n, m, R, c=2):
 
 ##         sage: C == D
 ##         True
-

src/sage/misc/derivative.pyx

@@ -221,4 +221,3 @@ def multi_derivative(F, args):
     for arg in derivative_parse(args):
         F = F._derivative(arg)
     return F
-

src/sage/misc/instancedoc.pyx

@@ -327,4 +327,3 @@ def instancedoc(cls):
     tp.tp_doc = NULL
     PyType_Modified(tp)
     return cls
-

src/sage/misc/lazy_attribute.pyx

@@ -506,6 +506,7 @@ class lazy_attribute(_lazy_attribute):
         if hasattr(f, "__module__"):
             self.__module__ = f.__module__
 
+
 class lazy_class_attribute(lazy_attribute):
     """
     A lazy class attribute for an class is like a usual class attribute,
@@ -601,7 +602,6 @@ class lazy_class_attribute(lazy_attribute):
         """
         result = self.f(cls)
         if result is NotImplemented:
-            return getattr(super(cls, cls),self.__name__)
+            return getattr(super(cls, cls), self.__name__)
         setattr(cls, self.__name__, result)
         return result
-

src/sage/misc/nested_class.pyx

@@ -386,4 +386,3 @@ class A1:
     class A2:
         class A3:
             pass
-

src/sage/misc/parser.pyx

@@ -1098,4 +1098,3 @@ cdef class LookupNameMaker:
             if self.fallback is not None:
                 return self.fallback(name)
             raise NameError("Unknown variable: '{}'".format(name))
-

src/sage/monoids/free_abelian_monoid_element.pyx

@@ -388,4 +388,3 @@ cdef class FreeAbelianMonoidElement(MonoidElement):
         """
         cdef Py_ssize_t i
         return [_Integer_from_mpz(self._element_vector[i]) for i in range(self._n)]
-

src/sage/numerical/backends/cvxopt_backend.pyx

@@ -1002,4 +1002,3 @@ cdef class CVXOPTBackend(GenericBackend):
             return self.param[name]
         else:
             self.param[name] = value
-

src/sage/numerical/mip.pyx

@@ -3576,7 +3576,7 @@ cdef class MIPVariable(SageObject):
         """
         Implement the action of a matrix multiplying from the left.
         """
-        result = dict()
+        result = {}
         for i, col in enumerate(m.columns()):
             x = self[i]
             x_index, = x.dict().keys()
@@ -3585,4 +3585,3 @@ cdef class MIPVariable(SageObject):
         V = FreeModule(self._p.base_ring(), m.nrows())
         T = self._p.linear_functions_parent().tensor(V)
         return T(result)
-

src/sage/rings/complex_number.pyx

@@ -9,8 +9,6 @@ TESTS::
     DeprecationWarning: the complex_number module is deprecated, please use sage.rings.complex_mpfr
     See http://trac.sagemath.org/24483 for details.
 """
-
 from sage.misc.superseded import deprecation
 from sage.rings.complex_mpfr import *
 deprecation(24483, "the complex_number module is deprecated, please use sage.rings.complex_mpfr")
-

src/sage/rings/finite_rings/residue_field.pyx

@@ -1919,5 +1919,3 @@ class ResidueFiniteField_ntl_gf2e(ResidueField_generic, FiniteField_ntl_gf2e):
             return FiniteField_ntl_gf2e._element_constructor_(self, x)
         except TypeError:
             return ResidueField_generic._element_constructor_(self, x)
-
-

src/sage/rings/function_field/element.pyx

@@ -1578,4 +1578,3 @@ cdef class FunctionFieldElement_rational(FunctionFieldElement):
         assert f.denominator() == 1
         assert self._x.denominator() == 1
         return self.parent()(self._x.numerator().inverse_mod(f.numerator()))
-

src/sage/rings/function_field/hermite_form_polynomial.pyx

@@ -184,4 +184,3 @@ def reversed_hermite_form(Matrix mat, bint transformation=False):
 
     if transformation:
         return U
-

src/sage/rings/noncommutative_ideals.pyx

@@ -418,4 +418,3 @@ class Ideal_nc(Ideal_generic):
                 return other.ring().ideal(other.gens(), side='twosided')
 
         raise NotImplementedError("cannot multiply non-commutative ideals")
-

src/sage/rings/number_field/number_field_element_quadratic.pyx

@@ -3074,4 +3074,3 @@ cpdef bint is_sqrt_disc(Rational ad, Rational bd):
     mpz_clear(denom)
 
     return ret
-

src/sage/rings/number_field/number_field_morphisms.pyx

@@ -775,4 +775,3 @@ cdef class CyclotomicFieldConversion(Map):
             return self.phi.preimage(M(x))
         except ValueError:
             raise ValueError('Element {} has no image in the codomain'.format(x))
-

src/sage/rings/padics/padic_ZZ_pX_CA_element.pyx

@@ -2351,4 +2351,3 @@ def make_ZZpXCAElement(parent, value, absprec, version):
         return ans
     else:
         raise ValueError("unknown unpickling version")
-

src/sage/rings/padics/padic_ZZ_pX_CR_element.pyx

@@ -3284,4 +3284,3 @@ def make_ZZpXCRElement(parent, unit, ordp, relprec, version):
         return ans
     else:
         raise ValueError("unknown unpickling version")
-

src/sage/rings/padics/padic_ZZ_pX_FM_element.pyx

@@ -1721,6 +1721,7 @@ cdef class pAdicZZpXFMElement(pAdicZZpXElement):
         """
         return self.ext_p_list_precs(pos, self.prime_pow.ram_prec_cap)
 
+
 def make_ZZpXFMElement(parent, f):
     """
     Create a new ``pAdicZZpXFMElement`` out of an ``ntl_ZZ_pX`` ``f``, with
@@ -1737,4 +1738,3 @@ def make_ZZpXFMElement(parent, f):
         True
     """
     return pAdicZZpXFMElement(parent, f)
-

src/sage/rings/padics/padic_ZZ_pX_element.pyx

@@ -914,4 +914,3 @@ cdef get_val_prec(PowComputer_ext pp, a):
             print(py_tmp)
             raise TypeError("modulus must be a positive power of the appropriate prime")
     raise TypeError("unsupported type for list element: %s" % type(a))
-

src/sage/rings/padics/padic_capped_relative_element.pyx

@@ -610,4 +610,3 @@ def base_p_list(Integer n, bint pos, PowComputer_class prime_pow):
     cdef ExpansionIter expansion = ExpansionIter(dummy, n.exact_log(p) + 2, mode)
     mpz_set(expansion.curvalue, n.value)
     return trim_zeros(list(expansion))
-

src/sage/rings/padics/padic_ext_element.pyx

@@ -509,4 +509,3 @@ cdef class pAdicExtElement(pAdicGenericElement):
             return R.residue_field()(self.expansion(0))
         else:
             raise NotImplementedError("residue() not implemented in extensions for absprec larger than one")
-

src/sage/rings/padics/padic_fixed_mod_element.pyx

@@ -567,7 +567,6 @@ cdef class pAdicFixedModElement(FMElement):
         return ans
 
 
-
 def make_pAdicFixedModElement(parent, value):
     """
     Unpickles a fixed modulus element.
@@ -580,4 +579,3 @@ def make_pAdicFixedModElement(parent, value):
         2*5^2 + 3*5^3
     """
     return unpickle_fme_v2(pAdicFixedModElement, parent, value)
-

src/sage/rings/padics/padic_floating_point_element.pyx

@@ -442,4 +442,3 @@ cdef class pAdicFloatingPointElement(FPElement):
         sig_off()
 
         return ans
-

src/sage/rings/padics/padic_relaxed_errors.pyx

@@ -69,4 +69,3 @@ def raise_error(error, permissive=False):
             raise PrecisionError("not enough precision")
         if error & ERROR_ABANDON:
             raise PrecisionError("computation has been abandoned; try to increase precision")
-

src/sage/rings/polynomial/hilbert.pyx

@@ -601,4 +601,3 @@ def hilbert_poincare_series(I, grading=None):
         if HP.leading_coefficient() >= 0:
             return HP / PR.prod([(1-t**d) for d in grading])
         return (-HP) / (-PR.prod([(1-t**d) for d in grading]))
-

src/sage/rings/polynomial/laurent_polynomial.pyx

@@ -3763,4 +3763,3 @@ cdef class LaurentPolynomial_mpair(LaurentPolynomial):
         if new_ring is not None:
             return new_ring(ans)
         return ans
-

src/sage/rings/polynomial/polynomial_compiled.pyx

@@ -509,4 +509,3 @@ cdef class abc_pd(binary_pd):
         self.value = self.left.value * self.right.value + coeffs[self.index]
         pd_clean(self.left)
         pd_clean(self.right)
-

src/sage/rings/polynomial/polynomial_real_mpfr_dense.pyx

@@ -778,4 +778,3 @@ def make_PolynomialRealDense(parent, data):
         3.00000000000000*x^2 + 2.00000000000000*x + 1.00000000000000
     """
     return PolynomialRealDense(parent, data)
-

src/sage/rings/polynomial/polynomial_zz_pex.pyx

@@ -443,4 +443,3 @@ cdef class Polynomial_ZZ_pEX(Polynomial_template):
             x^4 + x^3 + x
         """
         return self.shift(-n)
-

src/sage/rings/polynomial/skew_polynomial_element.pyx

@@ -690,4 +690,3 @@ cdef class SkewPolynomial_generic_dense(OrePolynomial_generic_dense):
             q.append(c)
         q.reverse()
         return (self._new_c(q, parent), self._new_c(a[:db], parent, 1))
-

src/sage/rings/polynomial/skew_polynomial_finite_order.pyx

@@ -572,8 +572,6 @@ cdef class SkewPolynomial_finite_order_dense(SkewPolynomial_generic_dense):
                 self._optbound = [section(x) for x in bound.list()]
         return center(self._optbound)
 
-
      # TODO:
      # fast multiplication
      # reduced characteristic polynomial
-

src/sage/rings/polynomial/weil/weil_polynomials.pyx

@@ -585,4 +585,3 @@ class WeilPolynomials():
             158
         """
         return self.w.node_count()
-

src/sage/rings/power_series_pari.pyx

@@ -953,4 +953,3 @@ cdef class PowerSeries_pari(PowerSeries):
                 precision = self._prec
             f = self
         return PowerSeries_pari(self._parent, f.g.serreverse(), precision)
-

src/sage/rings/power_series_poly.pyx

@@ -1293,4 +1293,3 @@ cdef class BaseRingFloorDivAction(Action):
         P = self.US()
         g = P.base_ring()(g)
         return type(x)(P, elt.__f // g, prec=prec, check=False)
-

src/sage/rings/puiseux_series_ring_element.pyx

@@ -1052,4 +1052,3 @@ cdef class PuiseuxSeries(AlgebraElement):
             25*x^(23/2) + O(x^(27/2))
         """
         return self.__invert__()
-

src/sage/rings/real_lazy.pyx

@@ -1748,4 +1748,3 @@ cdef class LazyWrapperMorphism(Morphism):
         else:
             e._value = x
         return e
-

src/sage/rings/semirings/tropical_semiring.pyx

@@ -671,4 +671,3 @@ cdef class TropicalToTropical(Map):
             +infinity
         """
         return self.codomain()((<TropicalSemiringElement>x)._val)
-

src/sage/sat/solvers/satsolver.pyx

@@ -395,4 +395,3 @@ def SAT(solver=None, *args, **kwds):
         return GlucoseSyrup(*args, **kwds)
     else:
         raise ValueError("Solver '{}' is not available".format(solver))
-

src/sage/stats/hmm/chmm.pyx

@@ -1559,4 +1559,3 @@ def unpickle_gaussian_mixture_hmm_v1(A, B, pi, mixture):
     m.pi = pi
     m.mixture = mixture
     return m
-