From 03d86f6ebbcd982ac06eebe3234df0605ecc5f50 Mon Sep 17 00:00:00 2001 From: "James D. Mitchell" Date: Tue, 17 Sep 2024 16:01:30 +0100 Subject: [PATCH] ci: add no-valgrind tag to more tests All tests taking longer than 1s in a recent CI run. --- tests/test-cong.cpp | 4 +-- tests/test-cutting.cpp | 6 ++--- tests/test-fpsemi-examples-1.cpp | 18 ++++++------- tests/test-froidure-pin-bmat8.cpp | 14 +++++----- tests/test-froidure-pin-intmat.cpp | 2 +- tests/test-froidure-pin-transf.cpp | 30 ++++++++++----------- tests/test-gabow.cpp | 5 +++- tests/test-kambites.cpp | 14 +++++----- tests/test-knuth-bendix-1.cpp | 6 ++--- tests/test-knuth-bendix-2.cpp | 14 +++++----- tests/test-knuth-bendix-5.cpp | 11 ++++---- tests/test-konieczny-bmat8-1.cpp | 2 +- tests/test-konieczny-bmat8-3.cpp | 2 +- tests/test-paths.cpp | 8 +++--- tests/test-pbr.cpp | 2 +- tests/test-presentation.cpp | 6 ++--- tests/test-schreier-sims.cpp | 8 +++--- tests/test-sims.cpp | 43 ++++++++++++++++-------------- tests/test-stephen.cpp | 6 ++--- tests/test-to-froidure-pin.cpp | 4 +-- tests/test-to-presentation.cpp | 2 +- tests/test-todd-coxeter.cpp | 6 ++--- tests/test-word-graph.cpp | 9 ++++--- tests/test-words.cpp | 18 ++++++------- 24 files changed, 125 insertions(+), 115 deletions(-) diff --git a/tests/test-cong.cpp b/tests/test-cong.cpp index c99c18daf..335582c90 100644 --- a/tests/test-cong.cpp +++ b/tests/test-cong.cpp @@ -995,7 +995,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Congruence", "035", "stellar_monoid S4", - "[quick][cong]") { + "[quick][cong][no-valgrind]") { auto rg = ReportGuard(false); Presentation p = zero_rook_monoid(4); @@ -1172,7 +1172,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Congruence", "042", "const_contains", - "[quick][cong]") { + "[quick][cong][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.alphabet(2); diff --git a/tests/test-cutting.cpp b/tests/test-cutting.cpp index 7531bf79d..e456e9ab1 100644 --- a/tests/test-cutting.cpp +++ b/tests/test-cutting.cpp @@ -67,7 +67,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Cutting", "002", "step_hen Stephen test case 004", - "[cutting][quick]") { + "[cutting][quick][no-valgrind]") { ToWord to_word("xyzXYZ"); InversePresentation p; p.alphabet(to_word("xyzXYZ")); @@ -87,7 +87,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Cutting", "003", "symmetric_inverse_semigroup", - "[cutting][quick]") { + "[cutting][quick][no-valgrind]") { auto p = to_inverse_presentation(fpsemigroup::symmetric_inverse_monoid(4)); REQUIRE(p.alphabet() == 01234567_w); REQUIRE(p.inverses() == 45670123_w); @@ -128,7 +128,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Cutting", "005", "dual_symmetric_inverse_monoid", - "[cutting][quick]") { + "[cutting][quick][no-valgrind]") { auto p = to_inverse_presentation( fpsemigroup::dual_symmetric_inverse_monoid(4)); REQUIRE(p.contains_empty_word()); diff --git a/tests/test-fpsemi-examples-1.cpp b/tests/test-fpsemi-examples-1.cpp index 1d8bd9b10..13e03830e 100644 --- a/tests/test-fpsemi-examples-1.cpp +++ b/tests/test-fpsemi-examples-1.cpp @@ -642,7 +642,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "034", "uniform_block_bijection_monoid(5)", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 5; auto p = uniform_block_bijection_monoid(n, author::FitzGerald); @@ -683,7 +683,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "038", "orientation_preserving_reversing_monoid(5)", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 5; ToddCoxeter tc(congruence_kind::twosided, @@ -756,7 +756,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "044", "symmetric_group(6) Carmichael", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 6; ToddCoxeter tc(congruence_kind::twosided, @@ -767,7 +767,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "045", "symmetric_group(6) Moore index 0", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 6; @@ -779,7 +779,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "046", "symmetric_group(7) Moore index 1", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 7; ToddCoxeter tc(congruence_kind::twosided, @@ -839,7 +839,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "049", "full_transformation_monoid(5) Iwahori", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 5; @@ -851,7 +851,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "050", "partial_transformation_monoid(5) Sutov", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 5; ToddCoxeter tc(congruence_kind::twosided, @@ -938,7 +938,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "058", "cyclic_inverse_monoid(8) Fernandes index 1", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 8; ToddCoxeter tc(congruence_kind::twosided, @@ -1051,7 +1051,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("fpsemi-examples", "072", "partial_brauer_monoid(4)", - "[fpsemi-examples][quick]") { + "[fpsemi-examples][quick][no-valgrind]") { auto rg = ReportGuard(REPORT); size_t n = 4; diff --git a/tests/test-froidure-pin-bmat8.cpp b/tests/test-froidure-pin-bmat8.cpp index 52ddf7dd1..8ea5295b9 100644 --- a/tests/test-froidure-pin-bmat8.cpp +++ b/tests/test-froidure-pin-bmat8.cpp @@ -39,7 +39,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin", "015", "(BMat8) regular boolean mat monoid 4", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][no-valgrind]") { auto rg = ReportGuard(false); std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), @@ -253,7 +253,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin", "018", "(BMat8) exception prefix", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][no-valgrind]") { std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), BMat8({{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 0}}), @@ -275,12 +275,13 @@ namespace libsemigroups { BMat8({{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 0}}), BMat8({{1, 1, 0, 0}, {1, 0, 1, 0}, {0, 1, 1, 1}, {0, 1, 1, 1}})}; FroidurePin S(gens); + // TODO(0) there are no tests in here! } LIBSEMIGROUPS_TEST_CASE("FroidurePin", "020", "(BMat8) exception first_letter", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][no-valgrind]") { std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), BMat8({{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 0}}), @@ -302,12 +303,13 @@ namespace libsemigroups { BMat8({{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 0}}), BMat8({{1, 1, 0, 0}, {1, 0, 1, 0}, {0, 1, 1, 1}, {0, 1, 1, 1}})}; FroidurePin S(gens); + // TODO(0) there are no tests in here! } LIBSEMIGROUPS_TEST_CASE("FroidurePin", "022", "(BMat8) exception current_length", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][no-valgrind]") { std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), BMat8({{0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}, {1, 0, 0, 0}}), @@ -323,7 +325,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin", "023", "(BMat8) exception product_by_reduction", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][no-valgrind]") { std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), BMat8({{1, 1, 0, 0}, {1, 0, 1, 0}, {0, 1, 1, 1}, {0, 1, 1, 1}})}; @@ -345,7 +347,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin", "024", "(BMat8) exception fast_product", - "[quick][froidure-pin][bmat8]") { + "[quick][froidure-pin][bmat8][024]") { std::vector gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), BMat8({{1, 1, 0, 0}, {1, 0, 1, 0}, {0, 1, 1, 1}, {0, 1, 1, 1}})}; diff --git a/tests/test-froidure-pin-intmat.cpp b/tests/test-froidure-pin-intmat.cpp index 6c777c688..c2bff4ff5 100644 --- a/tests/test-froidure-pin-intmat.cpp +++ b/tests/test-froidure-pin-intmat.cpp @@ -246,7 +246,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin", "038", "exception: prefix, suffix, first_letter", - "[quick][froidure-pin][element]") { + "[quick][froidure-pin][element][no-valgrind]") { test010>(); test010>(); } diff --git a/tests/test-froidure-pin-transf.cpp b/tests/test-froidure-pin-transf.cpp index d9e0b1134..5fa26a1c0 100644 --- a/tests/test-froidure-pin-transf.cpp +++ b/tests/test-froidure-pin-transf.cpp @@ -998,7 +998,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "098", "sorted_position, sorted_at", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1556,7 +1556,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "109", "copy_closure [partly enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1665,7 +1665,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "112", "copy_closure [fully enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1772,7 +1772,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "115", "relations", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1811,7 +1811,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "116", "relations [copy_closure, duplicate gens]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1846,7 +1846,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "117", "relations [copy_add_generators, duplicate gens]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1881,7 +1881,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "118", "relations [from copy, not enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1904,7 +1904,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "119", "relations [from copy, partly enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1931,7 +1931,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "120", "relations [from copy, fully enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1959,7 +1959,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "121", "relations [from copy_closure, not enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -1988,7 +1988,7 @@ namespace libsemigroups { "FroidurePin>", "122", "relations [from copy_add_generators, not enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -2013,7 +2013,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "123", "relations [from copy_closure, partly enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -2037,7 +2037,7 @@ namespace libsemigroups { "FroidurePin>", "124", "relations [from copy_add_generators, partly enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -2064,7 +2064,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("FroidurePin>", "125", "relations [from copy_closure, fully enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); @@ -2090,7 +2090,7 @@ namespace libsemigroups { "FroidurePin>", "126", "relations [from copy_add_generators, fully enumerated]", - "[quick][froidure-pin][transf]") { + "[quick][froidure-pin][transf][no-valgrind]") { auto rg = ReportGuard(REPORT); FroidurePin> S; S.add_generator(Transf<>({0, 1, 2, 3, 4, 5})); diff --git a/tests/test-gabow.cpp b/tests/test-gabow.cpp index 801b9103f..46214021d 100644 --- a/tests/test-gabow.cpp +++ b/tests/test-gabow.cpp @@ -237,7 +237,10 @@ namespace libsemigroups { // } // } - LIBSEMIGROUPS_TEST_CASE("Gabow", "009", "large cycle", "[quick][gabow]") { + LIBSEMIGROUPS_TEST_CASE("Gabow", + "009", + "large cycle", + "[quick][gabow][no-valgrind]") { WordGraph wg; wg.add_to_out_degree(1); word_graph::add_cycle(wg, 100000); diff --git a/tests/test-kambites.cpp b/tests/test-kambites.cpp index 143150319..68b4b20cd 100644 --- a/tests/test-kambites.cpp +++ b/tests/test-kambites.cpp @@ -187,14 +187,14 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "000", "MT test 4 (std::string)", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { test_case_mt_4(); } LIBSEMIGROUPS_TEST_CASE("Kambites", "001", "MT test 4 (MultiStringView)", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { test_case_mt_4(); } @@ -509,7 +509,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "008", "KnuthBendix 055 (std::string)", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { test_case_knuth_bendix_055(); } @@ -642,7 +642,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "013", "smalloverlap/gap/test.gi:49 (std::string)", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { test_case_gap_smalloverlap_49(); } @@ -1675,7 +1675,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "069", "almost all 2-generated 1-relation monoids are C(4)", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { auto x = count_2_gen_1_rel(1, 7); REQUIRE(x.first == 1); REQUIRE(x.second == 7'875); @@ -2536,7 +2536,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "077", "code coverage", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { Presentation p; p.alphabet(4); presentation::add_rule( @@ -2563,7 +2563,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Kambites", "078", "large number of rules", - "[quick][kambites]") { + "[quick][kambites][no-valgrind]") { FroidurePin> S({LeastTransf<6>({1, 2, 3, 4, 5, 0}), LeastTransf<6>({1, 0, 2, 3, 4, 5}), LeastTransf<6>({0, 1, 2, 3, 4, 0})}); diff --git a/tests/test-knuth-bendix-1.cpp b/tests/test-knuth-bendix-1.cpp index e2ec2771f..90e2a618b 100644 --- a/tests/test-knuth-bendix-1.cpp +++ b/tests/test-knuth-bendix-1.cpp @@ -590,7 +590,7 @@ namespace libsemigroups { TEMPLATE_TEST_CASE("redundant_rule (word_type)", "[014][quick][knuth-bendix]", KNUTH_BENDIX_TYPES) { - using literals:: operator""_w; + using literals::operator""_w; auto rg = ReportGuard(false); Presentation p; p.alphabet(3); @@ -681,7 +681,7 @@ namespace libsemigroups { "[016][quick][knuth-bendix]", KNUTH_BENDIX_TYPES) { using literals::operator""_w; - auto rg = ReportGuard(false); + auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -856,7 +856,7 @@ namespace libsemigroups { } TEMPLATE_TEST_CASE("non-trivial congruence on an infinite fp semigroup ", - "[021][quick][knuth-bendix]", + "[021][quick][knuth-bendix][no-valgrind]", KNUTH_BENDIX_TYPES) { auto rg = ReportGuard(false); Presentation p; diff --git a/tests/test-knuth-bendix-2.cpp b/tests/test-knuth-bendix-2.cpp index b731cefac..ef650f494 100644 --- a/tests/test-knuth-bendix-2.cpp +++ b/tests/test-knuth-bendix-2.cpp @@ -154,7 +154,7 @@ namespace libsemigroups { // trivial group - BHN presentation TEMPLATE_TEST_CASE("(from kbmag/standalone/kb_data/degen4a)", - "[032][quick][knuth-bendix][kbmag][shortlex]", + "[032][quick][knuth-bendix][kbmag][shortlex][no-valgrind]", KNUTH_BENDIX_TYPES) { auto rg = ReportGuard(false); @@ -242,7 +242,7 @@ namespace libsemigroups { // 3-fold cover of A_6 TEMPLATE_TEST_CASE("(from kbmag/standalone/kb_data/3a6)", - "[034][quick][knuth-bendix][kbmag][shortlex]", + "[034][quick][knuth-bendix][kbmag][shortlex][no-valgrind]", KNUTH_BENDIX_TYPES) { auto rg = ReportGuard(false); @@ -1372,7 +1372,7 @@ namespace libsemigroups { } TEMPLATE_TEST_CASE("1-relation hard case x 2", - "[062][quick][knuth-bendix]", + "[062][quick][knuth-bendix][no-valgrind]", KNUTH_BENDIX_TYPES) { auto rg = ReportGuard(false); Presentation p; @@ -1469,7 +1469,7 @@ namespace libsemigroups { } TEMPLATE_TEST_CASE("Chinese monoid", - "[064][knuth-bendix][quick]", + "[064][knuth-bendix][quick][no-valgrind]", KNUTH_BENDIX_TYPES) { auto rg = ReportGuard(false); // fmt::print(bg(fmt::color::white) | fg(fmt::color::black), @@ -1530,7 +1530,7 @@ namespace libsemigroups { } TEMPLATE_TEST_CASE("sigma sylvester monoid", - "[067][todd-coxeter][quick]", + "[067][todd-coxeter][quick][no-valgrind]", KNUTH_BENDIX_TYPES) { using namespace literals; auto rg = ReportGuard(false); @@ -1667,7 +1667,7 @@ namespace libsemigroups { TEMPLATE_TEST_CASE("Reinis MFE", "[027][todd-coxeter][quick]", KNUTH_BENDIX_TYPES) { - using literals:: operator""_w; + using literals::operator""_w; Presentation p; p.alphabet(2); presentation::add_rule(p, "000"_w, "11"_w); @@ -1702,7 +1702,7 @@ namespace libsemigroups { p.alphabet(2); presentation::add_idempotent_rules_no_checks(p, 01_w); using words::operator+; - WordRange words; + WordRange words; words.alphabet_size(2).min(0).max(3); size_t n = 2; for (size_t a = 0; a < n - 1; ++a) { diff --git a/tests/test-knuth-bendix-5.cpp b/tests/test-knuth-bendix-5.cpp index b3f74faff..3b80e47fa 100644 --- a/tests/test-knuth-bendix-5.cpp +++ b/tests/test-knuth-bendix-5.cpp @@ -238,11 +238,10 @@ namespace libsemigroups { auto ntc = (iterator_range(pp.begin(), pp.end()) | filter([](auto const& val) { return val.size() > 1; }) | transform([](auto& val) { - std::for_each( - val.begin(), val.end(), [](auto& w) -> auto& { - w.erase(w.begin()); - return w; - }); + std::for_each(val.begin(), val.end(), [](auto& w) -> auto& { + w.erase(w.begin()); + return w; + }); return val; })); @@ -413,7 +412,7 @@ namespace libsemigroups { } TEMPLATE_TEST_CASE("automatic left congruence!!!", - "[128][quick][knuth-bendix]", + "[128][quick][knuth-bendix][no-valgrind]", KNUTH_BENDIX_TYPES) { using words::operator+; diff --git a/tests/test-konieczny-bmat8-1.cpp b/tests/test-konieczny-bmat8-1.cpp index 661f7e959..60a28c594 100644 --- a/tests/test-konieczny-bmat8-1.cpp +++ b/tests/test-konieczny-bmat8-1.cpp @@ -100,7 +100,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Konieczny", "011", "regular D-class 02", - "[quick][bmat8]") { + "[quick][bmat8][no-valgrind]") { auto rg = ReportGuard(REPORT); const std::vector gens = {BMat8({{1, 0, 0, 0}, {0, 1, 0, 0}, {0, 0, 1, 0}, {0, 0, 0, 1}}), diff --git a/tests/test-konieczny-bmat8-3.cpp b/tests/test-konieczny-bmat8-3.cpp index 3d5bda331..7c27a28fb 100644 --- a/tests/test-konieczny-bmat8-3.cpp +++ b/tests/test-konieczny-bmat8-3.cpp @@ -43,7 +43,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Konieczny", "026", "non-regular D-classes 02", - "[quick][bmat8]") { + "[quick][bmat8][no-valgrind]") { auto rg = ReportGuard(REPORT); std::vector const gens = {BMat8({{0, 1, 0, 0}, {1, 0, 0, 1}, {1, 0, 0, 1}, {0, 1, 1, 0}}), diff --git a/tests/test-paths.cpp b/tests/test-paths.cpp index dd6ab25ae..46291f6cf 100644 --- a/tests/test-paths.cpp +++ b/tests/test-paths.cpp @@ -471,7 +471,7 @@ namespace libsemigroups { {{01_w, 1_w}, {11_w, 1_w}, {00000_w, 00_w}})); } - LIBSEMIGROUPS_TEST_CASE("Paths", "006", "#5", "[quick]") { + LIBSEMIGROUPS_TEST_CASE("Paths", "006", "#5", "[quick][no-valgrind]") { using namespace rx; auto wg = to_word_graph( 6, {{1, 2}, {3, 4}, {4, 2}, {1, 5}, {5, 4}, {4, 5}}); @@ -661,7 +661,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Paths", "011", "number_of_paths acyclic digraph", - "[quick]") { + "[quick][no-valgrind]") { auto wg = to_word_graph( 8, {{3, 2, 3}, {7}, {1}, {1, 5}, {6}, {}, {3, 7}}); @@ -891,7 +891,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Paths", "016", "number_of_paths node digraph", - "[quick]") { + "[quick][no-valgrind]") { size_t const n = 10; // auto wg = WordGraph::random(n, 20, 200, // std::mt19937()); @@ -940,7 +940,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Paths", "017", "number_of_paths (matrix)", - "[quick]") { + "[quick][no-valgrind]") { // REQUIRE(detail::magic_number(6) * 6 == 14.634); // auto wg = WordGraph::random(6, 3, 15, std::mt19937()); // std::cout << word_graph::detail::to_string(wg); diff --git a/tests/test-pbr.cpp b/tests/test-pbr.cpp index 06372afc6..4d1e68557 100644 --- a/tests/test-pbr.cpp +++ b/tests/test-pbr.cpp @@ -147,7 +147,7 @@ namespace libsemigroups { REQUIRE(x == expected); } - LIBSEMIGROUPS_TEST_CASE("PBR", "004", "hash", "[quick][pbr]") { + LIBSEMIGROUPS_TEST_CASE("PBR", "004", "hash", "[quick][pbr][no-valgrind]") { PBR x({{1}, {4}, {3}, {1}, {0, 2}, {0, 3, 4, 5}}); for (size_t i = 0; i < 1000000; i++) { x.hash_value(); diff --git a/tests/test-presentation.cpp b/tests/test-presentation.cpp index f57d79f6a..f884ebe48 100644 --- a/tests/test-presentation.cpp +++ b/tests/test-presentation.cpp @@ -1581,7 +1581,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Presentation", "028", "helpers redundant_rule", - "[quick][presentation]") { + "[quick][presentation][no-valgrind]") { auto rg = ReportGuard(false); check_redundant_rule(); check_redundant_rule>(); @@ -2637,7 +2637,7 @@ namespace libsemigroups { "meaningful exception messages", "[quick][presentation]") { using literals::operator""_w; - auto rg = ReportGuard(false); + auto rg = ReportGuard(false); { Presentation p; @@ -2713,7 +2713,7 @@ namespace libsemigroups { "056", "add_generator (std::string)", "[quick][presentation]") { - auto rg = ReportGuard(false); + auto rg = ReportGuard(false); using literals::operator""_w; { diff --git a/tests/test-schreier-sims.cpp b/tests/test-schreier-sims.cpp index a04fbdd97..dd2d49664 100644 --- a/tests/test-schreier-sims.cpp +++ b/tests/test-schreier-sims.cpp @@ -2968,7 +2968,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("SchreierSims", "037", "alternating perm. group (degree 17)", - "[quick][schreier-sims]") { + "[quick][schreier-sims][no-valgrind]") { auto rg = ReportGuard(false); SchreierSims<17> S; S.init(); @@ -3260,7 +3260,7 @@ namespace libsemigroups { "SchreierSims", "043", "transversal_element and inverse_transversal_element test", - "[quick][schreier-sims]") { + "[quick][schreier-sims][no-valgrind]") { auto rg = ReportGuard(false); SchreierSims<64> S; using Perm = typename decltype(S)::element_type; @@ -3878,7 +3878,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("SchreierSims", "062", "2^6:(S_3 x GL(3, 2)) and 2.6:Alt(7) intersection", - "[quick][schreier-sims][intersection]") { + "[quick][schreier-sims][intersection][no-valgrind]") { auto rg = ReportGuard(false); SchreierSims<64> S, T, U; using Perm = SchreierSims<64>::element_type; @@ -4037,7 +4037,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("SchreierSims", "064", "PSL(2, 127) and AGL(1, 2^7) intersection", - "[quick][schreier-sims][intersection]") { + "[quick][schreier-sims][intersection][no-valgrind]") { auto rg = ReportGuard(false); SchreierSims<128> S, T, U; using Perm = SchreierSims<128>::element_type; diff --git a/tests/test-sims.cpp b/tests/test-sims.cpp index 1c911a347..cf42dfeeb 100644 --- a/tests/test-sims.cpp +++ b/tests/test-sims.cpp @@ -273,7 +273,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "001", "fp example 2", - "[quick][low-index]") { + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -316,7 +316,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "002", "ToddCoxeter failing example (word_type)", - "[quick][low-index]") { + "[quick][low-index][no-valgrind[no-valgrind]]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(false); @@ -409,7 +409,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "004", "partition_monoid(2) right", - "[quick][low-index]") { + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(false); @@ -478,7 +478,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "006", "full_transformation_monoid(3) right", - "[quick][low-index]") { + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); FroidurePin> S({Transf<3>::make({1, 2, 0}), Transf<3>::make({1, 0, 2}), @@ -498,7 +498,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "007", "full_transformation_monoid(3) left", - "[quick][low-index]") { + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); FroidurePin> S( {Transf<3>({1, 2, 0}), Transf<3>({1, 0, 2}), Transf<3>({0, 1, 0})}); @@ -573,7 +573,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "011", "symmetric_inverse_monoid(3)", - "[quick][low-index]") { + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); auto p = symmetric_inverse_monoid(3, author::Gay); presentation::reverse(p); @@ -1149,7 +1149,7 @@ namespace libsemigroups { "Sims1", "027", "from https://mathoverflow.net/questions/423541/ (semigroup)", - "[quick][sims1]") { + "[quick][sims1][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(false); @@ -1167,7 +1167,7 @@ namespace libsemigroups { "Sims1", "028", "from https://mathoverflow.net/questions/423541/ (monoid)", - "[quick][sims1]") { + "[quick][sims1][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -1249,7 +1249,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "032", "presentation with empty word", - "[quick][sims1]") { + "[quick][sims1][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -1584,7 +1584,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "040", "TransitiveGroup(10, 32) - minimal rep", - "[quick][sims1]") { + "[quick][sims1][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -2330,7 +2330,10 @@ namespace libsemigroups { // we have N = 3 inputs. } - LIBSEMIGROUPS_TEST_CASE("Sims1", "068", "RepOrc", "[quick][low-index]") { + LIBSEMIGROUPS_TEST_CASE("Sims1", + "068", + "RepOrc", + "[quick][low-index][no-valgrind]") { auto rg = ReportGuard(false); auto p = temperley_lieb_monoid(9); @@ -2697,7 +2700,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims1", "080", "fibonacci_group(2, 9) x 1", - "[quick]") { + "[quick][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.alphabet("abcdefghiABCDEFGHI"); @@ -3131,7 +3134,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "094", "2-sided T_4 Iwahori presentation", - "[quick][sims2][low-index]") { + "[quick][sims2][low-index][no-valgrind]") { auto rg = ReportGuard(false); Sims2 S(fpsemigroup::full_transformation_monoid( 4, fpsemigroup::author::Iwahori)); @@ -3200,7 +3203,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "099", "2-sided (2,3,7) triangle group", - "[quick][sims2][low-index]") { + "[quick][sims2][low-index][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.contains_empty_word(true); @@ -3239,7 +3242,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "101", "2-sided Catalan monoid n=4", - "[quick][sims2][low-index]") { + "[quick][sims2][low-index][no-valgrind]") { auto rg = ReportGuard(false); FroidurePin> S; S.add_generator(Transf<4>::make({0, 1, 2, 3})); @@ -3617,7 +3620,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "111", "2-sided congruence-free monoid n=3", - "[quick][sims2]") { + "[quick][sims2][no-valgrind]") { auto rg = ReportGuard(false); // Presentation taken from // Al-Kharousi, F., Cain, A.J., Maltcev, V. et al. @@ -3650,7 +3653,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "112", "2-sided congruence-free monoid n=8", - "[quick][sims2]") { + "[quick][sims2][no-valgrind]") { auto rg = ReportGuard(false); // Presentation taken from // Al-Kharousi, F., Cain, A.J., Maltcev, V. et al. @@ -3688,7 +3691,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "113", "2-sided bicyclic monoid", - "[quick][sims2]") { + "[quick][sims2][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.alphabet("ab"); @@ -3704,7 +3707,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "114", "2-sided 2-generated free commutative monoid", - "[quick][sims2]") { + "[quick][sims2][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.alphabet("ab"); @@ -3848,7 +3851,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Sims2", "119", "2-sided ideals Jura's example", - "[quick][sims1]") { + "[quick][sims1][no-valgrind]") { Presentation p; p.alphabet("ab"); p.contains_empty_word(false); diff --git a/tests/test-stephen.cpp b/tests/test-stephen.cpp index 9a1e06d66..f42c5ac93 100644 --- a/tests/test-stephen.cpp +++ b/tests/test-stephen.cpp @@ -239,7 +239,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Stephen", "002", "full transf monoid", - "[quick][stephen]") { + "[quick][stephen][no-valgrind]") { using namespace fpsemigroup; auto rg = ReportGuard(true); size_t n = 5; @@ -1194,7 +1194,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Stephen", "044", "inverse presentation -- operator==", - "[stephen][quick]") { + "[stephen][quick][no-valgrind]") { ReportGuard rg(false); ToddCoxeter tc; { @@ -1268,7 +1268,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("Stephen", "046", "non-inverse presentation -- operator==", - "[stephen][quick]") { + "[stephen][quick][no-valgrind]") { ReportGuard rg(false); auto p = fpsemigroup::symmetric_inverse_monoid(4); diff --git a/tests/test-to-froidure-pin.cpp b/tests/test-to-froidure-pin.cpp index 716891b3f..4cffe2479 100644 --- a/tests/test-to-froidure-pin.cpp +++ b/tests/test-to-froidure-pin.cpp @@ -72,7 +72,7 @@ namespace libsemigroups { namespace { template void check_from_ke(Presentation const& p) { - using literals:: operator""_w; + using literals::operator""_w; Kambites k(p); auto s = to_froidure_pin(k); REQUIRE(s.is_finite() == tril::FALSE); @@ -133,7 +133,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("to_froidure_pin", "002", "from Kambites (code cov)", - "[quick][make]") { + "[quick][make][no-valgrind]") { auto rg = ReportGuard(false); Presentation p; p.alphabet("abcdefg"); diff --git a/tests/test-to-presentation.cpp b/tests/test-to-presentation.cpp index 2020e38c4..b8377c259 100644 --- a/tests/test-to-presentation.cpp +++ b/tests/test-to-presentation.cpp @@ -377,7 +377,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("to_inverse_presentation", "007", "inverse presentation from presentation", - "[quick][to_presentation]") { + "[quick][to_presentation][no-valgrind]") { check_to_inverse_presentation_from_presentation(); check_to_inverse_presentation_from_presentation(); check_to_inverse_presentation_from_presentation< diff --git a/tests/test-todd-coxeter.cpp b/tests/test-todd-coxeter.cpp index 53cd86648..e2b63603b 100644 --- a/tests/test-todd-coxeter.cpp +++ b/tests/test-todd-coxeter.cpp @@ -1872,7 +1872,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("ToddCoxeter", "047", "uniform_block_bijection_monoid(3) (FitzGerald) ", - "[todd-coxeter][quick]") { + "[todd-coxeter][quick][no-valgrind]") { using fpsemigroup::author; using fpsemigroup::uniform_block_bijection_monoid; @@ -2216,7 +2216,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("ToddCoxeter", "113", "symmetric_inverse_monoid(5, Sutov)", - "[todd-coxeter][quick]") { + "[todd-coxeter][quick][no-valgrind]") { using fpsemigroup::author; using fpsemigroup::symmetric_inverse_monoid; @@ -4515,7 +4515,7 @@ namespace libsemigroups { presentation::add_rule(p, pow({a}, 3), {a}); } using words::operator+; - WordRange words; + WordRange words; words.alphabet_size(n).min(0).max(8); for (size_t a = 0; a < n - 1; ++a) { diff --git a/tests/test-word-graph.cpp b/tests/test-word-graph.cpp index 63ac93180..e84d581d3 100644 --- a/tests/test-word-graph.cpp +++ b/tests/test-word-graph.cpp @@ -516,7 +516,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("WordGraph", "026", "is_reachable | 100 node path", - "[quick]") { + "[quick][no-valgrind]") { WordGraph ad; size_t const n = 100; ad.add_nodes(n); @@ -535,7 +535,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("WordGraph", "027", "is_reachable | 100 node cycle", - "[quick]") { + "[quick][no-valgrind]") { WordGraph ad; ad.add_to_out_degree(1); word_graph::add_cycle(ad, 100); @@ -637,7 +637,10 @@ namespace libsemigroups { REQUIRE(word_graph::is_connected(ad)); } - LIBSEMIGROUPS_TEST_CASE("WordGraph", "035", "is_strictly_cyclic", "[quick]") { + LIBSEMIGROUPS_TEST_CASE("WordGraph", + "035", + "is_strictly_cyclic", + "[quick][no-valgrind]") { auto ad = to_word_graph(5, {{0, 0}, {1, 1}, {2}, {3, 3}}); REQUIRE(!word_graph::is_strictly_cyclic(ad)); ad = path(1'000); diff --git a/tests/test-words.cpp b/tests/test-words.cpp index 7173854c7..ac09f935d 100644 --- a/tests/test-words.cpp +++ b/tests/test-words.cpp @@ -322,7 +322,7 @@ namespace libsemigroups { LIBSEMIGROUPS_TEST_CASE("WordRange", "012", "letters: 3, min: 0, max: 10", - "[wilo][quick]") { + "[wilo][quick][no-valgrind]") { word_type first = {}; word_type last(10, 2); auto w = std::vector(cbegin_wilo(3, 10, first, last), @@ -506,7 +506,7 @@ namespace libsemigroups { REQUIRE_THROWS_AS(words.order(Order::recursive), LibsemigroupsException); WordRange copy; - copy. operator=(words); + copy.operator=(words); REQUIRE(copy.get() == 00_w); copy.next(); REQUIRE(copy.get() == 000_w); @@ -519,7 +519,7 @@ namespace libsemigroups { REQUIRE(copy.count() == 25); WordRange move; - move. operator=(std::move(words)); + move.operator=(std::move(words)); REQUIRE(equal(copy, move)); REQUIRE(move.upper_bound() == 28); REQUIRE(move.first() == 0_w); @@ -901,7 +901,7 @@ namespace libsemigroups { REQUIRE_THROWS_AS(strings.order(Order::recursive), LibsemigroupsException); StringRange copy; - copy. operator=(strings); + copy.operator=(strings); REQUIRE(copy.get() == "aa"); copy.next(); REQUIRE(copy.get() == "aaa"); @@ -914,7 +914,7 @@ namespace libsemigroups { REQUIRE(copy.count() == 25); StringRange move; - move. operator=(std::move(strings)); + move.operator=(std::move(strings)); REQUIRE(equal(copy, move)); REQUIRE(move.upper_bound() == 28); REQUIRE(move.first() == "a"); @@ -1018,8 +1018,8 @@ namespace libsemigroups { "[quick][word_functions]") { using namespace literals; using words::operator+; - word_type w = 01_w; - word_type v = 2_w; + word_type w = 01_w; + word_type v = 2_w; REQUIRE((w + v) == 012_w); REQUIRE((w + v + w) == 01201_w); @@ -1037,8 +1037,8 @@ namespace libsemigroups { "[quick][word_functions]") { using namespace literals; using words::operator+=; - word_type w = 123_w; - word_type v = 345_w; + word_type w = 123_w; + word_type v = 345_w; w += v; REQUIRE(w == 123345_w); word_type t = word_type({});