Merge branch 'master' into el_rng

Author: pratzl

include/graph/views/depth_first_search.hpp

@@ -1103,7 +1103,6 @@ namespace views {
     inline constexpr _Sourced_Edges_DFS::_Cpo sourced_edges_depth_first_search;
   }
 
-
 } // namespace views
 } // namespace std::graph
 

include/graph/views/edgelist.hpp

@@ -389,7 +389,7 @@ namespace views {
 #endif                                     // ^^^ workaround ^^^
 
     template <class _G, class _UnCV>
-    concept _Has_adjlist_all_ADL = adjacency_list<_G>                       //
+    concept _Has_adjlist_all_ADL = adjacency_list<_G> //
                                    && requires(_G&& __g) {
                                         { _Fake_copy_init(edgelist(__g)) }; // intentional ADL
                                       };
@@ -399,23 +399,23 @@ namespace views {
     template <class _G, class _UnCV, class EVF>
     concept _Has_adjlist_all_evf_ADL = adjacency_list<_G> && invocable<EVF, edge_reference_t<_G>> //
                                        && requires(_G&& __g, EVF evf) {
-                                            { _Fake_copy_init(edgelist(__g, evf)) };              // intentional ADL
+                                            { _Fake_copy_init(edgelist(__g, evf)) }; // intentional ADL
                                           };
     template <class _G, class _UnCV, class EVF>
     concept _Can_adjlist_all_evf_eval = adjacency_list<_G> && invocable<EVF, edge_reference_t<_G>>;
 
 
     template <class _G, class _UnCV>
-    concept _Has_adjlist_idrng_ADL = adjacency_list<_G>                                 //
+    concept _Has_adjlist_idrng_ADL = adjacency_list<_G> //
                                      && requires(_G&& __g, vertex_id_t<_G> uid, vertex_id_t<_G> vid) {
                                           { _Fake_copy_init(edgelist(__g, uid, vid)) }; // intentional ADL
                                         };
     template <class _G, class _UnCV>
     concept _Can_adjlist_idrng_eval = adjacency_list<_G>;
 
     template <class _G, class _UnCV, class EVF>
-    concept _Has_adjlist_idrng_evf_ADL = adjacency_list<_G>                                      //
-                                         && invocable<EVF, edge_reference_t<_G>>                 //
+    concept _Has_adjlist_idrng_evf_ADL = adjacency_list<_G>                      //
+                                         && invocable<EVF, edge_reference_t<_G>> //
                                          && requires(_G&& __g, vertex_id_t<_G> uid, vertex_id_t<_G> vid, EVF evf) {
                                               { _Fake_copy_init(edgelist(__g, uid, vid, evf)) }; // intentional ADL
                                             };
@@ -466,7 +466,7 @@ namespace views {
           return {_St_adjlist_all::_Non_member,
                   noexcept(_Fake_copy_init(edgelist(declval<_G>(), declval<EVF>())))}; // intentional ADL
         } else if constexpr (_Can_adjlist_all_evf_eval<_G, _UnCV, EVF>) {
-          return {_St_adjlist_all::_Auto_eval, noexcept(true)};                        // default impl (revisit)
+          return {_St_adjlist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
         } else {
           return {_St_adjlist_all::_None};
         }
@@ -487,7 +487,7 @@ namespace views {
                   noexcept(_Fake_copy_init(edgelist(declval<_G>(), declval<vertex_id_t<_G>>(),
                                                     declval<vertex_id_t<_G>>())))}; // intentional ADL
         } else if constexpr (_Can_adjlist_idrng_eval<_G, _UnCV>) {
-          return {_St_adjlist_idrng::_Auto_eval, noexcept(true)};                   // default impl (revisit)
+          return {_St_adjlist_idrng::_Auto_eval, noexcept(true)}; // default impl (revisit)
         } else {
           return {_St_adjlist_idrng::_None};
         }
@@ -527,7 +527,7 @@ namespace views {
           return {_St_edgelist_all::_Non_member,
                   noexcept(_Fake_copy_init(edgelist(declval<ELR>(), declval<Proj>())))}; // intentional ADL
         } else if constexpr (_Can_edgelist_all_proj_eval<ELR, _UnCV, Proj>) {
-          return {_St_edgelist_all::_Auto_eval, noexcept(true)};                         // default impl (revisit)
+          return {_St_edgelist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
         } else {
           return {_St_edgelist_all::_None};
         }

include/graph/views/incidence.hpp

@@ -315,7 +315,7 @@ namespace views {
       static constexpr _Choice_t<_St_id> _Choice_id_evf = _Choose_id_evf<_G, EVF>();
 
     public:
-    /**
+      /**
      * @brief Get the outgoing incidence edges of a vertex id.
      * 
      * Complexity: O(n)
@@ -347,7 +347,7 @@ namespace views {
         }
       }
 
-    /**
+      /**
      * @brief Get the outgoing incidence edges of a vertex id and include an edge value in the result.
      * 
      * Complexity: O(n)

tests/examples_tests.cpp

@@ -262,8 +262,8 @@ TEST_CASE("wrapped vertex-vertex-int types", "[simple][bfs][example][bacon]") {
 
   std::vector<size_t> bacon_number(size(actors));
 
-  using G  = simple_graph;
-  G& g = costar_adjacency_list;
+  using G = simple_graph;
+  G& g    = costar_adjacency_list;
 
   for (auto&& u : std::graph::vertices(costar_adjacency_list)) {
     for (auto&& uv : std::graph::edges(costar_adjacency_list, u)) {