Trac #34640: fix some pep8 in words/

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

Author: Release Manager

build/pkgs/configure/checksums.ini

@@ -1,4 +1,4 @@
 tarball=configure-VERSION.tar.gz
-sha1=73f9fe2ad9e2cfe224c7667a784144a1c520b9d8
-md5=8be336b502a66c5a410183be1eca2ca9
-cksum=42655200
+sha1=2f4aa4b3eaa90d73b67907839f761af1f33ef978
+md5=4d3a0c6c5cc46758789f117cc5c64a9c
+cksum=3260232553

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-51d49e23f3d3014e301fefcf72bf7a2a3fe0c4e0
+cfb40bc006de1c9273edfd4519d8d8021d9c5ff5

src/sage/combinat/words/finite_word.py

@@ -5950,7 +5950,6 @@ def sturmian_desubstitute_as_possible(self):
                     desubstitued_word = desubstitued_word + w_running ** (current_run_length - min_run)
             return desubstitued_word.sturmian_desubstitute_as_possible()
 
-
     def is_sturmian_factor(self):
         r"""
         Tell whether ``self`` is a factor of a Sturmian word.
@@ -6011,7 +6010,6 @@ def is_sturmian_factor(self):
         """
         return self.sturmian_desubstitute_as_possible().is_empty()
 
-
     def is_tangent(self):
         r"""
         Tell whether ``self`` is a tangent word.
@@ -6081,7 +6079,6 @@ def is_tangent(self):
                 mini = min(mini , height)
         return (maxi - mini <= 2)
 
-
     # TODO.
     # 1. Those three swap functions should use the cmp of python.
     # 2. The actual code should then be copied as is in the Word_over_Alphabet
@@ -7176,7 +7173,6 @@ def minimal_conjugate(self):
             if end >= p.length():
                 return factor ** q
 
-#######################################################################
 
 class CallableFromListOfWords(tuple):
     r"""
@@ -7223,6 +7219,7 @@ def __call__(self, i):
             j -= c.length()
         raise IndexError("index (=%s) out of range" % i)
 
+
 class Factorization(list):
     r"""
     A list subclass having a nicer representation for factorization of words.
@@ -7246,6 +7243,7 @@ def __repr__(self):
         """
         return '(%s)' % ', '.join(w.string_rep() for w in self)
 
+
 #######################################################################
 
 def evaluation_dict(w):
@@ -7271,13 +7269,13 @@ def evaluation_dict(w):
 
         sage: evaluation_dict('1213121') # keys appear in random order
         {'1': 4, '2': 2, '3': 1}
-
     """
     d = defaultdict(int)
     for a in w:
         d[a] += 1
     return dict(d)
 
+
 def word_to_ordered_set_partition(w):
     r"""
     Return the ordered set partition corresponding to a finite

src/sage/combinat/words/lyndon_word.py

@@ -613,6 +613,7 @@ def standard_bracketing(lw):
         if lw[i:] in LyndonWords():
             return [standard_bracketing(lw[:i]), standard_bracketing(lw[i:])]
 
+
 def standard_unbracketing(sblw):
     """
     Return flattened ``sblw`` if it is a standard bracketing of a Lyndon word,