1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
//---------------------------------------------------------------------------//
// Copyright (c) 2016 Jakub Szuppe <j.szuppe@gmail.com>
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://boostorg.github.com/compute for more information.
//---------------------------------------------------------------------------//
#ifndef BOOST_COMPUTE_ALGORITHM_STABLE_SORT_BY_KEY_HPP
#define BOOST_COMPUTE_ALGORITHM_STABLE_SORT_BY_KEY_HPP
#include <iterator>
#include <boost/compute/system.hpp>
#include <boost/compute/command_queue.hpp>
#include <boost/compute/algorithm/sort_by_key.hpp>
#include <boost/compute/detail/iterator_range_size.hpp>
namespace boost {
namespace compute {
namespace detail {
template<class KeyIterator, class ValueIterator>
inline void
dispatch_gpu_ssort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
less<typename std::iterator_traits<KeyIterator>::value_type> compare,
command_queue &queue,
typename boost::enable_if_c<
is_radix_sortable<
typename std::iterator_traits<KeyIterator>::value_type
>::value
>::type* = 0)
{
size_t count = detail::iterator_range_size(keys_first, keys_last);
if(count < 32){
detail::serial_insertion_sort_by_key(
keys_first, keys_last, values_first, compare, queue
);
}
else {
detail::radix_sort_by_key(
keys_first, keys_last, values_first, queue
);
}
}
template<class KeyIterator, class ValueIterator>
inline void
dispatch_gpu_ssort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
greater<typename std::iterator_traits<KeyIterator>::value_type> compare,
command_queue &queue,
typename boost::enable_if_c<
is_radix_sortable<
typename std::iterator_traits<KeyIterator>::value_type
>::value
>::type* = 0)
{
size_t count = detail::iterator_range_size(keys_first, keys_last);
if(count < 32){
detail::serial_insertion_sort_by_key(
keys_first, keys_last, values_first, compare, queue
);
}
else {
// radix sorts in descending order
detail::radix_sort_by_key(
keys_first, keys_last, values_first, false, queue
);
}
}
template<class KeyIterator, class ValueIterator, class Compare>
inline void dispatch_gpu_ssort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
Compare compare,
command_queue &queue)
{
size_t count = detail::iterator_range_size(keys_first, keys_last);
if(count < 32){
detail::serial_insertion_sort_by_key(
keys_first, keys_last, values_first,
compare, queue
);
} else {
detail::merge_sort_by_key_on_gpu(
keys_first, keys_last, values_first,
compare, true /* stable */, queue
);
}
}
template<class KeyIterator, class ValueIterator, class Compare>
inline void dispatch_ssort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
Compare compare,
command_queue &queue)
{
if(queue.get_device().type() & device::gpu) {
dispatch_gpu_ssort_by_key(
keys_first, keys_last, values_first, compare, queue
);
return;
}
::boost::compute::detail::merge_sort_by_key_on_cpu(
keys_first, keys_last, values_first, compare, queue
);
}
} // end detail namespace
/// Performs a key-value stable sort using the keys in the range [\p keys_first,
/// \p keys_last) on the values in the range [\p values_first,
/// \p values_first \c + (\p keys_last \c - \p keys_first)) using \p compare.
///
/// If no compare function is specified, \c less is used.
///
/// Space complexity: \Omega(2n)
///
/// \see sort()
template<class KeyIterator, class ValueIterator, class Compare>
inline void stable_sort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
Compare compare,
command_queue &queue = system::default_queue())
{
::boost::compute::detail::dispatch_ssort_by_key(
keys_first, keys_last, values_first, compare, queue
);
}
/// \overload
template<class KeyIterator, class ValueIterator>
inline void stable_sort_by_key(KeyIterator keys_first,
KeyIterator keys_last,
ValueIterator values_first,
command_queue &queue = system::default_queue())
{
typedef typename std::iterator_traits<KeyIterator>::value_type key_type;
::boost::compute::stable_sort_by_key(
keys_first, keys_last, values_first, less<key_type>(), queue
);
}
} // end compute namespace
} // end boost namespace
#endif // BOOST_COMPUTE_ALGORITHM_STABLE_SORT_BY_KEY_HPP
|
