fix some pep in words

Author: fchapoton

src/sage/combinat/words/finite_word.py

@@ -5949,7 +5949,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.
@@ -6010,7 +6009,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.
@@ -6080,7 +6078,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
@@ -7175,7 +7172,6 @@ def minimal_conjugate(self):
             if end >= p.length():
                 return factor ** q
 
-#######################################################################
 
 class CallableFromListOfWords(tuple):
     r"""
@@ -7222,6 +7218,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.
@@ -7245,6 +7242,7 @@ def __repr__(self):
         """
         return '(%s)' % ', '.join(w.string_rep() for w in self)
 
+
 #######################################################################
 
 def evaluation_dict(w):
@@ -7270,13 +7268,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,