Skip to content

Commit

Permalink
fix style
Browse files Browse the repository at this point in the history
  • Loading branch information
@jnke2016
jnke2016 committed Nov 8, 2024
1 parent 24e31cb commit 7ca5d59
Show file tree
Hide file tree
Showing 6 changed files with 25 additions and 25 deletions.
2 changes: 1 addition & 1 deletion cpp/include/cugraph/detail/utility_wrappers.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -115,7 +115,7 @@ void transform_increment_ints(raft::device_span<value_t> 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
Expand Down
40 changes: 20 additions & 20 deletions cpp/include/cugraph/sampling_functions.hpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down
2 changes: 1 addition & 1 deletion cpp/tests/sampling/heterogeneous_biased_neighbor_sampling.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -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};
Expand Down
2 changes: 1 addition & 1 deletion cpp/tests/sampling/heterogeneous_uniform_neighbor_sampling.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -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};
Expand Down
2 changes: 1 addition & 1 deletion cpp/tests/sampling/mg_heterogeneous_biased_neighbor_sampling.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -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};
Expand Down
2 changes: 1 addition & 1 deletion cpp/tests/sampling/mg_heterogeneous_uniform_neighbor_sampling.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -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};
Expand Down

0 comments on commit 7ca5d59

Please sign in to comment.