1 // -*- C++ -*-
2 //===----------------------------------------------------------------------===//
3 //
4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5 // See https://llvm.org/LICENSE.txt for license information.
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //
8 //===----------------------------------------------------------------------===//
9
10 #ifndef _PSTL_ALGORITHM_IMPL_H
11 #define _PSTL_ALGORITHM_IMPL_H
12
13 #include <iterator>
14 #include <type_traits>
15 #include <utility>
16 #include <functional>
17 #include <algorithm>
18
19 #include "execution_impl.h"
20 #include "memory_impl.h"
21 #include "parallel_backend.h"
22 #include "parallel_backend_utils.h"
23 #include "parallel_impl.h"
24 #include "pstl_config.h"
25 #include "unseq_backend_simd.h"
26
27 _PSTL_HIDE_FROM_ABI_PUSH
28
29 namespace __pstl
30 {
31 namespace __internal
32 {
33
34 //------------------------------------------------------------------------
35 // any_of
36 //------------------------------------------------------------------------
37
38 template <class _ForwardIterator, class _Pred>
39 bool
__brick_any_of(const _ForwardIterator __first,const _ForwardIterator __last,_Pred __pred,std::false_type)40 __brick_any_of(const _ForwardIterator __first, const _ForwardIterator __last, _Pred __pred,
41 /*__is_vector=*/std::false_type) noexcept
42 {
43 return std::any_of(__first, __last, __pred);
44 };
45
46 template <class _RandomAccessIterator, class _Pred>
47 bool
__brick_any_of(const _RandomAccessIterator __first,const _RandomAccessIterator __last,_Pred __pred,std::true_type)48 __brick_any_of(const _RandomAccessIterator __first, const _RandomAccessIterator __last, _Pred __pred,
49 /*__is_vector=*/std::true_type) noexcept
50 {
51 return __unseq_backend::__simd_or(__first, __last - __first, __pred);
52 };
53
54 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Pred>
55 bool
__pattern_any_of(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Pred __pred)56 __pattern_any_of(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) noexcept
57 {
58 return __internal::__brick_any_of(__first, __last, __pred, typename _Tag::__is_vector{});
59 }
60
61 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Pred>
62 bool
__pattern_any_of(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Pred __pred)63 __pattern_any_of(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
64 _RandomAccessIterator __last, _Pred __pred)
65 {
66 using __backend_tag = typename decltype(__tag)::__backend_tag;
67
68 return __internal::__except_handler(
69 [&]()
70 {
71 return __internal::__parallel_or(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
72 [__pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
73 { return __internal::__brick_any_of(__i, __j, __pred, _IsVector{}); });
74 });
75 }
76
77 // [alg.foreach]
78 // for_each_n with no policy
79
80 template <class _ForwardIterator, class _Size, class _Function>
81 _ForwardIterator
__for_each_n_it_serial(_ForwardIterator __first,_Size __n,_Function __f)82 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __f)
83 {
84 for (; __n > 0; ++__first, --__n)
85 __f(__first);
86 return __first;
87 }
88
89 //------------------------------------------------------------------------
90 // walk1 (pseudo)
91 //
92 // walk1 evaluates f(x) for each dereferenced value x drawn from [first,last)
93 //------------------------------------------------------------------------
94 template <class _ForwardIterator, class _Function>
95 void
__brick_walk1(_ForwardIterator __first,_ForwardIterator __last,_Function __f,std::false_type)96 __brick_walk1(_ForwardIterator __first, _ForwardIterator __last, _Function __f, /*vector=*/std::false_type) noexcept
97 {
98 std::for_each(__first, __last, __f);
99 }
100
101 template <class _RandomAccessIterator, class _Function>
102 void
__brick_walk1(_RandomAccessIterator __first,_RandomAccessIterator __last,_Function __f,std::true_type)103 __brick_walk1(_RandomAccessIterator __first, _RandomAccessIterator __last, _Function __f,
104 /*vector=*/std::true_type) noexcept
105 {
106 __unseq_backend::__simd_walk_1(__first, __last - __first, __f);
107 }
108
109 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Function>
110 void
__pattern_walk1(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Function __f)111 __pattern_walk1(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Function __f) noexcept
112 {
113 __internal::__brick_walk1(__first, __last, __f, typename _Tag::__is_vector{});
114 }
115
116 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Function>
117 void
__pattern_walk1(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Function __f)118 __pattern_walk1(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
119 _RandomAccessIterator __last, _Function __f)
120 {
121 using __backend_tag = typename decltype(__tag)::__backend_tag;
122
123 __internal::__except_handler(
124 [&]()
125 {
126 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
127 [__f](_RandomAccessIterator __i, _RandomAccessIterator __j)
128 { __internal::__brick_walk1(__i, __j, __f, _IsVector{}); });
129 });
130 }
131
132 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Brick>
133 void
__pattern_walk_brick(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Brick __brick)134 __pattern_walk_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
135 _Brick __brick) noexcept
136 {
137 __brick(__first, __last);
138 }
139
140 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
141 void
__pattern_walk_brick(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Brick __brick)142 __pattern_walk_brick(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
143 _RandomAccessIterator __last, _Brick __brick)
144 {
145 using __backend_tag = typename decltype(__tag)::__backend_tag;
146
147 __internal::__except_handler(
148 [&]()
149 {
150 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
151 [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j)
152 { __brick(__i, __j); });
153 });
154 }
155
156 //------------------------------------------------------------------------
157 // walk1_n
158 //------------------------------------------------------------------------
159 template <class _ForwardIterator, class _Size, class _Function>
160 _ForwardIterator
__brick_walk1_n(_ForwardIterator __first,_Size __n,_Function __f,std::false_type)161 __brick_walk1_n(_ForwardIterator __first, _Size __n, _Function __f, /*_IsVectorTag=*/std::false_type)
162 {
163 return __internal::__for_each_n_it_serial(__first, __n,
164 [&__f](_ForwardIterator __it) { __f(*__it); }); // calling serial version
165 }
166
167 template <class _RandomAccessIterator, class _DifferenceType, class _Function>
168 _RandomAccessIterator
__brick_walk1_n(_RandomAccessIterator __first,_DifferenceType __n,_Function __f,std::true_type)169 __brick_walk1_n(_RandomAccessIterator __first, _DifferenceType __n, _Function __f,
170 /*vectorTag=*/std::true_type) noexcept
171 {
172 return __unseq_backend::__simd_walk_1(__first, __n, __f);
173 }
174
175 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
176 _ForwardIterator
__pattern_walk1_n(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_Size __n,_Function __f)177 __pattern_walk1_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Function __f) noexcept
178 {
179 return __internal::__brick_walk1_n(__first, __n, __f, typename _Tag::__is_vector{});
180 }
181
182 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function>
183 _RandomAccessIterator
__pattern_walk1_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_Size __n,_Function __f)184 __pattern_walk1_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n,
185 _Function __f)
186 {
187 __internal::__pattern_walk1(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __n, __f);
188
189 return __first + __n;
190 }
191
192 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
193 _ForwardIterator
__pattern_walk_brick_n(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_Size __n,_Brick __brick)194 __pattern_walk_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Brick __brick) noexcept
195 {
196 return __brick(__first, __n);
197 }
198
199 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
200 _RandomAccessIterator
__pattern_walk_brick_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_Size __n,_Brick __brick)201 __pattern_walk_brick_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
202 _Size __n, _Brick __brick)
203 {
204 using __backend_tag = typename decltype(__tag)::__backend_tag;
205
206 return __internal::__except_handler(
207 [&]()
208 {
209 __par_backend::__parallel_for(
210 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __first + __n,
211 [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j) { __brick(__i, __j - __i); });
212 return __first + __n;
213 });
214 }
215
216 //------------------------------------------------------------------------
217 // walk2 (pseudo)
218 //
219 // walk2 evaluates f(x,y) for deferenced values (x,y) drawn from [first1,last1) and [first2,...)
220 //------------------------------------------------------------------------
221 template <class _ForwardIterator1, class _ForwardIterator2, class _Function>
222 _ForwardIterator2
__brick_walk2(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_Function __f,std::false_type)223 __brick_walk2(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _Function __f,
224 /*vector=*/std::false_type) noexcept
225 {
226 for (; __first1 != __last1; ++__first1, ++__first2)
227 __f(*__first1, *__first2);
228 return __first2;
229 }
230
231 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Function>
232 _RandomAccessIterator2
__brick_walk2(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_Function __f,std::true_type)233 __brick_walk2(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
234 _Function __f,
235 /*vector=*/std::true_type) noexcept
236 {
237 return __unseq_backend::__simd_walk_2(__first1, __last1 - __first1, __first2, __f);
238 }
239
240 template <class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function>
241 _ForwardIterator2
__brick_walk2_n(_ForwardIterator1 __first1,_Size __n,_ForwardIterator2 __first2,_Function __f,std::false_type)242 __brick_walk2_n(_ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2, _Function __f,
243 /*vector=*/std::false_type) noexcept
244 {
245 for (; __n > 0; --__n, ++__first1, ++__first2)
246 __f(*__first1, *__first2);
247 return __first2;
248 }
249
250 template <class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2, class _Function>
251 _RandomAccessIterator2
__brick_walk2_n(_RandomAccessIterator1 __first1,_Size __n,_RandomAccessIterator2 __first2,_Function __f,std::true_type)252 __brick_walk2_n(_RandomAccessIterator1 __first1, _Size __n, _RandomAccessIterator2 __first2, _Function __f,
253 /*vector=*/std::true_type) noexcept
254 {
255 return __unseq_backend::__simd_walk_2(__first1, __n, __first2, __f);
256 }
257
258 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function>
259 _ForwardIterator2
__pattern_walk2(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_Function __f)260 __pattern_walk2(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
261 _ForwardIterator2 __first2, _Function __f) noexcept
262 {
263 return __internal::__brick_walk2(__first1, __last1, __first2, __f, typename _Tag::__is_vector{});
264 }
265
266 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
267 class _Function>
268 _RandomAccessIterator2
__pattern_walk2(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_Function __f)269 __pattern_walk2(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
270 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Function __f)
271 {
272 using __backend_tag = typename decltype(__tag)::__backend_tag;
273
274 return __internal::__except_handler(
275 [&]()
276 {
277 __par_backend::__parallel_for(
278 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
279 [__f, __first1, __first2](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
280 { __internal::__brick_walk2(__i, __j, __first2 + (__i - __first1), __f, _IsVector{}); });
281 return __first2 + (__last1 - __first1);
282 });
283 }
284
285 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
286 class _Function>
287 _ForwardIterator2
__pattern_walk2_n(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_Size __n,_ForwardIterator2 __first2,_Function __f)288 __pattern_walk2_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2,
289 _Function __f) noexcept
290 {
291 return __internal::__brick_walk2_n(__first1, __n, __first2, __f, typename _Tag::__is_vector{});
292 }
293
294 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
295 class _RandomAccessIterator2, class _Function>
296 _RandomAccessIterator2
__pattern_walk2_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_Size __n,_RandomAccessIterator2 __first2,_Function __f)297 __pattern_walk2_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
298 _Size __n, _RandomAccessIterator2 __first2, _Function __f)
299 {
300 return __internal::__pattern_walk2(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
301 __first2, __f);
302 }
303
304 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Brick>
305 _ForwardIterator2
__pattern_walk2_brick(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_Brick __brick)306 __pattern_walk2_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
307 _ForwardIterator2 __first2, _Brick __brick) noexcept
308 {
309 return __brick(__first1, __last1, __first2);
310 }
311
312 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
313 class _Brick>
314 _RandomAccessIterator2
__pattern_walk2_brick(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_Brick __brick)315 __pattern_walk2_brick(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
316 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Brick __brick)
317 {
318 using __backend_tag = typename decltype(__tag)::__backend_tag;
319
320 return __internal::__except_handler(
321 [&]()
322 {
323 __par_backend::__parallel_for(
324 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
325 [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
326 { __brick(__i, __j, __first2 + (__i - __first1)); });
327 return __first2 + (__last1 - __first1);
328 });
329 }
330
331 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
332 class _Brick>
333 _ForwardIterator2
__pattern_walk2_brick_n(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_Size __n,_ForwardIterator2 __first2,_Brick __brick)334 __pattern_walk2_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2,
335 _Brick __brick) noexcept
336 {
337 return __brick(__first1, __n, __first2);
338 }
339
340 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
341 class _RandomAccessIterator2, class _Brick>
342 _RandomAccessIterator2
__pattern_walk2_brick_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_Size __n,_RandomAccessIterator2 __first2,_Brick __brick)343 __pattern_walk2_brick_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
344 _Size __n, _RandomAccessIterator2 __first2, _Brick __brick)
345 {
346 using __backend_tag = typename decltype(__tag)::__backend_tag;
347
348 return __internal::__except_handler(
349 [&]()
350 {
351 __par_backend::__parallel_for(
352 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
353 [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
354 { __brick(__i, __j - __i, __first2 + (__i - __first1)); });
355 return __first2 + __n;
356 });
357 }
358
359 //------------------------------------------------------------------------
360 // walk3 (pseudo)
361 //
362 // walk3 evaluates f(x,y,z) for (x,y,z) drawn from [first1,last1), [first2,...), [first3,...)
363 //------------------------------------------------------------------------
364 template <class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3, class _Function>
365 _ForwardIterator3
__brick_walk3(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator3 __first3,_Function __f,std::false_type)366 __brick_walk3(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
367 _ForwardIterator3 __first3, _Function __f, /*vector=*/std::false_type) noexcept
368 {
369 for (; __first1 != __last1; ++__first1, ++__first2, ++__first3)
370 __f(*__first1, *__first2, *__first3);
371 return __first3;
372 }
373
374 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Function>
375 _RandomAccessIterator3
__brick_walk3(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator3 __first3,_Function __f,std::true_type)376 __brick_walk3(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
377 _RandomAccessIterator3 __first3, _Function __f, /*vector=*/std::true_type) noexcept
378 {
379 return __unseq_backend::__simd_walk_3(__first1, __last1 - __first1, __first2, __first3, __f);
380 }
381
382 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3,
383 class _Function>
384 _ForwardIterator3
__pattern_walk3(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator3 __first3,_Function __f)385 __pattern_walk3(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
386 _ForwardIterator2 __first2, _ForwardIterator3 __first3, _Function __f) noexcept
387 {
388 return __internal::__brick_walk3(__first1, __last1, __first2, __first3, __f, typename _Tag::__is_vector{});
389 }
390
391 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
392 class _RandomAccessIterator3, class _Function>
393 _RandomAccessIterator3
__pattern_walk3(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator3 __first3,_Function __f)394 __pattern_walk3(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
395 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator3 __first3,
396 _Function __f)
397 {
398 using __backend_tag = typename decltype(__tag)::__backend_tag;
399
400 return __internal::__except_handler(
401 [&]()
402 {
403 __par_backend::__parallel_for(
404 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
405 [__f, __first1, __first2, __first3](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
406 __internal::__brick_walk3(__i, __j, __first2 + (__i - __first1), __first3 + (__i - __first1), __f,
407 _IsVector{});
408 });
409 return __first3 + (__last1 - __first1);
410 });
411 }
412
413 //------------------------------------------------------------------------
414 // equal
415 //------------------------------------------------------------------------
416
417 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
418 bool
__brick_equal(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __p,std::false_type)419 __brick_equal(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
420 _ForwardIterator2 __last2, _BinaryPredicate __p, /* IsVector = */ std::false_type) noexcept
421 {
422 return std::equal(__first1, __last1, __first2, __last2, __p);
423 }
424
425 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
426 bool
__brick_equal(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_BinaryPredicate __p,std::true_type)427 __brick_equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
428 _RandomAccessIterator2 __last2, _BinaryPredicate __p, /* is_vector = */ std::true_type) noexcept
429 {
430 if (__last1 - __first1 != __last2 - __first2)
431 return false;
432
433 return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).first == __last1;
434 }
435
436 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
437 bool
__pattern_equal(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __p)438 __pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
439 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __p) noexcept
440 {
441 return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, typename _Tag::__is_vector{});
442 }
443
444 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
445 class _BinaryPredicate>
446 bool
__pattern_equal(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_BinaryPredicate __p)447 __pattern_equal(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
448 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
449 _BinaryPredicate __p)
450 {
451 using __backend_tag = typename decltype(__tag)::__backend_tag;
452
453 if (__last1 - __first1 != __last2 - __first2)
454 return false;
455
456 return __internal::__except_handler(
457 [&]()
458 {
459 return !__internal::__parallel_or(
460 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
461 [__first1, __first2, __p](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
462 {
463 return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1),
464 __first2 + (__j - __first1), __p, _IsVector{});
465 });
466 });
467 }
468
469 //------------------------------------------------------------------------
470 // equal version for sequences with equal length
471 //------------------------------------------------------------------------
472
473 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
474 bool
__brick_equal(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_BinaryPredicate __p,std::false_type)475 __brick_equal(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _BinaryPredicate __p,
476 /* IsVector = */ std::false_type) noexcept
477 {
478 return std::equal(__first1, __last1, __first2, __p);
479 }
480
481 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
482 bool
__brick_equal(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_BinaryPredicate __p,std::true_type)483 __brick_equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
484 _BinaryPredicate __p, /* is_vector = */ std::true_type) noexcept
485 {
486 return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).first == __last1;
487 }
488
489 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
490 bool
__pattern_equal(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_BinaryPredicate __p)491 __pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
492 _ForwardIterator2 __first2, _BinaryPredicate __p) noexcept
493 {
494 return __internal::__brick_equal(__first1, __last1, __first2, __p, typename _Tag::__is_vector{});
495 }
496
497 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
498 class _BinaryPredicate>
499 bool
__pattern_equal(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_BinaryPredicate __p)500 __pattern_equal(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
501 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _BinaryPredicate __p)
502 {
503 using __backend_tag = typename decltype(__tag)::__backend_tag;
504
505 return __internal::__except_handler(
506 [&]()
507 {
508 return !__internal::__parallel_or(
509 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
510 [__first1, __first2, __p](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
511 { return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1), __p, _IsVector{}); });
512 });
513 }
514
515 //------------------------------------------------------------------------
516 // find_if
517 //------------------------------------------------------------------------
518 template <class _ForwardIterator, class _Predicate>
519 _ForwardIterator
__brick_find_if(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,std::false_type)520 __brick_find_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
521 /*is_vector=*/std::false_type) noexcept
522 {
523 return std::find_if(__first, __last, __pred);
524 }
525
526 template <class _RandomAccessIterator, class _Predicate>
527 _RandomAccessIterator
__brick_find_if(_RandomAccessIterator __first,_RandomAccessIterator __last,_Predicate __pred,std::true_type)528 __brick_find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred,
529 /*is_vector=*/std::true_type) noexcept
530 {
531 typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _SizeType;
532 return __unseq_backend::__simd_first(
533 __first, _SizeType(0), __last - __first,
534 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return __pred(__it[__i]); });
535 }
536
537 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
538 _ForwardIterator
__pattern_find_if(_Tag __tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred)539 __pattern_find_if(_Tag __tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
540 _Predicate __pred) noexcept
541 {
542 return __internal::__brick_find_if(__first, __last, __pred, typename _Tag::__is_vector{});
543 }
544
545 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
546 _RandomAccessIterator
__pattern_find_if(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Predicate __pred)547 __pattern_find_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
548 _RandomAccessIterator __last, _Predicate __pred)
549 {
550 using __backend_tag = typename decltype(__tag)::__backend_tag;
551
552 return __internal::__except_handler(
553 [&]()
554 {
555 return __internal::__parallel_find(
556 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
557 [__pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
558 { return __internal::__brick_find_if(__i, __j, __pred, _IsVector{}); },
559 std::less<typename std::iterator_traits<_RandomAccessIterator>::difference_type>(),
560 /*is_first=*/true);
561 });
562 }
563
564 //------------------------------------------------------------------------
565 // find_end
566 //------------------------------------------------------------------------
567
568 // find the first occurrence of the subsequence [s_first, s_last)
569 // or the last occurrence of the subsequence in the range [first, last)
570 // b_first determines what occurrence we want to find (first or last)
571 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate, class _IsVector>
572 _RandomAccessIterator1
__find_subrange(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator1 __global_last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred,bool __b_first,_IsVector __is_vector)573 __find_subrange(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator1 __global_last,
574 _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last, _BinaryPredicate __pred,
575 bool __b_first, _IsVector __is_vector) noexcept
576 {
577 typedef typename std::iterator_traits<_RandomAccessIterator2>::value_type _ValueType;
578 auto __n2 = __s_last - __s_first;
579 if (__n2 < 1)
580 {
581 return __b_first ? __first : __last;
582 }
583
584 auto __n1 = __global_last - __first;
585 if (__n1 < __n2)
586 {
587 return __last;
588 }
589
590 auto __cur = __last;
591 while (__first != __last && (__global_last - __first >= __n2))
592 {
593 // find position of *s_first in [first, last) (it can be start of subsequence)
594 __first = __internal::__brick_find_if(
595 __first, __last, __equal_value_by_pred<_ValueType, _BinaryPredicate>(*__s_first, __pred), __is_vector);
596
597 // if position that was found previously is the start of subsequence
598 // then we can exit the loop (b_first == true) or keep the position
599 // (b_first == false)
600 if (__first != __last && (__global_last - __first >= __n2) &&
601 __internal::__brick_equal(__s_first + 1, __s_last, __first + 1, __pred, __is_vector))
602 {
603 if (__b_first)
604 {
605 return __first;
606 }
607 else
608 {
609 __cur = __first;
610 }
611 }
612 else if (__first == __last)
613 {
614 break;
615 }
616 else
617 {
618 }
619
620 // in case of b_first == false we try to find new start position
621 // for the next subsequence
622 ++__first;
623 }
624 return __cur;
625 }
626
627 template <class _RandomAccessIterator, class _Size, class _Tp, class _BinaryPredicate, class _IsVector>
628 _RandomAccessIterator
__find_subrange(_RandomAccessIterator __first,_RandomAccessIterator __last,_RandomAccessIterator __global_last,_Size __count,const _Tp & __value,_BinaryPredicate __pred,_IsVector __is_vector)629 __find_subrange(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __global_last,
630 _Size __count, const _Tp& __value, _BinaryPredicate __pred, _IsVector __is_vector) noexcept
631 {
632 if (static_cast<_Size>(__global_last - __first) < __count || __count < 1)
633 {
634 return __last; // According to the standard last shall be returned when count < 1
635 }
636
637 auto __unary_pred = __equal_value_by_pred<_Tp, _BinaryPredicate>(__value, __pred);
638 while (__first != __last && (static_cast<_Size>(__global_last - __first) >= __count))
639 {
640 __first = __internal::__brick_find_if(__first, __last, __unary_pred, __is_vector);
641
642 // check that all of elements in [first+1, first+count) equal to value
643 if (__first != __last && (static_cast<_Size>(__global_last - __first) >= __count) &&
644 !__internal::__brick_any_of(__first + 1, __first + __count, std::not_fn(__unary_pred), __is_vector))
645 {
646 return __first;
647 }
648 else if (__first == __last)
649 {
650 break;
651 }
652 else
653 {
654 ++__first;
655 }
656 }
657 return __last;
658 }
659
660 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
661 _ForwardIterator1
__brick_find_end(_ForwardIterator1 __first,_ForwardIterator1 __last,_ForwardIterator2 __s_first,_ForwardIterator2 __s_last,_BinaryPredicate __pred,std::false_type)662 __brick_find_end(_ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
663 _ForwardIterator2 __s_last, _BinaryPredicate __pred, /*__is_vector=*/std::false_type) noexcept
664 {
665 return std::find_end(__first, __last, __s_first, __s_last, __pred);
666 }
667
668 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
669 _RandomAccessIterator1
__brick_find_end(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred,std::true_type)670 __brick_find_end(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
671 _RandomAccessIterator2 __s_last, _BinaryPredicate __pred, /*__is_vector=*/std::true_type) noexcept
672 {
673 return __find_subrange(__first, __last, __last, __s_first, __s_last, __pred, false, std::true_type());
674 }
675
676 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
677 _ForwardIterator1
__pattern_find_end(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first,_ForwardIterator1 __last,_ForwardIterator2 __s_first,_ForwardIterator2 __s_last,_BinaryPredicate __pred)678 __pattern_find_end(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
679 _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
680 {
681 return __internal::__brick_find_end(__first, __last, __s_first, __s_last, __pred, typename _Tag::__is_vector{});
682 }
683
684 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
685 class _BinaryPredicate>
686 _RandomAccessIterator1
__pattern_find_end(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred)687 __pattern_find_end(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
688 _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last,
689 _BinaryPredicate __pred) noexcept
690 {
691 using __backend_tag = typename decltype(__tag)::__backend_tag;
692
693 if (__last - __first == __s_last - __s_first)
694 {
695 const bool __res = __internal::__pattern_equal(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
696 __s_first, __pred);
697 return __res ? __first : __last;
698 }
699 else
700 {
701 return __internal::__except_handler(
702 [&]()
703 {
704 return __internal::__parallel_find(
705 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
706 [__last, __s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
707 return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, false,
708 _IsVector{});
709 },
710 std::greater<typename std::iterator_traits<_RandomAccessIterator1>::difference_type>(),
711 /*is_first=*/false);
712 });
713 }
714 }
715
716 //------------------------------------------------------------------------
717 // find_first_of
718 //------------------------------------------------------------------------
719 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
720 _ForwardIterator1
__brick_find_first_of(_ForwardIterator1 __first,_ForwardIterator1 __last,_ForwardIterator2 __s_first,_ForwardIterator2 __s_last,_BinaryPredicate __pred,std::false_type)721 __brick_find_first_of(_ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
722 _ForwardIterator2 __s_last, _BinaryPredicate __pred, /*__is_vector=*/std::false_type) noexcept
723 {
724 return std::find_first_of(__first, __last, __s_first, __s_last, __pred);
725 }
726
727 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
728 _RandomAccessIterator1
__brick_find_first_of(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred,std::true_type)729 __brick_find_first_of(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
730 _RandomAccessIterator2 __s_last, _BinaryPredicate __pred, /*__is_vector=*/std::true_type) noexcept
731 {
732 return __unseq_backend::__simd_find_first_of(__first, __last, __s_first, __s_last, __pred);
733 }
734
735 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
736 _ForwardIterator1
__pattern_find_first_of(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first,_ForwardIterator1 __last,_ForwardIterator2 __s_first,_ForwardIterator2 __s_last,_BinaryPredicate __pred)737 __pattern_find_first_of(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
738 _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
739 {
740 return __internal::__brick_find_first_of(__first, __last, __s_first, __s_last, __pred,
741 typename _Tag::__is_vector{});
742 }
743
744 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
745 class _BinaryPredicate>
746 _RandomAccessIterator1
__pattern_find_first_of(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred)747 __pattern_find_first_of(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
748 _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
749 _RandomAccessIterator2 __s_last, _BinaryPredicate __pred) noexcept
750 {
751 using __backend_tag = typename decltype(__tag)::__backend_tag;
752
753 return __internal::__except_handler(
754 [&]()
755 {
756 return __internal::__parallel_find(
757 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
758 [__s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
759 { return __internal::__brick_find_first_of(__i, __j, __s_first, __s_last, __pred, _IsVector{}); },
760 std::less<typename std::iterator_traits<_RandomAccessIterator1>::difference_type>(), /*is_first=*/true);
761 });
762 }
763
764 //------------------------------------------------------------------------
765 // search
766 //------------------------------------------------------------------------
767 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
768 _RandomAccessIterator1
__brick_search(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred,std::false_type)769 __brick_search(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
770 _RandomAccessIterator2 __s_last, _BinaryPredicate __pred, /*vector=*/std::false_type) noexcept
771 {
772 return std::search(__first, __last, __s_first, __s_last, __pred);
773 }
774
775 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
776 _RandomAccessIterator1
__brick_search(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred,std::true_type)777 __brick_search(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
778 _RandomAccessIterator2 __s_last, _BinaryPredicate __pred, /*vector=*/std::true_type) noexcept
779 {
780 return __internal::__find_subrange(__first, __last, __last, __s_first, __s_last, __pred, true, std::true_type());
781 }
782
783 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
784 _ForwardIterator1
__pattern_search(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first,_ForwardIterator1 __last,_ForwardIterator2 __s_first,_ForwardIterator2 __s_last,_BinaryPredicate __pred)785 __pattern_search(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
786 _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
787 {
788 return __internal::__brick_search(__first, __last, __s_first, __s_last, __pred, typename _Tag::__is_vector{});
789 }
790
791 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
792 class _BinaryPredicate>
793 _RandomAccessIterator1
__pattern_search(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __s_first,_RandomAccessIterator2 __s_last,_BinaryPredicate __pred)794 __pattern_search(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
795 _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last,
796 _BinaryPredicate __pred) noexcept
797 {
798 using __backend_tag = typename decltype(__tag)::__backend_tag;
799
800 if (__last - __first == __s_last - __s_first)
801 {
802 const bool __res = __internal::__pattern_equal(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
803 __s_first, __pred);
804 return __res ? __first : __last;
805 }
806 else
807 {
808 return __internal::__except_handler(
809 [&]()
810 {
811 return __internal::__parallel_find(
812 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
813 [__last, __s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
814 return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, true,
815 _IsVector{});
816 },
817 std::less<typename std::iterator_traits<_RandomAccessIterator1>::difference_type>(),
818 /*is_first=*/true);
819 });
820 }
821 }
822
823 //------------------------------------------------------------------------
824 // search_n
825 //------------------------------------------------------------------------
826 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
827 _ForwardIterator
__brick_search_n(_ForwardIterator __first,_ForwardIterator __last,_Size __count,const _Tp & __value,_BinaryPredicate __pred,std::false_type)828 __brick_search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value,
829 _BinaryPredicate __pred, /*vector=*/std::false_type) noexcept
830 {
831 return std::search_n(__first, __last, __count, __value, __pred);
832 }
833
834 template <class _RandomAccessIterator, class _Size, class _Tp, class _BinaryPredicate>
835 _RandomAccessIterator
__brick_search_n(_RandomAccessIterator __first,_RandomAccessIterator __last,_Size __count,const _Tp & __value,_BinaryPredicate __pred,std::true_type)836 __brick_search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __count, const _Tp& __value,
837 _BinaryPredicate __pred, /*vector=*/std::true_type) noexcept
838 {
839 return __internal::__find_subrange(__first, __last, __last, __count, __value, __pred, std::true_type());
840 }
841
842 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
843 _ForwardIterator
__pattern_search_n(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Size __count,const _Tp & __value,_BinaryPredicate __pred)844 __pattern_search_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Size __count,
845 const _Tp& __value, _BinaryPredicate __pred) noexcept
846 {
847 return __internal::__brick_search_n(__first, __last, __count, __value, __pred, typename _Tag::__is_vector{});
848 }
849
850 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp,
851 class _BinaryPredicate>
852 _RandomAccessIterator
__pattern_search_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Size __count,const _Tp & __value,_BinaryPredicate __pred)853 __pattern_search_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
854 _RandomAccessIterator __last, _Size __count, const _Tp& __value, _BinaryPredicate __pred) noexcept
855 {
856 using __backend_tag = typename decltype(__tag)::__backend_tag;
857
858 if (static_cast<_Size>(__last - __first) == __count)
859 {
860 const bool __result =
861 !__internal::__pattern_any_of(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
862 [&__value, &__pred](const _Tp& __val) { return !__pred(__val, __value); });
863 return __result ? __first : __last;
864 }
865 else
866 {
867 return __internal::__except_handler(
868 [&__exec, __first, __last, __count, &__value, __pred]()
869 {
870 return __internal::__parallel_find(
871 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
872 [__last, __count, &__value, __pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
873 { return __internal::__find_subrange(__i, __j, __last, __count, __value, __pred, _IsVector{}); },
874 std::less<typename std::iterator_traits<_RandomAccessIterator>::difference_type>(),
875 /*is_first=*/true);
876 });
877 }
878 }
879
880 //------------------------------------------------------------------------
881 // copy_n
882 //------------------------------------------------------------------------
883
884 template <class _ForwardIterator, class _Size, class _OutputIterator>
885 _OutputIterator
__brick_copy_n(_ForwardIterator __first,_Size __n,_OutputIterator __result,std::false_type)886 __brick_copy_n(_ForwardIterator __first, _Size __n, _OutputIterator __result, /*vector=*/std::false_type) noexcept
887 {
888 return std::copy_n(__first, __n, __result);
889 }
890
891 template <class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2>
892 _RandomAccessIterator2
__brick_copy_n(_RandomAccessIterator1 __first,_Size __n,_RandomAccessIterator2 __result,std::true_type)893 __brick_copy_n(_RandomAccessIterator1 __first, _Size __n, _RandomAccessIterator2 __result,
894 /*vector=*/std::true_type) noexcept
895 {
896 return __unseq_backend::__simd_assign(
897 __first, __n, __result,
898 [](_RandomAccessIterator1 __first, _RandomAccessIterator2 __result) { *__result = *__first; });
899 }
900
901 //------------------------------------------------------------------------
902 // copy
903 //------------------------------------------------------------------------
904 template <class _ForwardIterator, class _OutputIterator>
905 _OutputIterator
__brick_copy(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,std::false_type)906 __brick_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
907 /*vector=*/std::false_type) noexcept
908 {
909 return std::copy(__first, __last, __result);
910 }
911
912 template <class _RandomAccessIterator1, class _RandomAccessIterator2>
913 _RandomAccessIterator2
__brick_copy(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,std::true_type)914 __brick_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
915 /*vector=*/std::true_type) noexcept
916 {
917 return __unseq_backend::__simd_assign(
918 __first, __last - __first, __result,
919 [](_RandomAccessIterator1 __first, _RandomAccessIterator2 __result) { *__result = *__first; });
920 }
921
922 //------------------------------------------------------------------------
923 // move
924 //------------------------------------------------------------------------
925 template <class _ForwardIterator, class _OutputIterator>
926 _OutputIterator
__brick_move(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,std::false_type)927 __brick_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
928 /*vector=*/std::false_type) noexcept
929 {
930 return std::move(__first, __last, __result);
931 }
932
933 template <class _RandomAccessIterator1, class _RandomAccessIterator2>
934 _RandomAccessIterator2
__brick_move(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,std::true_type)935 __brick_move(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
936 /*vector=*/std::true_type) noexcept
937 {
938 return __unseq_backend::__simd_assign(
939 __first, __last - __first, __result,
940 [](_RandomAccessIterator1 __first, _RandomAccessIterator2 __result) { *__result = std::move(*__first); });
941 }
942
943 struct __brick_move_destroy
944 {
945 template <typename _RandomAccessIterator1, typename _RandomAccessIterator2>
946 _RandomAccessIterator2
operator__brick_move_destroy947 operator()(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
948 /*vec*/ std::true_type) const
949 {
950 using _IteratorValueType = typename std::iterator_traits<_RandomAccessIterator1>::value_type;
951
952 return __unseq_backend::__simd_assign(__first, __last - __first, __result,
953 [](_RandomAccessIterator1 __first, _RandomAccessIterator2 __result) {
954 *__result = std::move(*__first);
955 (*__first).~_IteratorValueType();
956 });
957 }
958
959 template <typename _RandomAccessIterator1, typename _RandomAccessIterator2>
960 _RandomAccessIterator2
operator__brick_move_destroy961 operator()(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
962 /*vec*/ std::false_type) const
963 {
964 using _IteratorValueType = typename std::iterator_traits<_RandomAccessIterator1>::value_type;
965
966 for (; __first != __last; ++__first, ++__result)
967 {
968 *__result = std::move(*__first);
969 (*__first).~_IteratorValueType();
970 }
971 return __result;
972 }
973 };
974
975 //------------------------------------------------------------------------
976 // swap_ranges
977 //------------------------------------------------------------------------
978 template <class _ForwardIterator, class _OutputIterator>
979 _OutputIterator
__brick_swap_ranges(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,std::false_type)980 __brick_swap_ranges(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
981 /*vector=*/std::false_type) noexcept
982 {
983 return std::swap_ranges(__first, __last, __result);
984 }
985
986 template <class _RandomAccessIterator1, class _RandomAccessIterator2>
987 _RandomAccessIterator2
__brick_swap_ranges(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,std::true_type)988 __brick_swap_ranges(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
989 /*vector=*/std::true_type) noexcept
990 {
991 using std::iter_swap;
992 return __unseq_backend::__simd_assign(__first, __last - __first, __result,
993 iter_swap<_RandomAccessIterator1, _RandomAccessIterator2>);
994 }
995
996 //------------------------------------------------------------------------
997 // copy_if
998 //------------------------------------------------------------------------
999 template <class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
1000 _OutputIterator
__brick_copy_if(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,_UnaryPredicate __pred,std::false_type)1001 __brick_copy_if(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _UnaryPredicate __pred,
1002 /*vector=*/std::false_type) noexcept
1003 {
1004 return std::copy_if(__first, __last, __result, __pred);
1005 }
1006
1007 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _UnaryPredicate>
1008 _RandomAccessIterator2
__brick_copy_if(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,_UnaryPredicate __pred,std::true_type)1009 __brick_copy_if(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
1010 _UnaryPredicate __pred,
1011 /*vector=*/std::true_type) noexcept
1012 {
1013 #if defined(_PSTL_MONOTONIC_PRESENT)
1014 return __unseq_backend::__simd_copy_if(__first, __last - __first, __result, __pred);
1015 #else
1016 return std::copy_if(__first, __last, __result, __pred);
1017 #endif
1018 }
1019
1020 // TODO: Try to use transform_reduce for combining __brick_copy_if_phase1 on IsVector.
1021 template <class _DifferenceType, class _ForwardIterator, class _UnaryPredicate>
1022 std::pair<_DifferenceType, _DifferenceType>
__brick_calc_mask_1(_ForwardIterator __first,_ForwardIterator __last,bool * __restrict __mask,_UnaryPredicate __pred,std::false_type)1023 __brick_calc_mask_1(_ForwardIterator __first, _ForwardIterator __last, bool* __restrict __mask, _UnaryPredicate __pred,
1024 /*vector=*/std::false_type) noexcept
1025 {
1026 auto __count_true = _DifferenceType(0);
1027 auto __size = __last - __first;
1028
1029 static_assert(__are_random_access_iterators<_ForwardIterator>::value,
1030 "Pattern-brick error. Should be a random access iterator.");
1031
1032 for (; __first != __last; ++__first, ++__mask)
1033 {
1034 *__mask = __pred(*__first);
1035 if (*__mask)
1036 {
1037 ++__count_true;
1038 }
1039 }
1040 return std::make_pair(__count_true, __size - __count_true);
1041 }
1042
1043 template <class _DifferenceType, class _RandomAccessIterator, class _UnaryPredicate>
1044 std::pair<_DifferenceType, _DifferenceType>
__brick_calc_mask_1(_RandomAccessIterator __first,_RandomAccessIterator __last,bool * __mask,_UnaryPredicate __pred,std::true_type)1045 __brick_calc_mask_1(_RandomAccessIterator __first, _RandomAccessIterator __last, bool* __mask, _UnaryPredicate __pred,
1046 /*vector=*/std::true_type) noexcept
1047 {
1048 auto __result = __unseq_backend::__simd_calc_mask_1(__first, __last - __first, __mask, __pred);
1049 return std::make_pair(__result, (__last - __first) - __result);
1050 }
1051
1052 template <class _ForwardIterator, class _OutputIterator, class _Assigner>
1053 void
__brick_copy_by_mask(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,bool * __mask,_Assigner __assigner,std::false_type)1054 __brick_copy_by_mask(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, bool* __mask,
1055 _Assigner __assigner, /*vector=*/std::false_type) noexcept
1056 {
1057 for (; __first != __last; ++__first, ++__mask)
1058 {
1059 if (*__mask)
1060 {
1061 __assigner(__first, __result);
1062 ++__result;
1063 }
1064 }
1065 }
1066
1067 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Assigner>
1068 void
__brick_copy_by_mask(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,bool * __restrict __mask,_Assigner __assigner,std::true_type)1069 __brick_copy_by_mask(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
1070 bool* __restrict __mask, _Assigner __assigner, /*vector=*/std::true_type) noexcept
1071 {
1072 #if defined(_PSTL_MONOTONIC_PRESENT)
1073 __unseq_backend::__simd_copy_by_mask(__first, __last - __first, __result, __mask, __assigner);
1074 #else
1075 __internal::__brick_copy_by_mask(__first, __last, __result, __mask, __assigner, std::false_type());
1076 #endif
1077 }
1078
1079 template <class _ForwardIterator, class _OutputIterator1, class _OutputIterator2>
1080 void
__brick_partition_by_mask(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator1 __out_true,_OutputIterator2 __out_false,bool * __mask,std::false_type)1081 __brick_partition_by_mask(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator1 __out_true,
1082 _OutputIterator2 __out_false, bool* __mask, /*vector=*/std::false_type) noexcept
1083 {
1084 for (; __first != __last; ++__first, ++__mask)
1085 {
1086 if (*__mask)
1087 {
1088 *__out_true = *__first;
1089 ++__out_true;
1090 }
1091 else
1092 {
1093 *__out_false = *__first;
1094 ++__out_false;
1095 }
1096 }
1097 }
1098
1099 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3>
1100 void
__brick_partition_by_mask(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __out_true,_RandomAccessIterator3 __out_false,bool * __mask,std::true_type)1101 __brick_partition_by_mask(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
1102 _RandomAccessIterator2 __out_true, _RandomAccessIterator3 __out_false, bool* __mask,
1103 /*vector=*/std::true_type) noexcept
1104 {
1105 #if defined(_PSTL_MONOTONIC_PRESENT)
1106 __unseq_backend::__simd_partition_by_mask(__first, __last - __first, __out_true, __out_false, __mask);
1107 #else
1108 __internal::__brick_partition_by_mask(__first, __last, __out_true, __out_false, __mask, std::false_type());
1109 #endif
1110 }
1111
1112 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
1113 _OutputIterator
__pattern_copy_if(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,_UnaryPredicate __pred)1114 __pattern_copy_if(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
1115 _UnaryPredicate __pred) noexcept
1116 {
1117 return __internal::__brick_copy_if(__first, __last, __result, __pred, typename _Tag::__is_vector{});
1118 }
1119
1120 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
1121 class _UnaryPredicate>
1122 _RandomAccessIterator2
__pattern_copy_if(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,_UnaryPredicate __pred)1123 __pattern_copy_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
1124 _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _UnaryPredicate __pred)
1125 {
1126 using __backend_tag = typename decltype(__tag)::__backend_tag;
1127
1128 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
1129 const _DifferenceType __n = __last - __first;
1130 if (_DifferenceType(1) < __n)
1131 {
1132 __par_backend::__buffer<bool> __mask_buf(__n);
1133 return __internal::__except_handler(
1134 [&__exec, __n, __first, __result, __pred, &__mask_buf]()
1135 {
1136 bool* __mask = __mask_buf.get();
1137 _DifferenceType __m{};
1138 __par_backend::__parallel_strict_scan(
1139 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
1140 [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
1141 return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
1142 __mask + __i, __pred, _IsVector{})
1143 .first;
1144 },
1145 std::plus<_DifferenceType>(), // Combine
1146 [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
1147 __internal::__brick_copy_by_mask(
1148 __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
1149 [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; }, _IsVector{});
1150 },
1151 [&__m](_DifferenceType __total) { __m = __total; });
1152 return __result + __m;
1153 });
1154 }
1155 // trivial sequence - use serial algorithm
1156 return __internal::__brick_copy_if(__first, __last, __result, __pred, _IsVector{});
1157 }
1158
1159 //------------------------------------------------------------------------
1160 // count
1161 //------------------------------------------------------------------------
1162 template <class _RandomAccessIterator, class _Predicate>
1163 typename std::iterator_traits<_RandomAccessIterator>::difference_type
__brick_count(_RandomAccessIterator __first,_RandomAccessIterator __last,_Predicate __pred,std::true_type)1164 __brick_count(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred,
1165 /* is_vector = */ std::true_type) noexcept
1166 {
1167 return __unseq_backend::__simd_count(__first, __last - __first, __pred);
1168 }
1169
1170 template <class _ForwardIterator, class _Predicate>
1171 typename std::iterator_traits<_ForwardIterator>::difference_type
__brick_count(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,std::false_type)1172 __brick_count(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
1173 /* is_vector = */ std::false_type) noexcept
1174 {
1175 return std::count_if(__first, __last, __pred);
1176 }
1177
1178 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
1179 typename std::iterator_traits<_ForwardIterator>::difference_type
__pattern_count(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred)1180 __pattern_count(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) noexcept
1181 {
1182 return __internal::__brick_count(__first, __last, __pred, typename _Tag::__is_vector{});
1183 }
1184
1185 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
1186 typename std::iterator_traits<_RandomAccessIterator>::difference_type
__pattern_count(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Predicate __pred)1187 __pattern_count(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1188 _RandomAccessIterator __last, _Predicate __pred)
1189 {
1190 using __backend_tag = typename decltype(__tag)::__backend_tag;
1191
1192 typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _SizeType;
1193 return __internal::__except_handler(
1194 [&]()
1195 {
1196 return __par_backend::__parallel_reduce(
1197 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, _SizeType(0),
1198 [__pred](_RandomAccessIterator __begin, _RandomAccessIterator __end, _SizeType __value) -> _SizeType
1199 { return __value + __internal::__brick_count(__begin, __end, __pred, _IsVector{}); },
1200 std::plus<_SizeType>());
1201 });
1202 }
1203
1204 //------------------------------------------------------------------------
1205 // unique
1206 //------------------------------------------------------------------------
1207
1208 template <class _RandomAccessIterator, class _BinaryPredicate>
1209 _RandomAccessIterator
__brick_unique(_RandomAccessIterator __first,_RandomAccessIterator __last,_BinaryPredicate __pred,std::false_type)1210 __brick_unique(_RandomAccessIterator __first, _RandomAccessIterator __last, _BinaryPredicate __pred,
1211 /*is_vector=*/std::false_type) noexcept
1212 {
1213 return std::unique(__first, __last, __pred);
1214 }
1215
1216 template <class _RandomAccessIterator, class _BinaryPredicate>
1217 _RandomAccessIterator
__brick_unique(_RandomAccessIterator __first,_RandomAccessIterator __last,_BinaryPredicate __pred,std::true_type)1218 __brick_unique(_RandomAccessIterator __first, _RandomAccessIterator __last, _BinaryPredicate __pred,
1219 /*is_vector=*/std::true_type) noexcept
1220 {
1221 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
1222 return std::unique(__first, __last, __pred);
1223 }
1224
1225 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
1226 _ForwardIterator
__pattern_unique(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_BinaryPredicate __pred)1227 __pattern_unique(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
1228 _BinaryPredicate __pred) noexcept
1229 {
1230 return __internal::__brick_unique(__first, __last, __pred, typename _Tag::__is_vector{});
1231 }
1232
1233 // That function is shared between two algorithms - remove_if (__pattern_remove_if) and unique (pattern unique). But a mask calculation is different.
1234 // So, a caller passes _CalcMask brick into remove_elements.
1235 template <class _IsVector, class _ExecutionPolicy, class _ForwardIterator, class _CalcMask>
1236 _ForwardIterator
__remove_elements(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_ForwardIterator __first,_ForwardIterator __last,_CalcMask __calc_mask)1237 __remove_elements(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _ForwardIterator __first,
1238 _ForwardIterator __last, _CalcMask __calc_mask)
1239 {
1240 using __backend_tag = typename decltype(__tag)::__backend_tag;
1241
1242 typedef typename std::iterator_traits<_ForwardIterator>::difference_type _DifferenceType;
1243 typedef typename std::iterator_traits<_ForwardIterator>::value_type _Tp;
1244 _DifferenceType __n = __last - __first;
1245 __par_backend::__buffer<bool> __mask_buf(__n);
1246 // 1. find a first iterator that should be removed
1247 return __internal::__except_handler([&]() {
1248 bool* __mask = __mask_buf.get();
1249 _DifferenceType __min = __par_backend::__parallel_reduce(
1250 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), _DifferenceType(0), __n, __n,
1251 [__first, __mask, &__calc_mask](_DifferenceType __i, _DifferenceType __j,
1252 _DifferenceType __local_min) -> _DifferenceType
1253 {
1254 // Create mask
1255 __calc_mask(__mask + __i, __mask + __j, __first + __i);
1256
1257 // if minimum was found in a previous range we shouldn't do anymore
1258 if (__local_min < __i)
1259 {
1260 return __local_min;
1261 }
1262 // find first iterator that should be removed
1263 bool* __result = __internal::__brick_find_if(
1264 __mask + __i, __mask + __j, [](bool __val) { return !__val; }, _IsVector{});
1265 if (__result - __mask == __j)
1266 {
1267 return __local_min;
1268 }
1269 return std::min(__local_min, _DifferenceType(__result - __mask));
1270 },
1271 [](_DifferenceType __local_min1, _DifferenceType __local_min2) -> _DifferenceType
1272 { return std::min(__local_min1, __local_min2); });
1273
1274 // No elements to remove - exit
1275 if (__min == __n)
1276 {
1277 return __last;
1278 }
1279 __n -= __min;
1280 __first += __min;
1281
1282 __par_backend::__buffer<_Tp> __buf(__n);
1283 _Tp* __result = __buf.get();
1284 __mask += __min;
1285 _DifferenceType __m{};
1286 // 2. Elements that doesn't satisfy pred are moved to result
1287 __par_backend::__parallel_strict_scan(
1288 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
1289 [__mask](_DifferenceType __i, _DifferenceType __len)
1290 {
1291 return __internal::__brick_count(
1292 __mask + __i, __mask + __i + __len, [](bool __val) { return __val; }, _IsVector{});
1293 },
1294 std::plus<_DifferenceType>(),
1295 [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial)
1296 {
1297 __internal::__brick_copy_by_mask(
1298 __first + __i, __first + __i + __len, __result + __initial, __mask + __i,
1299 [](_ForwardIterator __x, _Tp* __z)
1300 {
1301 __internal::__invoke_if_else(
1302 std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
1303 [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
1304 },
1305 _IsVector{});
1306 },
1307 [&__m](_DifferenceType __total) { __m = __total; });
1308
1309 // 3. Elements from result are moved to [first, last)
1310 __par_backend::__parallel_for(
1311 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
1312 [__result, __first](_Tp* __i, _Tp* __j)
1313 {
1314 __invoke_if_else(
1315 std::is_trivial<_Tp>(), [&]() { __brick_move(__i, __j, __first + (__i - __result), _IsVector{}); },
1316 [&]() { __brick_move_destroy()(__i, __j, __first + (__i - __result), _IsVector{}); });
1317 });
1318 return __first + __m;
1319 });
1320 }
1321
1322 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
1323 _RandomAccessIterator
__pattern_unique(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_BinaryPredicate __pred)1324 __pattern_unique(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1325 _RandomAccessIterator __last, _BinaryPredicate __pred) noexcept
1326 {
1327 typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
1328
1329 if (__first == __last)
1330 {
1331 return __last;
1332 }
1333 if (__first + 1 == __last || __first + 2 == __last)
1334 {
1335 // Trivial sequence - use serial algorithm
1336 return __internal::__brick_unique(__first, __last, __pred, _IsVector{});
1337 }
1338 return __internal::__remove_elements(
1339 __tag, std::forward<_ExecutionPolicy>(__exec), ++__first, __last,
1340 [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it)
1341 {
1342 __internal::__brick_walk3(
1343 __b, __e, __it - 1, __it,
1344 [&__pred](bool& __x, _ReferenceType __y, _ReferenceType __z) { __x = !__pred(__y, __z); }, _IsVector{});
1345 });
1346 }
1347
1348 //------------------------------------------------------------------------
1349 // unique_copy
1350 //------------------------------------------------------------------------
1351
1352 template <class _ForwardIterator, class OutputIterator, class _BinaryPredicate>
1353 OutputIterator
__brick_unique_copy(_ForwardIterator __first,_ForwardIterator __last,OutputIterator __result,_BinaryPredicate __pred,std::false_type)1354 __brick_unique_copy(_ForwardIterator __first, _ForwardIterator __last, OutputIterator __result, _BinaryPredicate __pred,
1355 /*vector=*/std::false_type) noexcept
1356 {
1357 return std::unique_copy(__first, __last, __result, __pred);
1358 }
1359
1360 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
1361 _RandomAccessIterator2
__brick_unique_copy(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,_BinaryPredicate __pred,std::true_type)1362 __brick_unique_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result,
1363 _BinaryPredicate __pred, /*vector=*/std::true_type) noexcept
1364 {
1365 #if defined(_PSTL_MONOTONIC_PRESENT)
1366 return __unseq_backend::__simd_unique_copy(__first, __last - __first, __result, __pred);
1367 #else
1368 return std::unique_copy(__first, __last, __result, __pred);
1369 #endif
1370 }
1371
1372 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryPredicate>
1373 _OutputIterator
__pattern_unique_copy(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_OutputIterator __result,_BinaryPredicate __pred)1374 __pattern_unique_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
1375 _OutputIterator __result, _BinaryPredicate __pred) noexcept
1376 {
1377 return __internal::__brick_unique_copy(__first, __last, __result, __pred, typename _Tag::__is_vector{});
1378 }
1379
1380 template <class _DifferenceType, class _RandomAccessIterator, class _BinaryPredicate>
1381 _DifferenceType
__brick_calc_mask_2(_RandomAccessIterator __first,_RandomAccessIterator __last,bool * __restrict __mask,_BinaryPredicate __pred,std::false_type)1382 __brick_calc_mask_2(_RandomAccessIterator __first, _RandomAccessIterator __last, bool* __restrict __mask,
1383 _BinaryPredicate __pred, /*vector=*/std::false_type) noexcept
1384 {
1385 _DifferenceType __count = 0;
1386 for (; __first != __last; ++__first, ++__mask)
1387 {
1388 *__mask = !__pred(*__first, *(__first - 1));
1389 __count += *__mask;
1390 }
1391 return __count;
1392 }
1393
1394 template <class _DifferenceType, class _RandomAccessIterator, class _BinaryPredicate>
1395 _DifferenceType
__brick_calc_mask_2(_RandomAccessIterator __first,_RandomAccessIterator __last,bool * __restrict __mask,_BinaryPredicate __pred,std::true_type)1396 __brick_calc_mask_2(_RandomAccessIterator __first, _RandomAccessIterator __last, bool* __restrict __mask,
1397 _BinaryPredicate __pred, /*vector=*/std::true_type) noexcept
1398 {
1399 return __unseq_backend::__simd_calc_mask_2(__first, __last - __first, __mask, __pred);
1400 }
1401
1402 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
1403 class _BinaryPredicate>
1404 _RandomAccessIterator2
__pattern_unique_copy(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,_BinaryPredicate __pred)1405 __pattern_unique_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
1406 _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _BinaryPredicate __pred)
1407 {
1408 using __backend_tag = typename decltype(__tag)::__backend_tag;
1409
1410 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
1411 const _DifferenceType __n = __last - __first;
1412 if (_DifferenceType(2) < __n)
1413 {
1414 __par_backend::__buffer<bool> __mask_buf(__n);
1415 if (_DifferenceType(2) < __n)
1416 {
1417 return __internal::__except_handler(
1418 [&__exec, __n, __first, __result, __pred, &__mask_buf]()
1419 {
1420 bool* __mask = __mask_buf.get();
1421 _DifferenceType __m{};
1422 __par_backend::__parallel_strict_scan(
1423 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
1424 [=](_DifferenceType __i, _DifferenceType __len) -> _DifferenceType { // Reduce
1425 _DifferenceType __extra = 0;
1426 if (__i == 0)
1427 {
1428 // Special boundary case
1429 __mask[__i] = true;
1430 if (--__len == 0)
1431 return 1;
1432 ++__i;
1433 ++__extra;
1434 }
1435 return __internal::__brick_calc_mask_2<_DifferenceType>(
1436 __first + __i, __first + (__i + __len), __mask + __i, __pred, _IsVector{}) +
1437 __extra;
1438 },
1439 std::plus<_DifferenceType>(), // Combine
1440 [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
1441 // Phase 2 is same as for __pattern_copy_if
1442 __internal::__brick_copy_by_mask(
1443 __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
1444 [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; },
1445 _IsVector{});
1446 },
1447 [&__m](_DifferenceType __total) { __m = __total; });
1448 return __result + __m;
1449 });
1450 }
1451 }
1452 // trivial sequence - use serial algorithm
1453 return __internal::__brick_unique_copy(__first, __last, __result, __pred, _IsVector{});
1454 }
1455
1456 //------------------------------------------------------------------------
1457 // reverse
1458 //------------------------------------------------------------------------
1459 template <class _BidirectionalIterator>
1460 void
__brick_reverse(_BidirectionalIterator __first,_BidirectionalIterator __last,std::false_type)1461 __brick_reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, /*__is_vector=*/std::false_type) noexcept
1462 {
1463 std::reverse(__first, __last);
1464 }
1465
1466 template <class _RandomAccessIterator>
1467 void
__brick_reverse(_RandomAccessIterator __first,_RandomAccessIterator __last,std::true_type)1468 __brick_reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, /*__is_vector=*/std::true_type) noexcept
1469 {
1470 typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
1471
1472 const auto __n = (__last - __first) / 2;
1473 __unseq_backend::__simd_walk_2(__first, __n, std::reverse_iterator<_RandomAccessIterator>(__last),
1474 [](_ReferenceType __x, _ReferenceType __y) {
1475 using std::swap;
1476 swap(__x, __y);
1477 });
1478 }
1479
1480 // this brick is called in parallel version, so we can use iterator arithmetic
1481 template <class _BidirectionalIterator>
1482 void
__brick_reverse(_BidirectionalIterator __first,_BidirectionalIterator __last,_BidirectionalIterator __d_last,std::false_type)1483 __brick_reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, _BidirectionalIterator __d_last,
1484 /*is_vector=*/std::false_type) noexcept
1485 {
1486 for (--__d_last; __first != __last; ++__first, --__d_last)
1487 {
1488 using std::iter_swap;
1489 iter_swap(__first, __d_last);
1490 }
1491 }
1492
1493 // this brick is called in parallel version, so we can use iterator arithmetic
1494 template <class _RandomAccessIterator>
1495 void
__brick_reverse(_RandomAccessIterator __first,_RandomAccessIterator __last,_RandomAccessIterator __d_last,std::true_type)1496 __brick_reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __d_last,
1497 /*is_vector=*/std::true_type) noexcept
1498 {
1499 typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
1500
1501 __unseq_backend::__simd_walk_2(__first, __last - __first, std::reverse_iterator<_RandomAccessIterator>(__d_last),
1502 [](_ReferenceType __x, _ReferenceType __y) {
1503 using std::swap;
1504 swap(__x, __y);
1505 });
1506 }
1507
1508 template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator>
1509 void
__pattern_reverse(_Tag,_ExecutionPolicy &&,_BidirectionalIterator __first,_BidirectionalIterator __last)1510 __pattern_reverse(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last) noexcept
1511 {
1512 __internal::__brick_reverse(__first, __last, typename _Tag::__is_vector{});
1513 }
1514
1515 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
1516 void
__pattern_reverse(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last)1517 __pattern_reverse(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1518 _RandomAccessIterator __last)
1519 {
1520 using __backend_tag = typename decltype(__tag)::__backend_tag;
1521
1522 __par_backend::__parallel_for(
1523 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __first + (__last - __first) / 2,
1524 [__first, __last](_RandomAccessIterator __inner_first, _RandomAccessIterator __inner_last)
1525 { __internal::__brick_reverse(__inner_first, __inner_last, __last - (__inner_first - __first), _IsVector{}); });
1526 }
1527
1528 //------------------------------------------------------------------------
1529 // reverse_copy
1530 //------------------------------------------------------------------------
1531
1532 template <class _BidirectionalIterator, class _OutputIterator>
1533 _OutputIterator
__brick_reverse_copy(_BidirectionalIterator __first,_BidirectionalIterator __last,_OutputIterator __d_first,std::false_type)1534 __brick_reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __d_first,
1535 /*is_vector=*/std::false_type) noexcept
1536 {
1537 return std::reverse_copy(__first, __last, __d_first);
1538 }
1539
1540 template <class _RandomAccessIterator1, class _RandomAccessIterator2>
1541 _RandomAccessIterator2
__brick_reverse_copy(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __d_first,std::true_type)1542 __brick_reverse_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __d_first,
1543 /*is_vector=*/std::true_type) noexcept
1544 {
1545 typedef typename std::iterator_traits<_RandomAccessIterator1>::reference _ReferenceType1;
1546 typedef typename std::iterator_traits<_RandomAccessIterator2>::reference _ReferenceType2;
1547
1548 return __unseq_backend::__simd_walk_2(std::reverse_iterator<_RandomAccessIterator1>(__last), __last - __first,
1549 __d_first, [](_ReferenceType1 __x, _ReferenceType2 __y) { __y = __x; });
1550 }
1551
1552 template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator>
1553 _OutputIterator
__pattern_reverse_copy(_Tag,_ExecutionPolicy &&,_BidirectionalIterator __first,_BidirectionalIterator __last,_OutputIterator __d_first)1554 __pattern_reverse_copy(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
1555 _OutputIterator __d_first) noexcept
1556 {
1557 return __internal::__brick_reverse_copy(__first, __last, __d_first, typename _Tag::__is_vector{});
1558 }
1559
1560 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2>
1561 _RandomAccessIterator2
__pattern_reverse_copy(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __d_first)1562 __pattern_reverse_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
1563 _RandomAccessIterator1 __last, _RandomAccessIterator2 __d_first)
1564 {
1565 using __backend_tag = typename decltype(__tag)::__backend_tag;
1566
1567 auto __len = __last - __first;
1568 __par_backend::__parallel_for(
1569 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
1570 [__first, __len, __d_first](_RandomAccessIterator1 __inner_first, _RandomAccessIterator1 __inner_last)
1571 {
1572 __internal::__brick_reverse_copy(__inner_first, __inner_last,
1573 __d_first + (__len - (__inner_last - __first)), _IsVector{});
1574 });
1575 return __d_first + __len;
1576 }
1577
1578 //------------------------------------------------------------------------
1579 // rotate
1580 //------------------------------------------------------------------------
1581 template <class _ForwardIterator>
1582 _ForwardIterator
__brick_rotate(_ForwardIterator __first,_ForwardIterator __middle,_ForwardIterator __last,std::false_type)1583 __brick_rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
1584 /*is_vector=*/std::false_type) noexcept
1585 {
1586 #if defined(_PSTL_CPP11_STD_ROTATE_BROKEN)
1587 std::rotate(__first, __middle, __last);
1588 return std::next(__first, std::distance(__middle, __last));
1589 #else
1590 return std::rotate(__first, __middle, __last);
1591 #endif
1592 }
1593
1594 template <class _RandomAccessIterator>
1595 _RandomAccessIterator
__brick_rotate(_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last,std::true_type)1596 __brick_rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
1597 /*is_vector=*/std::true_type) noexcept
1598 {
1599 auto __n = __last - __first;
1600 auto __m = __middle - __first;
1601 const _RandomAccessIterator __ret = __first + (__last - __middle);
1602
1603 bool __is_left = (__m <= __n / 2);
1604 if (!__is_left)
1605 __m = __n - __m;
1606
1607 while (__n > 1 && __m > 0)
1608 {
1609 using std::iter_swap;
1610 const auto __m_2 = __m * 2;
1611 if (__is_left)
1612 {
1613 for (; __last - __first >= __m_2; __first += __m)
1614 {
1615 __unseq_backend::__simd_assign(__first, __m, __first + __m,
1616 iter_swap<_RandomAccessIterator, _RandomAccessIterator>);
1617 }
1618 }
1619 else
1620 {
1621 for (; __last - __first >= __m_2; __last -= __m)
1622 {
1623 __unseq_backend::__simd_assign(__last - __m, __m, __last - __m_2,
1624 iter_swap<_RandomAccessIterator, _RandomAccessIterator>);
1625 }
1626 }
1627 __is_left = !__is_left;
1628 __m = __n % __m;
1629 __n = __last - __first;
1630 }
1631
1632 return __ret;
1633 }
1634
1635 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator>
1636 _ForwardIterator
__pattern_rotate(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __middle,_ForwardIterator __last)1637 __pattern_rotate(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle,
1638 _ForwardIterator __last) noexcept
1639 {
1640 return __internal::__brick_rotate(__first, __middle, __last, typename _Tag::__is_vector{});
1641 }
1642
1643 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
1644 _RandomAccessIterator
__pattern_rotate(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last)1645 __pattern_rotate(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1646 _RandomAccessIterator __middle, _RandomAccessIterator __last)
1647 {
1648 using __backend_tag = typename decltype(__tag)::__backend_tag;
1649
1650 typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _Tp;
1651 auto __n = __last - __first;
1652 auto __m = __middle - __first;
1653 if (__m <= __n / 2)
1654 {
1655 __par_backend::__buffer<_Tp> __buf(__n - __m);
1656 return __internal::__except_handler(
1657 [&__exec, __n, __m, __first, __middle, __last, &__buf]()
1658 {
1659 _Tp* __result = __buf.get();
1660 __par_backend::__parallel_for(
1661 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __middle, __last,
1662 [__middle, __result](_RandomAccessIterator __b, _RandomAccessIterator __e)
1663 { __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __middle), _IsVector{}); });
1664
1665 __par_backend::__parallel_for(
1666 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle,
1667 [__last, __middle](_RandomAccessIterator __b, _RandomAccessIterator __e)
1668 { __internal::__brick_move(__b, __e, __b + (__last - __middle), _IsVector{}); });
1669
1670 __par_backend::__parallel_for(
1671 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + (__n - __m),
1672 [__first, __result](_Tp* __b, _Tp* __e)
1673 { __brick_move_destroy()(__b, __e, __first + (__b - __result), _IsVector{}); });
1674
1675 return __first + (__last - __middle);
1676 });
1677 }
1678 else
1679 {
1680 __par_backend::__buffer<_Tp> __buf(__m);
1681 return __internal::__except_handler(
1682 [&__exec, __n, __m, __first, __middle, __last, &__buf]()
1683 {
1684 _Tp* __result = __buf.get();
1685 __par_backend::__parallel_for(
1686 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle,
1687 [__first, __result](_RandomAccessIterator __b, _RandomAccessIterator __e)
1688 { __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __first), _IsVector{}); });
1689
1690 __par_backend::__parallel_for(
1691 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __middle, __last,
1692 [__first, __middle](_RandomAccessIterator __b, _RandomAccessIterator __e)
1693 { __internal::__brick_move(__b, __e, __first + (__b - __middle), _IsVector{}); });
1694
1695 __par_backend::__parallel_for(
1696 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
1697 [__n, __m, __first, __result](_Tp* __b, _Tp* __e)
1698 { __brick_move_destroy()(__b, __e, __first + ((__n - __m) + (__b - __result)), _IsVector{}); });
1699
1700 return __first + (__last - __middle);
1701 });
1702 }
1703 }
1704
1705 //------------------------------------------------------------------------
1706 // rotate_copy
1707 //------------------------------------------------------------------------
1708
1709 template <class _ForwardIterator, class _OutputIterator>
1710 _OutputIterator
__brick_rotate_copy(_ForwardIterator __first,_ForwardIterator __middle,_ForwardIterator __last,_OutputIterator __result,std::false_type)1711 __brick_rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
1712 _OutputIterator __result, /*__is_vector=*/std::false_type) noexcept
1713 {
1714 return std::rotate_copy(__first, __middle, __last, __result);
1715 }
1716
1717 template <class _RandomAccessIterator1, class _RandomAccessIterator2>
1718 _RandomAccessIterator2
__brick_rotate_copy(_RandomAccessIterator1 __first,_RandomAccessIterator1 __middle,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result,std::true_type)1719 __brick_rotate_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __middle, _RandomAccessIterator1 __last,
1720 _RandomAccessIterator2 __result, /*__is_vector=*/std::true_type) noexcept
1721 {
1722 _RandomAccessIterator2 __res = __internal::__brick_copy(__middle, __last, __result, std::true_type());
1723 return __internal::__brick_copy(__first, __middle, __res, std::true_type());
1724 }
1725
1726 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator>
1727 _OutputIterator
__pattern_rotate_copy(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __middle,_ForwardIterator __last,_OutputIterator __result)1728 __pattern_rotate_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle,
1729 _ForwardIterator __last, _OutputIterator __result) noexcept
1730 {
1731 return __internal::__brick_rotate_copy(__first, __middle, __last, __result, typename _Tag::__is_vector{});
1732 }
1733
1734 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2>
1735 _RandomAccessIterator2
__pattern_rotate_copy(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __middle,_RandomAccessIterator1 __last,_RandomAccessIterator2 __result)1736 __pattern_rotate_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
1737 _RandomAccessIterator1 __middle, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result)
1738 {
1739 using __backend_tag = typename decltype(__tag)::__backend_tag;
1740
1741 __par_backend::__parallel_for(
1742 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
1743 [__first, __last, __middle, __result](_RandomAccessIterator1 __b, _RandomAccessIterator1 __e)
1744 {
1745 if (__b > __middle)
1746 {
1747 __internal::__brick_copy(__b, __e, __result + (__b - __middle), _IsVector{});
1748 }
1749 else
1750 {
1751 _RandomAccessIterator2 __new_result = __result + ((__last - __middle) + (__b - __first));
1752 if (__e < __middle)
1753 {
1754 __internal::__brick_copy(__b, __e, __new_result, _IsVector{});
1755 }
1756 else
1757 {
1758 __internal::__brick_copy(__b, __middle, __new_result, _IsVector{});
1759 __internal::__brick_copy(__middle, __e, __result, _IsVector{});
1760 }
1761 }
1762 });
1763 return __result + (__last - __first);
1764 }
1765
1766 //------------------------------------------------------------------------
1767 // is_partitioned
1768 //------------------------------------------------------------------------
1769
1770 template <class _ForwardIterator, class _UnaryPredicate>
1771 bool
__brick_is_partitioned(_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred,std::false_type)1772 __brick_is_partitioned(_ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
1773 /*is_vector=*/std::false_type) noexcept
1774 {
1775 return std::is_partitioned(__first, __last, __pred);
1776 }
1777
1778 template <class _RandomAccessIterator, class _UnaryPredicate>
1779 bool
__brick_is_partitioned(_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred,std::true_type)1780 __brick_is_partitioned(_RandomAccessIterator __first, _RandomAccessIterator __last, _UnaryPredicate __pred,
1781 /*is_vector=*/std::true_type) noexcept
1782 {
1783 typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _SizeType;
1784 if (__first == __last)
1785 {
1786 return true;
1787 }
1788 else
1789 {
1790 _RandomAccessIterator __result = __unseq_backend::__simd_first(
1791 __first, _SizeType(0), __last - __first,
1792 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return !__pred(__it[__i]); });
1793 if (__result == __last)
1794 {
1795 return true;
1796 }
1797 else
1798 {
1799 ++__result;
1800 return !__unseq_backend::__simd_or(__result, __last - __result, __pred);
1801 }
1802 }
1803 }
1804
1805 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
1806 bool
__pattern_is_partitioned(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred)1807 __pattern_is_partitioned(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
1808 _UnaryPredicate __pred) noexcept
1809 {
1810 return __internal::__brick_is_partitioned(__first, __last, __pred, typename _Tag::__is_vector{});
1811 }
1812
1813 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
1814 bool
__pattern_is_partitioned(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred)1815 __pattern_is_partitioned(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1816 _RandomAccessIterator __last, _UnaryPredicate __pred)
1817 {
1818 if (__first == __last)
1819 {
1820 return true;
1821 }
1822 else
1823 {
1824 using __backend_tag = typename decltype(__tag)::__backend_tag;
1825
1826 return __internal::__except_handler([&]() {
1827 // State of current range:
1828 // broken - current range is not partitioned by pred
1829 // all_true - all elements in current range satisfy pred
1830 // all_false - all elements in current range don't satisfy pred
1831 // true_false - elements satisfy pred are placed before elements that don't satisfy pred
1832 enum _ReduceType
1833 {
1834 __not_init = -1,
1835 __broken,
1836 __all_true,
1837 __all_false,
1838 __true_false
1839 };
1840 _ReduceType __init = __not_init;
1841
1842 // Array with states that we'll have when state from the left branch is merged with state from the right branch.
1843 // State is calculated by formula: new_state = table[left_state * 4 + right_state]
1844 _ReduceType __table[] = {__broken, __broken, __broken, __broken, __broken, __all_true,
1845 __true_false, __true_false, __broken, __broken, __all_false, __broken,
1846 __broken, __broken, __true_false, __broken};
1847
1848 __init = __par_backend::__parallel_reduce(
1849 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
1850 [&__pred, &__table](_RandomAccessIterator __i, _RandomAccessIterator __j,
1851 _ReduceType __value) -> _ReduceType
1852 {
1853 if (__value == __broken)
1854 {
1855 return __broken;
1856 }
1857 _ReduceType __res = __not_init;
1858 // if first element satisfy pred
1859 if (__pred(*__i))
1860 {
1861 // find first element that don't satisfy pred
1862 _RandomAccessIterator __x =
1863 __internal::__brick_find_if(__i + 1, __j, std::not_fn(__pred), _IsVector{});
1864 if (__x != __j)
1865 {
1866 // find first element after "x" that satisfy pred
1867 _RandomAccessIterator __y = __internal::__brick_find_if(__x + 1, __j, __pred, _IsVector{});
1868 // if it was found then range isn't partitioned by pred
1869 if (__y != __j)
1870 {
1871 return __broken;
1872 }
1873 else
1874 {
1875 __res = __true_false;
1876 }
1877 }
1878 else
1879 {
1880 __res = __all_true;
1881 }
1882 }
1883 else
1884 { // if first element doesn't satisfy pred
1885 // then we should find the first element that satisfy pred.
1886 // If we found it then range isn't partitioned by pred
1887 if (__internal::__brick_find_if(__i + 1, __j, __pred, _IsVector{}) != __j)
1888 {
1889 return __broken;
1890 }
1891 else
1892 {
1893 __res = __all_false;
1894 }
1895 }
1896 // if we have value from left range then we should calculate the result
1897 return (__value == -1) ? __res : __table[__value * 4 + __res];
1898 },
1899
1900 [&__table](_ReduceType __val1, _ReduceType __val2) -> _ReduceType
1901 {
1902 if (__val1 == __broken || __val2 == __broken)
1903 {
1904 return __broken;
1905 }
1906 // calculate the result for new big range
1907 return __table[__val1 * 4 + __val2];
1908 });
1909 return __init != __broken;
1910 });
1911 }
1912 }
1913
1914 //------------------------------------------------------------------------
1915 // partition
1916 //------------------------------------------------------------------------
1917
1918 template <class _ForwardIterator, class _UnaryPredicate>
1919 _ForwardIterator
__brick_partition(_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred,std::false_type)1920 __brick_partition(_ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
1921 /*is_vector=*/std::false_type) noexcept
1922 {
1923 return std::partition(__first, __last, __pred);
1924 }
1925
1926 template <class _RandomAccessIterator, class _UnaryPredicate>
1927 _RandomAccessIterator
__brick_partition(_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred,std::true_type)1928 __brick_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _UnaryPredicate __pred,
1929 /*is_vector=*/std::true_type) noexcept
1930 {
1931 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
1932 return std::partition(__first, __last, __pred);
1933 }
1934
1935 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
1936 _ForwardIterator
__pattern_partition(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred)1937 __pattern_partition(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
1938 _UnaryPredicate __pred) noexcept
1939 {
1940 return __internal::__brick_partition(__first, __last, __pred, typename _Tag::__is_vector{});
1941 }
1942
1943 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
1944 _RandomAccessIterator
__pattern_partition(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred)1945 __pattern_partition(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
1946 _RandomAccessIterator __last, _UnaryPredicate __pred)
1947 {
1948 using __backend_tag = typename decltype(__tag)::__backend_tag;
1949
1950 // partitioned range: elements before pivot satisfy pred (true part),
1951 // elements after pivot don't satisfy pred (false part)
1952 struct _PartitionRange
1953 {
1954 _RandomAccessIterator __begin;
1955 _RandomAccessIterator __pivot;
1956 _RandomAccessIterator __end;
1957 };
1958
1959 return __internal::__except_handler([&]() {
1960 _PartitionRange __init{__last, __last, __last};
1961
1962 // lambda for merging two partitioned ranges to one partitioned range
1963 auto __reductor = [&__exec](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange
1964 {
1965 auto __size1 = __val1.__end - __val1.__pivot;
1966 auto __size2 = __val2.__pivot - __val2.__begin;
1967 auto __new_begin = __val2.__begin - (__val1.__end - __val1.__begin);
1968
1969 // if all elements in left range satisfy pred then we can move new pivot to pivot of right range
1970 if (__val1.__end == __val1.__pivot)
1971 {
1972 return {__new_begin, __val2.__pivot, __val2.__end};
1973 }
1974 // if true part of right range greater than false part of left range
1975 // then we should swap the false part of left range and last part of true part of right range
1976 else if (__size2 > __size1)
1977 {
1978 __par_backend::__parallel_for(
1979 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size1,
1980 [__val1, __val2, __size1](_RandomAccessIterator __i, _RandomAccessIterator __j) {
1981 __internal::__brick_swap_ranges(__i, __j, (__val2.__pivot - __size1) + (__i - __val1.__pivot),
1982 _IsVector{});
1983 });
1984 return {__new_begin, __val2.__pivot - __size1, __val2.__end};
1985 }
1986 // else we should swap the first part of false part of left range and true part of right range
1987 else
1988 {
1989 __par_backend::__parallel_for(
1990 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size2,
1991 [__val1, __val2](_RandomAccessIterator __i, _RandomAccessIterator __j) {
1992 __internal::__brick_swap_ranges(__i, __j, __val2.__begin + (__i - __val1.__pivot), _IsVector{});
1993 });
1994 return {__new_begin, __val1.__pivot + __size2, __val2.__end};
1995 }
1996 };
1997
1998 _PartitionRange __result = __par_backend::__parallel_reduce(
1999 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
2000 [__pred, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
2001 _PartitionRange __value) -> _PartitionRange
2002 {
2003 //1. serial partition
2004 _RandomAccessIterator __pivot = __internal::__brick_partition(__i, __j, __pred, _IsVector{});
2005
2006 // 2. merging of two ranges (left and right respectively)
2007 return __reductor(__value, {__i, __pivot, __j});
2008 },
2009 __reductor);
2010 return __result.__pivot;
2011 });
2012 }
2013
2014 //------------------------------------------------------------------------
2015 // stable_partition
2016 //------------------------------------------------------------------------
2017
2018 template <class _BidirectionalIterator, class _UnaryPredicate>
2019 _BidirectionalIterator
__brick_stable_partition(_BidirectionalIterator __first,_BidirectionalIterator __last,_UnaryPredicate __pred,std::false_type)2020 __brick_stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _UnaryPredicate __pred,
2021 /*__is_vector=*/std::false_type) noexcept
2022 {
2023 return std::stable_partition(__first, __last, __pred);
2024 }
2025
2026 template <class _RandomAccessIterator, class _UnaryPredicate>
2027 _RandomAccessIterator
__brick_stable_partition(_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred,std::true_type)2028 __brick_stable_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _UnaryPredicate __pred,
2029 /*__is_vector=*/std::true_type) noexcept
2030 {
2031 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
2032 return std::stable_partition(__first, __last, __pred);
2033 }
2034
2035 template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate>
2036 _BidirectionalIterator
__pattern_stable_partition(_Tag,_ExecutionPolicy &&,_BidirectionalIterator __first,_BidirectionalIterator __last,_UnaryPredicate __pred)2037 __pattern_stable_partition(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
2038 _UnaryPredicate __pred) noexcept
2039 {
2040 return __internal::__brick_stable_partition(__first, __last, __pred, typename _Tag::__is_vector{});
2041 }
2042
2043 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
2044 _RandomAccessIterator
__pattern_stable_partition(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred)2045 __pattern_stable_partition(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2046 _RandomAccessIterator __last, _UnaryPredicate __pred) noexcept
2047 {
2048 using __backend_tag = typename decltype(__tag)::__backend_tag;
2049
2050 // partitioned range: elements before pivot satisfy pred (true part),
2051 // elements after pivot don't satisfy pred (false part)
2052 struct _PartitionRange
2053 {
2054 _RandomAccessIterator __begin;
2055 _RandomAccessIterator __pivot;
2056 _RandomAccessIterator __end;
2057 };
2058
2059 return __internal::__except_handler([&]() {
2060 _PartitionRange __init{__last, __last, __last};
2061
2062 // lambda for merging two partitioned ranges to one partitioned range
2063 auto __reductor = [](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange
2064 {
2065 auto __size1 = __val1.__end - __val1.__pivot;
2066 auto __new_begin = __val2.__begin - (__val1.__end - __val1.__begin);
2067
2068 // if all elements in left range satisfy pred then we can move new pivot to pivot of right range
2069 if (__val1.__end == __val1.__pivot)
2070 {
2071 return {__new_begin, __val2.__pivot, __val2.__end};
2072 }
2073 // if true part of right range greater than false part of left range
2074 // then we should swap the false part of left range and last part of true part of right range
2075 else
2076 {
2077 __internal::__brick_rotate(__val1.__pivot, __val2.__begin, __val2.__pivot, _IsVector{});
2078 return {__new_begin, __val2.__pivot - __size1, __val2.__end};
2079 }
2080 };
2081
2082 _PartitionRange __result = __par_backend::__parallel_reduce(
2083 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
2084 [&__pred, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
2085 _PartitionRange __value) -> _PartitionRange
2086 {
2087 //1. serial stable_partition
2088 _RandomAccessIterator __pivot = __internal::__brick_stable_partition(__i, __j, __pred, _IsVector{});
2089
2090 // 2. merging of two ranges (left and right respectively)
2091 return __reductor(__value, {__i, __pivot, __j});
2092 },
2093 __reductor);
2094 return __result.__pivot;
2095 });
2096 }
2097
2098 //------------------------------------------------------------------------
2099 // partition_copy
2100 //------------------------------------------------------------------------
2101
2102 template <class _ForwardIterator, class _OutputIterator1, class _OutputIterator2, class _UnaryPredicate>
2103 std::pair<_OutputIterator1, _OutputIterator2>
__brick_partition_copy(_ForwardIterator __first,_ForwardIterator __last,_OutputIterator1 __out_true,_OutputIterator2 __out_false,_UnaryPredicate __pred,std::false_type)2104 __brick_partition_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator1 __out_true,
2105 _OutputIterator2 __out_false, _UnaryPredicate __pred, /*is_vector=*/std::false_type) noexcept
2106 {
2107 return std::partition_copy(__first, __last, __out_true, __out_false, __pred);
2108 }
2109
2110 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3,
2111 class _UnaryPredicate>
2112 std::pair<_RandomAccessIterator2, _RandomAccessIterator3>
__brick_partition_copy(_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __out_true,_RandomAccessIterator3 __out_false,_UnaryPredicate __pred,std::true_type)2113 __brick_partition_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __out_true,
2114 _RandomAccessIterator3 __out_false, _UnaryPredicate __pred,
2115 /*is_vector=*/std::true_type) noexcept
2116 {
2117 #if defined(_PSTL_MONOTONIC_PRESENT)
2118 return __unseq_backend::__simd_partition_copy(__first, __last - __first, __out_true, __out_false, __pred);
2119 #else
2120 return std::partition_copy(__first, __last, __out_true, __out_false, __pred);
2121 #endif
2122 }
2123
2124 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
2125 class _UnaryPredicate>
2126 std::pair<_OutputIterator1, _OutputIterator2>
__pattern_partition_copy(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_OutputIterator1 __out_true,_OutputIterator2 __out_false,_UnaryPredicate __pred)2127 __pattern_partition_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
2128 _OutputIterator1 __out_true, _OutputIterator2 __out_false, _UnaryPredicate __pred) noexcept
2129 {
2130 return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred,
2131 typename _Tag::__is_vector{});
2132 }
2133
2134 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
2135 class _RandomAccessIterator3, class _UnaryPredicate>
2136 std::pair<_RandomAccessIterator2, _RandomAccessIterator3>
__pattern_partition_copy(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __out_true,_RandomAccessIterator3 __out_false,_UnaryPredicate __pred)2137 __pattern_partition_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
2138 _RandomAccessIterator1 __last, _RandomAccessIterator2 __out_true,
2139 _RandomAccessIterator3 __out_false, _UnaryPredicate __pred)
2140 {
2141 using __backend_tag = typename decltype(__tag)::__backend_tag;
2142
2143 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
2144 typedef std::pair<_DifferenceType, _DifferenceType> _ReturnType;
2145 const _DifferenceType __n = __last - __first;
2146 if (_DifferenceType(1) < __n)
2147 {
2148 __par_backend::__buffer<bool> __mask_buf(__n);
2149 return __internal::__except_handler(
2150 [&__exec, __n, __first, __out_true, __out_false, __pred, &__mask_buf]()
2151 {
2152 bool* __mask = __mask_buf.get();
2153 _ReturnType __m{};
2154 __par_backend::__parallel_strict_scan(
2155 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n,
2156 std::make_pair(_DifferenceType(0), _DifferenceType(0)),
2157 [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
2158 return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
2159 __mask + __i, __pred, _IsVector{});
2160 },
2161 [](const _ReturnType& __x, const _ReturnType& __y) -> _ReturnType
2162 { return std::make_pair(__x.first + __y.first, __x.second + __y.second); }, // Combine
2163 [=](_DifferenceType __i, _DifferenceType __len, _ReturnType __initial) { // Scan
2164 __internal::__brick_partition_by_mask(
2165 __first + __i, __first + (__i + __len), __out_true + __initial.first,
2166 __out_false + __initial.second, __mask + __i, _IsVector{});
2167 },
2168 [&__m](_ReturnType __total) { __m = __total; });
2169 return std::make_pair(__out_true + __m.first, __out_false + __m.second);
2170 });
2171 }
2172 // trivial sequence - use serial algorithm
2173 return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred, _IsVector{});
2174 }
2175
2176 //------------------------------------------------------------------------
2177 // sort
2178 //------------------------------------------------------------------------
2179
2180 template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsMoveConstructible>
2181 void
__pattern_sort(_Tag,_ExecutionPolicy &&,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,_IsMoveConstructible)2182 __pattern_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
2183 _IsMoveConstructible) noexcept
2184 {
2185 std::sort(__first, __last, __comp);
2186 }
2187
2188 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2189 void
__pattern_sort(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,std::true_type)2190 __pattern_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2191 _RandomAccessIterator __last, _Compare __comp, /*is_move_constructible=*/std::true_type)
2192 {
2193 using __backend_tag = typename decltype(__tag)::__backend_tag;
2194
2195 __internal::__except_handler(
2196 [&]()
2197 {
2198 __par_backend::__parallel_stable_sort(
2199 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
2200 [](_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
2201 { std::sort(__first, __last, __comp); });
2202 });
2203 }
2204
2205 //------------------------------------------------------------------------
2206 // stable_sort
2207 //------------------------------------------------------------------------
2208
2209 template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2210 void
__pattern_stable_sort(_Tag,_ExecutionPolicy &&,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)2211 __pattern_stable_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
2212 _Compare __comp) noexcept
2213 {
2214 std::stable_sort(__first, __last, __comp);
2215 }
2216
2217 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2218 void
__pattern_stable_sort(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)2219 __pattern_stable_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2220 _RandomAccessIterator __last, _Compare __comp)
2221 {
2222 using __backend_tag = typename decltype(__tag)::__backend_tag;
2223
2224 __internal::__except_handler(
2225 [&]()
2226 {
2227 __par_backend::__parallel_stable_sort(
2228 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
2229 [](_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
2230 { std::stable_sort(__first, __last, __comp); });
2231 });
2232 }
2233
2234 //------------------------------------------------------------------------
2235 // partial_sort
2236 //------------------------------------------------------------------------
2237
2238 template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2239 void
__pattern_partial_sort(_Tag,_ExecutionPolicy &&,_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last,_Compare __comp)2240 __pattern_partial_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __middle,
2241 _RandomAccessIterator __last, _Compare __comp) noexcept
2242 {
2243 std::partial_sort(__first, __middle, __last, __comp);
2244 }
2245
2246 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2247 void
__pattern_partial_sort(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last,_Compare __comp)2248 __pattern_partial_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2249 _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp)
2250 {
2251 using __backend_tag = typename decltype(__tag)::__backend_tag;
2252
2253 const auto __n = __middle - __first;
2254 if (__n == 0)
2255 return;
2256
2257 __internal::__except_handler(
2258 [&]()
2259 {
2260 __par_backend::__parallel_stable_sort(
2261 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
2262 [__n](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Compare __comp)
2263 {
2264 if (__n < __end - __begin)
2265 std::partial_sort(__begin, __begin + __n, __end, __comp);
2266 else
2267 std::sort(__begin, __end, __comp);
2268 },
2269 __n);
2270 });
2271 }
2272
2273 //------------------------------------------------------------------------
2274 // partial_sort_copy
2275 //------------------------------------------------------------------------
2276
2277 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare>
2278 _RandomAccessIterator
__pattern_partial_sort_copy(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_RandomAccessIterator __d_first,_RandomAccessIterator __d_last,_Compare __comp)2279 __pattern_partial_sort_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
2280 _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp) noexcept
2281 {
2282 return std::partial_sort_copy(__first, __last, __d_first, __d_last, __comp);
2283 }
2284
2285 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
2286 class _Compare>
2287 _RandomAccessIterator2
__pattern_partial_sort_copy(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first,_RandomAccessIterator1 __last,_RandomAccessIterator2 __d_first,_RandomAccessIterator2 __d_last,_Compare __comp)2288 __pattern_partial_sort_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
2289 _RandomAccessIterator1 __last, _RandomAccessIterator2 __d_first,
2290 _RandomAccessIterator2 __d_last, _Compare __comp)
2291 {
2292 using __backend_tag = typename decltype(__tag)::__backend_tag;
2293
2294 if (__last == __first || __d_last == __d_first)
2295 {
2296 return __d_first;
2297 }
2298 auto __n1 = __last - __first;
2299 auto __n2 = __d_last - __d_first;
2300 return __internal::__except_handler([&]() {
2301 if (__n2 >= __n1)
2302 {
2303 __par_backend::__parallel_stable_sort(
2304 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __d_first, __d_first + __n1, __comp,
2305 [__first, __d_first](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j, _Compare __comp)
2306 {
2307 _RandomAccessIterator1 __i1 = __first + (__i - __d_first);
2308 _RandomAccessIterator1 __j1 = __first + (__j - __d_first);
2309
2310 // 1. Copy elements from input to output
2311 #if !defined(_PSTL_ICC_18_OMP_SIMD_BROKEN)
2312 __internal::__brick_copy(__i1, __j1, __i, _IsVector{});
2313 #else
2314 std::copy(__i1, __j1, __i);
2315 #endif
2316 // 2. Sort elements in output sequence
2317 std::sort(__i, __j, __comp);
2318 },
2319 __n1);
2320 return __d_first + __n1;
2321 }
2322 else
2323 {
2324 typedef typename std::iterator_traits<_RandomAccessIterator1>::value_type _T1;
2325 typedef typename std::iterator_traits<_RandomAccessIterator2>::value_type _T2;
2326 __par_backend::__buffer<_T1> __buf(__n1);
2327 _T1* __r = __buf.get();
2328
2329 __par_backend::__parallel_stable_sort(
2330 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n1, __comp,
2331 [__n2, __first, __r](_T1* __i, _T1* __j, _Compare __comp)
2332 {
2333 _RandomAccessIterator1 __it = __first + (__i - __r);
2334
2335 // 1. Copy elements from input to raw memory
2336 for (_T1* __k = __i; __k != __j; ++__k, ++__it)
2337 {
2338 ::new (__k) _T2(*__it);
2339 }
2340
2341 // 2. Sort elements in temporary __buffer
2342 if (__n2 < __j - __i)
2343 std::partial_sort(__i, __i + __n2, __j, __comp);
2344 else
2345 std::sort(__i, __j, __comp);
2346 },
2347 __n2);
2348
2349 // 3. Move elements from temporary __buffer to output
2350 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n2,
2351 [__r, __d_first](_T1* __i, _T1* __j)
2352 { __brick_move_destroy()(__i, __j, __d_first + (__i - __r), _IsVector{}); });
2353 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r + __n2,
2354 __r + __n1,
2355 [](_T1* __i, _T1* __j) { __brick_destroy(__i, __j, _IsVector{}); });
2356
2357 return __d_first + __n2;
2358 }
2359 });
2360 }
2361
2362 //------------------------------------------------------------------------
2363 // adjacent_find
2364 //------------------------------------------------------------------------
2365 template <class _RandomAccessIterator, class _BinaryPredicate>
2366 _RandomAccessIterator
__brick_adjacent_find(_RandomAccessIterator __first,_RandomAccessIterator __last,_BinaryPredicate __pred,std::true_type,bool __or_semantic)2367 __brick_adjacent_find(_RandomAccessIterator __first, _RandomAccessIterator __last, _BinaryPredicate __pred,
2368 /* IsVector = */ std::true_type, bool __or_semantic) noexcept
2369 {
2370 return __unseq_backend::__simd_adjacent_find(__first, __last, __pred, __or_semantic);
2371 }
2372
2373 template <class _ForwardIterator, class _BinaryPredicate>
2374 _ForwardIterator
__brick_adjacent_find(_ForwardIterator __first,_ForwardIterator __last,_BinaryPredicate __pred,std::false_type,bool)2375 __brick_adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred,
2376 /* IsVector = */ std::false_type, bool) noexcept
2377 {
2378 return std::adjacent_find(__first, __last, __pred);
2379 }
2380
2381 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
2382 _ForwardIterator
__pattern_adjacent_find(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_BinaryPredicate __pred,bool __or_semantic)2383 __pattern_adjacent_find(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
2384 _BinaryPredicate __pred, bool __or_semantic) noexcept
2385 {
2386 return __internal::__brick_adjacent_find(__first, __last, __pred, typename _Tag::__is_vector{}, __or_semantic);
2387 }
2388
2389 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
2390 _RandomAccessIterator
__pattern_adjacent_find(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_BinaryPredicate __pred,bool __or_semantic)2391 __pattern_adjacent_find(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2392 _RandomAccessIterator __last, _BinaryPredicate __pred, bool __or_semantic)
2393 {
2394 if (__last - __first < 2)
2395 return __last;
2396
2397 using __backend_tag = typename decltype(__tag)::__backend_tag;
2398
2399 return __internal::__except_handler(
2400 [&]()
2401 {
2402 return __par_backend::__parallel_reduce(
2403 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __last,
2404 [__last, __pred, __or_semantic](_RandomAccessIterator __begin, _RandomAccessIterator __end,
2405 _RandomAccessIterator __value) -> _RandomAccessIterator
2406 {
2407 // TODO: investigate performance benefits from the use of shared variable for the result,
2408 // checking (compare_and_swap idiom) its __value at __first.
2409 if (__or_semantic && __value < __last)
2410 { //found
2411 __par_backend::__cancel_execution();
2412 return __value;
2413 }
2414
2415 if (__value > __begin)
2416 {
2417 // modify __end to check the predicate on the boundary __values;
2418 // TODO: to use a custom range with boundaries overlapping
2419 // TODO: investigate what if we remove "if" below and run algorithm on range [__first, __last-1)
2420 // then check the pair [__last-1, __last)
2421 if (__end != __last)
2422 ++__end;
2423
2424 //correct the global result iterator if the "brick" returns a local "__last"
2425 const _RandomAccessIterator __res =
2426 __internal::__brick_adjacent_find(__begin, __end, __pred, _IsVector{}, __or_semantic);
2427 if (__res < __end)
2428 __value = __res;
2429 }
2430 return __value;
2431 },
2432 [](_RandomAccessIterator __x, _RandomAccessIterator __y) -> _RandomAccessIterator
2433 { return __x < __y ? __x : __y; } //reduce a __value
2434 );
2435 });
2436 }
2437
2438 //------------------------------------------------------------------------
2439 // nth_element
2440 //------------------------------------------------------------------------
2441
2442 template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2443 void
__pattern_nth_element(_Tag,_ExecutionPolicy &&,_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp)2444 __pattern_nth_element(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __nth,
2445 _RandomAccessIterator __last, _Compare __comp) noexcept
2446 {
2447 std::nth_element(__first, __nth, __last, __comp);
2448 }
2449
2450 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2451 void
__pattern_nth_element(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp)2452 __pattern_nth_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2453 _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) noexcept
2454 {
2455 if (__first == __last || __nth == __last)
2456 {
2457 return;
2458 }
2459
2460 using std::iter_swap;
2461 typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _Tp;
2462 _RandomAccessIterator __x;
2463 do
2464 {
2465 __x = __internal::__pattern_partition(__tag, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last,
2466 [&__comp, __first](const _Tp& __x) { return __comp(__x, *__first); });
2467 --__x;
2468 if (__x != __first)
2469 {
2470 iter_swap(__first, __x);
2471 }
2472 // if x > nth then our new range for partition is [first, x)
2473 if (__x - __nth > 0)
2474 {
2475 __last = __x;
2476 }
2477 // if x < nth then our new range for partition is [x, last)
2478 else if (__x - __nth < 0)
2479 {
2480 // if *x == *nth then we can start new partition with x+1
2481 if (!__comp(*__nth, *__x) && !__comp(*__x, *__nth))
2482 {
2483 ++__x;
2484 }
2485 else
2486 {
2487 iter_swap(__nth, __x);
2488 }
2489 __first = __x;
2490 }
2491 } while (__x != __nth);
2492 }
2493
2494 //------------------------------------------------------------------------
2495 // fill, fill_n
2496 //------------------------------------------------------------------------
2497 template <class _RandomAccessIterator, class _Tp>
2498 void
__brick_fill(_RandomAccessIterator __first,_RandomAccessIterator __last,const _Tp & __value,std::true_type)2499 __brick_fill(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __value,
2500 /* __is_vector = */ std::true_type) noexcept
2501 {
2502 __unseq_backend::__simd_fill_n(__first, __last - __first, __value);
2503 }
2504
2505 template <class _ForwardIterator, class _Tp>
2506 void
__brick_fill(_ForwardIterator __first,_ForwardIterator __last,const _Tp & __value,std::false_type)2507 __brick_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value,
2508 /* __is_vector = */ std::false_type) noexcept
2509 {
2510 std::fill(__first, __last, __value);
2511 }
2512
2513 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Tp>
2514 void
__pattern_fill(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,const _Tp & __value)2515 __pattern_fill(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) noexcept
2516 {
2517 __internal::__brick_fill(__first, __last, __value, typename _Tag::__is_vector{});
2518 }
2519
2520 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Tp>
2521 _RandomAccessIterator
__pattern_fill(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,const _Tp & __value)2522 __pattern_fill(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2523 _RandomAccessIterator __last, const _Tp& __value)
2524 {
2525 using __backend_tag = typename decltype(__tag)::__backend_tag;
2526
2527 return __internal::__except_handler(
2528 [&__exec, __first, __last, &__value]()
2529 {
2530 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
2531 [&__value](_RandomAccessIterator __begin, _RandomAccessIterator __end)
2532 { __internal::__brick_fill(__begin, __end, __value, _IsVector{}); });
2533 return __last;
2534 });
2535 }
2536
2537 template <class _RandomAccessIterator, class _Size, class _Tp>
2538 _RandomAccessIterator
__brick_fill_n(_RandomAccessIterator __first,_Size __count,const _Tp & __value,std::true_type)2539 __brick_fill_n(_RandomAccessIterator __first, _Size __count, const _Tp& __value,
2540 /* __is_vector = */ std::true_type) noexcept
2541 {
2542 return __unseq_backend::__simd_fill_n(__first, __count, __value);
2543 }
2544
2545 template <class _OutputIterator, class _Size, class _Tp>
2546 _OutputIterator
__brick_fill_n(_OutputIterator __first,_Size __count,const _Tp & __value,std::false_type)2547 __brick_fill_n(_OutputIterator __first, _Size __count, const _Tp& __value, /* __is_vector = */ std::false_type) noexcept
2548 {
2549 return std::fill_n(__first, __count, __value);
2550 }
2551
2552 template <class _Tag, class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp>
2553 _OutputIterator
__pattern_fill_n(_Tag,_ExecutionPolicy &&,_OutputIterator __first,_Size __count,const _Tp & __value)2554 __pattern_fill_n(_Tag, _ExecutionPolicy&&, _OutputIterator __first, _Size __count, const _Tp& __value) noexcept
2555 {
2556 return __internal::__brick_fill_n(__first, __count, __value, typename _Tag::__is_vector{});
2557 }
2558
2559 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp>
2560 _RandomAccessIterator
__pattern_fill_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_Size __count,const _Tp & __value)2561 __pattern_fill_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2562 _Size __count, const _Tp& __value)
2563 {
2564 return __internal::__pattern_fill(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __count,
2565 __value);
2566 }
2567
2568 //------------------------------------------------------------------------
2569 // generate, generate_n
2570 //------------------------------------------------------------------------
2571 template <class _RandomAccessIterator, class _Generator>
2572 void
__brick_generate(_RandomAccessIterator __first,_RandomAccessIterator __last,_Generator __g,std::true_type)2573 __brick_generate(_RandomAccessIterator __first, _RandomAccessIterator __last, _Generator __g,
2574 /* is_vector = */ std::true_type) noexcept
2575 {
2576 __unseq_backend::__simd_generate_n(__first, __last - __first, __g);
2577 }
2578
2579 template <class _ForwardIterator, class _Generator>
2580 void
__brick_generate(_ForwardIterator __first,_ForwardIterator __last,_Generator __g,std::false_type)2581 __brick_generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __g,
2582 /* is_vector = */ std::false_type) noexcept
2583 {
2584 std::generate(__first, __last, __g);
2585 }
2586
2587 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Generator>
2588 void
__pattern_generate(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Generator __g)2589 __pattern_generate(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Generator __g) noexcept
2590 {
2591 __internal::__brick_generate(__first, __last, __g, typename _Tag::__is_vector{});
2592 }
2593
2594 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Generator>
2595 _RandomAccessIterator
__pattern_generate(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Generator __g)2596 __pattern_generate(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2597 _RandomAccessIterator __last, _Generator __g)
2598 {
2599 using __backend_tag = typename decltype(__tag)::__backend_tag;
2600
2601 return __internal::__except_handler(
2602 [&]()
2603 {
2604 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
2605 [__g](_RandomAccessIterator __begin, _RandomAccessIterator __end)
2606 { __internal::__brick_generate(__begin, __end, __g, _IsVector{}); });
2607 return __last;
2608 });
2609 }
2610
2611 template <class _RandomAccessIterator, class Size, class _Generator>
2612 _RandomAccessIterator
__brick_generate_n(_RandomAccessIterator __first,Size __count,_Generator __g,std::true_type)2613 __brick_generate_n(_RandomAccessIterator __first, Size __count, _Generator __g,
2614 /* is_vector = */ std::true_type) noexcept
2615 {
2616 return __unseq_backend::__simd_generate_n(__first, __count, __g);
2617 }
2618
2619 template <class OutputIterator, class Size, class _Generator>
2620 OutputIterator
__brick_generate_n(OutputIterator __first,Size __count,_Generator __g,std::false_type)2621 __brick_generate_n(OutputIterator __first, Size __count, _Generator __g, /* is_vector = */ std::false_type) noexcept
2622 {
2623 return std::generate_n(__first, __count, __g);
2624 }
2625
2626 template <class _Tag, class _ExecutionPolicy, class _OutputIterator, class _Size, class _Generator>
2627 _OutputIterator
__pattern_generate_n(_Tag,_ExecutionPolicy &&,_OutputIterator __first,_Size __count,_Generator __g)2628 __pattern_generate_n(_Tag, _ExecutionPolicy&&, _OutputIterator __first, _Size __count, _Generator __g) noexcept
2629 {
2630 return __internal::__brick_generate_n(__first, __count, __g, typename _Tag::__is_vector{});
2631 }
2632
2633 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Generator>
2634 _RandomAccessIterator
__pattern_generate_n(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_Size __count,_Generator __g)2635 __pattern_generate_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2636 _Size __count, _Generator __g)
2637 {
2638 static_assert(__are_random_access_iterators<_RandomAccessIterator>::value,
2639 "Pattern-brick error. Should be a random access iterator.");
2640 return __internal::__pattern_generate(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __count,
2641 __g);
2642 }
2643
2644 //------------------------------------------------------------------------
2645 // remove
2646 //------------------------------------------------------------------------
2647
2648 template <class _ForwardIterator, class _UnaryPredicate>
2649 _ForwardIterator
__brick_remove_if(_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred,std::false_type)2650 __brick_remove_if(_ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
2651 /* __is_vector = */ std::false_type) noexcept
2652 {
2653 return std::remove_if(__first, __last, __pred);
2654 }
2655
2656 template <class _RandomAccessIterator, class _UnaryPredicate>
2657 _RandomAccessIterator
__brick_remove_if(_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred,std::true_type)2658 __brick_remove_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _UnaryPredicate __pred,
2659 /* __is_vector = */ std::true_type) noexcept
2660 {
2661 #if defined(_PSTL_MONOTONIC_PRESENT)
2662 return __unseq_backend::__simd_remove_if(__first, __last - __first, __pred);
2663 #else
2664 return std::remove_if(__first, __last, __pred);
2665 #endif
2666 }
2667
2668 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
2669 _ForwardIterator
__pattern_remove_if(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_UnaryPredicate __pred)2670 __pattern_remove_if(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
2671 _UnaryPredicate __pred) noexcept
2672 {
2673 return __internal::__brick_remove_if(__first, __last, __pred, typename _Tag::__is_vector{});
2674 }
2675
2676 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
2677 _RandomAccessIterator
__pattern_remove_if(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_UnaryPredicate __pred)2678 __pattern_remove_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2679 _RandomAccessIterator __last, _UnaryPredicate __pred) noexcept
2680 {
2681 typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
2682
2683 if (__first == __last || __first + 1 == __last)
2684 {
2685 // Trivial sequence - use serial algorithm
2686 return __internal::__brick_remove_if(__first, __last, __pred, _IsVector{});
2687 }
2688
2689 return __internal::__remove_elements(
2690 __tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
2691 [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it)
2692 {
2693 __internal::__brick_walk2(
2694 __b, __e, __it, [&__pred](bool& __x, _ReferenceType __y) { __x = !__pred(__y); }, _IsVector{});
2695 });
2696 }
2697
2698 //------------------------------------------------------------------------
2699 // merge
2700 //------------------------------------------------------------------------
2701
2702 template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
2703 _OutputIterator
__brick_merge(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __d_first,_Compare __comp,std::false_type)2704 __brick_merge(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
2705 _ForwardIterator2 __last2, _OutputIterator __d_first, _Compare __comp,
2706 /* __is_vector = */ std::false_type) noexcept
2707 {
2708 return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp);
2709 }
2710
2711 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Compare>
2712 _RandomAccessIterator3
__brick_merge(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __d_first,_Compare __comp,std::true_type)2713 __brick_merge(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
2714 _RandomAccessIterator2 __last2, _RandomAccessIterator3 __d_first, _Compare __comp,
2715 /* __is_vector = */ std::true_type) noexcept
2716 {
2717 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
2718 return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp);
2719 }
2720
2721 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
2722 class _Compare>
2723 _OutputIterator
__pattern_merge(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __d_first,_Compare __comp)2724 __pattern_merge(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
2725 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __d_first,
2726 _Compare __comp) noexcept
2727 {
2728 return __internal::__brick_merge(__first1, __last1, __first2, __last2, __d_first, __comp,
2729 typename _Tag::__is_vector{});
2730 }
2731
2732 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
2733 class _RandomAccessIterator3, class _Compare>
2734 _RandomAccessIterator3
__pattern_merge(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __d_first,_Compare __comp)2735 __pattern_merge(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
2736 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
2737 _RandomAccessIterator3 __d_first, _Compare __comp)
2738 {
2739 using __backend_tag = typename decltype(__tag)::__backend_tag;
2740
2741 __par_backend::__parallel_merge(
2742 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first,
2743 __comp,
2744 [](_RandomAccessIterator1 __f1, _RandomAccessIterator1 __l1, _RandomAccessIterator2 __f2,
2745 _RandomAccessIterator2 __l2, _RandomAccessIterator3 __f3, _Compare __comp)
2746 { return __internal::__brick_merge(__f1, __l1, __f2, __l2, __f3, __comp, _IsVector{}); });
2747 return __d_first + (__last1 - __first1) + (__last2 - __first2);
2748 }
2749
2750 //------------------------------------------------------------------------
2751 // inplace_merge
2752 //------------------------------------------------------------------------
2753 template <class _BidirectionalIterator, class _Compare>
2754 void
__brick_inplace_merge(_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare __comp,std::false_type)2755 __brick_inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last,
2756 _Compare __comp, /* __is_vector = */ std::false_type) noexcept
2757 {
2758 std::inplace_merge(__first, __middle, __last, __comp);
2759 }
2760
2761 template <class _RandomAccessIterator, class _Compare>
2762 void
__brick_inplace_merge(_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last,_Compare __comp,std::true_type)2763 __brick_inplace_merge(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last,
2764 _Compare __comp, /* __is_vector = */ std::true_type) noexcept
2765 {
2766 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial")
2767 std::inplace_merge(__first, __middle, __last, __comp);
2768 }
2769
2770 template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _Compare>
2771 void
__pattern_inplace_merge(_Tag,_ExecutionPolicy &&,_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare __comp)2772 __pattern_inplace_merge(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __middle,
2773 _BidirectionalIterator __last, _Compare __comp) noexcept
2774 {
2775 __internal::__brick_inplace_merge(__first, __middle, __last, __comp, typename _Tag::__is_vector{});
2776 }
2777
2778 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
2779 void
__pattern_inplace_merge(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __middle,_RandomAccessIterator __last,_Compare __comp)2780 __pattern_inplace_merge(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
2781 _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp)
2782 {
2783 using __backend_tag = typename decltype(__tag)::__backend_tag;
2784
2785 if (__first == __last || __first == __middle || __middle == __last)
2786 {
2787 return;
2788 }
2789 typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _Tp;
2790 auto __n = __last - __first;
2791 __par_backend::__buffer<_Tp> __buf(__n);
2792 _Tp* __r = __buf.get();
2793 __internal::__except_handler(
2794 [&]()
2795 {
2796 auto __move_values = [](_RandomAccessIterator __x, _Tp* __z)
2797 {
2798 __internal::__invoke_if_else(
2799 std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
2800 [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
2801 };
2802
2803 auto __move_sequences = [](_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Tp* __first2)
2804 { return __internal::__brick_uninitialized_move(__first1, __last1, __first2, _IsVector()); };
2805
2806 __par_backend::__parallel_merge(
2807 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle, __middle, __last, __r,
2808 __comp,
2809 [__n, __move_values, __move_sequences](_RandomAccessIterator __f1, _RandomAccessIterator __l1,
2810 _RandomAccessIterator __f2, _RandomAccessIterator __l2,
2811 _Tp* __f3, _Compare __comp)
2812 {
2813 (__utils::__serial_move_merge(__n))(__f1, __l1, __f2, __l2, __f3, __comp, __move_values,
2814 __move_values, __move_sequences, __move_sequences);
2815 return __f3 + (__l1 - __f1) + (__l2 - __f2);
2816 });
2817 __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n,
2818 [__r, __first](_Tp* __i, _Tp* __j)
2819 { __brick_move_destroy()(__i, __j, __first + (__i - __r), _IsVector{}); });
2820 });
2821 }
2822
2823 //------------------------------------------------------------------------
2824 // includes
2825 //------------------------------------------------------------------------
2826
2827 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
2828 bool
__pattern_includes(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Compare __comp)2829 __pattern_includes(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
2830 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp) noexcept
2831 {
2832 return std::includes(__first1, __last1, __first2, __last2, __comp);
2833 }
2834
2835 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
2836 class _Compare>
2837 bool
__pattern_includes(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_Compare __comp)2838 __pattern_includes(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
2839 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
2840 _Compare __comp)
2841 {
2842 using __backend_tag = typename decltype(__tag)::__backend_tag;
2843
2844 if (__first2 >= __last2)
2845 return true;
2846
2847 if (__first1 >= __last1 || __comp(*__first2, *__first1) || __comp(*(__last1 - 1), *(__last2 - 1)))
2848 return false;
2849
2850 __first1 = std::lower_bound(__first1, __last1, *__first2, __comp);
2851 if (__first1 == __last1)
2852 return false;
2853
2854 if (__last2 - __first2 == 1)
2855 return !__comp(*__first1, *__first2) && !__comp(*__first2, *__first1);
2856
2857 return __internal::__except_handler(
2858 [&]()
2859 {
2860 return !__internal::__parallel_or(
2861 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
2862 [__first1, __last1, __first2, __last2, &__comp](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j)
2863 {
2864 _PSTL_ASSERT(__j > __i);
2865 //_PSTL_ASSERT(__j - __i > 1);
2866
2867 //1. moving boundaries to "consume" subsequence of equal elements
2868 auto __is_equal = [&__comp](_RandomAccessIterator2 __a, _RandomAccessIterator2 __b) -> bool
2869 { return !__comp(*__a, *__b) && !__comp(*__b, *__a); };
2870
2871 //1.1 left bound, case "aaa[aaaxyz...]" - searching "x"
2872 if (__i > __first2 && __is_equal(__i, __i - 1))
2873 {
2874 //whole subrange continues to content equal elements - return "no op"
2875 if (__is_equal(__i, __j - 1))
2876 return false;
2877
2878 __i = std::upper_bound(__i, __last2, *__i, __comp);
2879 }
2880
2881 //1.2 right bound, case "[...aaa]aaaxyz" - searching "x"
2882 if (__j < __last2 && __is_equal(__j - 1, __j))
2883 __j = std::upper_bound(__j, __last2, *__j, __comp);
2884
2885 //2. testing is __a subsequence of the second range included into the first range
2886 auto __b = std::lower_bound(__first1, __last1, *__i, __comp);
2887
2888 _PSTL_ASSERT(!__comp(*(__last1 - 1), *__b));
2889 _PSTL_ASSERT(!__comp(*(__j - 1), *__i));
2890 return !std::includes(__b, __last1, __i, __j, __comp);
2891 });
2892 });
2893 }
2894
2895 constexpr auto __set_algo_cut_off = 1000;
2896
2897 template <class _IsVector, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2,
2898 class _OutputIterator, class _Compare, class _SizeFunction, class _SetOP>
2899 _OutputIterator
__parallel_set_op(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,_SizeFunction __size_func,_SetOP __set_op)2900 __parallel_set_op(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _ForwardIterator1 __first1,
2901 _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2,
2902 _OutputIterator __result, _Compare __comp, _SizeFunction __size_func, _SetOP __set_op)
2903 {
2904 using __backend_tag = typename decltype(__tag)::__backend_tag;
2905
2906 typedef typename std::iterator_traits<_ForwardIterator1>::difference_type _DifferenceType;
2907 typedef typename std::iterator_traits<_OutputIterator>::value_type _Tp;
2908
2909 struct _SetRange
2910 {
2911 _DifferenceType __pos, __len, __buf_pos;
2912 bool
2913 empty() const
2914 {
2915 return __len == 0;
2916 }
2917 };
2918
2919 const _DifferenceType __n1 = __last1 - __first1;
2920 const _DifferenceType __n2 = __last2 - __first2;
2921
2922 __par_backend::__buffer<_Tp> __buf(__size_func(__n1, __n2));
2923
2924 return __internal::__except_handler(
2925 [&__exec, __n1, __first1, __last1, __first2, __last2, __result, __comp, __size_func, __set_op, &__buf]()
2926 {
2927 auto __buffer = __buf.get();
2928 _DifferenceType __m{};
2929 auto __scan = [=](_DifferenceType, _DifferenceType, const _SetRange& __s) { // Scan
2930 if (!__s.empty())
2931 __brick_move_destroy()(__buffer + __s.__buf_pos, __buffer + (__s.__buf_pos + __s.__len),
2932 __result + __s.__pos, _IsVector{});
2933 };
2934 __par_backend::__parallel_strict_scan(
2935 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n1, _SetRange{0, 0, 0}, //-1, 0},
2936 [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
2937 //[__b; __e) - a subrange of the first sequence, to reduce
2938 _ForwardIterator1 __b = __first1 + __i, __e = __first1 + (__i + __len);
2939
2940 //try searching for the first element which not equal to *__b
2941 if (__b != __first1)
2942 __b = std::upper_bound(__b, __last1, *__b, __comp);
2943
2944 //try searching for the first element which not equal to *__e
2945 if (__e != __last1)
2946 __e = std::upper_bound(__e, __last1, *__e, __comp);
2947
2948 //check is [__b; __e) empty
2949 if (__e - __b < 1)
2950 {
2951 _ForwardIterator2 __bb = __last2;
2952 if (__b != __last1)
2953 __bb = std::lower_bound(__first2, __last2, *__b, __comp);
2954
2955 const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
2956 return _SetRange{0, 0, __buf_pos};
2957 }
2958
2959 //try searching for "corresponding" subrange [__bb; __ee) in the second sequence
2960 _ForwardIterator2 __bb = __first2;
2961 if (__b != __first1)
2962 __bb = std::lower_bound(__first2, __last2, *__b, __comp);
2963
2964 _ForwardIterator2 __ee = __last2;
2965 if (__e != __last1)
2966 __ee = std::lower_bound(__bb, __last2, *__e, __comp);
2967
2968 const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
2969 auto __buffer_b = __buffer + __buf_pos;
2970 auto __res = __set_op(__b, __e, __bb, __ee, __buffer_b, __comp);
2971
2972 return _SetRange{0, __res - __buffer_b, __buf_pos};
2973 },
2974 [](const _SetRange& __a, const _SetRange& __b) { // Combine
2975 if (__b.__buf_pos > __a.__buf_pos || ((__b.__buf_pos == __a.__buf_pos) && !__b.empty()))
2976 return _SetRange{__a.__pos + __a.__len + __b.__pos, __b.__len, __b.__buf_pos};
2977 return _SetRange{__b.__pos + __b.__len + __a.__pos, __a.__len, __a.__buf_pos};
2978 },
2979 __scan, // Scan
2980 [&__m, &__scan](const _SetRange& __total) { // Apex
2981 //final scan
2982 __scan(0, 0, __total);
2983 __m = __total.__pos + __total.__len;
2984 });
2985 return __result + __m;
2986 });
2987 }
2988
2989 //a shared parallel pattern for '__pattern_set_union' and '__pattern_set_symmetric_difference'
2990 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
2991 class _Compare, class _SetUnionOp>
2992 _OutputIterator
__parallel_set_union_op(_Tag __tag,_ExecutionPolicy && __exec,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,_SetUnionOp __set_union_op)2993 __parallel_set_union_op(_Tag __tag, _ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
2994 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
2995 _Compare __comp, _SetUnionOp __set_union_op)
2996 {
2997 using __backend_tag = typename decltype(__tag)::__backend_tag;
2998
2999 typedef typename std::iterator_traits<_ForwardIterator1>::difference_type _DifferenceType;
3000
3001 const auto __n1 = __last1 - __first1;
3002 const auto __n2 = __last2 - __first2;
3003
3004 auto copy_range1 = [](_ForwardIterator1 __begin, _ForwardIterator1 __end, _OutputIterator __res)
3005 { return __internal::__brick_copy(__begin, __end, __res, typename _Tag::__is_vector{}); };
3006 auto copy_range2 = [](_ForwardIterator2 __begin, _ForwardIterator2 __end, _OutputIterator __res)
3007 { return __internal::__brick_copy(__begin, __end, __res, typename _Tag::__is_vector{}); };
3008
3009 // {1} {}: parallel copying just first sequence
3010 if (__n2 == 0)
3011 return __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
3012 __result, copy_range1);
3013
3014 // {} {2}: parallel copying justmake second sequence
3015 if (__n1 == 0)
3016 return __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
3017 __result, copy_range2);
3018
3019 // testing whether the sequences are intersected
3020 _ForwardIterator1 __left_bound_seq_1 = std::lower_bound(__first1, __last1, *__first2, __comp);
3021
3022 if (__left_bound_seq_1 == __last1)
3023 {
3024 //{1} < {2}: seq2 is wholly greater than seq1, so, do parallel copying seq1 and seq2
3025 __par_backend::__parallel_invoke(
3026 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
3027 [=]
3028 {
3029 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
3030 __result, copy_range1);
3031 },
3032 [=]
3033 {
3034 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
3035 __result + __n1, copy_range2);
3036 });
3037 return __result + __n1 + __n2;
3038 }
3039
3040 // testing whether the sequences are intersected
3041 _ForwardIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp);
3042
3043 if (__left_bound_seq_2 == __last2)
3044 {
3045 //{2} < {1}: seq2 is wholly greater than seq1, so, do parallel copying seq1 and seq2
3046 __par_backend::__parallel_invoke(
3047 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
3048 [=]
3049 {
3050 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
3051 __result, copy_range2);
3052 },
3053 [=]
3054 {
3055 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
3056 __result + __n2, copy_range1);
3057 });
3058 return __result + __n1 + __n2;
3059 }
3060
3061 const auto __m1 = __left_bound_seq_1 - __first1;
3062 if (__m1 > __set_algo_cut_off)
3063 {
3064 auto __res_or = __result;
3065 __result += __m1; //we know proper offset due to [first1; left_bound_seq_1) < [first2; last2)
3066 __par_backend::__parallel_invoke(
3067 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
3068 //do parallel copying of [first1; left_bound_seq_1)
3069 [=]
3070 {
3071 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1,
3072 __left_bound_seq_1, __res_or, copy_range1);
3073 },
3074 [=, &__result]
3075 {
3076 __result = __internal::__parallel_set_op(
3077 __tag, std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2,
3078 __result, __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; },
3079 __set_union_op);
3080 });
3081 return __result;
3082 }
3083
3084 const auto __m2 = __left_bound_seq_2 - __first2;
3085 _PSTL_ASSERT(__m1 == 0 || __m2 == 0);
3086 if (__m2 > __set_algo_cut_off)
3087 {
3088 auto __res_or = __result;
3089 __result += __m2; //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1)
3090 __par_backend::__parallel_invoke(
3091 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
3092 //do parallel copying of [first2; left_bound_seq_2)
3093 [=]
3094 {
3095 __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2,
3096 __left_bound_seq_2, __res_or, copy_range2);
3097 },
3098 [=, &__result]
3099 {
3100 __result = __internal::__parallel_set_op(
3101 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2,
3102 __result, __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; },
3103 __set_union_op);
3104 });
3105 return __result;
3106 }
3107
3108 return __internal::__parallel_set_op(
3109 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
3110 [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; }, __set_union_op);
3111 }
3112
3113 //------------------------------------------------------------------------
3114 // set_union
3115 //------------------------------------------------------------------------
3116
3117 template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
3118 _OutputIterator
__brick_set_union(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,std::false_type)3119 __brick_set_union(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3120 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
3121 /*__is_vector=*/std::false_type) noexcept
3122 {
3123 return std::set_union(__first1, __last1, __first2, __last2, __result, __comp);
3124 }
3125
3126 template <typename _IsVector>
3127 struct __BrickCopyConstruct
3128 {
3129 template <typename _ForwardIterator, typename _OutputIterator>
3130 _OutputIterator
operator__BrickCopyConstruct3131 operator()(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result)
3132 {
3133 return __brick_uninitialized_copy(__first, __last, __result, _IsVector());
3134 }
3135 };
3136
3137 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
3138 _OutputIterator
__brick_set_union(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_OutputIterator __result,_Compare __comp,std::true_type)3139 __brick_set_union(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3140 _RandomAccessIterator2 __last2, _OutputIterator __result, _Compare __comp,
3141 /*__is_vector=*/std::true_type) noexcept
3142 {
3143 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
3144 return std::set_union(__first1, __last1, __first2, __last2, __result, __comp);
3145 }
3146
3147 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
3148 class _Compare>
3149 _OutputIterator
__pattern_set_union(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp)3150 __pattern_set_union(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3151 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
3152 _Compare __comp) noexcept
3153 {
3154 return __internal::__brick_set_union(__first1, __last1, __first2, __last2, __result, __comp,
3155 typename _Tag::__is_vector{});
3156 }
3157
3158 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3159 class _OutputIterator, class _Compare>
3160 _OutputIterator
__pattern_set_union(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_OutputIterator __result,_Compare __comp)3161 __pattern_set_union(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
3162 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3163 _OutputIterator __result, _Compare __comp)
3164 {
3165
3166 const auto __n1 = __last1 - __first1;
3167 const auto __n2 = __last2 - __first2;
3168
3169 // use serial algorithm
3170 if (__n1 + __n2 <= __set_algo_cut_off)
3171 return std::set_union(__first1, __last1, __first2, __last2, __result, __comp);
3172
3173 typedef typename std::iterator_traits<_OutputIterator>::value_type _Tp;
3174 return __parallel_set_union_op(
3175 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
3176 [](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3177 _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
3178 {
3179 return __pstl::__utils::__set_union_construct(__first1, __last1, __first2, __last2, __result, __comp,
3180 __BrickCopyConstruct<_IsVector>());
3181 });
3182 }
3183
3184 //------------------------------------------------------------------------
3185 // set_intersection
3186 //------------------------------------------------------------------------
3187
3188 template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
3189 _OutputIterator
__brick_set_intersection(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,std::false_type)3190 __brick_set_intersection(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3191 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
3192 /*__is_vector=*/std::false_type) noexcept
3193 {
3194 return std::set_intersection(__first1, __last1, __first2, __last2, __result, __comp);
3195 }
3196
3197 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Compare>
3198 _RandomAccessIterator3
__brick_set_intersection(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp,std::true_type)3199 __brick_set_intersection(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
3200 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3201 _RandomAccessIterator3 __result, _Compare __comp,
3202 /*__is_vector=*/std::true_type) noexcept
3203 {
3204 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
3205 return std::set_intersection(__first1, __last1, __first2, __last2, __result, __comp);
3206 }
3207
3208 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
3209 class _Compare>
3210 _OutputIterator
__pattern_set_intersection(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp)3211 __pattern_set_intersection(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3212 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
3213 _Compare __comp) noexcept
3214 {
3215 return __internal::__brick_set_intersection(__first1, __last1, __first2, __last2, __result, __comp,
3216 typename _Tag::__is_vector{});
3217 }
3218
3219 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3220 class _RandomAccessIterator3, class _Compare>
3221 _RandomAccessIterator3
__pattern_set_intersection(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp)3222 __pattern_set_intersection(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
3223 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3224 _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp)
3225 {
3226 typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
3227 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
3228
3229 const auto __n1 = __last1 - __first1;
3230 const auto __n2 = __last2 - __first2;
3231
3232 // intersection is empty
3233 if (__n1 == 0 || __n2 == 0)
3234 return __result;
3235
3236 // testing whether the sequences are intersected
3237 _RandomAccessIterator1 __left_bound_seq_1 = std::lower_bound(__first1, __last1, *__first2, __comp);
3238 //{1} < {2}: seq 2 is wholly greater than seq 1, so, the intersection is empty
3239 if (__left_bound_seq_1 == __last1)
3240 return __result;
3241
3242 // testing whether the sequences are intersected
3243 _RandomAccessIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp);
3244 //{2} < {1}: seq 1 is wholly greater than seq 2, so, the intersection is empty
3245 if (__left_bound_seq_2 == __last2)
3246 return __result;
3247
3248 const auto __m1 = __last1 - __left_bound_seq_1 + __n2;
3249 if (__m1 > __set_algo_cut_off)
3250 {
3251 //we know proper offset due to [first1; left_bound_seq_1) < [first2; last2)
3252 return __internal::__parallel_set_op(
3253 __tag, std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2, __result,
3254 __comp, [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
3255 [](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3256 _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
3257 return __pstl::__utils::__set_intersection_construct(__first1, __last1, __first2, __last2, __result,
3258 __comp);
3259 });
3260 }
3261
3262 const auto __m2 = __last2 - __left_bound_seq_2 + __n1;
3263 if (__m2 > __set_algo_cut_off)
3264 {
3265 //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1)
3266 __result = __internal::__parallel_set_op(
3267 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2, __result,
3268 __comp, [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
3269 [](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3270 _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
3271 return __pstl::__utils::__set_intersection_construct(__first2, __last2, __first1, __last1, __result,
3272 __comp);
3273 });
3274 return __result;
3275 }
3276
3277 // [left_bound_seq_1; last1) and [left_bound_seq_2; last2) - use serial algorithm
3278 return std::set_intersection(__left_bound_seq_1, __last1, __left_bound_seq_2, __last2, __result, __comp);
3279 }
3280
3281 //------------------------------------------------------------------------
3282 // set_difference
3283 //------------------------------------------------------------------------
3284
3285 template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
3286 _OutputIterator
__brick_set_difference(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,std::false_type)3287 __brick_set_difference(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3288 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
3289 /*__is_vector=*/std::false_type) noexcept
3290 {
3291 return std::set_difference(__first1, __last1, __first2, __last2, __result, __comp);
3292 }
3293
3294 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Compare>
3295 _RandomAccessIterator3
__brick_set_difference(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp,std::true_type)3296 __brick_set_difference(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3297 _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp,
3298 /*__is_vector=*/std::true_type) noexcept
3299 {
3300 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
3301 return std::set_difference(__first1, __last1, __first2, __last2, __result, __comp);
3302 }
3303
3304 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
3305 class _Compare>
3306 _OutputIterator
__pattern_set_difference(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp)3307 __pattern_set_difference(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3308 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
3309 _Compare __comp) noexcept
3310 {
3311 return __internal::__brick_set_difference(__first1, __last1, __first2, __last2, __result, __comp,
3312 typename _Tag::__is_vector{});
3313 }
3314
3315 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3316 class _RandomAccessIterator3, class _Compare>
3317 _RandomAccessIterator3
__pattern_set_difference(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp)3318 __pattern_set_difference(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
3319 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3320 _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp)
3321 {
3322 typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
3323 typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
3324
3325 const auto __n1 = __last1 - __first1;
3326 const auto __n2 = __last2 - __first2;
3327
3328 // {} \ {2}: the difference is empty
3329 if (__n1 == 0)
3330 return __result;
3331
3332 // {1} \ {}: parallel copying just first sequence
3333 if (__n2 == 0)
3334 return __internal::__pattern_walk2_brick(
3335 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
3336 [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
3337 { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
3338
3339 // testing whether the sequences are intersected
3340 _RandomAccessIterator1 __left_bound_seq_1 = std::lower_bound(__first1, __last1, *__first2, __comp);
3341 //{1} < {2}: seq 2 is wholly greater than seq 1, so, parallel copying just first sequence
3342 if (__left_bound_seq_1 == __last1)
3343 return __internal::__pattern_walk2_brick(
3344 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
3345 [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
3346 { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
3347
3348 // testing whether the sequences are intersected
3349 _RandomAccessIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp);
3350 //{2} < {1}: seq 1 is wholly greater than seq 2, so, parallel copying just first sequence
3351 if (__left_bound_seq_2 == __last2)
3352 return __internal::__pattern_walk2_brick(
3353 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
3354 [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
3355 { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
3356
3357 if (__n1 + __n2 > __set_algo_cut_off)
3358 return __parallel_set_op(
3359 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
3360 [](_DifferenceType __n, _DifferenceType) { return __n; },
3361 [](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3362 _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
3363 {
3364 return __pstl::__utils::__set_difference_construct(__first1, __last1, __first2, __last2, __result,
3365 __comp, __BrickCopyConstruct<_IsVector>());
3366 });
3367
3368 // use serial algorithm
3369 return std::set_difference(__first1, __last1, __first2, __last2, __result, __comp);
3370 }
3371
3372 //------------------------------------------------------------------------
3373 // set_symmetric_difference
3374 //------------------------------------------------------------------------
3375
3376 template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
3377 _OutputIterator
__brick_set_symmetric_difference(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp,std::false_type)3378 __brick_set_symmetric_difference(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3379 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
3380 /*__is_vector=*/std::false_type) noexcept
3381 {
3382 return std::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp);
3383 }
3384
3385 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _RandomAccessIterator3, class _Compare>
3386 _RandomAccessIterator3
__brick_set_symmetric_difference(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp,std::true_type)3387 __brick_set_symmetric_difference(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
3388 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3389 _RandomAccessIterator3 __result, _Compare __comp,
3390 /*__is_vector=*/std::true_type) noexcept
3391 {
3392 _PSTL_PRAGMA_MESSAGE("Vectorized algorithm unimplemented, redirected to serial");
3393 return std::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp);
3394 }
3395
3396 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
3397 class _Compare>
3398 _OutputIterator
__pattern_set_symmetric_difference(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_OutputIterator __result,_Compare __comp)3399 __pattern_set_symmetric_difference(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3400 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
3401 _Compare __comp) noexcept
3402 {
3403 return __internal::__brick_set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp,
3404 typename _Tag::__is_vector{});
3405 }
3406
3407 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3408 class _RandomAccessIterator3, class _Compare>
3409 _RandomAccessIterator3
__pattern_set_symmetric_difference(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_RandomAccessIterator3 __result,_Compare __comp)3410 __pattern_set_symmetric_difference(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec,
3411 _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
3412 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3413 _RandomAccessIterator3 __result, _Compare __comp)
3414 {
3415
3416 const auto __n1 = __last1 - __first1;
3417 const auto __n2 = __last2 - __first2;
3418
3419 // use serial algorithm
3420 if (__n1 + __n2 <= __set_algo_cut_off)
3421 return std::set_symmetric_difference(__first1, __last1, __first2, __last2, __result, __comp);
3422
3423 typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
3424 return __internal::__parallel_set_union_op(
3425 __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
3426 [](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3427 _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
3428 {
3429 return __pstl::__utils::__set_symmetric_difference_construct(__first1, __last1, __first2, __last2, __result,
3430 __comp, __BrickCopyConstruct<_IsVector>());
3431 });
3432 }
3433
3434 //------------------------------------------------------------------------
3435 // is_heap_until
3436 //------------------------------------------------------------------------
3437
3438 template <class _RandomAccessIterator, class _Compare>
3439 _RandomAccessIterator
__brick_is_heap_until(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,std::false_type)3440 __brick_is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
3441 /* __is_vector = */ std::false_type) noexcept
3442 {
3443 return std::is_heap_until(__first, __last, __comp);
3444 }
3445
3446 template <class _RandomAccessIterator, class _Compare>
3447 _RandomAccessIterator
__brick_is_heap_until(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,std::true_type)3448 __brick_is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
3449 /* __is_vector = */ std::true_type) noexcept
3450 {
3451 if (__last - __first < 2)
3452 return __last;
3453 typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _SizeType;
3454 return __unseq_backend::__simd_first(
3455 __first, _SizeType(0), __last - __first,
3456 [&__comp](_RandomAccessIterator __it, _SizeType __i) { return __comp(__it[(__i - 1) / 2], __it[__i]); });
3457 }
3458
3459 template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
3460 _RandomAccessIterator
__pattern_is_heap_until(_Tag,_ExecutionPolicy &&,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)3461 __pattern_is_heap_until(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
3462 _Compare __comp) noexcept
3463 {
3464 return __internal::__brick_is_heap_until(__first, __last, __comp, typename _Tag::__is_vector{});
3465 }
3466
3467 template <class _RandomAccessIterator, class _DifferenceType, class _Compare>
3468 _RandomAccessIterator
__is_heap_until_local(_RandomAccessIterator __first,_DifferenceType __begin,_DifferenceType __end,_Compare __comp,std::false_type)3469 __is_heap_until_local(_RandomAccessIterator __first, _DifferenceType __begin, _DifferenceType __end, _Compare __comp,
3470 /* __is_vector = */ std::false_type) noexcept
3471 {
3472 _DifferenceType __i = __begin;
3473 for (; __i < __end; ++__i)
3474 {
3475 if (__comp(__first[(__i - 1) / 2], __first[__i]))
3476 {
3477 break;
3478 }
3479 }
3480 return __first + __i;
3481 }
3482
3483 template <class _RandomAccessIterator, class _DifferenceType, class _Compare>
3484 _RandomAccessIterator
__is_heap_until_local(_RandomAccessIterator __first,_DifferenceType __begin,_DifferenceType __end,_Compare __comp,std::true_type)3485 __is_heap_until_local(_RandomAccessIterator __first, _DifferenceType __begin, _DifferenceType __end, _Compare __comp,
3486 /* __is_vector = */ std::true_type) noexcept
3487 {
3488 return __unseq_backend::__simd_first(
3489 __first, __begin, __end,
3490 [&__comp](_RandomAccessIterator __it, _DifferenceType __i) { return __comp(__it[(__i - 1) / 2], __it[__i]); });
3491 }
3492
3493 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
3494 _RandomAccessIterator
__pattern_is_heap_until(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)3495 __pattern_is_heap_until(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
3496 _RandomAccessIterator __last, _Compare __comp) noexcept
3497 {
3498 using __backend_tag = typename decltype(__tag)::__backend_tag;
3499
3500 if (__last - __first < 2)
3501 return __last;
3502
3503 return __internal::__except_handler(
3504 [&]()
3505 {
3506 return __parallel_find(
3507 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
3508 [__first, __comp](_RandomAccessIterator __i, _RandomAccessIterator __j) {
3509 return __internal::__is_heap_until_local(__first, __i - __first, __j - __first, __comp,
3510 _IsVector{});
3511 },
3512 std::less<typename std::iterator_traits<_RandomAccessIterator>::difference_type>(), /*is_first=*/true);
3513 });
3514 }
3515
3516 //------------------------------------------------------------------------
3517 // min_element
3518 //------------------------------------------------------------------------
3519
3520 template <typename _ForwardIterator, typename _Compare>
3521 _ForwardIterator
__brick_min_element(_ForwardIterator __first,_ForwardIterator __last,_Compare __comp,std::false_type)3522 __brick_min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp,
3523 /* __is_vector = */ std::false_type) noexcept
3524 {
3525 return std::min_element(__first, __last, __comp);
3526 }
3527
3528 template <typename _RandomAccessIterator, typename _Compare>
3529 _RandomAccessIterator
__brick_min_element(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,std::true_type)3530 __brick_min_element(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
3531 /* __is_vector = */ std::true_type) noexcept
3532 {
3533 #if defined(_PSTL_UDR_PRESENT)
3534 return __unseq_backend::__simd_min_element(__first, __last - __first, __comp);
3535 #else
3536 return std::min_element(__first, __last, __comp);
3537 #endif
3538 }
3539
3540 template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
3541 _ForwardIterator
__pattern_min_element(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Compare __comp)3542 __pattern_min_element(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
3543 _Compare __comp) noexcept
3544 {
3545 return __internal::__brick_min_element(__first, __last, __comp, typename _Tag::__is_vector{});
3546 }
3547
3548 template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
3549 _RandomAccessIterator
__pattern_min_element(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)3550 __pattern_min_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
3551 _RandomAccessIterator __last, _Compare __comp)
3552 {
3553 if (__first == __last)
3554 return __last;
3555
3556 using __backend_tag = typename decltype(__tag)::__backend_tag;
3557
3558 return __internal::__except_handler(
3559 [&]()
3560 {
3561 return __par_backend::__parallel_reduce(
3562 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last, __first,
3563 [=](_RandomAccessIterator __begin, _RandomAccessIterator __end,
3564 _RandomAccessIterator __init) -> _RandomAccessIterator
3565 {
3566 const _RandomAccessIterator subresult =
3567 __internal::__brick_min_element(__begin, __end, __comp, _IsVector{});
3568 return __internal::__cmp_iterators_by_values(__init, subresult, __comp);
3569 },
3570 [=](_RandomAccessIterator __it1, _RandomAccessIterator __it2) -> _RandomAccessIterator
3571 { return __internal::__cmp_iterators_by_values(__it1, __it2, __comp); });
3572 });
3573 }
3574
3575 //------------------------------------------------------------------------
3576 // minmax_element
3577 //------------------------------------------------------------------------
3578
3579 template <typename _ForwardIterator, typename _Compare>
3580 std::pair<_ForwardIterator, _ForwardIterator>
__brick_minmax_element(_ForwardIterator __first,_ForwardIterator __last,_Compare __comp,std::false_type)3581 __brick_minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp,
3582 /* __is_vector = */ std::false_type) noexcept
3583 {
3584 return std::minmax_element(__first, __last, __comp);
3585 }
3586
3587 template <typename _RandomAccessIterator, typename _Compare>
3588 std::pair<_RandomAccessIterator, _RandomAccessIterator>
__brick_minmax_element(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,std::true_type)3589 __brick_minmax_element(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
3590 /* __is_vector = */ std::true_type) noexcept
3591 {
3592 #if defined(_PSTL_UDR_PRESENT)
3593 return __unseq_backend::__simd_minmax_element(__first, __last - __first, __comp);
3594 #else
3595 return std::minmax_element(__first, __last, __comp);
3596 #endif
3597 }
3598
3599 template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
3600 std::pair<_ForwardIterator, _ForwardIterator>
__pattern_minmax_element(_Tag,_ExecutionPolicy &&,_ForwardIterator __first,_ForwardIterator __last,_Compare __comp)3601 __pattern_minmax_element(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
3602 _Compare __comp) noexcept
3603 {
3604 return __internal::__brick_minmax_element(__first, __last, __comp, typename _Tag::__is_vector{});
3605 }
3606
3607 template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
3608 std::pair<_RandomAccessIterator, _RandomAccessIterator>
__pattern_minmax_element(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp)3609 __pattern_minmax_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
3610 _RandomAccessIterator __last, _Compare __comp)
3611 {
3612 if (__first == __last)
3613 return std::make_pair(__first, __first);
3614
3615 using __backend_tag = typename decltype(__tag)::__backend_tag;
3616
3617 return __internal::__except_handler([&]() {
3618 typedef std::pair<_RandomAccessIterator, _RandomAccessIterator> _Result;
3619
3620 return __par_backend::__parallel_reduce(
3621 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last,
3622 std::make_pair(__first, __first),
3623 [=](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Result __init) -> _Result
3624 {
3625 const _Result __subresult = __internal::__brick_minmax_element(__begin, __end, __comp, _IsVector{});
3626 return std::make_pair(
3627 __internal::__cmp_iterators_by_values(__subresult.first, __init.first, __comp),
3628 __internal::__cmp_iterators_by_values(__init.second, __subresult.second, std::not_fn(__comp)));
3629 },
3630 [=](_Result __p1, _Result __p2) -> _Result
3631 {
3632 return std::make_pair(
3633 __internal::__cmp_iterators_by_values(__p1.first, __p2.first, __comp),
3634 __internal::__cmp_iterators_by_values(__p2.second, __p1.second, std::not_fn(__comp)));
3635 });
3636 });
3637 }
3638
3639 //------------------------------------------------------------------------
3640 // mismatch
3641 //------------------------------------------------------------------------
3642 template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
3643 std::pair<_ForwardIterator1, _ForwardIterator2>
__mismatch_serial(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred)3644 __mismatch_serial(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3645 _ForwardIterator2 __last2, _BinaryPredicate __pred)
3646 {
3647 #if defined(_PSTL_CPP14_2RANGE_MISMATCH_EQUAL_PRESENT)
3648 return std::mismatch(__first1, __last1, __first2, __last2, __pred);
3649 #else
3650 for (; __first1 != __last1 && __first2 != __last2 && __pred(*__first1, *__first2); ++__first1, ++__first2)
3651 {
3652 }
3653 return std::make_pair(__first1, __first2);
3654 #endif
3655 }
3656
3657 template <class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
3658 std::pair<_ForwardIterator1, _ForwardIterator2>
__brick_mismatch(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Predicate __pred,std::false_type)3659 __brick_mismatch(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3660 _ForwardIterator2 __last2, _Predicate __pred, /* __is_vector = */ std::false_type) noexcept
3661 {
3662 return __mismatch_serial(__first1, __last1, __first2, __last2, __pred);
3663 }
3664
3665 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Predicate>
3666 std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
__brick_mismatch(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_Predicate __pred,std::true_type)3667 __brick_mismatch(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
3668 _RandomAccessIterator2 __last2, _Predicate __pred, /* __is_vector = */ std::true_type) noexcept
3669 {
3670 auto __n = std::min(__last1 - __first1, __last2 - __first2);
3671 return __unseq_backend::__simd_first(__first1, __n, __first2, std::not_fn(__pred));
3672 }
3673
3674 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
3675 std::pair<_ForwardIterator1, _ForwardIterator2>
__pattern_mismatch(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Predicate __pred)3676 __pattern_mismatch(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3677 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Predicate __pred) noexcept
3678 {
3679 return __internal::__brick_mismatch(__first1, __last1, __first2, __last2, __pred, typename _Tag::__is_vector{});
3680 }
3681
3682 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3683 class _Predicate>
3684 std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
__pattern_mismatch(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_Predicate __pred)3685 __pattern_mismatch(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
3686 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3687 _Predicate __pred) noexcept
3688 {
3689 using __backend_tag = typename decltype(__tag)::__backend_tag;
3690
3691 return __internal::__except_handler([&]() {
3692 auto __n = std::min(__last1 - __first1, __last2 - __first2);
3693 auto __result = __internal::__parallel_find(
3694 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
3695 [__first1, __first2, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
3696 {
3697 return __internal::__brick_mismatch(__i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
3698 __pred, _IsVector{})
3699 .first;
3700 },
3701 std::less<typename std::iterator_traits<_RandomAccessIterator1>::difference_type>(), /*is_first=*/true);
3702 return std::make_pair(__result, __first2 + (__result - __first1));
3703 });
3704 }
3705
3706 //------------------------------------------------------------------------
3707 // lexicographical_compare
3708 //------------------------------------------------------------------------
3709
3710 template <class _ForwardIterator1, class _ForwardIterator2, class _Compare>
3711 bool
__brick_lexicographical_compare(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Compare __comp,std::false_type)3712 __brick_lexicographical_compare(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
3713 _ForwardIterator2 __last2, _Compare __comp,
3714 /* __is_vector = */ std::false_type) noexcept
3715 {
3716 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __comp);
3717 }
3718
3719 template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare>
3720 bool
__brick_lexicographical_compare(_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_Compare __comp,std::true_type)3721 __brick_lexicographical_compare(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
3722 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _Compare __comp,
3723 /* __is_vector = */ std::true_type) noexcept
3724 {
3725 if (__first2 == __last2)
3726 { // if second sequence is empty
3727 return false;
3728 }
3729 else if (__first1 == __last1)
3730 { // if first sequence is empty
3731 return true;
3732 }
3733 else
3734 {
3735 typedef typename std::iterator_traits<_RandomAccessIterator1>::reference ref_type1;
3736 typedef typename std::iterator_traits<_RandomAccessIterator2>::reference ref_type2;
3737 --__last1;
3738 --__last2;
3739 auto __n = std::min(__last1 - __first1, __last2 - __first2);
3740 std::pair<_RandomAccessIterator1, _RandomAccessIterator2> __result = __unseq_backend::__simd_first(
3741 __first1, __n, __first2, [__comp](const ref_type1 __x, const ref_type2 __y) mutable {
3742 return __comp(__x, __y) || __comp(__y, __x);
3743 });
3744
3745 if (__result.first == __last1 && __result.second != __last2)
3746 { // if first sequence shorter than second
3747 return !__comp(*__result.second, *__result.first);
3748 }
3749 else
3750 { // if second sequence shorter than first or both have the same number of elements
3751 return __comp(*__result.first, *__result.second);
3752 }
3753 }
3754 }
3755
3756 template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
3757 bool
__pattern_lexicographical_compare(_Tag,_ExecutionPolicy &&,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_Compare __comp)3758 __pattern_lexicographical_compare(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
3759 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp) noexcept
3760 {
3761 return __internal::__brick_lexicographical_compare(__first1, __last1, __first2, __last2, __comp,
3762 typename _Tag::__is_vector{});
3763 }
3764
3765 template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
3766 class _Compare>
3767 bool
__pattern_lexicographical_compare(__parallel_tag<_IsVector> __tag,_ExecutionPolicy && __exec,_RandomAccessIterator1 __first1,_RandomAccessIterator1 __last1,_RandomAccessIterator2 __first2,_RandomAccessIterator2 __last2,_Compare __comp)3768 __pattern_lexicographical_compare(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec,
3769 _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
3770 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
3771 _Compare __comp) noexcept
3772 {
3773 using __backend_tag = typename decltype(__tag)::__backend_tag;
3774
3775 if (__first2 == __last2)
3776 { // if second sequence is empty
3777 return false;
3778 }
3779 else if (__first1 == __last1)
3780 { // if first sequence is empty
3781 return true;
3782 }
3783 else
3784 {
3785 typedef typename std::iterator_traits<_RandomAccessIterator1>::reference _RefType1;
3786 typedef typename std::iterator_traits<_RandomAccessIterator2>::reference _RefType2;
3787 --__last1;
3788 --__last2;
3789 auto __n = std::min(__last1 - __first1, __last2 - __first2);
3790 auto __result = __internal::__parallel_find(
3791 __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
3792 [__first1, __first2, &__comp](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
3793 {
3794 return __internal::__brick_mismatch(
3795 __i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
3796 [&__comp](const _RefType1 __x, const _RefType2 __y)
3797 { return !__comp(__x, __y) && !__comp(__y, __x); },
3798 _IsVector{})
3799 .first;
3800 },
3801 std::less<typename std::iterator_traits<_RandomAccessIterator1>::difference_type>(), /*is_first=*/true);
3802
3803 if (__result == __last1 && __first2 + (__result - __first1) != __last2)
3804 { // if first sequence shorter than second
3805 return !__comp(*(__first2 + (__result - __first1)), *__result);
3806 }
3807 else
3808 { // if second sequence shorter than first or both have the same number of elements
3809 return __comp(*__result, *(__first2 + (__result - __first1)));
3810 }
3811 }
3812 }
3813
3814 } // namespace __internal
3815 } // namespace __pstl
3816
3817 _PSTL_HIDE_FROM_ABI_POP
3818
3819 #endif /* _PSTL_ALGORITHM_IMPL_H */
3820