some fixes for E114

Author: fchapoton

src/sage/dynamics/arithmetic_dynamics/wehlerK3.py

@@ -2066,8 +2066,8 @@ def fiber(self, p, component):
         Points = []
 
         if (self.Gpoly(component,0)(P0) != 0):
-             #We are using the quadratic formula, we need this check to ensure that the points
-             #will be rational
+            # We are using the quadratic formula, we need this check
+            # to ensure that the points will be rational
             T0 = (self.Hpoly(component, 0, 1)(P0)**2 - 4*self.Gpoly(component, 0)(P0)*self.Gpoly(component, 1)(P0))
             T1 = (self.Hpoly(component, 0, 2)(P0)**2 - 4*self.Gpoly(component, 0)(P0)*self.Gpoly(component, 2)(P0))
             if (T0.is_square() and T1.is_square()):

src/sage/game_theory/matching_game.py

@@ -493,7 +493,7 @@ def __eq__(self, other):
                         zip(set(self._suitors), set(other._suitors))))
 
     __hash__ = None
-   # not hashable because this is mutable.
+    # not hashable because this is mutable.
 
     def plot(self):
         r"""

src/sage/groups/free_group.py

@@ -457,8 +457,9 @@ def fox_derivative(self, gen, im_gens=None, ring=None):
                 R = ring
             symb = list(im_gens)
             symb += reversed([a**(-1) for a in im_gens])
-        i = gen.Tietze()[0]  # So ``gen`` is the `i`-th
-                             # generator of the free group.
+        i = gen.Tietze()[0]
+        # so gen is the i-th generator of the free group
+
         a = R.zero()
         coef = R.one()
         while l:
@@ -506,7 +507,7 @@ def syllables(self):
         for i in range(k):
             exponent = exponent_syllable(g, i+1).sage()
             generator = gen(generator_syllable(g, i+1).sage() - 1)
-            result.append( (generator, exponent) )
+            result.append((generator, exponent))
         return tuple(result)
 
     def __call__(self, *values):
@@ -936,6 +937,7 @@ def quotient(self, relations, **kwds):
             Finitely presented group < a, b, c, d | a*b*a^-1 >
         """
         from sage.groups.finitely_presented import FinitelyPresentedGroup
-        return FinitelyPresentedGroup(self, tuple(map(self, relations) ), **kwds)
+        return FinitelyPresentedGroup(self,
+                                      tuple(map(self, relations)), **kwds)
 
     __truediv__ = quotient

src/sage/interfaces/maxima.py

@@ -504,9 +504,9 @@
 from .expect import (Expect, ExpectElement, gc_disabled)
 
 from .maxima_abstract import (MaximaAbstract, MaximaAbstractFunction,
-                             MaximaAbstractElement,
-                             MaximaAbstractFunctionElement,
-                             MaximaAbstractElementFunction)
+                              MaximaAbstractElement,
+                              MaximaAbstractFunctionElement,
+                              MaximaAbstractElementFunction)
 from sage.misc.instancedoc import instancedoc
 
 
@@ -586,10 +586,13 @@ def __init__(self, script_subdirectory=None, logfile=None, server=None,
         self._ask = [b'zero or nonzero\\?', b'an integer\\?',
                      b'positive, negative or zero\\?', b'positive or negative\\?',
                      b'positive or zero\\?', b'equal to .*\\?']
+
         self._prompt_wait = ([self._prompt] +
                              [re.compile(x) for x in self._ask] +
-                             [b'Break [0-9]+'])  # note that you might need to change _expect_expr if you
-                                                 # change this
+                             [b'Break [0-9]+'])
+        # note that you might need to change _expect_expr if you
+        # change this _prompt_wait
+
         self._error_re = re.compile('(Principal Value|debugmode|incorrect syntax|Maxima encountered a Lisp error)')
         self._display2d = False
 
@@ -811,7 +814,7 @@ def _eval_line(self, line, allow_use_file=False,
 
         self._expect_expr()
         assert len(self._before()) == 0, \
-                'Maxima expect interface is confused!'
+            'Maxima expect interface is confused!'
         r = self._output_prompt_re
         m = r.search(out)
         if m is not None:
@@ -984,7 +987,7 @@ def lisp(self, cmd):
             (
         """
         self._eval_line(':lisp %s\n""' % cmd, allow_use_file=False,
-               wait_for_prompt=False, reformat=False, error_check=False)
+                        wait_for_prompt=False, reformat=False, error_check=False)
         self._expect_expr('(%i)')
         return self._before()
 

src/sage/modular/pollack_stevens/fund_domain.py

@@ -1151,7 +1151,7 @@ def form_list_of_cusps(self):
 
         full_domain = False     # Says that we are not done yet!
 
-        v = [False for r in range(sP)]
+        v = [False for _ in range(sP)]
         # This initializes a list indexed by P^1(Z/NZ) which keeps track of
         # which right coset representatives we've found for Gamma_0(N)/SL_2(Z)
         # thru the construction of a fundamental domain
@@ -1171,8 +1171,8 @@ def form_list_of_cusps(self):
             # This loop runs through the current set of cusps
             # and checks to see if more cusps should be added
             # -----------------------------------------------
-            for s in range(1, len(C), 2):  # range over odd indices in the
-                                           # final list C
+            for s in range(1, len(C), 2):
+                # range over odd indices in the final list C
                 if C[s] == "?":
 
                     # Single out our two cusps (path from cusp2 to cusp1)
@@ -1188,9 +1188,9 @@ def form_list_of_cusps(self):
                     # This is the point where it is determined whether
                     # or not the adjacent triangle should be added
                     # ------------------------------------------------
-                    pos = P.index(b2, b1)   # The Sage index of the bottom
-                                                 # row of our unimodular
-                                           # transformation gam
+                    pos = P.index(b2, b1)
+                    # The Sage index of the bottom row of our
+                    # unimodular transformation gam
 
                     # Check if we need to flip (since this P1 element has not
                     # yet been accounted for!)
@@ -1214,16 +1214,18 @@ def form_list_of_cusps(self):
                             # where gam is the matrix corresponding to the
                             # unimodular path connecting cusp1 to cusp2
 
-                            C[s] = "i"  # The '?' is changed to an 'i'
-                             # indicating that a new cusp needs to
-                                        #  be inserted here
+                            C[s] = "i"
+                            # The '?' is changed to an 'i' indicating
+                            # that a new cusp needs to be inserted here
                             full_domain = False
                         else:
-                            C[s] = "x"  # The '?' is changed to an 'x' and no
-                                        # more checking below is needed! =)
+                            C[s] = "x"
+                            # The '?' is changed to an 'x' and no
+                            # more checking below is needed! =)
                     else:
-                        C[s] = "x"  # The '?' is changed to an 'x' and no more
-                                           # checking below is needed! =)
+                        C[s] = "x"
+                        # The '?' is changed to an 'x' and no more
+                        # checking below is needed! =)
 
             # Now insert the missing cusps (where there is an 'i' in
             # the final list)