// Copyright (c) 2020-2025 Advanced Micro Devices, Inc. All rights reserved. // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE // SOFTWARE. #include #include #include #include #include #include #include #include // This example demonstrates how to expand an input sequence by // replicating each element a variable number of times. For example, // // expand([2,2,2],[A,B,C]) -> [A,A,B,B,C,C] // expand([3,0,1],[A,B,C]) -> [A,A,A,C] // expand([1,3,2],[A,B,C]) -> [A,B,B,B,C,C] // // The element counts are assumed to be non-negative integers template OutputIterator expand(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator output) { using difference_type = typename thrust::iterator_difference::type; difference_type input_size = thrust::distance(first1, last1); difference_type output_size = thrust::reduce(first1, last1); // scan the counts to obtain output offsets for each input element thrust::device_vector output_offsets(input_size, 0); thrust::exclusive_scan(first1, last1, output_offsets.begin()); // scatter the nonzero counts into their corresponding output positions thrust::device_vector output_indices(output_size, 0); thrust::scatter_if( thrust::counting_iterator(0), thrust::counting_iterator(input_size), output_offsets.begin(), first1, output_indices.begin()); // compute max-scan over the output indices, filling in the holes thrust::inclusive_scan( output_indices.begin(), output_indices.end(), output_indices.begin(), thrust::maximum()); // gather input values according to index array (output = first2[output_indices]) thrust::gather(output_indices.begin(), output_indices.end(), first2, output); // return output + output_size thrust::advance(output, output_size); return output; } template void print(const std::string& s, const Vector& v) { using T = typename Vector::value_type; std::cout << s; thrust::copy(v.begin(), v.end(), std::ostream_iterator(std::cout, " ")); std::cout << std::endl; } int main(void) { int counts[] = {3, 5, 2, 0, 1, 3, 4, 2, 4}; int values[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; size_t input_size = sizeof(counts) / sizeof(int); size_t output_size = thrust::reduce(counts, counts + input_size); // copy inputs to device thrust::device_vector d_counts(counts, counts + input_size); thrust::device_vector d_values(values, values + input_size); thrust::device_vector d_output(output_size); // expand values according to counts expand(d_counts.begin(), d_counts.end(), d_values.begin(), d_output.begin()); std::cout << "Expanding values according to counts" << std::endl; print(" counts ", d_counts); print(" values ", d_values); print(" output ", d_output); return 0; }