Fixing many e305

src/sage/algebras/free_algebra.py

@@ -331,6 +331,7 @@ def create_object(self, version, key):
             return FreeAlgebra_letterplace(key[1], degrees=key[0])
         return FreeAlgebra_generic(key[0], len(key[1]), key[1])
 
+
 FreeAlgebra = FreeAlgebraFactory('FreeAlgebra')
 
 

src/sage/algebras/group_algebra.py

@@ -223,5 +223,6 @@ def _coerce_map_from_(self, S):
                 return SetMorphism(S.Hom(self, category=self.category() | S.category()),
                                    lambda x: self.sum_of_terms( (hom_G(g), hom_K(c)) for g,c in x ))
 
+
 from sage.misc.persist import register_unpickle_override
 register_unpickle_override('sage.algebras.group_algebras', 'GroupAlgebra',  GroupAlgebra_class)

src/sage/categories/cartesian_product.py

@@ -271,6 +271,7 @@ def base_ring(self):
         """
         return self.base_category().base_ring()
 
+
 # Moved to avoid circular imports
 lazy_import('sage.categories.sets_cat', 'cartesian_product')
 """

src/sage/categories/category_with_axiom.py

@@ -2524,6 +2524,7 @@ def __init__(self, base_category):
 class CategoryWithAxiom_singleton(Category_singleton, CategoryWithAxiom):#, Category_singleton, FastHashable_class):
     pass
 
+
 """
 The following workaround is needed until any :class:`CategoryWithAxiom` of a
 :class:`Category_over_base_ring` becomes automatically a

src/sage/categories/examples/algebras_with_basis.py

@@ -97,4 +97,5 @@ def algebra_generators(self):
         # for the specifying the order of the elements in the family
         #return Family(self._alphabet, lambda a: self.term(self.basis().keys()(a)))
 
+
 Example = FreeAlgebra

src/sage/categories/examples/commutative_additive_semigroups.py

@@ -194,4 +194,5 @@ def __hash__(self):
             """
             return hash(tuple(self.value.items()))
 
+
 Example = FreeCommutativeAdditiveSemigroup

src/sage/categories/examples/cw_complexes.py

@@ -158,4 +158,5 @@ def dimension(self):
             """
             return self._dim
 
+
 Example = Surface

src/sage/categories/examples/filtered_algebras_with_basis.py

@@ -198,4 +198,5 @@ def product_on_basis(self, s, t):
             cur = cur * self.monomial(self._indices.gen(a))
         return cur
 
+
 Example = PBWBasisCrossProduct

src/sage/categories/examples/filtered_modules_with_basis.py

@@ -149,4 +149,5 @@ def _repr_term(self, t):
         """
         return 'P' + t._repr_()
 
+
 Example = FilteredPartitionModule

src/sage/categories/examples/finite_dimensional_algebras_with_basis.py

@@ -143,4 +143,5 @@ def _repr_term(self, p):
         """
         return str(p)
 
+
 Example = KroneckerQuiverPathAlgebra

src/sage/categories/examples/finite_dimensional_lie_algebras_with_basis.py

@@ -404,4 +404,5 @@ def monomial_coefficients(self, copy=True):
             """
             return self.value.monomial_coefficients(copy)
 
+
 Example = AbelianLieAlgebra

src/sage/categories/examples/finite_monoids.py

@@ -146,4 +146,5 @@ def an_element(self):
     class Element (ElementWrapper):
         wrapped_class = Integer
 
+
 Example = IntegerModMonoid

src/sage/categories/examples/finite_semigroups.py

@@ -187,4 +187,5 @@ class Element (ElementWrapper):
         wrapped_class = str
         __lt__ = ElementWrapper._lt_by_value
 
+
 Example = LeftRegularBand

src/sage/categories/examples/graded_connected_hopf_algebras_with_basis.py

@@ -162,4 +162,5 @@ def coproduct_on_basis(self, i):
             for j in range(i+1)
         )
 
+
 Example = GradedConnectedCombinatorialHopfAlgebraWithPrimitiveGenerator

src/sage/categories/examples/graded_modules_with_basis.py

@@ -163,4 +163,5 @@ def _repr_term(self, t):
         """
         return 'P' + t._repr_()
 
+
 Example = GradedPartitionModule

src/sage/categories/examples/graphs.py

@@ -117,4 +117,5 @@ def dimension(self):
                 return 2
             return 1
 
+
 Example = Cycle

src/sage/categories/examples/infinite_enumerated_sets.py

@@ -185,4 +185,5 @@ def _element_constructor_(self, i):
 
     Element = Integer
 
+
 Example = NonNegativeIntegers

src/sage/categories/examples/lie_algebras.py

@@ -332,4 +332,5 @@ def _bracket_(self, rhs):
             """
             return self.__class__(self.parent(), self.value * rhs.value - rhs.value * self.value)
 
