formatted

Author: nadim-241

src/action.cpp

@@ -29,8 +29,8 @@
 #include <libsemigroups/action.hpp>
 #include <libsemigroups/bmat8.hpp>
 #include <libsemigroups/transf.hpp>
-#include <libsemigroups/word-graph.hpp>
 #include <libsemigroups/word-graph-helpers.hpp>
+#include <libsemigroups/word-graph.hpp>
 
 #include <fmt/core.h>  // for format, print
 

src/cong.cpp

@@ -260,7 +260,7 @@ obviously infinite; ``False`` is returned if it is not.
     congruence has infinitely many classes.
 )pbdoc");
     }  // bind_cong
-  }  // namespace
+  }    // namespace
 
   void init_cong(py::module& m) {
     bind_cong<word_type>(m, "CongruenceWord");

src/froidure-pin.cpp

@@ -729,7 +729,7 @@ elements are sorted, or :any:`UNDEFINED` if *i* is greater than
 
       // TODO(1) are there some functions missing here?
     }  // bind_froidure_pin
-  }  // namespace
+  }    // namespace
 
   void init_froidure_pin(py::module& m) {
     // TODO(0) uncomment bind_froidure_pin<HPCombiTransf<16>>(m, "Transf16");

src/gabow.cpp

@@ -32,8 +32,8 @@
 #include <libsemigroups/detail/int-range.hpp>  // for IntegralRange<>::value_type
 #include <libsemigroups/forest.hpp>            // for Forest
 #include <libsemigroups/gabow.hpp>             // for Gabow
-#include <libsemigroups/word-graph.hpp>        // for WordGraph, word_graph
-#include <libsemigroups/word-graph-helpers.hpp> // for WordGraph helpers
+#include <libsemigroups/word-graph-helpers.hpp>  // for WordGraph helpers
+#include <libsemigroups/word-graph.hpp>          // for WordGraph, word_graph
 
 // pybind11....
 #include <pybind11/operators.h>  // for self, self_t, operator!=, operator*

src/kambites.cpp

@@ -231,7 +231,7 @@ defined by a :any:`KambitesMultiStringView` object is obviously infinite;
   presented semigroup or monoid defined by *k* is infinite.
 )pbdoc");
     }  // bind_kambites
-  }  // namespace
+  }    // namespace
 
   void init_kambites(py::module& m) {
     // One call to bind is required per list of types

src/knuth-bendix-impl.cpp

@@ -25,11 +25,11 @@
 // libsemigroups....
 
 #include <libsemigroups/knuth-bendix.hpp>  // for KnuthBendixImpl, KnuthBendixImpl::option...
-#include <libsemigroups/obvinf.hpp>      // for is_obviously_infinite
-#include <libsemigroups/runner.hpp>      // for Runner
-#include <libsemigroups/types.hpp>       // for word_type, letter_type
-#include <libsemigroups/word-graph.hpp>  // for WordGraph
-#include <libsemigroups/word-graph-helpers.hpp> // for WordGraph helpers
+#include <libsemigroups/obvinf.hpp>              // for is_obviously_infinite
+#include <libsemigroups/runner.hpp>              // for Runner
+#include <libsemigroups/types.hpp>               // for word_type, letter_type
+#include <libsemigroups/word-graph-helpers.hpp>  // for WordGraph helpers
+#include <libsemigroups/word-graph.hpp>          // for WordGraph
 
 // pybind11....
 #include <pybind11/chrono.h>

src/knuth-bendix.cpp

@@ -398,7 +398,7 @@ redundant in this way, then ``None`` is returned.
                 });
       thing.def("next", [](NormalFormRange& nfr) { nfr.next(); });
     }  // bind_normal_form_range
-  }  // namespace
+  }    // namespace
 
   void init_knuth_bendix(py::module& m) {
     using RewriteTrie     = detail::RewriteTrie;

src/konieczny.cpp

@@ -641,7 +641,7 @@ not already known.
    int
 )pbdoc");
     }  // bind_konieczny
-  }  // namespace
+  }    // namespace
 
   void init_konieczny(py::module& m) {
     bind_konieczny<BMat8>(m, "BMat8");

src/paths.cpp

@@ -26,11 +26,11 @@
 #include <vector>            // for vector
 
 // libsemigroups....
-#include <libsemigroups/constants.hpp>   // for operator!=, operator==
-#include <libsemigroups/order.hpp>       // for order
-#include <libsemigroups/paths.hpp>       // for Paths
-#include <libsemigroups/word-graph.hpp>  // for WordGraph, word_graph
-#include <libsemigroups/word-graph-helpers.hpp> // for WordGraph helpers
+#include <libsemigroups/constants.hpp>           // for operator!=, operator==
+#include <libsemigroups/order.hpp>               // for order
+#include <libsemigroups/paths.hpp>               // for Paths
+#include <libsemigroups/word-graph-helpers.hpp>  // for WordGraph helpers
+#include <libsemigroups/word-graph.hpp>          // for WordGraph, word_graph
 // pybind11....
 #include <pybind11/operators.h>  // for self, self_t, operator!=, operator*
 #include <pybind11/pybind11.h>   // for class_, make_iterator, init, enum_

src/present.cpp

@@ -1346,7 +1346,7 @@ defined in the alphabet, and that the inverses act as semigroup inverses.
 
 )pbdoc");
     }  // bind_inverse_present
-  }  // namespace
+  }    // namespace
   void init_present(py::module& m) {
     bind_present<word_type>(m, "PresentationWords");
     bind_present<std::string>(m, "PresentationStrings");