Thrust库的使用 - radix sort的具体实现写作sort by key

最新推荐文章于 2024-03-11 10:23:09 发布

陈国文21

最新推荐文章于 2024-03-11 10:23:09 发布

阅读量2k

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/chenguowen21/article/details/86746905

版权

C++ 专栏收录该内容

29 篇文章 2 订阅

订阅专栏

https://thrust.github.io/doc/group__sorting.html

https://devtalk.nvidia.com/default/topic/951795/fastest-sorting-algorithm-on-gpu-currently/

Precondition

The range [keys_first, keys_last)) shall not overlap the range [values_first, values_first + (keys_last - keys_first)).

The following code snippet demonstrates how to use sort_by_key to sort an array of character values using integers as sorting keys using the thrust::host execution policy for parallelization. The keys are sorted in descending order using the greater<int> comparison operator.

#include <thrust/sort.h>

#include <thrust/execution_policy.h>

...

const int N = 6;

int keys[N] = { 1, 4, 2, 8, 5, 7};

char values[N] = {'a', 'b', 'c', 'd', 'e', 'f'};

thrust::stable_sort_by_key(thrust::host, keys, keys + N, values, thrust::greater<int>());

// keys is now { 8, 7, 5, 4, 2, 1}

// values is now {'d', 'f', 'e', 'b', 'c', 'a'}

See Also

http://www.sgi.com/tech/stl/sort.html

sort_by_key

stable_sort

template<typename RandomAccessIterator1 , typename RandomAccessIterator2 , typename StrictWeakOrdering >

void thrust::stable_sort_by_key	(	RandomAccessIterator1	keys_first,
		RandomAccessIterator1	keys_last,
		RandomAccessIterator2	values_first,
		StrictWeakOrdering	comp
	)

stable_sort_by_key performs a key-value sort. That is, stable_sort_by_key sorts the elements in [keys_first, keys_last) and [values_first, values_first + (keys_last - keys_first)) into ascending key order, meaning that if i and j are any two valid iterators in [keys_first, keys_last) such that i precedes j, and p and q are iterators in [values_first, values_first + (keys_last - keys_first))corresponding to i and j respectively, then *j is not less than *i.

As the name suggests, stable_sort_by_key is stable: it preserves the relative ordering of equivalent elements. That is, if x and y are elements in [keys_first, keys_last) such that x precedes y, and if the two elements are equivalent (neither x < y nor y < x) then a postcondition of stable_sort_by_key is that x still precedes y.

This version of stable_sort_by_key compares key objects using the function object comp.

Parameters

keys_first	The beginning of the key sequence.
keys_last	The end of the key sequence.
values_first	The beginning of the value sequence.
comp	Comparison operator.

Template Parameters

RandomAccessIterator1	is a model of Random Access Iterator, `RandomAccessIterator1` is mutable, and `RandomAccessIterator1's` `value_type` is convertible to `StrictWeakOrdering'sfirst_argument_type` and `second_argument_type`.
RandomAccessIterator2	is a model of Random Access Iterator, and `RandomAccessIterator2` is mutable.
StrictWeakOrdering	is a model of Strict Weak Ordering.