Replace relative imports by absolute imports because pytest

Author: Matthias Koeppe

src/sage/combinat/partition_algebra.py

@@ -17,18 +17,17 @@
 # ****************************************************************************
 from sage.arith.misc import binomial, factorial
 from sage.categories.algebras_with_basis import AlgebrasWithBasis
+from sage.combinat.combinat import catalan_number
+from sage.combinat.free_module import CombinatorialFreeModule
+from sage.combinat.permutation import Permutations
+from sage.combinat.set_partition import SetPartition, SetPartitions, SetPartitions_set
+from sage.combinat.subset import Subsets
 from sage.functions.all import ceil
 from sage.graphs.graph import Graph
 from sage.rings.integer_ring import ZZ
 from sage.rings.rational_field import QQ
 from sage.sets.set import Set, Set_generic
 
-from .combinat import catalan_number
-from .free_module import CombinatorialFreeModule
-from .permutation import Permutations
-from .set_partition import SetPartition, SetPartitions, SetPartitions_set
-from .subset import Subsets
-
 
 def _int_or_half_int(k):
     r"""

src/sage/combinat/permutation.py

@@ -247,6 +247,15 @@
 from sage.categories.finite_weyl_groups import FiniteWeylGroups
 from sage.categories.infinite_enumerated_sets import InfiniteEnumeratedSets
 from sage.categories.sets_with_grading import SetsWithGrading
+from sage.combinat.backtrack import GenericBacktracker
+from sage.combinat.combinat import CombinatorialElement, catalan_number
+from sage.combinat.combinatorial_map import combinatorial_map
+from sage.combinat.composition import Composition
+from sage.combinat.permutation_cython import (left_action_product, right_action_product,
+                                              left_action_same_n, right_action_same_n,
+                                              map_to_list, next_perm)
+from sage.combinat.rsk import RSK, RSK_inverse
+from sage.combinat.tools import transitive_ideal
 from sage.graphs.digraph import DiGraph
 from sage.groups.perm_gps.permgroup_element import PermutationGroupElement
 from sage.groups.perm_gps.permgroup_named import SymmetricGroup
@@ -262,16 +271,6 @@
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
 
-from .backtrack import GenericBacktracker
-from .combinat import CombinatorialElement, catalan_number
-from .combinatorial_map import combinatorial_map
-from .composition import Composition
-from .permutation_cython import (left_action_product, right_action_product,
-                                 left_action_same_n, right_action_same_n,
-                                 map_to_list, next_perm)
-from .rsk import RSK, RSK_inverse
-from .tools import transitive_ideal
-
 
 class Permutation(CombinatorialElement):
     r"""

src/sage/combinat/sf/elementary.py

@@ -19,11 +19,10 @@
 #*****************************************************************************
 from sage.arith.misc import binomial, factorial
 from sage.combinat.partition import Partition
+from sage.combinat.sf import multiplicative, classical
 from sage.misc.misc_c import prod
 from sage.rings.infinity import infinity
 
-from . import multiplicative, classical
-
 
 ###################################
 #                                 #

src/sage/combinat/sf/homogeneous.py

@@ -27,11 +27,10 @@
 ####################################
 from sage.arith.misc import binomial, factorial
 from sage.combinat.partition import Partition
+from sage.combinat.sf import multiplicative, classical
 from sage.misc.misc_c import prod
 from sage.rings.infinity import infinity
 
-from . import multiplicative, classical
-
 
 class SymmetricFunctionAlgebra_homogeneous(multiplicative.SymmetricFunctionAlgebra_multiplicative):
     def __init__(self, Sym):

src/sage/combinat/similarity_class_type.py

@@ -192,6 +192,9 @@ class type, it is also possible to compute the number of classes of that type
 
 from sage.arith.misc import divisors, factorial, moebius
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
+from sage.combinat.combinat import CombinatorialElement
+from sage.combinat.misc import IterableFunctionCall
+from sage.combinat.partition import Partitions, Partition
 from sage.misc.cachefunc import cached_in_parent_method, cached_function
 from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
 from sage.misc.misc_c import prod
