-
Notifications
You must be signed in to change notification settings - Fork 6
/
api_Reductions.cpp
256 lines (229 loc) · 6.1 KB
/
api_Reductions.cpp
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
#include "api.h"
#include "TRTCContext.h"
#include "count.h"
#include "reduce.h"
#include "equal.h"
#include "extrema.h"
#include "inner_product.h"
#include "transform_reduce.h"
#include "logical.h"
#include "partition.h"
#include "sort.h"
unsigned long long n_count(void* ptr_vec, void* ptr_value)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
DeviceViewable* value = (DeviceViewable*)ptr_value;
size_t res;
if (TRTC_Count(*vec, *value, res))
return (unsigned long long)res;
else
return (unsigned long long)(-1);
}
unsigned long long n_count_if(void* ptr_vec, void* ptr_pred)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* pred = (Functor*)ptr_pred;
size_t res;
if (TRTC_Count_If(*vec, *pred, res))
return (unsigned long long)res;
else
return (unsigned long long)(-1);
}
void* n_reduce(void* ptr_vec, void* ptr_init, void* ptr_bin_op)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
DeviceViewable* init = (DeviceViewable*)ptr_init;
Functor* binary_op = (Functor*)ptr_bin_op;
ViewBuf ret;
if (init == nullptr)
{
if (!TRTC_Reduce(*vec, ret))
return nullptr;
}
else if (binary_op == nullptr)
{
if (!TRTC_Reduce(*vec, *init, ret))
return nullptr;
}
else
{
if (!TRTC_Reduce(*vec, *init, *binary_op, ret))
return nullptr;
}
return dv_from_viewbuf(ret, vec->name_elem_cls().c_str());
}
unsigned n_reduce_by_key(void* ptr_key_in, void* ptr_value_in, void* ptr_key_out, void* ptr_value_out, void* ptr_binary_pred, void* ptr_binary_op)
{
DVVectorLike* key_in = (DVVectorLike*)ptr_key_in;
DVVectorLike* value_in = (DVVectorLike*)ptr_value_in;
DVVectorLike* key_out = (DVVectorLike*)ptr_key_out;
DVVectorLike* value_out = (DVVectorLike*)ptr_value_out;
Functor* binary_pred = (Functor*)ptr_binary_pred;;
Functor* binary_op = (Functor*)ptr_binary_op;
if (binary_pred == nullptr)
{
return TRTC_Reduce_By_Key(*key_in, *value_in, *key_out, *value_out);
}
else if (binary_op == nullptr)
{
return TRTC_Reduce_By_Key(*key_in, *value_in, *key_out, *value_out, *binary_pred);
}
else
{
return TRTC_Reduce_By_Key(*key_in, *value_in, *key_out, *value_out, *binary_pred, *binary_op);
}
}
int n_equal(void* ptr_vec1, void* ptr_vec2, void* ptr_binary_pred)
{
DVVectorLike* vec1 = (DVVectorLike*)ptr_vec1;
DVVectorLike* vec2 = (DVVectorLike*)ptr_vec2;
Functor* binary_pred = (Functor*)ptr_binary_pred;
bool res;
if (binary_pred == nullptr)
if (TRTC_Equal(*vec1, *vec2, res))
return res ? 1 : 0;
else
return -1;
else
if (TRTC_Equal(*vec1, *vec2, *binary_pred, res))
return res ? 1 : 0;
else
return -1;
}
unsigned long long n_min_element(void* ptr_vec, void* ptr_comp)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* comp = (Functor*)ptr_comp;
size_t id_min;
if (comp == nullptr)
if (TRTC_Min_Element(*vec, id_min))
return (unsigned long long)id_min;
else
return (unsigned long long)(-1);
else
if (TRTC_Min_Element(*vec, *comp, id_min))
return (unsigned long long)id_min;
else
return (unsigned long long)(-1);
}
unsigned long long n_max_element(void* ptr_vec, void* ptr_comp)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* comp = (Functor*)ptr_comp;
size_t id_max;
if (comp == nullptr)
if (TRTC_Max_Element(*vec, id_max))
return (unsigned long long)id_max;
else
return (unsigned long long)(-1);
else
if (TRTC_Max_Element(*vec, *comp, id_max))
return (unsigned long long)id_max;
else
return (unsigned long long)(-1);
}
int n_minmax_element(void* ptr_vec, void* ptr_comp, unsigned long long* ret)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* comp = (Functor*)ptr_comp;
size_t id_min, id_max;
if (comp == nullptr)
{
if (!TRTC_MinMax_Element(*vec, id_min, id_max)) return -1;
}
else
{
if (!TRTC_MinMax_Element(*vec, *comp, id_min, id_max)) return -1;
}
ret[0] = id_min;
ret[1] = id_max;
return 0;
}
void* n_inner_product(void* ptr_vec1, void* ptr_vec2, void* ptr_init, void* ptr_binary_op1, void* ptr_binary_op2)
{
DVVectorLike* vec1 = (DVVectorLike*)ptr_vec1;
DVVectorLike* vec2 = (DVVectorLike*)ptr_vec2;
DeviceViewable* init = (DeviceViewable*)ptr_init;
Functor* binary_op1 = (Functor*)ptr_binary_op1;
Functor* binary_op2 = (Functor*)ptr_binary_op2;
ViewBuf ret;
if (binary_op1==nullptr || binary_op2 == nullptr)
{
if (!TRTC_Inner_Product(*vec1, *vec2, *init, ret)) return nullptr;
}
else
{
if (!TRTC_Inner_Product(*vec1, *vec2, *init, ret, *binary_op1, *binary_op2)) return nullptr;
}
return dv_from_viewbuf(ret, init->name_view_cls().c_str());
}
void* n_transform_reduce(void* ptr_vec, void* ptr_unary_op, void* ptr_init, void* ptr_binary_op)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* unary_op = (Functor*)ptr_unary_op;
DeviceViewable* init = (DeviceViewable*)ptr_init;
Functor* binary_op = (Functor*)ptr_binary_op;
ViewBuf ret;
if (!TRTC_Transform_Reduce(*vec, *unary_op, *init, *binary_op, ret)) return nullptr;
return dv_from_viewbuf(ret, init->name_view_cls().c_str());
}
int n_all_of(void* ptr_vec, void* ptr_pred)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* pred = (Functor*)ptr_pred;
bool res;
if (TRTC_All_Of(*vec, *pred, res))
return res ? 1 : 0;
else
return -1;
}
int n_any_of(void* ptr_vec, void* ptr_pred)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* pred = (Functor*)ptr_pred;
bool res;
if (TRTC_Any_Of(*vec, *pred, res))
return res ? 1 : 0;
else
return -1;
}
int n_none_of(void* ptr_vec, void* ptr_pred)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* pred = (Functor*)ptr_pred;
bool res;
if (TRTC_None_Of(*vec, *pred, res))
return res ? 1 : 0;
else
return -1;
}
int n_is_partitioned(void* ptr_vec, void* ptr_pred)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* pred = (Functor*)ptr_pred;
bool res;
if (TRTC_Is_Partitioned(*vec, *pred, res))
return res ? 1 : 0;
else
return -1;
}
int n_is_sorted(void* ptr_vec, void* ptr_comp)
{
DVVectorLike* vec = (DVVectorLike*)ptr_vec;
Functor* comp = (Functor*)ptr_comp;
bool res;
if (comp == nullptr)
{
if (TRTC_Is_Sorted(*vec, res))
return res ? 1 : 0;
else
return -1;
}
else
{
if (TRTC_Is_Sorted(*vec, *comp, res))
return res ? 1 : 0;
else
return -1;
}
}