sage.{coding,combinat}: Update # needs

Author: Matthias Koeppe

src/sage/coding/binary_code.pyx

@@ -3204,6 +3204,8 @@ cdef class BinaryCodeClassifier:
             ....:  [0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
@@ -3218,14 +3220,16 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,0,1,1,0,0,0,0,1,1,0,1,1,0,1,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
             2304
             sage: size
             2304
 
-            sage: M=Matrix(GF(2),[
+            sage: M = Matrix(GF(2),[
             ....:  [1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,0,0],
             ....:  [0,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0,0],
             ....:  [0,0,1,0,0,1,1,1,1,0,0,1,0,0,0,0,0],
@@ -3236,14 +3240,16 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,0,0,0,0,0,1,0,0,1,1,1,1,0,0,1]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
             136
             sage: size
             136
 
-            sage: M=Matrix(GF(2),[
+            sage: M = Matrix(GF(2),[
             ....:  [0,1,0,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,0,1],
             ....:  [1,0,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,0,1,0],
             ....:  [0,1,1,1,0,0,0,1,0,0,1,1,0,0,0,1,1,1,0,1,0,0],
@@ -3257,6 +3263,8 @@ cdef class BinaryCodeClassifier:
             ....:  [0,0,1,0,1,1,1,0,0,0,1,1,0,0,1,0,0,0,1,1,1,0]])
             sage: B = BinaryCode(M)
             sage: gens, labeling, size, base = BC._aut_gp_and_can_label(B)
+
+            sage: # needs sage.groups
             sage: S = SymmetricGroup(M.ncols())
             sage: L = [S([x+1 for x in g]) for g in gens]
             sage: PermutationGroup(L).order()
@@ -3956,7 +3964,7 @@ cdef class BinaryCodeClassifier:
             sage: from sage.coding.binary_code import *
             sage: BC = BinaryCodeClassifier()
             sage: B = BinaryCode(Matrix(GF(2), [[1,1,1,1]]))
-            sage: BC.generate_children(B, 6, 4)
+            sage: BC.generate_children(B, 6, 4)                                         # needs sage.groups
             [
             [1 1 1 1 0 0]
             [0 1 0 1 1 1]

src/sage/coding/codecan/autgroup_can_label.pyx

@@ -1,3 +1,4 @@
+# sage.doctest: needs sage.libs.pari
 r"""
 Canonical forms and automorphisms for linear codes over finite fields
 

src/sage/coding/goppa_code.py

@@ -308,7 +308,7 @@ def distance_bound(self):
             [8, 2] Goppa code over GF(2)
             sage: C.distance_bound()
             3
-            sage: C.minimum_distance()
+            sage: C.minimum_distance()                                                  # needs sage.libs.gap
             5
         """
         return 1 + (self._generating_pol).degree()

src/sage/combinat/root_system/cartan_type.py

@@ -1438,7 +1438,7 @@ def is_implemented(self):
 
         EXAMPLES::
 
-            sage: CartanType(["A",4,1]).is_implemented()
+            sage: CartanType(["A",4,1]).is_implemented()                                # needs sage.graphs
             True
             sage: CartanType(['H',3]).is_implemented()
             True

src/sage/combinat/root_system/reflection_group_c.pyx

@@ -1,4 +1,5 @@
 # cython: wraparound=False, boundscheck=False
+# sage.doctest: needs sage.graphs
 r"""
 This contains a few time-critical auxiliary cython functions for
 finite complex or real reflection groups.

src/sage/combinat/root_system/reflection_group_element.pyx

@@ -835,6 +835,7 @@ cdef class RealReflectionGroupElement(ComplexReflectionGroupElement):
 
         EXAMPLES::
 
+            sage: # needs sage.graphs
             sage: W = CoxeterGroup(['A',4], implementation="permutation")
             sage: s = W.simple_reflections()
             sage: w = s[2] * s[1] * s[3]

src/sage/combinat/root_system/root_system.py

@@ -158,7 +158,7 @@ class RootSystem(UniqueRepresentation, SageObject):
     In finite type `A`, we recover the natural representation of the
     symmetric group as group of permutation matrices::
 
-        sage: RootSystem(["A",2]).ambient_space().weyl_group().simple_reflections()     # needs sage.libs.pari
+        sage: RootSystem(["A",2]).ambient_space().weyl_group().simple_reflections()     # needs sage.libs.gap sage.libs.pari
         Finite family {1: [0 1 0]
                           [1 0 0]
                           [0 0 1],
@@ -169,7 +169,7 @@ class RootSystem(UniqueRepresentation, SageObject):
     In type `B`, `C`, and `D`, we recover the natural representation
     of the Weyl group as groups of signed permutation matrices::
 
-        sage: RootSystem(["B",3]).ambient_space().weyl_group().simple_reflections()     # needs sage.libs.pari
+        sage: RootSystem(["B",3]).ambient_space().weyl_group().simple_reflections()     # needs sage.libs.gap  sage.libs.pari
         Finite family {1: [0 1 0]
                           [1 0 0]
                           [0 0 1],

src/sage/combinat/root_system/weyl_characters.py

@@ -1,4 +1,4 @@
-# sage.doctest: needs sage.groups sage.modules
+# sage.doctest: needs sage.graphs sage.groups sage.modules
 """
 Weyl Character Rings
 """

src/sage/combinat/root_system/weyl_group.py

@@ -1,4 +1,4 @@
-# sage.doctest: needs sage.groups sage.modules
+# sage.doctest: needs sage.graphs sage.groups sage.modules
 """
 Weyl Groups