diff --git a/.github/workflows/ci-conda-known-test-failures.json b/.github/workflows/ci-conda-known-test-failures.json index 3d1518255d5..5bf42869869 100644 --- a/.github/workflows/ci-conda-known-test-failures.json +++ b/.github/workflows/ci-conda-known-test-failures.json @@ -1,80 +1,5 @@ { - "doc.en.constructions.calculus": { - "failed": "unreported random failures in plotting" - }, - "sage_setup.clean": { - "failed": "_find_stale_files finds some stale files under sage/tests when executed under conda" - }, - "sage.algebras.fusion_rings.fusion_ring": { - "failed": "unreported random timeouts" - }, - "sage.combinat.cluster_algebra_quiver.quiver": { - "failed": "failure seen in https://github.com/sagemath/sage/actions/runs/6836592771/job/18591690058#step:11:10059" - }, - "sage.geometry.cone": { - "failed": "unreported random timeouts seen in https://github.com/sagemath/sage/actions/runs/6827937663/job/18571052628#step:11:12362" - }, - "sage.groups.matrix_gps.finitely_generated_gap": { - "failed": true - }, - "sage.interfaces.expect": { - "failed": true - }, "sage.libs.gap.element": { - "failed": "failure seen in https://github.com/sagemath/sage/actions/runs/6840579851/job/18600012965#step:11:13016" - }, - "sage.libs.singular.singular": { - "failed": true - }, - "sage.matrix.matrix2": { - "failed": "failure seen in https://github.com/sagemath/sage/actions/runs/6835143781/job/18588599649#step:11:16939" - }, - "sage.matrix.matrix_integer_sparse": { - "failed": "failure seen in https://github.com/sagemath/sage/actions/runs/6827937663/job/18571052628#step:11:12362" - }, - "sage.misc.lazy_import": { - "failed": true - }, - "sage.misc.weak_dict": { - "failed": "failure seen in https://github.com/sagemath/sage/actions/runs/6870325919/job/18684964234#step:11:10059" - }, - "sage.modular.modform.l_series_gross_zagier": { - "failed": "unreported failure seen in https://github.com/sagemath/sage/actions/runs/6859244281/job/18651257775#step:11:10102" - }, - "sage.numerical.linear_tensor_element": { - "failed": "random segfaults https://github.com/sagemath/sage/issues/28559" - }, - "sage.parallel.map_reduce": { - "failed": "random failure https://github.com/sagemath/sage/issues/36939" - }, - "sage.plot.plot": { - "failed": "unreported random failure (macOS)" - }, - "sage.rings.function_field.drinfeld_modules.morphism": { - "failed": "unreported random failure seen in https://github.com/sagemath/sage/actions/runs/6840502530/job/18599835766#step:11:10107" - }, - "sage.rings.polynomial.multi_polynomial_ideal": { - "failed": true - }, - "sage.rings.polynomial.multi_polynomial_libsingular": { - "failed": true - }, - "sage.rings.polynomial.polynomial_element": { - "failed": "unreported random failure in symbolic 'roots' (macOS)" - }, - "sage.rings.polynomial.skew_polynomial_finite_field": { - "failed": true - }, - "sage.schemes.elliptic_curves.descent_two_isogeny": { - "failed": "random segfault (macOS) https://github.com/sagemath/sage/issues/36949" - }, - "sage.schemes.elliptic_curves.ell_field": { - "failed": "random failure https://github.com/sagemath/sage/issues/36832" - }, - "sage.sets.recursively_enumerated_set": { - "failed": "random failures related to AlarmInterrupt (macOS)" - }, - "sage.structure.coerce_actions": { - "failed": "random failure https://github.com/sagemath/sage/issues/35973" + "failed": "https://github.com/sagemath/sage/issues/37289" } } diff --git a/src/doc/en/constructions/calculus.rst b/src/doc/en/constructions/calculus.rst index b6243b64dbc..9379b63ccdf 100644 --- a/src/doc/en/constructions/calculus.rst +++ b/src/doc/en/constructions/calculus.rst @@ -387,7 +387,7 @@ are obtained via ``fourier_series_partial_sum``:: -6/5/pi sage: s5 = f.fourier_series_partial_sum(5); s5 -6/5*sin(10*x)/pi - 2*sin(6*x)/pi - 6*sin(2*x)/pi + 1/2 - sage: plot(f, (0,pi)) + plot(s5, (x,0,pi), color='red') + sage: plot(f, (0,pi)) + plot(s5, (x,0,pi), color='red') # known bug: macos (sporadic failures) Graphics object consisting of 2 graphics primitives .. PLOT:: diff --git a/src/sage/algebras/clifford_algebra.py b/src/sage/algebras/clifford_algebra.py index 64ba03acf87..1359ec0009b 100644 --- a/src/sage/algebras/clifford_algebra.py +++ b/src/sage/algebras/clifford_algebra.py @@ -2449,7 +2449,7 @@ def __init__(self, E, s_coeff): sage: E. = ExteriorAlgebra(QQ) sage: d = E.coboundary({(0,1): z, (1,2):x, (2,0):y}) - sage: TestSuite(d).run() # known bug - morphisms are properly in a category + sage: TestSuite(d).run() # known bug (morphisms are properly in a category) """ # Construct the dictionary of costructure coefficients, i.e. given # [x_j, x_k] = \sum_i s_{jk}^i x_i, we get x^i |-> \sum_{j0) - sage: limit(x^a,x=0) # random - maxima 5.46.0 does not need extra assumption + sage: limit(x^a,x=0) # known bug (maxima 5.46.0 does not need extra assumption) Traceback (most recent call last): ... ValueError: Computation failed since Maxima requested additional @@ -1244,7 +1244,7 @@ def limit(ex, dir=None, taylor=False, algorithm='maxima', **argv): more details) Is a an integer? sage: assume(a,'integer') - sage: limit(x^a, x=0) # random - maxima 5.46.0 does not need extra assumption + sage: limit(x^a, x=0) # known bug (maxima 5.46.0 does not need extra assumption) Traceback (most recent call last): ... ValueError: Computation failed since Maxima requested additional @@ -1668,9 +1668,9 @@ def laplace(ex, t, s, algorithm='maxima'): sage: laplace(dirac_delta(t), t, s) 1 sage: F, a, cond = laplace(dirac_delta(t), t, s, algorithm='sympy') - sage: a, cond # random - sympy <1.10 gives (-oo, True) + sage: a, cond # known bug (sympy <1.10 gives (-oo, True)) (0, True) - sage: F # random - sympy <1.9 includes undefined heaviside(0) in answer + sage: F # known bug (sympy <1.9 includes undefined heaviside(0) in answer) 1 sage: laplace(dirac_delta(t), t, s, algorithm='giac') 1 diff --git a/src/sage/calculus/transforms/dft.py b/src/sage/calculus/transforms/dft.py index 1b165fa6503..27337531f98 100644 --- a/src/sage/calculus/transforms/dft.py +++ b/src/sage/calculus/transforms/dft.py @@ -798,10 +798,10 @@ def idwt(self, other="haar", wavelet_k=2): sage: A = [RR(1) for i in J] sage: s = IndexedSequence(A,J) sage: t = s.dwt() - sage: t # random arch dependent output + sage: t # known bug (arch dependent output) Indexed sequence: [2.82842712474999, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000] indexed by [0, 1, 2, 3, 4, 5, 6, 7] - sage: t.idwt() # random arch dependent output + sage: t.idwt() # known bug (arch dependent output) Indexed sequence: [1.00000000000000, 1.00000000000000, 1.00000000000000, 1.00000000000000, 1.00000000000000, 1.00000000000000, 1.00000000000000, 1.00000000000000] indexed by [0, 1, 2, 3, 4, 5, 6, 7] sage: t.idwt() == s @@ -810,7 +810,7 @@ def idwt(self, other="haar", wavelet_k=2): sage: A = [RR(1) for i in J] sage: s = IndexedSequence(A,J) sage: t = s.dwt("bspline", 103) - sage: t # random arch dependent output + sage: t # known bug (arch dependent output) Indexed sequence: [4.00000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000, 0.000000000000000] indexed by [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15] sage: t.idwt("bspline", 103) == s diff --git a/src/sage/categories/sets_cat.py b/src/sage/categories/sets_cat.py index df0e3abee86..a80eeb1bebf 100644 --- a/src/sage/categories/sets_cat.py +++ b/src/sage/categories/sets_cat.py @@ -1735,7 +1735,7 @@ def _sympy_(self): sage: list(sF) [1, 2, 3] sage: from sympy import FiniteSet - sage: FiniteSet.fromiter(sF) # random - this output is sympy >= 1.9 + sage: FiniteSet.fromiter(sF) # known bug (this output is sympy >= 1.9) FiniteSet(1, 2, 3) sage: RR._sympy_().is_finite_set # needs sympy diff --git a/src/sage/combinat/sf/sfa.py b/src/sage/combinat/sf/sfa.py index 292c6c499fd..51933623626 100644 --- a/src/sage/combinat/sf/sfa.py +++ b/src/sage/combinat/sf/sfa.py @@ -6456,7 +6456,7 @@ def _variables_recursive(R, include=None, exclude=None): sage: _variables_recursive(R.fraction_field(), exclude=[b]) [a] - sage: _variables_recursive(S.fraction_field(), exclude=[b]) # known bug + sage: _variables_recursive(S.fraction_field(), exclude=[b]) # known bug [a, t] """ if include is not None and exclude is not None: diff --git a/src/sage/doctest/parsing.py b/src/sage/doctest/parsing.py index 3e5b0a98975..b9c66a16879 100644 --- a/src/sage/doctest/parsing.py +++ b/src/sage/doctest/parsing.py @@ -871,14 +871,12 @@ class SageDocTestParser(doctest.DocTestParser): A version of the standard doctest parser which handles Sage's custom options and tolerances in floating point arithmetic. """ - long: bool file_optional_tags: set[str] optional_tags: Union[bool, set[str]] optional_only: bool optionals: dict[str, int] probed_tags: set[str] - def __init__(self, optional_tags=(), long=False, *, probed_tags=(), file_optional_tags=()): r""" INPUT: diff --git a/src/sage/geometry/cone.py b/src/sage/geometry/cone.py index 3a35e078173..87532d9e48a 100644 --- a/src/sage/geometry/cone.py +++ b/src/sage/geometry/cone.py @@ -5740,7 +5740,7 @@ def positive_operators_gens(self, K2=None): sage: pi_cone = Cone((g.list() for g in pi_gens), ....: lattice=L, ....: check=False) - sage: K.is_proper() == pi_cone.is_proper() + sage: K.is_proper() == pi_cone.is_proper() # known bug: macos (sporadic timeouts) True The positive operators on a permuted cone can be obtained by @@ -6363,9 +6363,8 @@ def random_cone(lattice=None, min_ambient_dim=0, max_ambient_dim=None, Or one that isn't strictly convex:: - sage: K = random_cone(min_ambient_dim=5, min_rays=2, - ....: strictly_convex=False) - sage: K.is_strictly_convex() + sage: K = random_cone(min_ambient_dim=5, min_rays=2, strictly_convex=False) # known bug: macos (sporadic timeouts) + sage: K.is_strictly_convex() # known bug: macos (sporadic timeouts) False An example with all parameters set:: diff --git a/src/sage/interfaces/expect.py b/src/sage/interfaces/expect.py index 80f22b33657..7af1ba7c7ad 100644 --- a/src/sage/interfaces/expect.py +++ b/src/sage/interfaces/expect.py @@ -1217,7 +1217,7 @@ def _expect_expr(self, expr=None, timeout=None): A quick consistency check on the time that the above took:: - sage: w = walltime(t); 0.3 < w < 10 + sage: w = walltime(t); 0.3 < w < 10 # known bug: sporadic failure True We tell Singular to print abc, which equals 25:: diff --git a/src/sage/interfaces/gap.py b/src/sage/interfaces/gap.py index 4b9e619ae3d..8e05bb6f2d1 100644 --- a/src/sage/interfaces/gap.py +++ b/src/sage/interfaces/gap.py @@ -278,7 +278,7 @@ def _synchronize(self, timeout=0.5, cmd='%s;'): sage: gap._expect.sendline() # now we are out of sync 1 sage: gap._synchronize() - sage: gap(123) + sage: gap(123) # known bug: macos (sporadic test failures, #37298) 123 """ if self._expect is None: diff --git a/src/sage/interfaces/sympy.py b/src/sage/interfaces/sympy.py index 0735691d279..37854c60c18 100644 --- a/src/sage/interfaces/sympy.py +++ b/src/sage/interfaces/sympy.py @@ -622,7 +622,7 @@ def _sympysage_ff(self): sage: from sympy import Symbol, ff sage: _ = var('x, y') sage: ffxy = ff(Symbol('x'), Symbol('y')) - sage: assert falling_factorial(x,y)._sympy_() == ffxy.rewrite('gamma') # known bug + sage: assert falling_factorial(x,y)._sympy_() == ffxy.rewrite('gamma') # known bug sage: assert falling_factorial(x,y) == ffxy._sage_() """ from sage.arith.misc import falling_factorial diff --git a/src/sage/libs/gap/element.pyx b/src/sage/libs/gap/element.pyx index ab9a2860cb4..e1a31936332 100644 --- a/src/sage/libs/gap/element.pyx +++ b/src/sage/libs/gap/element.pyx @@ -1149,13 +1149,13 @@ cdef class GapElement(RingElement): ... AlarmInterrupt - sage: libgap.CyclicGroup(2) ^ 2 + sage: libgap.CyclicGroup(2) ^ 2 # known bug (sporadic segmentation fault, #37289) Traceback (most recent call last): ... GAPError: Error, no method found! Error, no 1st choice method found for `^' on 2 arguments - sage: libgap(3) ^ Infinity + sage: libgap(3) ^ Infinity # known bug (sporadic segmentation fault, #37289) Traceback (most recent call last): ... GAPError: Error, no method found! Error, no 1st choice @@ -1174,7 +1174,7 @@ cdef class GapElement(RingElement): """ TESTS:: - sage: libgap(5)._pow_int(int(2)) + sage: libgap(5)._pow_int(int(2)) # known bug (sporadic segmentation fault, #37289) 25 """ return self._pow_(self._parent(other)) @@ -1189,6 +1189,7 @@ cdef class GapElement(RingElement): EXAMPLES:: + sage: # known bug (sporadic segmentation fault, #37289) sage: a = libgap.eval("NormalSubgroups") sage: a.is_function() True @@ -1208,9 +1209,9 @@ cdef class GapElement(RingElement): EXAMPLES:: - sage: libgap.eval('[1, 2,,,, 5]').is_list() + sage: libgap.eval('[1, 2,,,, 5]').is_list() # known bug (sporadic segmentation fault, #37289) True - sage: libgap.eval('3/2').is_list() + sage: libgap.eval('3/2').is_list() # known bug (sporadic segmentation fault, #37289) False """ return GAP_IsList(self.value) @@ -1225,9 +1226,9 @@ cdef class GapElement(RingElement): EXAMPLES:: - sage: libgap.eval('[1, 2,,,, 5]').is_record() + sage: libgap.eval('[1, 2,,,, 5]').is_record() # known bug (sporadic segmentation fault, #37289) False - sage: libgap.eval('rec(a:=1, b:=3)').is_record() + sage: libgap.eval('rec(a:=1, b:=3)').is_record() # known bug (sporadic segmentation fault, #37289) True """ return GAP_IsRecord(self.value) @@ -1242,7 +1243,7 @@ cdef class GapElement(RingElement): EXAMPLES:: - sage: libgap(True).is_bool() + sage: libgap(True).is_bool() # known bug (sporadic segmentation fault, #37289) True """ libgap = self.parent() @@ -1275,9 +1276,9 @@ cdef class GapElement(RingElement): EXAMPLES:: - sage: perm = libgap.PermList( libgap([1,5,2,3,4]) ); perm + sage: perm = libgap.PermList( libgap([1,5,2,3,4]) ); perm # known bug (sporadic segmentation fault, #37289) (2,5,4,3) - sage: perm.is_permutation() + sage: perm.is_permutation() # known bug (sporadic segmentation fault, #37289) True sage: libgap('this is a string').is_permutation() False @@ -1291,22 +1292,22 @@ cdef class GapElement(RingElement): EXAMPLES:: - sage: libgap(1).sage() + sage: libgap(1).sage() # known bug (sporadic segmentation fault, #37289) 1 - sage: type(_) + sage: type(_) # known bug (sporadic segmentation fault, #37289) - sage: libgap(3/7).sage() + sage: libgap(3/7).sage() # known bug (sporadic segmentation fault, #37289) 3/7 - sage: type(_) + sage: type(_) # known bug (sporadic segmentation fault, #37289) - sage: libgap.eval('5 + 7*E(3)').sage() + sage: libgap.eval('5 + 7*E(3)').sage() # known bug (sporadic segmentation fault, #37289) 7*zeta3 + 5 - sage: libgap(Infinity).sage() + sage: libgap(Infinity).sage() # known bug (sporadic segmentation fault, #37289) +Infinity - sage: libgap(-Infinity).sage() + sage: libgap(-Infinity).sage() # known bug (sporadic segmentation fault, #37289) -Infinity sage: libgap(True).sage() @@ -1321,34 +1322,34 @@ cdef class GapElement(RingElement): sage: type(_) <... 'str'> - sage: x = libgap.Integers.Indeterminate("x") + sage: x = libgap.Integers.Indeterminate("x") # known bug (sporadic segmentation fault, #37289) - sage: p = x^2 - 2*x + 3 - sage: p.sage() + sage: p = x^2 - 2*x + 3 # known bug (sporadic segmentation fault, #37289) + sage: p.sage() # known bug (sporadic segmentation fault, #37289) x^2 - 2*x + 3 - sage: p.sage().parent() + sage: p.sage().parent() # known bug (sporadic segmentation fault, #37289) Univariate Polynomial Ring in x over Integer Ring - sage: p = x^-2 + 3*x - sage: p.sage() + sage: p = x^-2 + 3*x # known bug (sporadic segmentation fault, #37289) + sage: p.sage() # known bug (sporadic segmentation fault, #37289) x^-2 + 3*x - sage: p.sage().parent() + sage: p.sage().parent() # known bug (sporadic segmentation fault, #37289) Univariate Laurent Polynomial Ring in x over Integer Ring - sage: p = (3 * x^2 + x) / (x^2 - 2) - sage: p.sage() + sage: p = (3 * x^2 + x) / (x^2 - 2) # known bug (sporadic segmentation fault, #37289) + sage: p.sage() # known bug (sporadic segmentation fault, #37289) (3*x^2 + x)/(x^2 - 2) - sage: p.sage().parent() + sage: p.sage().parent() # known bug (sporadic segmentation fault, #37289) Fraction Field of Univariate Polynomial Ring in x over Integer Ring TESTS: Check :trac:`30496`:: - sage: x = libgap.Integers.Indeterminate("x") + sage: x = libgap.Integers.Indeterminate("x") # known bug (sporadic segmentation fault, #37289) - sage: p = x^2 - 2*x - sage: p.sage() + sage: p = x^2 - 2*x # known bug (sporadic segmentation fault, #37289) + sage: p.sage() # known bug (sporadic segmentation fault, #37289) x^2 - 2*x """ if self.value is NULL: @@ -1407,9 +1408,9 @@ cdef GapElement_Integer make_GapElement_Integer(parent, Obj obj) noexcept: EXAMPLES:: - sage: libgap(123) + sage: libgap(123) # known bug (sporadic segmentation fault, #37289) 123 - sage: type(_) + sage: type(_) # known bug (sporadic segmentation fault, #37289) """ cdef GapElement_Integer r = GapElement_Integer.__new__(GapElement_Integer) @@ -1423,10 +1424,10 @@ cdef class GapElement_Integer(GapElement): EXAMPLES:: - sage: i = libgap(123) - sage: type(i) + sage: i = libgap(123) # known bug (sporadic segmentation fault, #37289) + sage: type(i) # known bug (sporadic segmentation fault, #37289) - sage: ZZ(i) + sage: ZZ(i) # known bug (sporadic segmentation fault, #37289) 123 """ @@ -1444,6 +1445,7 @@ cdef class GapElement_Integer(GapElement): EXAMPLES:: + sage: # known bug (sporadic segmentation fault, #37289) sage: n = libgap(1) sage: type(n) @@ -1452,6 +1454,7 @@ cdef class GapElement_Integer(GapElement): sage: n.IsInt() true + sage: # known bug (sporadic segmentation fault, #37289) sage: N = libgap(2^130) sage: type(N) diff --git a/src/sage/matrix/matrix2.pyx b/src/sage/matrix/matrix2.pyx index 3f0ddb6d84a..a0d54b9594d 100644 --- a/src/sage/matrix/matrix2.pyx +++ b/src/sage/matrix/matrix2.pyx @@ -152,19 +152,19 @@ cdef class Matrix(Matrix1): sage: A = matrix(QQ, 3, [1,2,4,2,3,1,0,1,2]) sage: B = matrix(QQ, 3, 2, [1,7,5, 2,1,3]) - sage: C = A._backslash_(B); C + sage: C = A._backslash_(B); C # known bug (sporadic timeouts) doctest:...: DeprecationWarning: the backslash operator has been deprecated; use A.solve_right(B) instead See https://github.com/sagemath/sage/issues/36394 for details. [ -1 1] [13/5 -3/5] [-4/5 9/5] - sage: A*C == B + sage: A*C == B # known bug (sporadic timeouts) True - sage: A._backslash_(B) == A \ B + sage: A._backslash_(B) == A \ B # known bug (sporadic timeouts) doctest:...: DeprecationWarning: the backslash operator has been deprecated; use A.solve_right(B) instead See https://github.com/sagemath/sage/issues/36394 for details. True - sage: A._backslash_(B) == A.solve_right(B) + sage: A._backslash_(B) == A.solve_right(B) # known bug (sporadic timeouts) True """ deprecation(36394, 'the backslash operator has been deprecated; use A.solve_right(B) instead') diff --git a/src/sage/matrix/matrix_gap.pyx b/src/sage/matrix/matrix_gap.pyx index 9e1d1066a48..b17f3fb7337 100644 --- a/src/sage/matrix/matrix_gap.pyx +++ b/src/sage/matrix/matrix_gap.pyx @@ -63,7 +63,7 @@ cdef class Matrix_gap(Matrix_dense): sage: rings = [ZZ, QQ, UniversalCyclotomicField(), GF(2), GF(3)] sage: rings += [UniversalCyclotomicField()] # needs sage.rings.number_field - sage: for ring in rings: + sage: for ring in rings: # known bug: linux (sporadic segfaults, #37295) ....: M = MatrixSpace(ring, 2, implementation='gap') ....: TestSuite(M).run(skip=['_test_construction']) ....: M = MatrixSpace(ring, 2, 3, implementation='gap') diff --git a/src/sage/modular/modform/l_series_gross_zagier.py b/src/sage/modular/modform/l_series_gross_zagier.py index 28acdeeb978..c25c07df4ee 100644 --- a/src/sage/modular/modform/l_series_gross_zagier.py +++ b/src/sage/modular/modform/l_series_gross_zagier.py @@ -104,7 +104,7 @@ def taylor_series(self, s=1, series_prec=6, var='z'): sage: A = K.class_group().gen(0) sage: from sage.modular.modform.l_series_gross_zagier import GrossZagierLseries sage: G = GrossZagierLseries(e, A) - sage: G.taylor_series(2,3) + sage: G.taylor_series(2,3) # known bug: macos (sporadic failures) -0.613002046122894 + 0.490374999263514*z - 0.122903033710382*z^2 + O(z^3) """ return self._dokchister.taylor_series(s, series_prec, var) diff --git a/src/sage/modules/with_basis/indexed_element.pyx b/src/sage/modules/with_basis/indexed_element.pyx index f366fe1bdf1..2bb1cb6a751 100644 --- a/src/sage/modules/with_basis/indexed_element.pyx +++ b/src/sage/modules/with_basis/indexed_element.pyx @@ -45,7 +45,7 @@ cdef class IndexedFreeModuleElement(ModuleElement): True sage: isinstance(f, collections.abc.Iterable) True - sage: isinstance(f, collections.abc.Collection) # known bug - will be fixed by removing __contains__ + sage: isinstance(f, collections.abc.Collection) # known bug (will be fixed by removing __contains__) False """ def __init__(self, M, x): diff --git a/src/sage/numerical/linear_tensor_element.pyx b/src/sage/numerical/linear_tensor_element.pyx index e2c88619469..5f44b878d82 100644 --- a/src/sage/numerical/linear_tensor_element.pyx +++ b/src/sage/numerical/linear_tensor_element.pyx @@ -6,7 +6,7 @@ Here is an example of a linear function tensored with a vector space:: sage: mip. = MixedIntegerLinearProgram('ppl') # base ring is QQ sage: lt = x[0] * vector([3,4]) + 1; lt (1, 1) + (3, 4)*x_0 - sage: type(lt) + sage: type(lt) # known bug (sporadic abort error, see #28559) """ @@ -380,12 +380,12 @@ cdef class LinearTensor(ModuleElement): sage: x[0] * vector([1,2]) == x[1] * vector([2,3]) (1.0, 2.0)*x_0 == (2.0, 3.0)*x_1 - sage: x[0] * vector([1,2]) < x[1] * vector([2,3]) + sage: x[0] * vector([1,2]) < x[1] * vector([2,3]) # known bug (sporadic abort error, see #28559) Traceback (most recent call last): ... ValueError: strict < is not allowed, use <= instead. - sage: x[0] * vector([1,2]) > x[1] * vector([2,3]) + sage: x[0] * vector([1,2]) > x[1] * vector([2,3]) # known bug (sporadic abort error, see #28559) Traceback (most recent call last): ... ValueError: strict > is not allowed, use >= instead. diff --git a/src/sage/parallel/map_reduce.py b/src/sage/parallel/map_reduce.py index b71e695128b..d7d706961d4 100644 --- a/src/sage/parallel/map_reduce.py +++ b/src/sage/parallel/map_reduce.py @@ -1149,20 +1149,20 @@ def start_workers(self): ....: return [] sage: S = RESetMapReduce(roots=[1, 2], children=children) sage: S.setup_workers(2) - sage: S.start_workers(); sleep(float(0.4)) + sage: S.start_workers(); sleep(float(0.4)) # known bug: macos (sporadic failures, see #36939) Starting: ... Starting: ... - sage: [w.is_alive() for w in S._workers] + sage: [w.is_alive() for w in S._workers] # known bug: macos (sporadic failures, see #36939) [True, True] - sage: sleep(float(1.5)) + sage: sleep(float(1.5)) # known bug: macos (sporadic failures, see #36939) Finished: ... Finished: ... - sage: [not w.is_alive() for w in S._workers] + sage: [not w.is_alive() for w in S._workers] # known bug: macos (sporadic failures, see #36939) [True, True] Cleanup:: - sage: S.finish() + sage: S.finish() # known bug: macos (sporadic failures, see #36939) """ if self._nprocess == 0: raise ValueError("No process connected") diff --git a/src/sage/plot/plot.py b/src/sage/plot/plot.py index b25ba785326..20cdf3b67c6 100644 --- a/src/sage/plot/plot.py +++ b/src/sage/plot/plot.py @@ -1852,7 +1852,7 @@ def g(x): return x**2-2*x-2 ``exclude`` and ``detect_poles`` can be used together:: sage: f(x) = (floor(x)+0.5) / (1-(x-0.5)^2) - sage: plot(f, (x, -3.5, 3.5), detect_poles='show', exclude=[-3..3], + sage: plot(f, (x, -3.5, 3.5), detect_poles='show', exclude=[-3..3], # known bug (sporadic failures, #35470) ....: ymin=-5, ymax=5) Graphics object consisting of 12 graphics primitives diff --git a/src/sage/rings/complex_interval.pyx b/src/sage/rings/complex_interval.pyx index 4b9e7f2aefa..52f8078e886 100644 --- a/src/sage/rings/complex_interval.pyx +++ b/src/sage/rings/complex_interval.pyx @@ -31,9 +31,9 @@ heavily modified: sage: ref = ComplexIntervalField(100)(ComplexBallField(100).one().airy_ai()) sage: ref 0.135292416312881415524147423515? - sage: val = CIF(airy_ai(1)); val # known bug + sage: val = CIF(airy_ai(1)); val # known bug 0.13529241631288142? - sage: val.overlaps(ref) # known bug + sage: val.overlaps(ref) # known bug False .. TODO:: diff --git a/src/sage/rings/function_field/drinfeld_modules/morphism.py b/src/sage/rings/function_field/drinfeld_modules/morphism.py index dfed15f778c..9818195c217 100644 --- a/src/sage/rings/function_field/drinfeld_modules/morphism.py +++ b/src/sage/rings/function_field/drinfeld_modules/morphism.py @@ -540,12 +540,12 @@ def __invert__(self): sage: K. = Fq.extension(3) sage: coeffs = [z] + [K.random_element() for _ in range(10)] sage: phi = DrinfeldModule(A, coeffs) - sage: f = phi.hom(K.random_element()) - sage: g = ~f + sage: f = phi.hom(K.random_element()) # known bug (sporadic ValueError: the input does not define an isogeny, #37071) + sage: g = ~f # known bug (sporadic ValueError: the input does not define an isogeny, #37071) - sage: (f*g).is_identity() + sage: (f*g).is_identity() # known bug (sporadic ValueError: the input does not define an isogeny, #37071) True - sage: (g*f).is_identity() + sage: (g*f).is_identity() # known bug (sporadic ValueError: the input does not define an isogeny, #37071) True """ diff --git a/src/sage/rings/polynomial/multi_polynomial_ideal.py b/src/sage/rings/polynomial/multi_polynomial_ideal.py index 2b828fba51b..c68785a6006 100644 --- a/src/sage/rings/polynomial/multi_polynomial_ideal.py +++ b/src/sage/rings/polynomial/multi_polynomial_ideal.py @@ -3147,7 +3147,7 @@ def hilbert_numerator(self, grading=None, algorithm='sage'): sage: n=4; m=11; P = PolynomialRing(QQ, n*m, "x"); x = P.gens(); M = Matrix(n, x) sage: I = P.ideal(M.minors(2)) sage: J = P * [m.lm() for m in I.groebner_basis()] - sage: J.hilbert_numerator(algorithm='singular') # known bug + sage: J.hilbert_numerator(algorithm='singular') # known bug Traceback (most recent call last): .... RuntimeError: error in Singular function call 'hilb': diff --git a/src/sage/rings/polynomial/multi_polynomial_sequence.py b/src/sage/rings/polynomial/multi_polynomial_sequence.py index 9519b2d0c90..2c2cc67a8c0 100644 --- a/src/sage/rings/polynomial/multi_polynomial_sequence.py +++ b/src/sage/rings/polynomial/multi_polynomial_sequence.py @@ -1557,7 +1557,7 @@ def solve(self, algorithm='polybori', n=1, eliminate_linear_variables=True, ver sage: sol = S.solve(algorithm='sat') # optional - pycryptosat # needs sage.rings.polynomial.pbori sage: print(reproducible_repr(sol)) # optional - pycryptosat # needs sage.rings.polynomial.pbori [{x: 0, y: 1, z: 0}] - sage: S.subs(sol[0]) # needs sage.rings.polynomial.pbori + sage: S.subs(sol[0]) # optional - pycryptosat # needs sage.rings.polynomial.pbori [0, 0, 0] TESTS: diff --git a/src/sage/rings/polynomial/polynomial_element.pyx b/src/sage/rings/polynomial/polynomial_element.pyx index 94d5854976a..4472146799d 100644 --- a/src/sage/rings/polynomial/polynomial_element.pyx +++ b/src/sage/rings/polynomial/polynomial_element.pyx @@ -8190,10 +8190,10 @@ cdef class Polynomial(CommutativePolynomial): sage: # needs sage.symbolic sage: X = var('X') - sage: f = expand((X - 1) * (X - I)^3 * (X^2 - sqrt(2))); f + sage: f = expand((X - 1) * (X - I)^3 * (X^2 - sqrt(2))); f # known bug: macos (sporadic failures) X^6 - (3*I + 1)*X^5 - sqrt(2)*X^4 + (3*I - 3)*X^4 + (3*I + 1)*sqrt(2)*X^3 + (I + 3)*X^3 - (3*I - 3)*sqrt(2)*X^2 - I*X^2 - (I + 3)*sqrt(2)*X + I*sqrt(2) - sage: f.roots() + sage: f.roots() # known bug: macos (sporadic failures) [(I, 3), (-2^(1/4), 1), (2^(1/4), 1), (1, 1)] The same operation, performed over a polynomial ring diff --git a/src/sage/rings/polynomial/skew_polynomial_finite_field.pyx b/src/sage/rings/polynomial/skew_polynomial_finite_field.pyx index 1a176288395..ac1b50e0e32 100644 --- a/src/sage/rings/polynomial/skew_polynomial_finite_field.pyx +++ b/src/sage/rings/polynomial/skew_polynomial_finite_field.pyx @@ -1080,7 +1080,7 @@ cdef class SkewPolynomial_finite_field_dense(SkewPolynomial_finite_order_dense): we can get different orderings:: sage: factorizations2 = [ F for F in a.factorizations() ] - sage: factorizations == factorizations2 # random + sage: factorizations == factorizations2 # known bug: linux (sporadic failure, see #36646) False sage: sorted(factorizations) == sorted(factorizations2) True diff --git a/src/sage/rings/real_mpfi.pyx b/src/sage/rings/real_mpfi.pyx index 47c24f7261b..cc9b03b5036 100644 --- a/src/sage/rings/real_mpfi.pyx +++ b/src/sage/rings/real_mpfi.pyx @@ -223,9 +223,9 @@ specified if given a non-interval and an interval:: sage: ref = RealIntervalField(100)(ComplexBallField(100).one().airy_ai().real()) sage: ref 0.135292416312881415524147423515? - sage: val = RIF(airy_ai(1)); val # known bug + sage: val = RIF(airy_ai(1)); val # known bug 0.13529241631288142? - sage: val.overlaps(ref) # known bug + sage: val.overlaps(ref) # known bug False TESTS:: diff --git a/src/sage/rings/tests.py b/src/sage/rings/tests.py index 3eed7e1aa31..d96e8c8531d 100644 --- a/src/sage/rings/tests.py +++ b/src/sage/rings/tests.py @@ -450,7 +450,7 @@ def test_karatsuba_multiplication(base_ring, maxdeg1, maxdeg2, Zero-tests over ``QQbar`` are currently very slow, so we test only very small examples:: - sage: test_karatsuba_multiplication(QQbar, 3, 3, numtests=2) # long time, needs sage.rings.number_field + sage: test_karatsuba_multiplication(QQbar, 3, 3, numtests=2) # known bug: linux (sporadic timeouts, see #35715), long time, needs sage.rings.number_field Larger degrees (over ``ZZ``, using FLINT):: diff --git a/src/sage/sandpiles/sandpile.py b/src/sage/sandpiles/sandpile.py index 57838f7647b..d4f2d488b46 100644 --- a/src/sage/sandpiles/sandpile.py +++ b/src/sage/sandpiles/sandpile.py @@ -5115,7 +5115,7 @@ def _set_linear_system(self): sage: S = sandpiles.Cycle(3) sage: D = SandpileDivisor(S, [0,1,1]) - sage: D._set_linear_system() # known bug (won't fix due to deprecation optional - 4ti2) + sage: D._set_linear_system() # known bug (won't fix due to deprecation optional - 4ti2) .. WARNING:: diff --git a/src/sage/schemes/elliptic_curves/ell_field.py b/src/sage/schemes/elliptic_curves/ell_field.py index 6bd9960ce58..6713993983b 100644 --- a/src/sage/schemes/elliptic_curves/ell_field.py +++ b/src/sage/schemes/elliptic_curves/ell_field.py @@ -1049,11 +1049,11 @@ def division_field(self, n, names='t', map=False, **kwds): ....: continue ....: break sage: l = random_prime(8) - sage: K = E.division_field(l) - sage: n = E.cardinality(extension_degree=K.degree()//F.degree()) - sage: (l^2 if q%l else 0 + E.is_ordinary()).divides(n) + sage: K = E.division_field(l) # known bug (sporadic TypeError, see #36832) + sage: n = E.cardinality(extension_degree=K.degree()//F.degree()) # known bug (sporadic TypeError, see #36832) + sage: (l^2 if q%l else 0 + E.is_ordinary()).divides(n) # known bug (sporadic TypeError, see #36832) True - sage: check(E, l, K) # long time + sage: check(E, l, K) # known bug (sporadic TypeError, see #36832) AUTHORS: diff --git a/src/sage/schemes/elliptic_curves/ell_finite_field.py b/src/sage/schemes/elliptic_curves/ell_finite_field.py index 367d79f703a..cde9144c020 100644 --- a/src/sage/schemes/elliptic_curves/ell_finite_field.py +++ b/src/sage/schemes/elliptic_curves/ell_finite_field.py @@ -1799,6 +1799,7 @@ def twists(self): sage: A,B = polygens(F, 'A,B') sage: eq = 1728*4*A**3 - j * (4*A**3 + 27*B**2) sage: twists2 = [] + sage: # known bug: macos (sporadic ValueError, #37294) sage: for _ in range(10): ....: I = Ideal([eq, A + B - F.random_element()]) ....: try: diff --git a/src/sage/schemes/elliptic_curves/ell_rational_field.py b/src/sage/schemes/elliptic_curves/ell_rational_field.py index f4f13c112dc..0abc9607722 100644 --- a/src/sage/schemes/elliptic_curves/ell_rational_field.py +++ b/src/sage/schemes/elliptic_curves/ell_rational_field.py @@ -3603,7 +3603,7 @@ def lseries_gross_zagier(self, A): These should be equal:: - sage: L(2) + E.lseries_gross_zagier(A^2)(2) + sage: L(2) + E.lseries_gross_zagier(A^2)(2) # known bug: macos (sporadic RuntimeError, #37293) 0.502803417587467 sage: E.lseries()(2) * E.quadratic_twist(-40).lseries()(2) 0.502803417587467 diff --git a/src/sage/schemes/elliptic_curves/hom_frobenius.py b/src/sage/schemes/elliptic_curves/hom_frobenius.py index 0c1254e15b0..8827dc390d6 100644 --- a/src/sage/schemes/elliptic_curves/hom_frobenius.py +++ b/src/sage/schemes/elliptic_curves/hom_frobenius.py @@ -67,7 +67,7 @@ over Finite Field in z6 of size 17^6 sage: pihat.is_separable() True - sage: pihat * pi == EllipticCurveHom_scalar(E,17) # known bug -- #6413 + sage: pihat * pi == EllipticCurveHom_scalar(E,17) # known bug (#6413) True A supersingular example (with purely inseparable dual):: @@ -462,7 +462,7 @@ def dual(self): True sage: f * f.dual() == EllipticCurveHom_scalar(f.codomain(), p**n) True - sage: f.dual().dual() == f # known bug -- broken in characteristic 2,3 + sage: f.dual().dual() == f # known bug (broken in characteristic 2,3) True sage: p in (2,3) or f.dual().dual() == f True diff --git a/src/sage/schemes/toric/morphism.py b/src/sage/schemes/toric/morphism.py index d6687a3e790..6c2563a39c1 100644 --- a/src/sage/schemes/toric/morphism.py +++ b/src/sage/schemes/toric/morphism.py @@ -281,7 +281,7 @@ We see that codomain fan of this morphism is a projective plane, which can be verified by :: - sage: phi_d.codomain().fan().is_isomorphic(toric_varieties.P2().fan()) # known bug + sage: phi_d.codomain().fan().is_isomorphic(toric_varieties.P2().fan()) # known bug True (Unfortunately it cannot be verified correctly until :trac:`16012` is fixed.) diff --git a/src/sage/sets/recursively_enumerated_set.pyx b/src/sage/sets/recursively_enumerated_set.pyx index 66720d924e5..74528714d29 100644 --- a/src/sage/sets/recursively_enumerated_set.pyx +++ b/src/sage/sets/recursively_enumerated_set.pyx @@ -1159,11 +1159,11 @@ cdef class RecursivelyEnumeratedSet_symmetric(RecursivelyEnumeratedSet_generic): sage: next(it) {-1, 1} sage: from cysignals.alarm import alarm - sage: alarm(0.02); next(it) + sage: alarm(0.02); next(it) # known bug: macos (sporadic failures) Traceback (most recent call last): ... AlarmInterrupt - sage: next(it) + sage: next(it) # known bug: macos (sporadic failures) Traceback (most recent call last): ... StopIteration diff --git a/src/sage/symbolic/expression.pyx b/src/sage/symbolic/expression.pyx index ab19b46c181..618fad17cf2 100644 --- a/src/sage/symbolic/expression.pyx +++ b/src/sage/symbolic/expression.pyx @@ -5435,7 +5435,7 @@ cdef class Expression(Expression_abc): {$0: a + b + d + f + g} sage: (a+b+c+d+f+g).match(c+g+w0) {$0: a + b + d + f} - sage: (a+b).match(a+b+w0) # known bug + sage: (a+b).match(a+b+w0) # known bug {$0: 0} sage: print((a*b^2).match(a^w0*b^w1)) None diff --git a/src/sage/symbolic/integration/integral.py b/src/sage/symbolic/integration/integral.py index e431e76a767..1f8d325f2cb 100644 --- a/src/sage/symbolic/integration/integral.py +++ b/src/sage/symbolic/integration/integral.py @@ -909,7 +909,7 @@ def integrate(expression, v=None, a=None, b=None, algorithm=None, hold=False): Check that :trac:`13733` is fixed (but the bug reappeared, see :trac:`30063`):: - sage: a = integral(log(cot(x) - 1), x, 0, pi/4); a # long time (about 6 s) # known bug + sage: a = integral(log(cot(x) - 1), x, 0, pi/4); a # long time (about 6 s) # known bug -1/4*pi*log(2) - 1/2*I*dilog(I + 1) + 1/2*I*dilog(-I + 1) + 1/2*I*dilog(1/2*I + 1/2) - 1/2*I*dilog(-1/2*I + 1/2) sage: abs(N(a - pi*log(2)/8)) < 1e-15 # long time # known bug True diff --git a/src/sage/tests/books/computational-mathematics-with-sagemath/sol/graphique_doctest.py b/src/sage/tests/books/computational-mathematics-with-sagemath/sol/graphique_doctest.py index 549f48e1b77..657a77a3c57 100644 --- a/src/sage/tests/books/computational-mathematics-with-sagemath/sol/graphique_doctest.py +++ b/src/sage/tests/books/computational-mathematics-with-sagemath/sol/graphique_doctest.py @@ -42,7 +42,7 @@ sage: g = plot([c*e^(-1/x) for c in srange(-8, 8, 0.4)], (x, -3, 3)) sage: y = var('y') sage: g += plot_vector_field((x^2, y), (x,-3,3), (y,-5,5)) - sage: g.show() # not tested, known bug, see :trac:`32657` + sage: g.show() # not tested, known bug (see :trac:`32657`) Sage example in ./sol/graphique.tex, line 124:: diff --git a/src/sage/tests/cmdline.py b/src/sage/tests/cmdline.py index 5a577d1ff83..0ae9b9f65a8 100644 --- a/src/sage/tests/cmdline.py +++ b/src/sage/tests/cmdline.py @@ -721,7 +721,7 @@ def test_executable(args, input="", timeout=100.0, pydebug_ignore_warnings=False ....: _ = F.write(s) sage: L = ["sage", "--ipynb2rst", input, output] sage: _ = test_executable(L) # long time # optional - pandoc - sage: print(open(output, 'r').read() == t) # long time # optional - pandoc # known bug #32697 + sage: print(open(output, 'r').read() == t) # long time # optional - pandoc # known bug (#32697) True """ pexpect_env = dict(os.environ) diff --git a/src/sage/tests/gosper-sum.py b/src/sage/tests/gosper-sum.py index 84679ac0ff3..87e37456d91 100644 --- a/src/sage/tests/gosper-sum.py +++ b/src/sage/tests/gosper-sum.py @@ -102,7 +102,7 @@ 2*2^m*m - 2*2^m + 2 2*2^m*m^2 - 4*2^m*m + 6*2^m - 6 2*2^m*m^3 - 6*2^m*m^2 + 18*2^m*m - 26*2^m + 26 - sage: (1 / (n^2 + sqrt(5)*n - 1)).gosper_sum(n,0,m) # known bug + sage: (1 / (n^2 + sqrt(5)*n - 1)).gosper_sum(n,0,m) # known bug ....: # TODO: algebraic solutions sage: check((n^4 * 4^n / binomial(2*n, n)), n, 0, 10, 20) sage: check((factorial(3*n) / (factorial(n) * factorial(n+1) * factorial(n+2) * 27^n)), n,0,10,20)