sage.{crypto.lattice,modules,quadratic_forms,groups}: Update # needs

Author: Matthias Koeppe

src/sage/crypto/lattice.py

@@ -211,7 +211,7 @@ def gen_lattice(type='modular', n=4, m=8, q=11, seed=None,
         [-4 -3 2 -5 0 0 0 0 0 1]
         ]
 
-        sage: sage.crypto.gen_lattice(m=10, q=11, seed=42, lattice=True)
+        sage: sage.crypto.gen_lattice(m=10, q=11, seed=42, lattice=True)                # needs fpylll
         Free module of degree 10 and rank 10 over Integer Ring
         User basis matrix:
         [ 0  0  1  1  0 -1 -1 -1  1  0]

src/sage/groups/abelian_gps/dual_abelian_group_element.py

@@ -156,7 +156,7 @@ def word_problem(self, words):
             sage: w = a^7*b^3*c^5*d^4*e^4
             sage: x = a^3*b^2*c^2*d^3*e^5
             sage: y = a^2*b^4*c^2*d^4*e^5
-            sage: e.word_problem([u,v,w,x,y])
+            sage: e.word_problem([u,v,w,x,y])                                           # needs sage.libs.gap
             [[b^2*c^2*d^3*e^5, 245]]
         """
         from sage.libs.gap.libgap import libgap

src/sage/groups/group.pyx

@@ -140,7 +140,7 @@ cdef class Group(Parent):
 
         EXAMPLES::
 
-            sage: SL(2, 7).is_commutative()                                             # needs sage.modules sage.rings.finite_rings
+            sage: SL(2, 7).is_commutative()                                             # needs sage.libs.gap sage.modules sage.rings.finite_rings
             False
         """
         return self.is_abelian()

src/sage/groups/matrix_gps/coxeter_group.py

@@ -79,7 +79,7 @@ class CoxeterMatrixGroup(UniqueRepresentation, FinitelyGeneratedMatrixGroup_gene
 
     We can create Coxeter groups from Coxeter matrices::
 
-        sage: # needs sage.rings.number_field
+        sage: # needs sage.libs.gap
         sage: W = CoxeterGroup([[1, 6, 3], [6, 1, 10], [3, 10, 1]]); W
         Coxeter group over Universal Cyclotomic Field with Coxeter matrix:
         [ 1  6  3]
@@ -150,7 +150,7 @@ class CoxeterMatrixGroup(UniqueRepresentation, FinitelyGeneratedMatrixGroup_gene
     graphs, we can input a Coxeter graph. Following the standard convention,
     edges with no label (i.e. labelled by ``None``) are treated as 3::
 
-        sage: # needs sage.rings.number_field
+        sage: # needs sage.libs.gap
         sage: G = Graph([(0,3,None), (1,3,15), (2,3,7), (0,1,3)])
         sage: W = CoxeterGroup(G); W
         Coxeter group over Universal Cyclotomic Field with Coxeter matrix:
@@ -165,7 +165,7 @@ class CoxeterMatrixGroup(UniqueRepresentation, FinitelyGeneratedMatrixGroup_gene
     Because there currently is no class for `\ZZ \cup \{ \infty \}`, labels
     of `\infty` are given by `-1` in the Coxeter matrix::
 
-        sage: # needs sage.rings.number_field
+        sage: # needs sage.libs.gap
         sage: G = Graph([(0,1,None), (1,2,4), (0,2,oo)])
         sage: W = CoxeterGroup(G)
         sage: W.coxeter_matrix()
@@ -240,15 +240,15 @@ def __init__(self, coxeter_matrix, base_ring, index_set):
         EXAMPLES::
 
             sage: W = CoxeterGroup([[1,3,2],[3,1,3],[2,3,1]])
-            sage: TestSuite(W).run() # long time
+            sage: TestSuite(W).run()  # long time
 
-            sage: # needs sage.rings.number_field
+            sage: # long time, needs sage.rings.number_field sage.symbolic
             sage: W = CoxeterGroup([[1,3,2],[3,1,4],[2,4,1]], base_ring=QQbar)
-            sage: TestSuite(W).run() # long time
+            sage: TestSuite(W).run()
             sage: W = CoxeterGroup([[1,3,2],[3,1,6],[2,6,1]])
-            sage: TestSuite(W).run(max_runs=30) # long time
+            sage: TestSuite(W).run(max_runs=30)
             sage: W = CoxeterGroup([[1,3,2],[3,1,-1],[2,-1,1]])
-            sage: TestSuite(W).run(max_runs=30) # long time
+            sage: TestSuite(W).run(max_runs=30)
 
         We check that :trac:`16630` is fixed::
 
@@ -340,7 +340,7 @@ def _repr_(self):
 
         EXAMPLES::
 
-            sage: CoxeterGroup([[1,3,2],[3,1,4],[2,4,1]])                               # needs sage.rings.number_field
+            sage: CoxeterGroup([[1,3,2],[3,1,4],[2,4,1]])                               # needs sage.libs.gap sage.rings.number_field
             Finite Coxeter group over Number Field in a with defining polynomial x^2 - 2 with a = 1.414213562373095? with Coxeter matrix:
             [1 3 2]
             [3 1 4]
@@ -383,8 +383,8 @@ def coxeter_matrix(self):
             sage: W.coxeter_matrix()
             [1 3]
             [3 1]
-            sage: W = CoxeterGroup(['H',3])                                             # needs sage.rings.number_field
-            sage: W.coxeter_matrix()
+            sage: W = CoxeterGroup(['H',3])                                             # needs sage.libs.gap sage.rings.number_field
+            sage: W.coxeter_matrix()                                                    # needs sage.libs.gap sage.rings.number_field
             [1 3 2]
             [3 1 5]
             [2 5 1]
@@ -423,7 +423,7 @@ def is_finite(self):
 
         EXAMPLES::
 
-            sage: # needs sage.rings.number_field
+            sage: # needs sage.libs.gap sage.rings.number_field
             sage: [l for l in range(2, 9) if
             ....:  CoxeterGroup([[1,3,2],[3,1,l],[2,l,1]]).is_finite()]
             [2, 3, 4, 5]

src/sage/quadratic_forms/quadratic_form__automorphisms.py

@@ -349,22 +349,22 @@ def automorphisms(self):
         48
         sage: 2^3 * factorial(3)
         48
-        sage: len(Q.automorphisms())
+        sage: len(Q.automorphisms())                                                    # needs sage.libs.gap
         48
 
     ::
 
         sage: Q = DiagonalQuadraticForm(ZZ, [1,3,5,7])
         sage: Q.number_of_automorphisms()
         16
-        sage: aut = Q.automorphisms()
-        sage: len(aut)
+        sage: aut = Q.automorphisms()                                                   # needs sage.libs.gap
+        sage: len(aut)                                                                  # needs sage.libs.gap
         16
-        sage: all(Q(M) == Q for M in aut)
+        sage: all(Q(M) == Q for M in aut)                                               # needs sage.libs.gap
         True
 
         sage: Q = QuadraticForm(ZZ, 3, [2, 1, 2, 2, 1, 3])
-        sage: sorted(Q.automorphisms())
+        sage: sorted(Q.automorphisms())                                                 # needs sage.libs.gap
         [
         [-1  0  0]  [1 0 0]
         [ 0 -1  0]  [0 1 0]