Revert some "#long time"s

gmou3 · Jun 1, 2024 · bbedbaf · bbedbaf
1 parent f2d6ecc
commit bbedbaf
Show file tree

Hide file tree

Showing 9 changed files with 16 additions and 15 deletions.
diff --git a/src/sage/groups/cactus_group.py b/src/sage/groups/cactus_group.py
@@ -91,7 +91,7 @@ def __init__(self, n):
             sage: J4 = groups.misc.Cactus(4)
             sage: it = iter(J4)
             sage: elts = [next(it) for _ in range(100)]
-            sage: TestSuite(J4).run(elements=elts[::8])  # long time
+            sage: TestSuite(J4).run(elements=elts[::8])
         """
         self._n = n
         ell = len(str(n))
@@ -500,7 +500,7 @@ def geometric_representation_generators(self, t=None):
             sage: RG = list(J3.geometric_representation_generators())
             sage: count = 0
             sage: max_tests = 1000
-            sage: while cur:  # long time
+            sage: while cur:
             ....:     count += 1
             ....:     if count >= max_tests:
             ....:         break

diff --git a/src/sage/groups/cubic_braid.py b/src/sage/groups/cubic_braid.py
@@ -1519,7 +1519,8 @@ def as_matrix_group(self, root_bur=None, domain=None, characteristic=None, var='
             [2*t + 1       0 2*t + 2     3*t 3*t + 3]
             [2*t + 2       0       0 3*t + 4       0]
             [     0       0 2*t + 2 3*t + 4       0]
-            sage: m_back = C5(m); m_back == c  # long time
+            sage: m_back = C5(m)
+            sage: m_back == c
             True
             sage: U5 = AssionGroupU(5); U5
             Assion group on 5 strands of type U

diff --git a/src/sage/groups/lie_gps/nilpotent_lie_group.py b/src/sage/groups/lie_gps/nilpotent_lie_group.py
@@ -48,7 +48,7 @@ def _symbolic_lie_algebra_copy(L):
         sage: L_SR = _symbolic_lie_algebra_copy(L)
         sage: L.structure_coefficients()
         Finite family {((1,), (2,)): X_12}
-        sage: L_SR.structure_coefficients()  # long time
+        sage: L_SR.structure_coefficients()
         Finite family {((1,), (2,)): L[(1, 2)]}
 
     TESTS:

diff --git a/src/sage/groups/perm_gps/cubegroup.py b/src/sage/groups/perm_gps/cubegroup.py
@@ -1086,10 +1086,10 @@ def solve(self, state, algorithm='default'):
 
             sage: rubik = CubeGroup()
             sage: state = rubik.faces("R")
-            sage: rubik.solve(state)  # long time
+            sage: rubik.solve(state)
             'R'
             sage: state = rubik.faces("R*U")
-            sage: rubik.solve(state, algorithm='gap')  # long time
+            sage: rubik.solve(state, algorithm='gap')       # long time
             'R*U'
 
         You can also check this another (but similar) way using the

diff --git a/src/sage/groups/perm_gps/permgroup.py b/src/sage/groups/perm_gps/permgroup.py
@@ -1236,9 +1236,9 @@ def iteration(self, algorithm="SGS"):
 
             sage: sum(1 for x in A.iteration()) == 60000
             True
-            sage: sum(1 for x in A.iteration(algorithm="BFS")) == 60000  # long time
+            sage: sum(1 for x in A.iteration(algorithm="BFS")) == 60000
             True
-            sage: sum(1 for x in A.iteration(algorithm="DFS")) == 60000  # long time
+            sage: sum(1 for x in A.iteration(algorithm="DFS")) == 60000
             True
         """
         if algorithm == "SGS":

diff --git a/src/sage/groups/perm_gps/permgroup_element.pyx b/src/sage/groups/perm_gps/permgroup_element.pyx
@@ -851,14 +851,14 @@ cdef class PermutationGroupElement(MultiplicativeGroupElement):
             sage: S(p_libgap) == p
             True
 
-            sage: # long time, needs sage.rings.finite_rings
+            sage: # needs sage.rings.finite_rings
             sage: P = PGU(8,2)
             sage: p, q = P.gens()
             sage: p_libgap  = p.gap()
 
         TESTS::
 
-            sage: # long time, needs sage.rings.finite_rings
+            sage: # needs sage.rings.finite_rings
             sage: P = PGU(8,2)
             sage: p, q = P.gens()
             sage: p_pexpect = gap(p)

diff --git a/src/sage/groups/perm_gps/permgroup_named.py b/src/sage/groups/perm_gps/permgroup_named.py
@@ -1986,7 +1986,7 @@ def __init__(self):
             sage: S = TransitiveGroups()
             sage: S.category()
             Category of facade infinite enumerated sets
-            sage: TestSuite(TransitiveGroups()).run()  # long time
+            sage: TestSuite(TransitiveGroups()).run()
         """
         DisjointUnionEnumeratedSets.__init__(self,
                                              Family(NonNegativeIntegers(),
@@ -3479,7 +3479,7 @@ class SmallPermutationGroup(PermutationGroup_generic):
         [ 2  0 -2 -1  0  1]
         [ 2  0  2 -1  0 -1]
         sage: def numgps(n): return ZZ(libgap.NumberSmallGroups(n))
-        sage: all(SmallPermutationGroup(n,k).id() == [n,k]  # long time
+        sage: all(SmallPermutationGroup(n,k).id() == [n,k]
         ....:     for n in [1..64] for k in [1..numgps(n)])
         True
         sage: H = SmallPermutationGroup(6,1)

diff --git a/src/sage/interfaces/fricas.py b/src/sage/interfaces/fricas.py
@@ -1705,12 +1705,12 @@ def _sage_expression(fricas_InputForm):
             sage: f = fricas.zerosOf(y^4 + y + 1, y); f
                         +-----------------------------+
                         |       2                    2
-                       \|- 3 %y1  - 2 %y0 %y1 - 3 %y0   - %y1 -- %y0
+                       \|- 3 %y1  - 2 %y0 %y1 - 3 %y0   - %y1 - %y0
             [%y0, %y1, --------------------------------------------,
                                              2
                 +-----------------------------+
                 |       2                    2
-             - \|- 3 %y1  - 2 %y0 %y1 - 3 %y0   - %y1 -- %y0
+             - \|- 3 %y1  - 2 %y0 %y1 - 3 %y0   - %y1 - %y0
              ----------------------------------------------]
                                     2
 

diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py
@@ -3046,7 +3046,7 @@ def hilbert_series(self, grading=None, algorithm='sage'):
             sage: J.hilbert_series(grading=(10,3))                                      # needs sage.libs.flint
             (t^25 + t^24 + t^23 - t^15 - t^14 - t^13 - t^12 - t^11
              - t^10 - t^9 - t^8 - t^7 - t^6 - t^5 - t^4 - t^3 - t^2
-             - t -- 1)/(t^12 + t^11 + t^10 - t^2 - t - 1)
+             - t - 1)/(t^12 + t^11 + t^10 - t^2 - t - 1)
 
             sage: K = R.ideal([a^2*b^3, a*b^4 + a^3*b^2])
             sage: K.hilbert_series(grading=[1,2])                                       # needs sage.libs.flint