+
 Example = LieAlgebraFromAssociative

src/sage/categories/examples/lie_algebras_with_basis.py

@@ -100,6 +100,7 @@ def lift(self):
             I = UEA._indices
             return UEA.sum_of_terms((I.gen(t), c) for t, c in self)
 
+
 Example = AbelianLieAlgebra
 
 ##############

src/sage/categories/examples/manifolds.py

@@ -89,4 +89,5 @@ def an_element(self):
 
     Element = ElementWrapper
 
+
 Example = Plane

src/sage/categories/examples/monoids.py

@@ -141,4 +141,5 @@ def monoid_generators(self):
     class Element (ElementWrapper):
         wrapped_class = str
 
+
 Example = FreeMonoid

src/sage/categories/realizations.py

@@ -102,6 +102,7 @@ def Realizations(self):
     else:
         return getattr(self.__class__, "Realizations")(self)
 
+
 Category.Realizations = Realizations
 
 class Category_realization_of_parent(Category_over_base, BindableClass):

src/sage/categories/sets_cat.py

@@ -3154,5 +3154,6 @@ def _repr_(self):
                 """
                 return "{} in the realization {}".format(self.realization_of(), self._realization_name())
 
+
 # Moved from sage.categories.cartesian_product to avoid circular import errors
 cartesian_product = CartesianProductFunctor()

src/sage/categories/with_realizations.py

@@ -280,6 +280,7 @@ def WithRealizations(self):
     """
     return WithRealizationsCategory.category_of(self)
 
+
 Category.WithRealizations = WithRealizations
 
 class WithRealizationsCategory(RegressiveCovariantConstructionCategory):

src/sage/coding/databases.py

@@ -309,6 +309,7 @@ def self_orthogonal_binary_codes(n, k, b=2, parent=None, BC=None, equal=False,
                         if out_test(N):
                             yield N
 
+
 # Import the following function so that it is available as
 # sage.codes.databases.self_dual_binary_codes sage.codes.databases functions
 # somewhat like a catalog in this respect.

src/sage/coding/goppa_code.py

@@ -436,4 +436,5 @@ def generator_matrix(self):
         aux = codes.from_parity_check_matrix(pmat)
         return aux.generator_matrix()
 
+
 GoppaCode._registered_encoders["GoppaEncoder"] = GoppaCodeEncoder

src/sage/coding/linear_rank_metric.py

@@ -891,7 +891,8 @@ def decoding_radius(self):
             sage: D.decoding_radius()
             1
         """
-        return (self.code().minimum_distance()-1) // 2
+        return (self.code().minimum_distance() - 1) // 2
+
 
 ####################### registration ###############################
 

src/sage/coding/parity_check_code.py

@@ -349,6 +349,7 @@ def message_space(self):
         """
         return VectorSpace(self.code().base_field(), self.code().dimension())
 
+
 ####################### registration ###############################
 
 ParityCheckCode._registered_encoders["ParityCheckCodeGeneratorMatrixEncoder"] = ParityCheckCodeGeneratorMatrixEncoder

src/sage/coding/punctured_code.py

@@ -709,6 +709,7 @@ def decoding_radius(self, number_erasures=None):
         elif "error-erasure" in D.decoder_type() and number_erasures is None:
             raise ValueError("You must provide the number of erasures")
 
+
 ####################### registration ###############################
 
 PuncturedCode._registered_encoders["PuncturedMatrix"] = PuncturedCodePuncturedMatrixEncoder

src/sage/coding/subfield_subcode.py

@@ -419,6 +419,7 @@ def decoding_radius(self, **kwargs):
         """
         return self.original_decoder().decoding_radius(**kwargs)
 
+
 ####################### registration ###############################
 
 SubfieldSubcode._registered_decoders["OriginalCode"] = SubfieldSubcodeOriginalCodeDecoder

src/sage/crypto/sboxes.py

@@ -397,6 +397,7 @@ def monomial_function(n, e):
     X = R.gen()
     return SBox(X**e)
 
+
 # Bijective S-Boxes mapping 9 bits to 9
 # =====================================
 

src/sage/databases/findstat.py

@@ -4516,6 +4516,7 @@ def name(self, style="singular"):
             return self._data["NamePlural"]
         raise ValueError("argument 'style' (=%s) must be 'singular' or 'plural'" % style)
 
+
 from collections import namedtuple
 _SupportedFindStatCollection = namedtuple("SupportedFindStatCollection",
                                           ["string_to_element",

src/sage/doctest/external.py

@@ -372,6 +372,7 @@ def external_software():
     """
     return sorted(f.name for f in external_features())
 
+
 external_software = external_software()
 
 

src/sage/functions/gamma.py

@@ -183,6 +183,7 @@ def __init__(self):
                                             'fricas':'Gamma',
                                             'giac':'Gamma'})
 
