Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Clarify docstring for num_items parameter of DeviceSegmentedRadixSort #1

Merged
merged 1 commit into from
Aug 10, 2023
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 32 additions & 8 deletions cub/cub/device/device_segmented_radix_sort.cuh
Original file line number Diff line number Diff line change
Expand Up @@ -182,7 +182,10 @@ struct DeviceSegmentedRadixSort
* sequence of associated value items
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -408,7 +411,10 @@ struct DeviceSegmentedRadixSort
* to the sorted output values
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -615,7 +621,10 @@ struct DeviceSegmentedRadixSort
* sequence of associated value items
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -843,7 +852,10 @@ struct DeviceSegmentedRadixSort
* to the sorted output values
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -1040,7 +1052,10 @@ struct DeviceSegmentedRadixSort
* Device-accessible pointer to the sorted output sequence of key data
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -1240,7 +1255,10 @@ struct DeviceSegmentedRadixSort
* point to the sorted output keys
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -1431,7 +1449,10 @@ struct DeviceSegmentedRadixSort
* Device-accessible pointer to the sorted output sequence of key data
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down Expand Up @@ -1630,7 +1651,10 @@ struct DeviceSegmentedRadixSort
* point to the sorted output keys
*
* @param[in] num_items
* The total number of items to sort (across all segments)
* The total number of items to sort (across all segments). If segments
* are non-contiguous, this should include unused items in between
* segments, namely all items between the start of the first and end
* of the last segment.
*
* @param[in] num_segments
* The number of segments that comprise the sorting data
Expand Down