Trac #34919: fix E266 in modular

about
{{{
E266 too many leading '#' for block comment
}}}

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

Author: Release Manager

src/sage/modular/arithgroup/arithgroup_perm.py

@@ -147,9 +147,9 @@ def sl2z_word_problem(A):
         True
     """
     A = SL2Z(A)
-    output=[]
+    output = []
 
-    ## If A00 is zero
+    # If A00 is zero
     if A[0,0]==0:
         c=A[1,1]
         if c != 1:
@@ -167,20 +167,20 @@ def sl2z_word_problem(A):
         n=(-A[0,1]/A[0,0]).ceil()  #n s.t. 0 <= A[0,1]+n*A[0,0] < A[0,0]
         A=A*Lm**n
         output.append((0, -n))
-   ## At this point A00>0 and A01>=0
+    # At this point A00>0 and A01>=0
     while not (A[0,0]==0 or A[0,1]==0):
         if A[0,0]>A[0,1]:
             n=(A[0,0]/A[0,1]).floor()
             A=A*SL2Z([1,0,-n,1])
             output.append((1, n))
 
-        else:      #A[0,0]<=A[0,1]
+        else:      # A[0,0]<=A[0,1]
             n=(A[0,1]/A[0,0]).floor()
             A=A*SL2Z([1,-n,0,1])
             output.append((0, n))
 
     if A==SL2Z(1):
-        pass       #done, so don't add R^0
+        pass       # done, so don't add R^0
     elif A[0,0]==0:
         c=A[1,1]
         if c != 1:

src/sage/modular/buzzard.py

@@ -23,6 +23,7 @@
 
 _gp = None
 
+
 def gp():
     r"""
     Return a copy of the GP interpreter with the appropriate files loaded.
@@ -41,32 +42,32 @@ def gp():
         _gp.read("Tpprog.g")
     return _gp
 
-## def buzzard_dimension_cusp_forms(eps, k):
-##     r"""
-##     eps is [N, i x 3 matrix], where eps[2][,1] is the primes dividing
-##     N, eps[2][,2] is the powers of these primes that divide N, and eps[2][,3]
-##     is the following: for p odd, p^n||N, it's t such that znprimroot(p^n)
-##     gets sent to exp(2*pi*i/phi(p^n))^t. And for p=2, it's
-##     0 for 2^1, it's 0 (trivial) or -1 (non-trivial) for 2^2, and for p^n>=8
-##     it's either t>=0 for the even char sending 5 to exp(2*pi*i/p^(n-2))^t,
-##     or t<=-1 for the odd char sending 5 to exp(2*pi*i/p^(n-2))^(-1-t).
-##     (so either 0<=t<2^(n-2) or -1>=t>-1-2^(n-2) )
-
-##     EXAMPLES::
-
-##         sage: buzzard_dimension_cusp_forms('TrivialCharacter(100)', 4)
-
-##     Next we compute a dimension for the character of level 45 which is
-##     the product of the character of level 9 sending znprimroot(9)=2 to
-##     $e^{2 \pi i/6}^1$ and the character of level 5 sending
-##     \code{znprimroot(5)=2} to $e^{2 \pi i/4}^2=-1$.
-
-##         sage: buzzard_dimension_cusp_forms('DirichletCharacter(45,[1,2])', 4)
-##         <boom!>  which is why this is commented out!
-##     """
-##     s = gp().eval('DimensionCuspForms(%s, %s)'%(eps,k))
-##     print(s)
-##     return Integer(s)
+# def buzzard_dimension_cusp_forms(eps, k):
+#     r"""
+#     eps is [N, i x 3 matrix], where eps[2][,1] is the primes dividing
+#     N, eps[2][,2] is the powers of these primes that divide N, and eps[2][,3]
+#     is the following: for p odd, p^n||N, it's t such that znprimroot(p^n)
+#     gets sent to exp(2*pi*i/phi(p^n))^t. And for p=2, it's
+#     0 for 2^1, it's 0 (trivial) or -1 (non-trivial) for 2^2, and for p^n>=8
+#     it's either t>=0 for the even char sending 5 to exp(2*pi*i/p^(n-2))^t,
+#     or t<=-1 for the odd char sending 5 to exp(2*pi*i/p^(n-2))^(-1-t).
+#     (so either 0<=t<2^(n-2) or -1>=t>-1-2^(n-2) )
+
+#     EXAMPLES::
+
+#         sage: buzzard_dimension_cusp_forms('TrivialCharacter(100)', 4)
+
+#     Next we compute a dimension for the character of level 45 which is
+#     the product of the character of level 9 sending znprimroot(9)=2 to
+#     $e^{2 \pi i/6}^1$ and the character of level 5 sending
+#     \code{znprimroot(5)=2} to $e^{2 \pi i/4}^2=-1$.
+
+#         sage: buzzard_dimension_cusp_forms('DirichletCharacter(45,[1,2])', 4)
+#         <boom!>  which is why this is commented out!
+#     """
+#     s = gp().eval('DimensionCuspForms(%s, %s)'%(eps,k))
+#     print(s)
+#     return Integer(s)
 
 
 def buzzard_tpslopes(p, N, kmax):

