Trac #34671: fix the linter again

as some recent tickets have added final empty lines in some files

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

Author: Release Manager

src/sage/combinat/species/all.py

@@ -48,4 +48,3 @@
 lazy_import("sage.combinat.species.recursive_species", "CombinatorialSpecies")
 lazy_import("sage.combinat.species", "library", as_="species")
 del lazy_import
-

src/sage/combinat/species/library.py

@@ -1,7 +1,7 @@
 """
 Examples of Combinatorial Species
 """
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2008 Mike Hansen <[email protected]>,
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
@@ -13,8 +13,8 @@
 #
 #  The full text of the GPL is available at:
 #
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 
 from .set_species import SetSpecies
 from .partition_species import PartitionSpecies
@@ -32,6 +32,7 @@
 
 from sage.misc.cachefunc import cached_function
 
+
 @cached_function
 def SimpleGraphSpecies():
     """
@@ -66,7 +67,7 @@ def SimpleGraphSpecies():
     E = SetSpecies()
     E2 = SetSpecies(size=2)
     WP = SubsetSpecies()
-    P2 = E2*E
+    P2 = E2 * E
     return WP.functorial_composition(P2)
 
 
@@ -104,9 +105,10 @@ def BinaryTreeSpecies():
     """
     B = CombinatorialSpecies(min=1)
     X = SingletonSpecies()
-    B.define(X + B*B)
+    B.define(X + B * B)
     return B
 
+
 @cached_function
 def BinaryForestSpecies():
     """
@@ -141,5 +143,5 @@ def BinaryForestSpecies():
     F = S(B)
     return F
 
-del cached_function  # so it doesn't get picked up by tab completion
 
+del cached_function  # so it doesn't get picked up by tab completion

src/sage/schemes/elliptic_curves/hom.py

@@ -353,9 +353,9 @@ def scaling_factor(self):
             ...
             NotImplementedError: ...
         """
-        #TODO: could have a default implementation that simply
-        #      returns .formal()[1], but it seems safer to fail
-        #      visibly to make sure we would notice regressions
+        # TODO: could have a default implementation that simply
+        #       returns .formal()[1], but it seems safer to fail
+        #       visibly to make sure we would notice regressions
         raise NotImplementedError('children must implement')
 
     def formal(self, prec=20):
@@ -576,7 +576,7 @@ def is_injective(self):
             True
         """
         if not self.is_separable():
-            #TODO: should implement .separable_degree() or similar
+            # TODO: should implement .separable_degree() or similar
             raise NotImplementedError
         return self.degree() == 1
 
@@ -746,4 +746,3 @@ def compare_via_evaluation(left, right):
             assert False, "couldn't find a point of infinite order"
     else:
         raise NotImplementedError('not implemented for this base field')
-

src/sage/schemes/elliptic_curves/hom_composite.py

@@ -91,6 +91,7 @@
 
 # TODO: Implement sparse strategies? (cf. the SIKE cryptosystem)
 
+
 def _eval_factored_isogeny(phis, P):
     """
     This method pushes a point `P` through a given sequence ``phis``
@@ -115,6 +116,7 @@ def _eval_factored_isogeny(phis, P):
         P = phi(P)
     return P
 
+
 def _compute_factored_isogeny_prime_power(P, l, e):
     """
     This method takes a point `P` of order `l^e` and returns
@@ -143,6 +145,7 @@ def _compute_factored_isogeny_prime_power(P, l, e):
         phis.append(phi)
     return phis
 
+
 def _compute_factored_isogeny_single_generator(P):
     """
     This method takes a point `P` and returns a sequence of
@@ -169,6 +172,7 @@ def _compute_factored_isogeny_single_generator(P):
         phis += psis
     return phis
 
+
 def _compute_factored_isogeny(kernel):
     """
     This method takes a set of points on an elliptic curve
@@ -195,6 +199,7 @@ def _compute_factored_isogeny(kernel):
         phis += psis
     return phis
 
+
 class EllipticCurveHom_composite(EllipticCurveHom):
 
     _degree = None
@@ -512,14 +517,14 @@ def _composition_impl(left, right):
               To:   Elliptic Curve defined by y^2 + (I+1)*x*y = x^3 + I*x^2 + (-4)*x + (-6*I) over Number Field in I with defining polynomial x^2 + 1 with I = 1*I
         """
         if isinstance(left, EllipticCurveHom_composite):
-            if isinstance(right, WeierstrassIsomorphism) and hasattr(left.factors()[0], '_set_pre_isomorphism'):    #XXX bit of a hack
+            if isinstance(right, WeierstrassIsomorphism) and hasattr(left.factors()[0], '_set_pre_isomorphism'):    # XXX bit of a hack
                 return EllipticCurveHom_composite.from_factors((left.factors()[0] * right,) + left.factors()[1:], strict=False)
             if isinstance(right, EllipticCurveHom_composite):
                 return EllipticCurveHom_composite.from_factors(right.factors() + left.factors())
             if isinstance(right, EllipticCurveHom):
                 return EllipticCurveHom_composite.from_factors((right,) + left.factors())
         if isinstance(right, EllipticCurveHom_composite):
-            if isinstance(left, WeierstrassIsomorphism) and hasattr(right.factors()[-1], '_set_post_isomorphism'):  #XXX bit of a hack
+            if isinstance(left, WeierstrassIsomorphism) and hasattr(right.factors()[-1], '_set_post_isomorphism'):  # XXX bit of a hack
                 return EllipticCurveHom_composite.from_factors(right.factors()[:-1] + (left * right.factors()[-1],), strict=False)
             if isinstance(left, EllipticCurveHom):
                 return EllipticCurveHom_composite.from_factors(right.factors() + (left,))
@@ -787,4 +792,3 @@ def make_default():
         """
         from sage.misc.superseded import deprecation
         deprecation(34410, 'calling EllipticCurveHom_composite.make_default() is no longer necessary')
-