sage.structure: Update # needs

Author: Matthias Koeppe

src/sage/structure/coerce_dict.pyx

@@ -35,18 +35,19 @@ coerce maps. In previous versions of Sage, the cache was by strong
 references and resulted in a memory leak in the following example.
 However, this leak was fixed by :trac:`715`, using weak references::
 
-    sage: K.<t> = GF(2^55)                                                              # needs sage.rings.finite_rings
-    sage: for i in range(20):                                                           # needs sage.rings.finite_rings
+    sage: # needs sage.combinat sage.modules sage.rings.finite_rings
+    sage: K.<t> = GF(2^55)
+    sage: for i in range(20):
     ....:     a = K.random_element()
     ....:     E = EllipticCurve(j=a)
     ....:     P = E.random_point()
     ....:     Q = 2*P
-    sage: L = [Partitions(n) for n in range(200)]  # purge strong cache in CachedRepresentation     # needs sage.combinat sage.rings.finite_rings
+    sage: L = [Partitions(n) for n in range(200)]  # purge strong cache in CachedRepresentation
     sage: import gc
     sage: n = gc.collect()
-    sage: from sage.schemes.elliptic_curves.ell_finite_field import EllipticCurve_finite_field      # needs sage.combinat sage.rings.finite_rings
-    sage: LE = [x for x in gc.get_objects() if isinstance(x, EllipticCurve_finite_field)]           # needs sage.combinat sage.rings.finite_rings
-    sage: len(LE)                                                                                   # needs sage.combinat sage.rings.finite_rings
+    sage: from sage.schemes.elliptic_curves.ell_finite_field import EllipticCurve_finite_field
+    sage: LE = [x for x in gc.get_objects() if isinstance(x, EllipticCurve_finite_field)]
+    sage: len(LE)
     1
 """
 

src/sage/structure/element.pyx

@@ -4384,11 +4384,12 @@ cdef class FieldElement(CommutativeRingElement):
 
         Test if :trac:`8671` is fixed::
 
+            sage: # needs sage.libs.pari sage.libs.singular
             sage: R.<x,y> = QQ[]
-            sage: S.<a,b> = R.quo(y^2 + 1)                                              # needs sage.libs.pari
-            sage: S.is_field = lambda: False                                            # needs sage.libs.pari
-            sage: F = Frac(S); u = F.one()                                              # needs sage.libs.pari
-            sage: u.quo_rem(u)                                                          # needs sage.libs.pari
+            sage: S.<a,b> = R.quo(y^2 + 1)
+            sage: S.is_field = lambda: False
+            sage: F = Frac(S); u = F.one()
+            sage: u.quo_rem(u)
             (1, 0)
         """
         if not isinstance(right, FieldElement) or not (parent(right) is self._parent):

src/sage/structure/factorization.py

@@ -125,14 +125,15 @@
 
 Factorizations can involve fairly abstract mathematical objects::
 
-    sage: F = ModularSymbols(11,4).factorization(); F                                   # optional - sage.modular
+    sage: # needs sage.modular
+    sage: F = ModularSymbols(11,4).factorization(); F
     (Modular Symbols subspace of dimension 2 of Modular Symbols space
       of dimension 6 for Gamma_0(11) of weight 4 with sign 0 over Rational Field) *
     (Modular Symbols subspace of dimension 2 of Modular Symbols space
       of dimension 6 for Gamma_0(11) of weight 4 with sign 0 over Rational Field) *
     (Modular Symbols subspace of dimension 2 of Modular Symbols space
       of dimension 6 for Gamma_0(11) of weight 4 with sign 0 over Rational Field)
-    sage: type(F)                                                                       # optional - sage.modular
+    sage: type(F)
     <class 'sage.structure.factorization.Factorization'>
 
 

src/sage/structure/factory.pyx

@@ -518,11 +518,12 @@ cdef class UniqueFactory(SageObject):
         The ``GF`` factory used to have a custom :meth:`other_keys`
         method, but this was removed in :trac:`16934`::
 
-            sage: key, _ = GF.create_key_and_extra_args(27, 'k'); key                   # needs sage.rings.finite_rings
+            sage: # needs sage.libs.linbox sage.ring.finite_rings
+            sage: key, _ = GF.create_key_and_extra_args(27, 'k'); key
             (27, ('k',), x^3 + 2*x + 1, 'givaro', 3, 3, True, None, 'poly', True, True, True)
-            sage: K = GF.create_object(0, key); K                                       # needs sage.rings.finite_rings
+            sage: K = GF.create_object(0, key); K
             Finite Field in k of size 3^3
-            sage: GF.other_keys(key, K)                                                 # needs sage.rings.finite_rings
+            sage: GF.other_keys(key, K)
             []
 
             sage: K = GF(7^40, 'a')                                                     # needs sage.rings.finite_rings