src/sage/modular/hypergeometric_motive.py

@@ -1094,7 +1094,7 @@ def primitive_data(self):
         d = gcd(g)
         return HypergeometricData(gamma_list=[x / d for x in g])
 
-### L-functions
+    # ----- L-functions -----
 
     def gauss_table(self, p, f, prec):
         """

src/sage/modular/modform/eis_series.py

@@ -125,8 +125,8 @@ def eisenstein_series_qexp(k, prec=10, K=QQ, var='q', normalization='linear'):
     - David Loeffler (2012-03-15): add options for alternative normalizations
       (motivated by :trac:`12043`)
     """
-    ## we use this to prevent computation if it would fail anyway.
-    if k <= 0 or k % 2 == 1 :
+    # we use this to prevent computation if it would fail anyway.
+    if k <= 0 or k % 2 == 1:
         raise ValueError("k must be positive and even")
 
     a0 = - bernoulli(k) / (2*k)

src/sage/modular/modform/space.py

@@ -1802,13 +1802,13 @@ def embedded_submodule(self):
 #            raise ArithmeticError, "Intersection of %s and %s not defined."%\
 #                                   (self, right)
 #        V = self.embedded_submodule().intersection(right.embedded_submodule())
-##        return ModularForms(self.ambient_module(),V)
+#        return ModularForms(self.ambient_module(),V)
 #        return self.span([ self(b) for b in V.basis() ])
 
-##    def _key(self):
-##        if self.is_ambient():
-##            return self.__key
-##        return self.__ambient
+#    def _key(self):
+#        if self.is_ambient():
+#            return self.__key
+#        return self.__ambient
 
     def level(self):
         """

src/sage/modular/modform_hecketriangle/abstract_space.py

@@ -693,9 +693,9 @@ def weight_parameters(self):
             if (n == infinity):
                 # TODO: Figure out what to do in this case
                 # (l1 and l2 are no longer defined in an analog/unique way)
-                #l2 = num % ZZ(2)
-                #l1 = ((num-l2)/ZZ(2)).numerator()
-                ## TODO: The correct generalization seems (l1,l2) = (0,num)
+                # l2 = num % ZZ(2)
+                # l1 = ((num-l2)/ZZ(2)).numerator()
+                # TODO: The correct generalization seems (l1,l2) = (0,num)
                 l2 = ZZ(0)
                 l1 = num
             else:

src/sage/modular/pollack_stevens/distributions.py

@@ -567,7 +567,7 @@ def random_element(self, M=None, **args):
             M = self.precision_cap()
         R = self.base_ring()
         return self((R ** M).random_element(**args))
-##        return self(self.approx_module(M).random_element())
+    #        return self(self.approx_module(M).random_element())
 
     def clear_cache(self):
         """