git grep -l 'GCD as gcd' src/sage/{algebras,combinat,matroids} | xargs sed -i.bak 's/GCD as gcd/gcd/'

Author: Matthias Koeppe

src/sage/algebras/quatalg/quaternion_algebra.py

@@ -38,7 +38,7 @@
 from sage.arith.misc import (hilbert_conductor_inverse,
                              hilbert_conductor,
                              factor,
-                             GCD as gcd,
+                             gcd,
                              kronecker as kronecker_symbol,
                              valuation)
 from sage.rings.real_mpfr import RR

src/sage/combinat/ncsf_qsym/qsym.py

@@ -3688,7 +3688,7 @@ def _precompute_M(self, n):
             M = self.realization_of().M()
             if l <= n:
                 from sage.misc.cachefunc import cached_function
-                from sage.arith.misc import GCD as gcd
+                from sage.arith.misc import gcd
 
                 @cached_function
                 def monolambda(I):

src/sage/combinat/necklace.py

@@ -22,7 +22,7 @@
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.arith.misc import divisors, euler_phi, factorial, GCD as gcd
+from sage.arith.misc import divisors, euler_phi, factorial, gcd
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.combinat.composition import Composition
 from sage.combinat.misc import DoublyLinkedList

src/sage/combinat/partition.py

@@ -283,7 +283,7 @@
 from copy import copy
 from itertools import accumulate
 
-from sage.arith.misc import binomial, factorial, GCD as gcd, multinomial
+from sage.arith.misc import binomial, factorial, gcd, multinomial
 from sage.libs.pari.all import pari
 from sage.libs.flint.arith import number_of_partitions as flint_number_of_partitions
 from sage.structure.global_options import GlobalOptions

src/sage/combinat/sf/jack.py

@@ -33,7 +33,7 @@
 import sage.categories.all
 from sage.rings.integer import Integer
 from sage.rings.rational_field import QQ
-from sage.arith.misc import GCD as gcd
+from sage.arith.misc import gcd
 from sage.arith.functions import lcm
 from sage.rings.fraction_field import is_FractionField
 from sage.misc.misc_c import prod

src/sage/combinat/sf/sfa.py

@@ -4711,7 +4711,7 @@ def arithmetic_product(self, x):
         parent = self.parent()
         if parent.has_coerce_map_from(QQ):
             from sage.combinat.partition import Partition
-            from sage.arith.misc import GCD as gcd
+            from sage.arith.misc import gcd
             from sage.arith.functions import lcm
             from itertools import product, repeat, chain
             p = parent.realization_of().power()

src/sage/combinat/tamari_lattices.py

@@ -48,7 +48,7 @@
 # ****************************************************************************
 from __future__ import annotations
 from sage.combinat.posets.lattices import LatticePoset, MeetSemilattice
-from sage.arith.misc import GCD as gcd
+from sage.arith.misc import gcd
 
 
 def paths_in_triangle(i, j, a, b) -> list[tuple[int, ...]]:

src/sage/combinat/words/lyndon_word.py

@@ -12,7 +12,7 @@
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
 
-from sage.arith.misc import divisors, GCD as gcd, moebius, multinomial
+from sage.arith.misc import divisors, gcd, moebius, multinomial
 from sage.combinat.combinat_cython import lyndon_word_iterator
 from sage.combinat.composition import Composition, Compositions
 from sage.combinat.necklace import _sfc

src/sage/combinat/words/word_generators.py

@@ -66,7 +66,7 @@
 from sage.combinat.words.finite_word import FiniteWord_class, Factorization
 from sage.combinat.words.words import FiniteWords, InfiniteWords
 from sage.combinat.words.morphism import WordMorphism
-from sage.arith.misc import GCD as gcd
+from sage.arith.misc import gcd
 from sage.misc.decorators import rename_keyword