Formatting

james-d-mitchell · Sep 17, 2024 · 0c92607 · 0c92607
1 parent e0c7d27
commit 0c92607
Show file tree

Hide file tree

Showing 7 changed files with 21 additions and 20 deletions.
diff --git 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<word_type> 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<std::string> p;
     p.contains_empty_word(true);

diff --git a/tests/test-knuth-bendix-2.cpp b/tests/test-knuth-bendix-2.cpp
@@ -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<word_type> 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
@@ -238,10 +238,11 @@ 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;
                   }));
 

diff --git a/tests/test-presentation.cpp b/tests/test-presentation.cpp
@@ -2637,7 +2637,7 @@ namespace libsemigroups {
                           "meaningful exception messages",
                           "[quick][presentation]") {
     using literals::operator""_w;
-    auto rg = ReportGuard(false);
+    auto            rg = ReportGuard(false);
 
     {
       Presentation<std::string> 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-to-froidure-pin.cpp b/tests/test-to-froidure-pin.cpp
@@ -72,7 +72,7 @@ namespace libsemigroups {
   namespace {
     template <typename Word, typename OtherWord = Word>
     void check_from_ke(Presentation<Word> const& p) {
-      using literals::operator""_w;
+      using literals::    operator""_w;
       Kambites<OtherWord> k(p);
       auto                s = to_froidure_pin(k);
       REQUIRE(s.is_finite() == tril::FALSE);

diff --git a/tests/test-todd-coxeter.cpp b/tests/test-todd-coxeter.cpp
@@ -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-words.cpp b/tests/test-words.cpp
@@ -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({});