Add some long time markers

Author: user202729

src/doc/en/thematic_tutorials/vector_calculus/vector_calc_curvilinear.rst

@@ -232,7 +232,8 @@ The Laplacian of a scalar field::
 
 The Laplacian of a vector field::
 
-    sage: Du = laplacian(u)
+    sage: # long time
+    sage: Du = laplacian(u)  # long time (20s)
     sage: Du.display()
     Delta(u) = ((r^2*d^2(u_r)/dr^2 + 2*r*d(u_r)/dr - 2*u_r(r, th, ph)
      + d^2(u_r)/dth^2 - 2*d(u_theta)/dth)*sin(th)^2 - ((2*u_theta(r, th, ph)
@@ -247,6 +248,7 @@ The Laplacian of a vector field::
 Since this expression is quite lengthy, we may ask for a display component by
 component::
 
+    sage: # long time
     sage: Du.display_comp()
     Delta(u)^1 = ((r^2*d^2(u_r)/dr^2 + 2*r*d(u_r)/dr - 2*u_r(r, th, ph) + d^2(u_r)/dth^2
      - 2*d(u_theta)/dth)*sin(th)^2 - ((2*u_theta(r, th, ph) - d(u_r)/dth)*cos(th)
@@ -260,6 +262,7 @@ component::
 
 We may expand each component::
 
+    sage: # long time
     sage: for i in E.irange():
     ....:     s = Du[i].expand()
     sage: Du.display_comp()

src/sage/doctest/forker.py

@@ -2193,7 +2193,7 @@ def dispatch(self):
             sage: DC.reporter = DR
             sage: DC.dispatcher = DD
             sage: DC.timer = Timer().start()
-            sage: DD.dispatch()
+            sage: DD.dispatch()  # long time (20s)
             sage -t .../sage/modules/free_module_homspace.py
                 [... tests, ...s wall]
             sage -t .../sage/rings/big_oh.py

src/sage/dynamics/arithmetic_dynamics/projective_ds.py

@@ -6974,7 +6974,7 @@ def Lattes_to_curve(self, return_conjugation=False, check_lattes=False):
             sage: P.<x,y>=ProjectiveSpace(QQbar, 1)
             sage: E=EllipticCurve([1, 2])
             sage: f=P.Lattes_map(E, 2)
-            sage: f.Lattes_to_curve(check_lattes=true)
+            sage: f.Lattes_to_curve(check_lattes=true)  # long time (30s)
             Elliptic Curve defined by y^2 = x^3 + x + 2 over Rational Field
 
         """

src/sage/groups/perm_gps/permgroup_named.py

@@ -3513,8 +3513,8 @@ class SmallPermutationGroup(PermutationGroup_generic):
         [ 2  0 -1 -2  0  1]
         [ 2  0 -1  2  0 -1]
         sage: def numgps(n): return ZZ(libgap.NumberSmallGroups(n))
-        sage: all(SmallPermutationGroup(n,k).id() == [n,k]
-        ....:     for n in [1..64] for k in [1..numgps(n)])  # long time (180s)
+        sage: all(SmallPermutationGroup(n,k).id() == [n,k]  # long time (180s)
+        ....:     for n in [1..64] for k in [1..numgps(n)])
         True
         sage: H = SmallPermutationGroup(6,1)
         sage: H.is_abelian()

src/sage/interacts/test_jupyter.rst

@@ -205,7 +205,7 @@ Test all interacts from the Sage interact library::
     Exact value of the integral \(\displaystyle\int_{0}^{2}x^{2} +
     1\,\mathrm{d}x=4.666666666666668\)
 
-    sage: test(interacts.calculus.function_tool)
+    sage: test(interacts.calculus.function_tool)  # long time (10s)
     ...Interactive function <function function_tool at ...> with 7 widgets
       f: EvalText(value='sin(x)', description='f')
       g: EvalText(value='cos(x)', description='g')

src/sage/interfaces/maxima_abstract.py

@@ -304,7 +304,7 @@ def _commands(self, verbose=True):
         EXAMPLES::
 
             # The output is kind of random
-            sage: sorted(maxima._commands(verbose=False))
+            sage: sorted(maxima._commands(verbose=False))  # long time (40s)
             [...
              'display',
              ...

src/sage/rings/semirings/tropical_mpolynomial.py

@@ -543,12 +543,13 @@ def dual_subdivision(self):
 
         A subdivision with many faces, not all of which are triangles::
 
+            sage: # long time
             sage: T = TropicalSemiring(QQ)
             sage: R.<x,y> = PolynomialRing(T)
             sage: p3 = (R(8) + R(4)*x + R(2)*y + R(1)*x^2 + x*y + R(1)*y^2
             ....:      + R(2)*x^3 + x^2*y + x*y^2 + R(4)*y^3 + R(8)*x^4
             ....:      + R(4)*x^3*y + x^2*y^2 + R(2)*x*y^3 + y^4)
-            sage: pc = p3.dual_subdivision(); pc
+            sage: pc = p3.dual_subdivision(); pc  # long time (40s)
             Polyhedral complex with 10 maximal cells
             sage: [p.Vrepresentation() for p in pc.maximal_cells_sorted()]
             [(A vertex at (0, 0), A vertex at (0, 1), A vertex at (1, 0)),

src/sage/schemes/elliptic_curves/ell_generic.py

@@ -2464,6 +2464,8 @@ def multiplication_by_m(self, m, x_only=False):
             sage: assert(E(eval(f,P)) == 2*P)
 
         The following test shows that :issue:`6413` is fixed for elliptic curves over finite fields::
+
+            sage: # long time
             sage: p = 7
             sage: K.<a> = GF(p^2)
             sage: E = EllipticCurve(K, [a + 3, 5 - a])

src/sage/stats/distributions/discrete_gaussian_lattice.py

@@ -504,7 +504,7 @@ def __init__(self, B, sigma=1, c=0, r=None, precision=None, sigma_basis=False):
             ....:     add_samples(1000)
             sage: sum(counter.values())  # random
             3000
-            sage: while abs(m*f(v)*1.0/nf/counter[v] - 1.0) >= 0.1:                     # needs sage.symbolic
+            sage: while abs(m*f(v)*1.0/nf/counter[v] - 1.0) >= 0.1:                     # needs sage.symbolic  # long time (20s)
             ....:     add_samples(1000)
 
         If the covariance provided is not positive definite, an error is thrown::

src/sage/symbolic/expression.pyx

@@ -13201,7 +13201,7 @@ cdef class Expression(Expression_abc):
         answer::
 
             sage: f = ln(1+4/5*sin(x))
-            sage: integrate(f, x, -3.1415, 3.1415)  # random
+            sage: integrate(f, x, -3.1415, 3.1415)  # random  # long time (10s)
             integrate(log(4/5*sin(x) + 1), x, -3.14150000000000,
             3.14150000000000)
             sage: # needs sage.libs.giac