Trac #34144: modernize super in combinat (step one)

using the short syntax `super()`

URL: https://trac.sagemath.org/34144
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=b5a2cfbb85e9d1afd3c151429525944f1e0ca84f
-md5=8cf9a8e717fe11a7c6fb7aa41975a7a1
-cksum=2226307451
+sha1=7f35111c9a2aeb985580f13c2f1f72b2219ffcb1
+md5=30cf7cce73540a45384762cea5da5f62
+cksum=2110985588

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-413ff13c54c4738b14d64eb7e7e6b2d06439d12c
+b393ee3e8e5501fd7e9101d884c743567df1816d

src/sage/combinat/abstract_tree.py

@@ -2085,15 +2085,15 @@ def __init__(self, parent, children, label=None, check=True):
         """
         # We must initialize the label before the subtrees to allows rooted
         # trees canonization. Indeed it needs that ``self``._hash_() is working
-        # at the end of the call super(..., self).__init__(...)
+        # at the end of the call super().__init__(...)
         if isinstance(children, AbstractLabelledTree):
             if label is None:
                 self._label = children._label
             else:
                 self._label = label
         else:
             self._label = label
-        super(AbstractLabelledTree, self).__init__(parent, children, check=check)
+        super().__init__(parent, children, check=check)
 
     def _repr_(self):
         """
@@ -2211,8 +2211,7 @@ def __eq__(self, other):
             sage: t1 == t2
             False
         """
-        return (super(AbstractLabelledTree, self).__eq__(other) and
-                self._label == other._label)
+        return super().__eq__(other) and self._label == other._label
 
     def _hash_(self):
         """

src/sage/combinat/baxter_permutations.py

@@ -81,7 +81,7 @@ def __init__(self, n):
         self.element_class = Permutations(n).element_class
         self._n = ZZ(n)
         from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
-        super(BaxterPermutations_size, self).__init__(category=FiniteEnumeratedSets())
+        super().__init__(category=FiniteEnumeratedSets())
 
     def _repr_(self):
         """

src/sage/combinat/blob_algebra.py

@@ -429,7 +429,7 @@ def __classcall_private__(cls, k, q1, q2, q3, base_ring=None, prefix='B'):
         q1 = base_ring(q1)
         q2 = base_ring(q2)
         q3 = base_ring(q3)
-        return super(BlobAlgebra, cls).__classcall__(cls, k, q1, q2, q3, base_ring, prefix)
+        return super().__classcall__(cls, k, q1, q2, q3, base_ring, prefix)
 
     def __init__(self, k, q1, q2, q3, base_ring, prefix):
         r"""

src/sage/combinat/chas/fsym.py

@@ -158,7 +158,7 @@ def coerce_base_ring(self, x):
             # Otherwise lift that basis up and then coerce over
             target = getattr(FSym, R._realization_name())()
             return self._coerce_map_via([target], R)
-        return super(FSymBasis_abstract, self)._coerce_map_from_(R)
+        return super()._coerce_map_from_(R)
 
     def some_elements(self):
         r"""
@@ -633,7 +633,7 @@ def R_to_G_on_basis(alpha):
                                                          if descent_composition(t) == alpha)
                         return ribbon.module_morphism(R_to_G_on_basis, codomain=self)
                     return self._coerce_map_via([ribbon], R)
-            return super(FreeSymmetricFunctions.Fundamental, self)._coerce_map_from_(R)
+            return super()._coerce_map_from_(R)
 
         def dual_basis(self):
             r"""
@@ -963,7 +963,7 @@ def s_to_F_on_basis(mu):
                             return self.sum_of_monomials(StandardTableaux(mu))
                         return s.module_morphism(s_to_F_on_basis, codomain=self)
                     return self._coerce_map_via([s], R)
-            return super(FreeSymmetricFunctions_Dual.FundamentalDual, self)._coerce_map_from_(R)
+            return super()._coerce_map_from_(R)
 
         def dual_basis(self):
             r"""

src/sage/combinat/chas/wqsym.py

@@ -233,7 +233,7 @@ def coerce_base_ring(self, x):
             # Otherwise lift that basis up and then coerce over
             target = getattr(self.realization_of(), R._basis_name)()
             return self._coerce_map_via([target], R)
-        return super(WQSymBasis_abstract, self)._coerce_map_from_(R)
+        return super()._coerce_map_from_(R)
 
     @cached_method
     def an_element(self):

src/sage/combinat/colored_permutations.py

@@ -727,13 +727,13 @@ def _coerce_map_from_(self, C):
             False
         """
         if isinstance(C, Permutations) and C.n == self._n:
-            return lambda P, x: P.element_class(P, [P._C.zero()]*P._n, x)
+            return lambda P, x: P.element_class(P, [P._C.zero()] * P._n, x)
         if self._m == 2 and isinstance(C, SignedPermutations) and C._n == self._n:
             return lambda P, x: P.element_class(P,
                                                 [P._C.zero() if v == 1 else P._C.one()
                                                  for v in x._colors],
                                                 x._perm)
-        return super(ColoredPermutations, self)._coerce_map_from_(C)
+        return super()._coerce_map_from_(C)
 
     def __iter__(self):
         """

src/sage/combinat/combinat.py

@@ -1572,7 +1572,7 @@ def __init__(self, parent, *args, **kwds):
             L, = kwds.values()
         else:
             raise TypeError("__init__() takes exactly 2 arguments ({} given)".format(1 + len(args) + len(kwds)))
-        super(CombinatorialElement, self).__init__(L)
+        super().__init__(L)
         super(CombinatorialObject, self).__init__(parent)
 
 

src/sage/combinat/composition.py

@@ -1907,7 +1907,7 @@ def __classcall_private__(cls, n):
             sage: C is C3
             True
         """
-        return super(Compositions_n, cls).__classcall__(cls, Integer(n))
+        return super().__classcall__(cls, Integer(n))
 
     def __init__(self, n):
         """