sage -fiximports src/sage/{coding,groups}

Author: alexchandler100

src/sage/coding/bch_code.py

@@ -27,8 +27,8 @@
 from sage.modules.free_module_element import vector
 from sage.misc.misc_c import prod
 from sage.categories.fields import Fields
-from sage.arith.all import gcd
-from sage.rings.all import Zmod
+from sage.arith.misc import GCD as gcd
+from sage.rings.finite_rings.integer_mod_ring import IntegerModRing as Zmod
 
 from .cyclic_code import CyclicCode
 from .grs_code import GeneralizedReedSolomonCode

src/sage/coding/binary_code.pyx

@@ -4103,7 +4103,7 @@ cdef class BinaryCodeClassifier:
                     m = BinaryCode(matrix(ZZ, rs))
 
                     m_aut_gp_gens, m_labeling, m_size, m_base = self._aut_gp_and_can_label(m)
-                    from sage.arith.all import factorial
+                    from sage.arith.misc import factorial
                     if True:  # size*factorial(n-B.ncols) == m_size:
 
                         if len(m_aut_gp_gens) == 0:

src/sage/coding/code_bounds.py

@@ -174,9 +174,12 @@
 # ****************************************************************************
 
 from sage.libs.gap.libgap import libgap
-from sage.rings.all import QQ, RR, ZZ, RDF
+from sage.rings.rational_field import Q as QQ
+from sage.rings.real_mpfr import RR
+from sage.rings.integer_ring import Z as ZZ
+from sage.rings.real_double import RDF
 from sage.arith.misc import is_prime_power
-from sage.arith.all import binomial
+from sage.arith.misc import binomial
 from sage.misc.functional import sqrt, log
 from .delsarte_bounds import (delsarte_bound_hamming_space,
                               delsarte_bound_additive_hamming_space)

src/sage/coding/code_constructions.py

@@ -41,7 +41,8 @@
 # ****************************************************************************
 
 from sage.misc.misc_c import prod
-from sage.arith.all import quadratic_residues, gcd
+from sage.arith.misc import quadratic_residues
+from sage.arith.misc import GCD as gcd
 
 from sage.structure.sequence import Sequence, Sequence_generic
 
@@ -753,7 +754,7 @@ def ToricCode(P,F):
 
     - David Joyner (07-2006)
     """
-    from sage.combinat.all import Tuples
+    from sage.combinat.tuple import Tuples
     mset = [x for x in F if x != 0]
     d = len(P[0])
     pts = Tuples(mset, d).list()

src/sage/coding/cyclic_code.py

@@ -41,11 +41,11 @@
 from copy import copy
 from sage.rings.integer import Integer
 from sage.categories.homset import Hom
-from sage.arith.all import gcd
+from sage.arith.misc import GCD as gcd
 from sage.modules.free_module_element import vector
 from sage.matrix.constructor import matrix
 from sage.misc.cachefunc import cached_method
-from sage.rings.all import Zmod
+from sage.rings.finite_rings.integer_mod_ring import IntegerModRing as Zmod
 
 
 def find_generator_polynomial(code, check=True):

src/sage/coding/delsarte_bounds.py

@@ -102,7 +102,7 @@ def krawtchouk(n, q, l, x, check=True):
         ...
         TypeError: no conversion of this rational to integer
     """
-    from sage.arith.all import binomial
+    from sage.arith.misc import binomial
     from sage.arith.srange import srange
     # Use the expression in equation (55) of MacWilliams & Sloane, pg 151
     # We write jth term = some_factor * (j-1)th term
@@ -171,7 +171,7 @@ def eberlein(n, w, k, u, check=True):
         TypeError: either m or x-m must be an integer
 
     """
-    from sage.arith.all import binomial
+    from sage.arith.misc import binomial
     from sage.arith.srange import srange
 
     if 2*w > n:
@@ -275,7 +275,7 @@ def _delsarte_cwc_LP_building(n, d, w, solver, isinteger):
 
     """
     from sage.numerical.mip import MixedIntegerLinearProgram
-    from sage.arith.all import binomial
+    from sage.arith.misc import binomial
 
     p = MixedIntegerLinearProgram(maximization=True, solver=solver)
     A = p.new_variable(integer=isinteger, nonnegative=True)

src/sage/coding/information_set_decoder.py

@@ -40,7 +40,11 @@
 #                  http://www.gnu.org/licenses/
 #******************************************************************************
 
-from sage.all import ZZ, Integer, vector, SageObject, binomial
+from sage.rings.integer_ring import Z as ZZ
+from sage.rings.integer import Integer
+from sage.modules.free_module_element import free_module_element as vector
+from sage.structure.sage_object import SageObject
+from sage.functions.other import binomial
 from .decoder import Decoder
 
 

src/sage/coding/linear_code.py

@@ -214,7 +214,8 @@ class should inherit from this class. Also ``AbstractLinearCode`` should never
 from sage.matrix.matrix_space import MatrixSpace
 from sage.modules.free_module import VectorSpace
 from sage.modules.free_module_element import vector
-from sage.arith.all import GCD, binomial
+from sage.arith.misc import GCD
+from sage.arith.misc import binomial
 from sage.groups.all import SymmetricGroup
 from sage.groups.perm_gps.permgroup import PermutationGroup
 from sage.rings.rational_field import QQ

src/sage/groups/abelian_gps/abelian_group.py

@@ -207,7 +207,9 @@
 from sage.structure.category_object import normalize_names
 from sage.structure.unique_representation import UniqueRepresentation
 from sage.rings.infinity import infinity
-from sage.arith.all import divisors, gcd, lcm
+from sage.arith.misc import divisors
+from sage.arith.misc import GCD as gcd
+from sage.arith.functions import lcm
 from sage.groups.abelian_gps.abelian_group_element import AbelianGroupElement
 from sage.misc.cachefunc import cached_method
 from sage.misc.misc_c import prod

src/sage/groups/abelian_gps/dual_abelian_group_element.py

@@ -52,7 +52,7 @@
 # (at your option) any later version.
 #                  https://www.gnu.org/licenses/
 # ****************************************************************************
-from sage.arith.all import LCM
+from sage.arith.functions import lcm as LCM
 from sage.groups.abelian_gps.element_base import AbelianGroupElementBase