@@ -203,11 +206,6 @@ class type, it is also possible to compute the number of classes of that type
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
 
-from .combinat import CombinatorialElement
-from .misc import IterableFunctionCall
-from .partition import Partitions, Partition
-
-
 
 @cached_function
 def fq(n, q=None):

src/sage/combinat/species/cycle_species.py

@@ -13,13 +13,11 @@
 #*****************************************************************************
 
 from sage.arith.misc import divisors, euler_phi
+from sage.combinat.species.misc import accept_size
+from sage.combinat.species.species import GenericCombinatorialSpecies
+from sage.combinat.species.structure import GenericSpeciesStructure
 from sage.structure.unique_representation import UniqueRepresentation
 
-from .misc import accept_size
-from .species import GenericCombinatorialSpecies
-from .structure import GenericSpeciesStructure
-
-
 
 class CycleSpeciesStructure(GenericSpeciesStructure):
     def __repr__(self):

src/sage/combinat/tableau.py

@@ -86,34 +86,34 @@
 # ****************************************************************************
 from itertools import repeat
 
+import sage.libs.symmetrica.all as symmetrica
+import sage.misc.prandom as random
+
 from sage.arith.misc import binomial, factorial, multinomial
 from sage.categories.finite_enumerated_sets import FiniteEnumeratedSets
 from sage.categories.infinite_enumerated_sets import InfiniteEnumeratedSets
 from sage.categories.sets_cat import Sets
+from sage.combinat import permutation
+from sage.combinat.combinatorial_map import combinatorial_map
+from sage.combinat.composition import Composition, Compositions
+from sage.combinat.integer_vector import IntegerVectors, integer_vectors_nk_fast_iter
+from sage.combinat.posets.posets import Poset
 from sage.groups.perm_gps.permgroup import PermutationGroup
+from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
+from sage.misc.misc import powerset
+from sage.misc.misc_c import prod
+from sage.misc.persist import register_unpickle_override
+from sage.rings.finite_rings.integer_mod_ring import IntegerModRing
+from sage.rings.infinity import PlusInfinity
+from sage.rings.integer import Integer
 from sage.sets.disjoint_union_enumerated_sets import DisjointUnionEnumeratedSets
 from sage.sets.family import Family
 from sage.sets.non_negative_integers import NonNegativeIntegers
 from sage.structure.global_options import GlobalOptions
-from sage.structure.unique_representation import UniqueRepresentation
 from sage.structure.list_clone import ClonableList
 from sage.structure.parent import Parent
 from sage.structure.richcmp import richcmp, richcmp_method
-from sage.misc.persist import register_unpickle_override
-from sage.misc.inherit_comparison import InheritComparisonClasscallMetaclass
-from sage.rings.finite_rings.integer_mod_ring import IntegerModRing
-from sage.rings.infinity import PlusInfinity
-from sage.rings.integer import Integer
-import sage.libs.symmetrica.all as symmetrica
-import sage.misc.prandom as random
-from sage.misc.misc_c import prod
-from sage.misc.misc import powerset
-
-from . import permutation
-from .combinatorial_map import combinatorial_map
-from .composition import Composition, Compositions
-from .integer_vector import IntegerVectors, integer_vectors_nk_fast_iter
-from .posets.posets import Poset
+from sage.structure.unique_representation import UniqueRepresentation
 
 
 @richcmp_method

src/sage/combinat/words/lyndon_word.py

@@ -16,13 +16,12 @@
 from sage.combinat.combinat_cython import lyndon_word_iterator
 from sage.combinat.composition import Composition, Compositions
 from sage.combinat.necklace import _sfc
+from sage.combinat.words.finite_word import FiniteWord_class
+from sage.combinat.words.words import FiniteWords
 from sage.rings.integer import Integer
 from sage.structure.parent import Parent
 from sage.structure.unique_representation import UniqueRepresentation
 
-from .finite_word import FiniteWord_class
-from .words import FiniteWords
-
 
 def LyndonWords(e=None, k=None):
     """