+
 gamma1 = Function_gamma()
 
 
@@ -486,7 +487,8 @@ def _evalf_(self, x, y, parent=None, algorithm='pari'):
         else:
             return C(v)
 
-# synonym.
+
+# shorter alias
 gamma_inc = Function_gamma_inc()
 
 
@@ -649,7 +651,8 @@ def _mathematica_init_evaled_(self, *args):
         x, z = args_mathematica
         return "Gamma[%s,0,%s]" % (x, z)
 
-# synonym.
+
+# shorter alias
 gamma_inc_lower = Function_gamma_inc_lower()
 
 
@@ -750,6 +753,7 @@ def _mathematica_gamma3(*args):
     assert len(args) == 3
     return gamma_inc(args[0], args[1]) - gamma_inc(args[0], args[2])
 
+
 register_symbol(_mathematica_gamma3, dict(mathematica='Gamma'), 3)
 
 
@@ -893,6 +897,7 @@ def _maxima_init_evaled_(self, *args):
         n, x = args_maxima
         return "psi[%s](%s)" % (n, x)
 
+
 psi1 = Function_psi1()
 psi2 = Function_psi2()
 
@@ -945,6 +950,7 @@ def psi(x, *args, **kwds):
         raise TypeError("Symbolic function psi takes at most 2 arguments (%s given)" % (len(args) + 1))
     return psi2(x, args[0], **kwds)
 
+
 # We have to add the wrapper function manually to the symbol_table when we have
 # two functions with different number of arguments and the same name
 symbol_table['functions']['psi'] = psi
@@ -953,6 +959,7 @@ def psi(x, *args, **kwds):
 def _swap_psi(a, b):
     return psi(b, a)
 
+
 register_symbol(_swap_psi, {'giac': 'Psi'}, 2)
 
 
@@ -1075,4 +1082,5 @@ def _method_arguments(self, x, y):
         """
         return [x, y]
 
+
 beta = Function_beta()

src/sage/functions/other.py

@@ -127,6 +127,7 @@ def __init__(self):
                                                 giac='abs',
                                                 fricas='abs'))
 
+
 abs = abs_symbolic = Function_abs()
 
 
@@ -466,6 +467,7 @@ def _eval_(self, x):
                 return Integer(math.ceil(x))
         return None
 
+
 ceil = Function_ceil()
 
 
@@ -634,6 +636,7 @@ def _eval_(self, x):
                 return Integer(math.floor(x))
         return None
 
+
 floor = Function_floor()
 
 
@@ -698,6 +701,7 @@ def _sympy_(self, arg):
         import sympy
         return sympy.O(*sympy.sympify(arg, evaluate=False))
 
+
 Order = Function_Order()
 
 
@@ -771,6 +775,7 @@ def _eval_(self, x):
                     return x - ret
         return None
 
+
 frac = Function_frac()
 
 
@@ -955,6 +960,7 @@ def _derivative_(self, base, exp, diff_param=None):
         """
         return 1/exp * self(base, exp)**(1-exp)
 
+
 real_nth_root = Function_real_nth_root()
 
 
@@ -1107,6 +1113,7 @@ def _evalf_(self, x, parent=None, algorithm=None):
 
         return parent(x).arg()
 
+
 arg=Function_arg()
 
 
@@ -1206,6 +1213,7 @@ def __call__(self, x, **kwargs):
         else:
             return GinacFunction.__call__(self, x, **kwargs)
 
+
 real = real_part = Function_real_part()
 
 
@@ -1891,6 +1899,7 @@ def _sympy_(self, term, k, a, n):
         import sympy
         return sympy.Product(term, (k, a, n))
 
+
 symbolic_product = Function_prod()
 
 
@@ -1996,6 +2005,7 @@ def _print_latex_(self, ex, var, to, direction=''):
         return r"\lim_{{{} \to {}{}}}\, {}".format(latex(var),
                 latex(to), dir_str, latex(ex))
 
+
 symbolic_limit = Function_limit()
 
 
@@ -2208,6 +2218,7 @@ def _evalf_(self, poly, index, parent=None, algorithm=None):
         sobj = CRootOf(Poly(poly._sympy_()), int(index))
         return parent(sobj.n(1 + prec_to_dps(prec))._sage_())
 
+
 complex_root_of = Function_crootof()
 
 
@@ -2282,4 +2293,5 @@ def _print_latex_(self, ex, s):
         """
         return r"{} \in {}".format(latex(ex), latex(s))
 
+
 element_of = Function_elementof()