more fixes in permutation.py

Author: fchapoton

src/sage/combinat/permutation.py

@@ -223,15 +223,15 @@
 ===================
 """
 
-#*****************************************************************************
+# ****************************************************************************
 #       Copyright (C) 2007 Mike Hansen <[email protected]>
 #
 # This program is free software: you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
 # the Free Software Foundation, either version 2 of the License, or
 # (at your option) any later version.
 #                  https://www.gnu.org/licenses/
-#*****************************************************************************
+# ****************************************************************************
 
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
@@ -701,7 +701,7 @@ def size(self):
 
     def cycle_string(self, singletons=False):
         """
-        Returns a string of the permutation in cycle notation.
+        Return a string of the permutation in cycle notation.
 
         If ``singletons=True``, it includes 1-cycles in the string.
 
@@ -968,7 +968,7 @@ def to_cycles(self, singletons=True, use_min=True):
 
     def _to_cycles_orig(self, singletons=True):
         r"""
-        Returns the permutation ``self`` as a list of disjoint cycles.
+        Return the permutation ``self`` as a list of disjoint cycles.
 
         EXAMPLES::
 
@@ -1115,7 +1115,7 @@ def _to_cycles_list(self, singletons=True):
 
     def to_permutation_group_element(self):
         """
-        Returns a PermutationGroupElement equal to self.
+        Return a PermutationGroupElement equal to self.
 
         EXAMPLES::
 
@@ -1391,7 +1391,7 @@ def rank(self):
         n = len(self)
         factoradic = self.to_lehmer_code()
         return sum(factoradic[n - 1 - i] * factorial(i)
-                   for i in reversed(range(n))
+                   for i in reversed(range(n)))
 
     ##############
     # Inversions #
@@ -1863,10 +1863,10 @@ def _icondition(self, i):
 
         .. NOTE::
 
-           An imove (that is, an iswitch or an ishift) can only be applied
-           when the relative positions of `i-1,i,i+1` are one of '213',
-           '132', '231', or '312'. ``None`` is returned in the other cases
-           to signal that an imove cannot be applied.
+            An imove (that is, an iswitch or an ishift) can only be applied
+            when the relative positions of `i-1,i,i+1` are one of '213',
+            '132', '231', or '312'. ``None`` is returned in the other cases
+            to signal that an imove cannot be applied.
 
         EXAMPLES::
 
@@ -2155,9 +2155,9 @@ def longest_increasing_subsequences(self):
         r"""
         Return the list of the longest increasing subsequences of ``self``.
 
-        .. note::
+        .. NOTE::
 
-           The algorithm is not optimal.
+            The algorithm is not optimal.
 
         EXAMPLES::
 
@@ -3646,7 +3646,7 @@ def bruhat_smaller(self):
 
     def bruhat_greater(self):
         r"""
-        Returns the combinatorial class of permutations greater than or
+        Return the combinatorial class of permutations greater than or
         equal to ``self`` in the Bruhat order (on the symmetric group
         containing ``self``).
 
@@ -4307,7 +4307,7 @@ def simion_schmidt(self, avoid=[1,2,3]):
     @combinatorial_map(order=2,name='reverse')
     def reverse(self):
         """
-        Returns the permutation obtained by reversing the list.
+        Return the permutation obtained by reversing the list.
 
         EXAMPLES::
 
@@ -4373,7 +4373,7 @@ def permutation_poset(self):
 
     def dict(self):
         """
-        Returns a dictionary corresponding to the permutation.
+        Return a dictionary corresponding to the permutation.
 
         EXAMPLES::