Skip to content

Commit ce40641

Browse files
pratzlgithub-actions[bot]
authored andcommitted
:octocat: Applied clang-format.
1 parent b8069f8 commit ce40641

File tree

4 files changed

+22
-22
lines changed

4 files changed

+22
-22
lines changed

include/graph/views/depth_first_search.hpp

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -654,7 +654,7 @@ namespace _Vertices_DFS {
654654
# endif // ^^^ workaround ^^^
655655

656656
template <class _G, class _Alloc, class _UnCV>
657-
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
657+
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
658658
&& requires(_G&& __g, const vertex_id_t<_G>& uid, _Alloc alloc) {
659659
{ _Fake_copy_init(vertices_depth_first_search(__g, uid, alloc)) }; // intentional ADL
660660
};
@@ -746,7 +746,7 @@ namespace _Vertices_DFS {
746746
constexpr _St_ref _Strat_ref = _Choice_ref<_G&, _Alloc>._Strategy;
747747

748748
if constexpr (_Strat_ref == _St_ref::_Non_member) {
749-
return vertices_depth_first_search(__g, seed, alloc); // intentional ADL
749+
return vertices_depth_first_search(__g, seed, alloc); // intentional ADL
750750
} else if constexpr (_Strat_ref == _St_ref::_Auto_eval) {
751751
return vertices_depth_first_search_view<_G, void>(__g, seed, alloc); // default impl
752752
} else {
@@ -779,7 +779,7 @@ namespace _Vertices_DFS {
779779
constexpr _St_ref_vvf _Strat_ref_vvf = _Choice_ref_vvf<_G&, _VVF, _Alloc>._Strategy;
780780

781781
if constexpr (_Strat_ref_vvf == _St_ref_vvf::_Non_member) {
782-
return vertices_depth_first_search(__g, seed, vvf, alloc); // intentional ADL
782+
return vertices_depth_first_search(__g, seed, vvf, alloc); // intentional ADL
783783
} else if constexpr (_Strat_ref_vvf == _St_ref_vvf::_Auto_eval) {
784784
return vertices_depth_first_search_view<_G, _VVF>(__g, seed, vvf, alloc); // default impl
785785
} else {
@@ -808,7 +808,7 @@ namespace _Edges_DFS {
808808
# endif // ^^^ workaround ^^^
809809

810810
template <class _G, class _Alloc, class _UnCV>
811-
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
811+
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
812812
&& requires(_G&& __g, const vertex_id_t<_G>& uid, _Alloc alloc) {
813813
{ _Fake_copy_init(edges_depth_first_search(__g, uid, alloc)) }; // intentional ADL
814814
};
@@ -901,7 +901,7 @@ namespace _Edges_DFS {
901901
constexpr _St_ref _Strat_ref = _Choice_ref<_G&, _Alloc>._Strategy;
902902

903903
if constexpr (_Strat_ref == _St_ref::_Non_member) {
904-
return edges_depth_first_search(__g, seed, alloc); // intentional ADL
904+
return edges_depth_first_search(__g, seed, alloc); // intentional ADL
905905
} else if constexpr (_Strat_ref == _St_ref::_Auto_eval) {
906906
return edges_depth_first_search_view<_G, void, false>(__g, seed, alloc); // default impl
907907
} else {
@@ -934,7 +934,7 @@ namespace _Edges_DFS {
934934
constexpr _St_ref_evf _Strat_ref_evf = _Choice_ref_evf<_G&, _EVF, _Alloc>._Strategy;
935935

936936
if constexpr (_Strat_ref_evf == _St_ref_evf::_Non_member) {
937-
return edges_depth_first_search(__g, seed, alloc); // intentional ADL
937+
return edges_depth_first_search(__g, seed, alloc); // intentional ADL
938938
} else if constexpr (_Strat_ref_evf == _St_ref_evf::_Auto_eval) {
939939
return edges_depth_first_search_view<_G, _EVF, false>(__g, seed, evf, alloc); // default impl
940940
} else {
@@ -963,7 +963,7 @@ namespace _Sourced_Edges_DFS {
963963
# endif // ^^^ workaround ^^^
964964

965965
template <class _G, class _Alloc, class _UnCV>
966-
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
966+
concept _Has_ref_ADL = _Has_class_or_enum_type<_G> //
967967
&& requires(_G&& __g, const vertex_id_t<_G>& uid, _Alloc alloc) {
968968
{ _Fake_copy_init(sourced_edges_depth_first_search(__g, uid, alloc)) }; // intentional ADL
969969
};
@@ -1056,7 +1056,7 @@ namespace _Sourced_Edges_DFS {
10561056
constexpr _St_ref _Strat_ref = _Choice_ref<_G&, _Alloc>._Strategy;
10571057

10581058
if constexpr (_Strat_ref == _St_ref::_Non_member) {
1059-
return sourced_edges_depth_first_search(__g, seed, alloc); // intentional ADL
1059+
return sourced_edges_depth_first_search(__g, seed, alloc); // intentional ADL
10601060
} else if constexpr (_Strat_ref == _St_ref::_Auto_eval) {
10611061
return edges_depth_first_search_view<_G, void, true>(__g, seed, alloc); // default impl
10621062
} else {
@@ -1089,7 +1089,7 @@ namespace _Sourced_Edges_DFS {
10891089
constexpr _St_ref_evf _Strat_ref_evf = _Choice_ref_evf<_G&, _EVF, _Alloc>._Strategy;
10901090

10911091
if constexpr (_Strat_ref_evf == _St_ref_evf::_Non_member) {
1092-
return sourced_edges_depth_first_search(__g, seed, alloc); // intentional ADL
1092+
return sourced_edges_depth_first_search(__g, seed, alloc); // intentional ADL
10931093
} else if constexpr (_Strat_ref_evf == _St_ref_evf::_Auto_eval) {
10941094
return edges_depth_first_search_view<_G, _EVF, true>(__g, seed, evf, alloc); // default impl
10951095
} else {
@@ -1248,4 +1248,4 @@ sourced_edges_depth_first_search(G&& g, vertex_id_t<G> seed, const EVF& evf, con
12481248

12491249
# endif //0
12501250

1251-
#endif // GRAPH_DFS_HPP
1251+
#endif // GRAPH_DFS_HPP

include/graph/views/edgelist.hpp

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -389,7 +389,7 @@ namespace views {
389389
#endif // ^^^ workaround ^^^
390390

391391
template <class _G, class _UnCV>
392-
concept _Has_adjlist_all_ADL = adjacency_list<_G> //
392+
concept _Has_adjlist_all_ADL = adjacency_list<_G> //
393393
&& requires(_G&& __g) {
394394
{ _Fake_copy_init(edgelist(__g)) }; // intentional ADL
395395
};
@@ -399,23 +399,23 @@ namespace views {
399399
template <class _G, class _UnCV, class EVF>
400400
concept _Has_adjlist_all_evf_ADL = adjacency_list<_G> && invocable<EVF, edge_reference_t<_G>> //
401401
&& requires(_G&& __g, EVF evf) {
402-
{ _Fake_copy_init(edgelist(__g, evf)) }; // intentional ADL
402+
{ _Fake_copy_init(edgelist(__g, evf)) }; // intentional ADL
403403
};
404404
template <class _G, class _UnCV, class EVF>
405405
concept _Can_adjlist_all_evf_eval = adjacency_list<_G> && invocable<EVF, edge_reference_t<_G>>;
406406

407407

408408
template <class _G, class _UnCV>
409-
concept _Has_adjlist_idrng_ADL = adjacency_list<_G> //
409+
concept _Has_adjlist_idrng_ADL = adjacency_list<_G> //
410410
&& requires(_G&& __g, vertex_id_t<_G> uid, vertex_id_t<_G> vid) {
411411
{ _Fake_copy_init(edgelist(__g, uid, vid)) }; // intentional ADL
412412
};
413413
template <class _G, class _UnCV>
414414
concept _Can_adjlist_idrng_eval = adjacency_list<_G>;
415415

416416
template <class _G, class _UnCV, class EVF>
417-
concept _Has_adjlist_idrng_evf_ADL = adjacency_list<_G> //
418-
&& invocable<EVF, edge_reference_t<_G>> //
417+
concept _Has_adjlist_idrng_evf_ADL = adjacency_list<_G> //
418+
&& invocable<EVF, edge_reference_t<_G>> //
419419
&& requires(_G&& __g, vertex_id_t<_G> uid, vertex_id_t<_G> vid, EVF evf) {
420420
{ _Fake_copy_init(edgelist(__g, uid, vid, evf)) }; // intentional ADL
421421
};
@@ -466,7 +466,7 @@ namespace views {
466466
return {_St_adjlist_all::_Non_member,
467467
noexcept(_Fake_copy_init(edgelist(declval<_G>(), declval<EVF>())))}; // intentional ADL
468468
} else if constexpr (_Can_adjlist_all_evf_eval<_G, _UnCV, EVF>) {
469-
return {_St_adjlist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
469+
return {_St_adjlist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
470470
} else {
471471
return {_St_adjlist_all::_None};
472472
}
@@ -487,7 +487,7 @@ namespace views {
487487
noexcept(_Fake_copy_init(edgelist(declval<_G>(), declval<vertex_id_t<_G>>(),
488488
declval<vertex_id_t<_G>>())))}; // intentional ADL
489489
} else if constexpr (_Can_adjlist_idrng_eval<_G, _UnCV>) {
490-
return {_St_adjlist_idrng::_Auto_eval, noexcept(true)}; // default impl (revisit)
490+
return {_St_adjlist_idrng::_Auto_eval, noexcept(true)}; // default impl (revisit)
491491
} else {
492492
return {_St_adjlist_idrng::_None};
493493
}
@@ -527,7 +527,7 @@ namespace views {
527527
return {_St_edgelist_all::_Non_member,
528528
noexcept(_Fake_copy_init(edgelist(declval<ELR>(), declval<Proj>())))}; // intentional ADL
529529
} else if constexpr (_Can_edgelist_all_proj_eval<ELR, _UnCV, Proj>) {
530-
return {_St_edgelist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
530+
return {_St_edgelist_all::_Auto_eval, noexcept(true)}; // default impl (revisit)
531531
} else {
532532
return {_St_edgelist_all::_None};
533533
}

include/graph/views/incidence.hpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -315,7 +315,7 @@ namespace views {
315315
static constexpr _Choice_t<_St_id> _Choice_id_evf = _Choose_id_evf<_G, EVF>();
316316

317317
public:
318-
/**
318+
/**
319319
* @brief Get the outgoing incidence edges of a vertex id.
320320
*
321321
* Complexity: O(n)
@@ -347,7 +347,7 @@ namespace views {
347347
}
348348
}
349349

350-
/**
350+
/**
351351
* @brief Get the outgoing incidence edges of a vertex id and include an edge value in the result.
352352
*
353353
* Complexity: O(n)

tests/examples_tests.cpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -262,8 +262,8 @@ TEST_CASE("wrapped vertex-vertex-int types", "[simple][bfs][example][bacon]") {
262262

263263
std::vector<size_t> bacon_number(size(actors));
264264

265-
using G = simple_graph;
266-
G& g = costar_adjacency_list;
265+
using G = simple_graph;
266+
G& g = costar_adjacency_list;
267267

268268
for (auto&& u : std::graph::vertices(costar_adjacency_list)) {
269269
for (auto&& uv : std::graph::edges(costar_adjacency_list, u)) {

0 commit comments

Comments
 (0)