sage.libs.gap, sage.groups: Update # needs

Author: Matthias Koeppe

src/sage/groups/perm_gps/permgroup.py

@@ -344,6 +344,7 @@ def PermutationGroup(gens=None, *args, **kwds):
     Note that we provide generators for the acting group.  The
     permutation group we construct is its homomorphic image::
 
+        sage: # needs sage.combinat
         sage: a = lambda g, x: vector(g*x, immutable=True)
         sage: X = [vector(x, immutable=True) for x in GF(3)^2]
         sage: G = SL(2,3); G.gens()
@@ -1547,6 +1548,7 @@ def representative_action(self,x,y):
 
         TESTS::
 
+            sage: # needs sage.graphs
             sage: g = graphs.PetersenGraph()
             sage: g.relabel(list("abcdefghik"))
             sage: g.vertices(sort=True)
@@ -3706,6 +3708,7 @@ def has_regular_subgroup(self, return_group=False):
 
         But the automorphism group of Petersen's graph does not::
 
+            sage: # needs sage.graphs
             sage: G = graphs.PetersenGraph().automorphism_group()
             sage: G.has_regular_subgroup()
             False
@@ -3767,6 +3770,7 @@ def blocks_all(self, representatives=True):
 
         Picking an interesting group::
 
+            sage: # needs sage.graphs
             sage: g = graphs.DodecahedralGraph()
             sage: g.is_vertex_transitive()
             True
@@ -3776,12 +3780,12 @@ def blocks_all(self, representatives=True):
 
         Computing its blocks representatives::
 
-            sage: ag.blocks_all()
+            sage: ag.blocks_all()                                                       # needs sage.graphs
             [[0, 15]]
 
         Now the full block::
 
-            sage: sorted(ag.blocks_all(representatives = False)[0])
+            sage: sorted(ag.blocks_all(representatives=False)[0])                       # needs sage.graphs
             [[0, 15], [1, 16], [2, 12], [3, 13], [4, 9],
              [5, 10], [6, 11], [7, 18], [8, 17], [14, 19]]
 
@@ -3977,6 +3981,7 @@ def minimal_generating_set(self):
 
         EXAMPLES::
 
+            sage: # needs sage.graphs
             sage: g = graphs.CompleteGraph(4)
             sage: g.relabel(['a','b','c','d'])
             sage: mgs = g.automorphism_group().minimal_generating_set(); len(mgs)

src/sage/libs/gap/libgap.pyx

@@ -46,7 +46,7 @@ equivalent::
     sage: type(_)
     <class 'sage.rings.integer.Integer'>
 
-    sage: libgap.eval('5/3 + 7*E(3)').sage()
+    sage: libgap.eval('5/3 + 7*E(3)').sage()                                            # needs sage.rings.number_field
     7*zeta3 + 5/3
 
     sage: gens_of_group = libgap.AlternatingGroup(4).GeneratorsOfGroup()
@@ -265,7 +265,7 @@ class Gap(Parent):
 
             sage: libgap.has_coerce_map_from(ZZ)
             True
-            sage: libgap.has_coerce_map_from(CyclotomicField(5)['x','y'])
+            sage: libgap.has_coerce_map_from(CyclotomicField(5)['x','y'])               # needs sage.rings.number_field
             True
         """
         return True
@@ -362,11 +362,12 @@ class Gap(Parent):
 
         We gracefully handle the case that the conversion fails (:trac:`18039`)::
 
-            sage: F.<a> = GF(9, modulus="first_lexicographic")
+            sage: F.<a> = GF(9, modulus="first_lexicographic")                          # needs sage.rings.finite_rings
             sage: libgap(Matrix(F, [[a]]))
             Traceback (most recent call last):
             ...
-            NotImplementedError: conversion of (Givaro) finite field element to GAP not implemented except for fields defined by Conway polynomials.
+            NotImplementedError: conversion of (Givaro) finite field element to GAP
+            not implemented except for fields defined by Conway polynomials.
         """
         ring = M.base_ring()
         try: