sage.{homology,matrix,modules}: Protect timing out doctests from probing

Author: Matthias Koeppe

src/sage/homology/homology_group.py

@@ -165,6 +165,8 @@ def HomologyGroup(n, base_ring, invfac=None):
         Multiplicative Abelian group isomorphic to Z x Z x Z x Z
         sage: HomologyGroup(4, ZZ)
         Z x Z x Z x Z
+
+        sage: # needs sage.libs.flint (otherwise timeout)
         sage: HomologyGroup(100, ZZ)
         Z^100
     """

src/sage/matrix/constructor.pyx

@@ -579,7 +579,8 @@ def matrix(*args, **kwds):
 
     Check :trac:`24459`::
 
-        sage: Matrix(ZZ, sys.maxsize, sys.maxsize)                                      # needs sage.libs.flint
+        sage: # needs sage.libs.flint
+        sage: Matrix(ZZ, sys.maxsize, sys.maxsize)
         Traceback (most recent call last):
         ...
         RuntimeError...

src/sage/matrix/special.py

@@ -365,19 +365,21 @@ def random_matrix(ring, nrows, ncols=None, algorithm='randomize', implementation
         sage: while abs(density_sum/total_count - expected_density) > 0.001:
         ....:     add_sample(ZZ, 5, x=-10, y=10, density=0.75)
 
+        sage: # needs sage.libs.flint (otherwise timeout)
         sage: density_sum = 0.0
         sage: total_count = 0.0
         sage: add_sample(ZZ, 5, x=20, y=30, density=0.75)
-        sage: while abs(density_sum/total_count - expected_density) > 0.001:            # needs sage.libs.flint
+        sage: while abs(density_sum/total_count - expected_density) > 0.001:
         ....:     add_sample(ZZ, 5, x=20, y=30, density=0.75)
 
+        sage: # needs sage.libs.flint (otherwise timeout)
         sage: density_sum = 0.0
         sage: total_count = 0.0
-        sage: add_sample(ZZ, 100, x=20, y=30, density=0.75)                             # needs sage.libs.flint
+        sage: add_sample(ZZ, 100, x=20, y=30, density=0.75)
         sage: expected_density = (1 - (99/100)^75)
         sage: float(expected_density)
         0.529...
-        sage: while abs(density_sum/total_count - expected_density) > 0.001:            # needs sage.libs.flint
+        sage: while abs(density_sum/total_count - expected_density) > 0.001:
         ....:     add_sample(ZZ, 100, x=20, y=30, density=0.75)
 
     For a matrix with low density it may be advisable to insist on a sparse
@@ -393,7 +395,8 @@ def random_matrix(ring, nrows, ncols=None, algorithm='randomize', implementation
     For algorithm testing you might want to control the number of bits,
     say 10,000 entries, each limited to 16 bits.  ::
 
-        sage: A = random_matrix(ZZ, 100, 100, x=2^16); A                                # needs sage.libs.flint
+        sage: # needs sage.libs.flint (otherwise timeout)
+        sage: A = random_matrix(ZZ, 100, 100, x=2^16); A
         100 x 100 dense matrix over Integer Ring (use the '.str()' method to see the entries)
 
     One can prescribe a specific matrix implementation::

src/sage/modules/fg_pid/fgp_module.py

@@ -1867,7 +1867,9 @@ def construction(self):
             sage: T2 = A2 / B2
             sage: t1 = T1.an_element()
             sage: t2 = T2.an_element()
-            sage: t1 + t2                                                               # needs sage.libs.flint (o/w infinite recursion)
+
+            sage: # needs sage.libs.flint (o/w infinite recursion)
+            sage: t1 + t2
             (1, 1)
         """
         from sage.modules.module_functors import QuotientModuleFunctor
@@ -2068,8 +2070,10 @@ def _test_morphism_0(*args, **kwds):
         sage: set_random_seed(s); v = [fgp._test_morphism_0(1) for _ in range(30)]
         sage: set_random_seed(s); v = [fgp._test_morphism_0(2) for _ in range(30)]
         sage: set_random_seed(s); v = [fgp._test_morphism_0(3) for _ in range(10)]
-        sage: set_random_seed(s); v = [fgp._test_morphism_0(i) for i in range(1,20)]    # needs sage.libs.flint (o/w timeout)
-        sage: set_random_seed(s); v = [fgp._test_morphism_0(4) for _ in range(50)]  # long time, needs sage.libs.flint
+
+        sage: # needs sage.libs.flint (o/w timeout)
+        sage: set_random_seed(s); v = [fgp._test_morphism_0(i) for i in range(1,20)]
+        sage: set_random_seed(s); v = [fgp._test_morphism_0(4) for _ in range(50)]  # long time
     """
     phi = random_fgp_morphism_0(*args, **kwds)
     K = phi.kernel()

src/sage/modules/free_module_integer.py

@@ -407,7 +407,7 @@ def BKZ(self, *args, **kwds):
 
         EXAMPLES::
 
-            sage: # needs sage.libs.flint
+            sage: # needs sage.libs.flint (o/w timeout)
             sage: from sage.modules.free_module_integer import IntegerLattice
             sage: A = sage.crypto.gen_lattice(type='random', n=1, m=60, q=2^60, seed=42)
             sage: L = IntegerLattice(A, lll_reduce=False)

src/sage/modules/free_quadratic_module_integer_symmetric.py

@@ -1048,8 +1048,9 @@ def maximal_overlattice(self, p=None):
 
         TESTS::
 
+            sage: # needs sage.libs.flint (otherwise timeout)
             sage: L = IntegralLattice(matrix.diagonal([2,4,4,8]))
-            sage: L.maximal_overlattice().is_even()                                     # needs sage.libs.flint
+            sage: L.maximal_overlattice().is_even()
             True
 
         """