fixing most E222 warning in py files

Author: fchapoton

src/sage/algebras/lie_algebras/heisenberg.py

@@ -261,7 +261,7 @@ def lie_algebra_generators(self):
         """
         if self._n == 0:
             return Family(['z'], lambda i: self.z())
-        k =  ['p%s'%i for i in range(1, self._n+1)]
+        k = ['p%s'%i for i in range(1, self._n+1)]
         k += ['q%s'%i for i in range(1, self._n+1)]
         d = {}
         for i in range(1, self._n+1):

src/sage/algebras/splitting_algebra.py

@@ -343,14 +343,14 @@ def __init__(self, monic_polynomial, names='X', iterate=True, warning=True):
         # ------------------------------------------------------------------
         if cf0_inv is not None:
             deg_cf = len(cf)-1
-            pf =  P(cf)
+            pf = P(cf)
             for root in self._splitting_roots:
                 check = self(pf)
                 if not check.is_zero():
                     continue
                 root_inv = self.one()
                 for pos in range(deg_cf-1 ):
-                    root_inv =  (-1 )**(pos+1 ) * cf[deg_cf-pos-1 ] - root_inv * root
+                    root_inv = (-1 )**(pos+1 ) * cf[deg_cf-pos-1 ] - root_inv * root
                 verbose("inverse %s of root %s" % (root_inv, root))
                 root_inv = (-1 )**(deg_cf) * cf0_inv * root_inv
                 self._invertible_elements.update({root:root_inv})

src/sage/categories/finite_dimensional_lie_algebras_with_basis.py

@@ -1208,7 +1208,7 @@ def compute_diff(k):
                     zero = [zero] * len(indices)
                 for X in combinations(Ind, k):
                     if not sparse:
-                        ret =  list(zero)
+                        ret = list(zero)
                     for i in range(k):
                         Y = list(X)
                         Y.pop(i)

src/sage/coding/punctured_code.py

@@ -652,7 +652,7 @@ def decode_to_code(self, y):
                 try:
                     shift = 0
                     for i in list_pts:
-                        yl[i + shift] =  values[shift]
+                        yl[i + shift] = values[shift]
                         shift += 1
                     y = A(yl)
                     values = next(I)

src/sage/combinat/designs/orthogonal_arrays_build_recursive.py

@@ -1404,7 +1404,7 @@ def brouwer_separable_design(k,t,q,x,check=False,verbose=False,explain_construct
     assert x>=0
     assert is_prime_power(q)
     N2 = q**4+q**2+1
-    N1 = q**2+  q +1
+    N1 = q**2+ q +1
 
     # A projective plane on (q^2-q+1)*(q^2+q+1)=q^4+q^2+1 points
     B = difference_family(N2,q**2+1,1)[1][0]

src/sage/combinat/designs/steiner_quadruple_systems.py

@@ -718,7 +718,7 @@ def steiner_quadruple_system(n, check=False):
     elif n == 38:
         sqs = IncidenceStructure(38, _SQS38(), copy=False, check=False)
     elif n%12 in [4, 8]:
-        nn =  n // 2
+        nn = n // 2
         sqs = two_n(steiner_quadruple_system(nn, check=False))
     elif n%18 in [4,10]:
         nn = (n+2) // 3

src/sage/combinat/root_system/root_lattice_realizations.py

@@ -594,7 +594,7 @@ def roots(self):
             if not self.cartan_type().is_finite():
                 from sage.sets.disjoint_union_enumerated_sets \
                                 import DisjointUnionEnumeratedSets
-                D =  DisjointUnionEnumeratedSets([self.positive_roots(),
+                D = DisjointUnionEnumeratedSets([self.positive_roots(),
                                                   self.negative_roots()])
                 D.rename("All roots of type {}".format(self.cartan_type()))
                 return D
@@ -1509,7 +1509,7 @@ def simple_reflections(self):
                 sage: s
                 simple reflections
             """
-            res =  self.alpha().zip(self.reflection, self.alphacheck())
+            res = self.alpha().zip(self.reflection, self.alphacheck())
             # Should we use rename to set a nice name for this family?
             res.rename("simple reflections")
             return res

src/sage/combinat/root_system/type_D.py

@@ -341,7 +341,7 @@ def ascii_art(self, label=lambda i: i, node=None):
         if n == 2:
             ret = "{}   {}\n".format(node(label(1)), node(label(2)))
             return ret + "{!s:4}{!s:4}".format(label(1), label(2))
-        ret =  (4*(n-3))*" "+"{} {}\n".format(node(label(n)), label(n))
+        ret = (4*(n-3))*" "+"{} {}\n".format(node(label(n)), label(n))
         ret += ((4*(n-3))*" " +"|\n")*2
         ret += "---".join(node(label(i)) for i in range(1, n)) +"\n"
         ret += "".join("{!s:4}".format(label(i)) for i in range(1,n))

src/sage/combinat/sf/llt.py

@@ -256,7 +256,7 @@ def _llt_generic(self, skp, stat):
 
         elif isinstance(skp, list) and skp[0] in sage.combinat.skew_partition.SkewPartitions():
             #skp is a list of skew partitions
-            skp2 =  [Partition(core=[], quotient=[skp[i][0] for i in range(len(skp))])]
+            skp2 = [Partition(core=[], quotient=[skp[i][0] for i in range(len(skp))])]
             skp2 += [Partition(core=[], quotient=[skp[i][1] for i in range(len(skp))])]
             mu = Partitions(ZZ((skp2[0].size()-skp2[1].size()) / self.level()))
             skp = skp2

src/sage/combinat/t_sequences.py

@@ -520,7 +520,7 @@ def T_sequences_smallcases(t, existence=False, check=True):
     if t in db:
         if existence:
             return True
-        sequences =  list(map(Sequence, db[t]))
+        sequences = list(map(Sequence, db[t]))
         if check:
             assert is_T_sequences_set(sequences)
         return sequences