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
|
/*
* Copyright 2008-2013 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/system/detail/sequential/stable_primitive_sort.h>
#include <thrust/system/detail/sequential/stable_radix_sort.h>
#include <thrust/functional.h>
#include <thrust/system/detail/sequential/partition.h>
#include <thrust/iterator/zip_iterator.h>
#include <thrust/detail/type_traits.h>
THRUST_NAMESPACE_BEGIN
namespace system
{
namespace detail
{
namespace sequential
{
namespace stable_primitive_sort_detail
{
template<typename Iterator>
struct enable_if_bool_sort
: thrust::detail::enable_if<
thrust::detail::is_same<
bool,
typename thrust::iterator_value<Iterator>::type
>::value
>
{};
template<typename Iterator>
struct disable_if_bool_sort
: thrust::detail::disable_if<
thrust::detail::is_same<
bool,
typename thrust::iterator_value<Iterator>::type
>::value
>
{};
template<typename DerivedPolicy,
typename RandomAccessIterator>
typename enable_if_bool_sort<RandomAccessIterator>::type
__host__ __device__
stable_primitive_sort(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator first, RandomAccessIterator last)
{
// use stable_partition if we're sorting bool
// stable_partition puts true values first, so we need to logical_not
sequential::stable_partition(exec, first, last, thrust::logical_not<bool>());
}
template<typename DerivedPolicy,
typename RandomAccessIterator>
typename disable_if_bool_sort<RandomAccessIterator>::type
__host__ __device__
stable_primitive_sort(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator first, RandomAccessIterator last)
{
// call stable_radix_sort
sequential::stable_radix_sort(exec,first,last);
}
struct logical_not_first
{
template<typename Tuple>
__host__ __device__
bool operator()(Tuple t)
{
return !thrust::get<0>(t);
}
};
template<typename DerivedPolicy,
typename RandomAccessIterator1,
typename RandomAccessIterator2>
typename enable_if_bool_sort<RandomAccessIterator1>::type
__host__ __device__
stable_primitive_sort_by_key(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator1 keys_first, RandomAccessIterator1 keys_last,
RandomAccessIterator2 values_first)
{
// use stable_partition if we're sorting bool
// stable_partition puts true values first, so we need to logical_not
sequential::stable_partition(exec,
thrust::make_zip_iterator(thrust::make_tuple(keys_first, values_first)),
thrust::make_zip_iterator(thrust::make_tuple(keys_last, values_first)),
logical_not_first());
}
template<typename DerivedPolicy,
typename RandomAccessIterator1,
typename RandomAccessIterator2>
typename disable_if_bool_sort<RandomAccessIterator1>::type
__host__ __device__
stable_primitive_sort_by_key(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator1 keys_first, RandomAccessIterator1 keys_last,
RandomAccessIterator2 values_first)
{
// call stable_radix_sort_by_key
sequential::stable_radix_sort_by_key(exec, keys_first, keys_last, values_first);
}
} // end stable_primitive_sort_detail
template<typename DerivedPolicy,
typename RandomAccessIterator>
__host__ __device__
void stable_primitive_sort(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator first,
RandomAccessIterator last)
{
stable_primitive_sort_detail::stable_primitive_sort(exec, first,last);
}
template<typename DerivedPolicy,
typename RandomAccessIterator1,
typename RandomAccessIterator2>
__host__ __device__
void stable_primitive_sort_by_key(sequential::execution_policy<DerivedPolicy> &exec,
RandomAccessIterator1 keys_first,
RandomAccessIterator1 keys_last,
RandomAccessIterator2 values_first)
{
stable_primitive_sort_detail::stable_primitive_sort_by_key(exec, keys_first, keys_last, values_first);
}
} // end namespace sequential
} // end namespace detail
} // end namespace system
THRUST_NAMESPACE_END
|
