From 7ca5d5926f632e444333be1ec9217878fb3440d3 Mon Sep 17 00:00:00 2001 From: jnke2016 Date: Thu, 7 Nov 2024 20:21:22 -0800 Subject: [PATCH] fix style --- .../cugraph/detail/utility_wrappers.hpp | 2 +- cpp/include/cugraph/sampling_functions.hpp | 40 +++++++++---------- ...heterogeneous_biased_neighbor_sampling.cpp | 2 +- ...eterogeneous_uniform_neighbor_sampling.cpp | 2 +- ...heterogeneous_biased_neighbor_sampling.cpp | 2 +- ...eterogeneous_uniform_neighbor_sampling.cpp | 2 +- 6 files changed, 25 insertions(+), 25 deletions(-) diff --git a/cpp/include/cugraph/detail/utility_wrappers.hpp b/cpp/include/cugraph/detail/utility_wrappers.hpp index e0307bc372..b1afeafd66 100644 --- a/cpp/include/cugraph/detail/utility_wrappers.hpp +++ b/cpp/include/cugraph/detail/utility_wrappers.hpp @@ -115,7 +115,7 @@ void transform_increment_ints(raft::device_span values, * * Similar to the function std::iota, wraps the function thrust::sequence * - * @tparam value_t type of the value to operate on. + * @tparam value_t type of the value to operate on. * * @param[in] stream_view stream view * @param[out] d_value device array to fill diff --git a/cpp/include/cugraph/sampling_functions.hpp b/cpp/include/cugraph/sampling_functions.hpp index f4178efc83..5033e46f33 100644 --- a/cpp/include/cugraph/sampling_functions.hpp +++ b/cpp/include/cugraph/sampling_functions.hpp @@ -284,12 +284,12 @@ struct sampling_flags_t { * id, edge_type (optional) identifies the edge type, hop identifies which hop the edge was * encountered in. The offsets array (optional) identifies the offset for each label. * - * If @p starting_vertex_label_offsets is not specified then no organization is applied to the output, the - * offsets values in the return set will be std::nullopt. + * If @p starting_vertex_label_offsets is not specified then no organization is applied to the + * output, the offsets values in the return set will be std::nullopt. * - * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets array - * in the return will be a CSR-style offsets array to identify the beginning of each label range in - * the output vectors. + * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets + * array in the return will be a CSR-style offsets array to identify the beginning of each label + * range in the output vectors. * * If @p label_to_output_comm_rank is specified then the data will be shuffled so that all entries * for a particular label are returned on the specified rank. This will result in the offsets array @@ -369,12 +369,12 @@ heterogeneous_uniform_neighbor_sample( * id, edge_type (optional) identifies the edge type, hop identifies which hop the edge was * encountered in. The offsets array (optional) identifies the offset for each label. * - * If @p starting_vertex_label_offsets is not specified then no organization is applied to the output, the - * offsets values in the return set will be std::nullopt. + * If @p starting_vertex_label_offsets is not specified then no organization is applied to the + * output, the offsets values in the return set will be std::nullopt. * - * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets array - * in the return will be a CSR-style offsets array to identify the beginning of each label range in - * the output vectors. + * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets + * array in the return will be a CSR-style offsets array to identify the beginning of each label + * range in the output vectors. * * If @p label_to_output_comm_rank is specified then the data will be shuffled so that all entries * for a particular label are returned on the specified rank. This will result in the offsets array @@ -459,12 +459,12 @@ heterogeneous_biased_neighbor_sample( * id, edge_type (optional) identifies the edge type, hop identifies which hop the edge was * encountered in. The offsets array (optional) identifies the offset for each label. * - * If @p starting_vertex_label_offsets is not specified then no organization is applied to the output, the - * offsets values in the return set will be std::nullopt. + * If @p starting_vertex_label_offsets is not specified then no organization is applied to the + * output, the offsets values in the return set will be std::nullopt. * - * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets array - * in the return will be a CSR-style offsets array to identify the beginning of each label range in - * the output vectors. + * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets + * array in the return will be a CSR-style offsets array to identify the beginning of each label + * range in the output vectors. * * If @p label_to_output_comm_rank is specified then the data will be shuffled so that all entries * for a particular label are returned on the specified rank. This will result in the offsets array @@ -540,12 +540,12 @@ homogeneous_uniform_neighbor_sample( * id, edge_type (optional) identifies the edge type, hop identifies which hop the edge was * encountered in. The offsets array (optional) identifies the offset for each label. * - * If @p starting_vertex_label_offsets is not specified then no organization is applied to the output, the - * offsets values in the return set will be std::nullopt. + * If @p starting_vertex_label_offsets is not specified then no organization is applied to the + * output, the offsets values in the return set will be std::nullopt. * - * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets array - * in the return will be a CSR-style offsets array to identify the beginning of each label range in - * the output vectors. + * If @p starting_vertex_label_offsets is specified the offsets array will be populated. The offsets + * array in the return will be a CSR-style offsets array to identify the beginning of each label + * range in the output vectors. * * If @p label_to_output_comm_rank is specified then the data will be shuffled so that all entries * for a particular label are returned on the specified rank. This will result in the offsets array diff --git a/cpp/tests/sampling/heterogeneous_biased_neighbor_sampling.cpp b/cpp/tests/sampling/heterogeneous_biased_neighbor_sampling.cpp index f6807ecfc8..6ea00cf510 100644 --- a/cpp/tests/sampling/heterogeneous_biased_neighbor_sampling.cpp +++ b/cpp/tests/sampling/heterogeneous_biased_neighbor_sampling.cpp @@ -30,7 +30,7 @@ struct Heterogeneous_Biased_Neighbor_Sampling_Usecase { bool flag_replacement{true}; // FIXME: Edge masking is currently not tested because it will // require attaching two masks (edge_type_t, bool_t) which - // is not currently supported. Once a primitive to support + // is not currently supported. Once a primitive to support // heterogeneous sampling is added, maintaining two masks // won't be necessary // bool edge_masking{false}; diff --git a/cpp/tests/sampling/heterogeneous_uniform_neighbor_sampling.cpp b/cpp/tests/sampling/heterogeneous_uniform_neighbor_sampling.cpp index 762381b60f..3b57aed476 100644 --- a/cpp/tests/sampling/heterogeneous_uniform_neighbor_sampling.cpp +++ b/cpp/tests/sampling/heterogeneous_uniform_neighbor_sampling.cpp @@ -30,7 +30,7 @@ struct Heterogeneous_Uniform_Neighbor_Sampling_Usecase { bool flag_replacement{true}; // FIXME: Edge masking is currently not tested because it will // require attaching two masks (edge_type_t, bool_t) which - // is not currently supported. Once a primitive to support + // is not currently supported. Once a primitive to support // heterogeneous sampling is added, maintaining two masks // won't be necessary // bool edge_masking{false}; diff --git a/cpp/tests/sampling/mg_heterogeneous_biased_neighbor_sampling.cpp b/cpp/tests/sampling/mg_heterogeneous_biased_neighbor_sampling.cpp index fd70aacf32..abdf882496 100644 --- a/cpp/tests/sampling/mg_heterogeneous_biased_neighbor_sampling.cpp +++ b/cpp/tests/sampling/mg_heterogeneous_biased_neighbor_sampling.cpp @@ -33,7 +33,7 @@ struct Heterogeneous_Biased_Neighbor_Sampling_Usecase { bool with_replacement{true}; // FIXME: Edge masking is currently not tested because it will // require attaching two masks (edge_type_t, bool_t) which - // is not currently supported. Once a primitive to support + // is not currently supported. Once a primitive to support // heterogeneous sampling is added, maintaining two masks // won't be necessary // bool edge_masking{false}; diff --git a/cpp/tests/sampling/mg_heterogeneous_uniform_neighbor_sampling.cpp b/cpp/tests/sampling/mg_heterogeneous_uniform_neighbor_sampling.cpp index eed1c4078f..42abf18682 100644 --- a/cpp/tests/sampling/mg_heterogeneous_uniform_neighbor_sampling.cpp +++ b/cpp/tests/sampling/mg_heterogeneous_uniform_neighbor_sampling.cpp @@ -33,7 +33,7 @@ struct Heterogeneous_Uniform_Neighbor_Sampling_Usecase { bool with_replacement{true}; // FIXME: Edge masking is currently not tested because it will // require attaching two masks (edge_type_t, bool_t) which - // is not currently supported. Once a primitive to support + // is not currently supported. Once a primitive to support // heterogeneous sampling is added, maintaining two masks // won't be necessary // bool edge_masking{false};