Skip to content

Commit df9fcba

Browse files
SpectraL519SpectraL519
committed
format
1 parent ef60922 commit df9fcba

6 files changed

Lines changed: 13 additions & 17 deletions

File tree

‎include/gl/algorithm/impl/bfs.hpp‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,8 @@ template <
1616
std::vector<algorithm::vertex_info>,
1717
type_traits::c_optional_id_callback<bool> VisitVertexPredicate,
1818
type_traits::c_optional_id_callback<bool, types::id_type> VisitCallback,
19-
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&> EnqueueVertexPred,
19+
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&>
20+
EnqueueVertexPred,
2021
type_traits::c_optional_id_callback<void> PreVisitCallback = algorithm::empty_callback,
2122
type_traits::c_optional_id_callback<void> PostVisitCallback = algorithm::empty_callback>
2223
bool bfs(

‎include/gl/algorithm/impl/common.hpp‎

Lines changed: 3 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -31,9 +31,7 @@ template <
3131
}
3232

3333
[[nodiscard]] gl_attr_force_inline auto default_visit_vertex_predicate(std::vector<bool>& visited) {
34-
return [&](const types::id_type vertex_id) -> bool {
35-
return not visited[vertex_id];
36-
};
34+
return [&](const types::id_type vertex_id) -> bool { return not visited[vertex_id]; };
3735
}
3836

3937
template <result_discriminator ResultDiscriminator>
@@ -54,9 +52,8 @@ template <type_traits::c_graph GraphType, bool AsResult = false>
5452
) {
5553
using return_type = std::conditional_t<AsResult, predicate_result, bool>;
5654

57-
return [&](const types::id_type vertex_id, const typename GraphType::edge_type& in_edge) -> return_type {
58-
return not visited[vertex_id];
59-
};
55+
return [&](const types::id_type vertex_id, const typename GraphType::edge_type& in_edge
56+
) -> return_type { return not visited[vertex_id]; };
6057
}
6158

6259
} // namespace gl::algorithm::impl

‎include/gl/algorithm/impl/dfs.hpp‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,8 @@ template <
1414
type_traits::c_graph GraphType,
1515
type_traits::c_optional_id_callback<bool> VisitVertexPredicate,
1616
type_traits::c_optional_id_callback<bool, types::id_type> VisitCallback,
17-
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&> EnqueueVertexPred,
17+
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&>
18+
EnqueueVertexPred,
1819
type_traits::c_optional_id_callback<void> PreVisitCallback = algorithm::empty_callback,
1920
type_traits::c_optional_id_callback<void> PostVisitCallback = algorithm::empty_callback>
2021
void dfs(

‎include/gl/algorithm/impl/pfs.hpp‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,7 +17,8 @@ template <
1717
std::vector<algorithm::vertex_info>,
1818
type_traits::c_optional_id_callback<GraphType, bool> VisitVertexPredicate,
1919
type_traits::c_optional_id_callback<bool, types::id_type> VisitCallback,
20-
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&> EnqueueVertexPred,
20+
type_traits::c_id_callback<predicate_result, const typename GraphType::edge_type&>
21+
EnqueueVertexPred,
2122
type_traits::c_optional_id_callback<void> PreVisitCallback = algorithm::empty_callback,
2223
type_traits::c_optional_id_callback<void> PostVisitCallback = algorithm::empty_callback>
2324
bool pfs(

‎include/gl/algorithm/mst.hpp‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -28,8 +28,7 @@ struct mst_descriptor {
2828

2929
template <type_traits::c_undirected_graph GraphType>
3030
[[nodiscard]] mst_descriptor<GraphType> edge_heap_prim_mst(
31-
const GraphType& graph,
32-
const std::optional<types::id_type> root_id_opt
31+
const GraphType& graph, const std::optional<types::id_type> root_id_opt
3332
) {
3433
// type definitions
3534

@@ -96,8 +95,7 @@ template <type_traits::c_undirected_graph GraphType>
9695
template <type_traits::c_undirected_graph GraphType>
9796
requires type_traits::c_has_numeric_limits_max<types::vertex_distance_type<GraphType>>
9897
[[nodiscard]] mst_descriptor<GraphType> vertex_heap_prim_mst(
99-
const GraphType& graph,
100-
const std::optional<types::id_type> root_id_opt
98+
const GraphType& graph, const std::optional<types::id_type> root_id_opt
10199
) {
102100
// type definitions
103101
using edge_type = typename GraphType::edge_type;

‎include/gl/algorithm/types.hpp‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -102,16 +102,14 @@ template <typename F, typename ReturnType, typename... Args>
102102
concept c_optional_callback = c_empty_callback<F> or std::is_invocable_r_v<ReturnType, F, Args...>;
103103

104104
template <typename F, typename ReturnType, typename... Args>
105-
concept c_id_callback =
106-
std::is_invocable_r_v<ReturnType, F, const types::id_type&, Args...>;
105+
concept c_id_callback = std::is_invocable_r_v<ReturnType, F, const types::id_type&, Args...>;
107106

108107
template <typename F, typename GraphType, typename ReturnType, typename... Args>
109108
concept c_edge_callback =
110109
std::is_invocable_r_v<ReturnType, F, const typename GraphType::edge_type&, Args...>;
111110

112111
template <typename F, typename ReturnType, typename... Args>
113-
concept c_optional_id_callback =
114-
c_optional_callback<F, ReturnType, const types::id_type, Args...>;
112+
concept c_optional_id_callback = c_optional_callback<F, ReturnType, const types::id_type, Args...>;
115113

116114
template <typename F, typename GraphType, typename ReturnType, typename... Args>
117115
concept c_optional_edge_callback =

0 commit comments

Comments
 (0)