[libcxx-commits] [pstl] 843c12d - [libc++][pstl] Implement tag dispatching mechanism for Parallel STL
Ruslan Arutyunyan via libcxx-commits
libcxx-commits at lists.llvm.org
Thu Jan 27 17:14:52 PST 2022
Author: Ruslan Arutyunyan
Date: 2022-01-28T04:09:51+03:00
New Revision: 843c12d6a0cdfd64c5a92e24eb58ba9ee17ca1ee
URL: https://github.com/llvm/llvm-project/commit/843c12d6a0cdfd64c5a92e24eb58ba9ee17ca1ee
DIFF: https://github.com/llvm/llvm-project/commit/843c12d6a0cdfd64c5a92e24eb58ba9ee17ca1ee.diff
LOG: [libc++][pstl] Implement tag dispatching mechanism for Parallel STL
Implement the mechanism that simplifies the execution policy/iterator
category dispatching and allows to implement customizations for
the parallel algorithms with adding custom tags
Reviewed By: rodgert, MikeDvorskiy
Differential Revision: https://reviews.llvm.org/D104492
Added:
Modified:
pstl/include/pstl/internal/algorithm_fwd.h
pstl/include/pstl/internal/algorithm_impl.h
pstl/include/pstl/internal/execution_defs.h
pstl/include/pstl/internal/execution_impl.h
pstl/include/pstl/internal/glue_algorithm_impl.h
pstl/include/pstl/internal/glue_memory_impl.h
pstl/include/pstl/internal/glue_numeric_impl.h
pstl/include/pstl/internal/numeric_fwd.h
pstl/include/pstl/internal/numeric_impl.h
pstl/include/pstl/internal/omp/parallel_for.h
pstl/include/pstl/internal/omp/parallel_invoke.h
pstl/include/pstl/internal/omp/parallel_merge.h
pstl/include/pstl/internal/omp/parallel_reduce.h
pstl/include/pstl/internal/omp/parallel_scan.h
pstl/include/pstl/internal/omp/parallel_stable_partial_sort.h
pstl/include/pstl/internal/omp/parallel_stable_sort.h
pstl/include/pstl/internal/omp/parallel_transform_reduce.h
pstl/include/pstl/internal/omp/parallel_transform_scan.h
pstl/include/pstl/internal/parallel_backend_serial.h
pstl/include/pstl/internal/parallel_backend_tbb.h
pstl/include/pstl/internal/parallel_impl.h
pstl/test/std/numerics/numeric.ops/scan.fail.cpp
pstl/test/support/utils.h
Removed:
################################################################################
diff --git a/pstl/include/pstl/internal/algorithm_fwd.h b/pstl/include/pstl/internal/algorithm_fwd.h
index 43fd05709eee5..3dcf9e9f5e9eb 100644
--- a/pstl/include/pstl/internal/algorithm_fwd.h
+++ b/pstl/include/pstl/internal/algorithm_fwd.h
@@ -37,15 +37,13 @@ bool
__brick_any_of(const _RandomAccessIterator, const _RandomAccessIterator, _Pred,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Pred, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Pred>
bool
-__pattern_any_of(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Pred, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_any_of(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Pred) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Pred, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Pred>
bool
-__pattern_any_of(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Pred, _IsVector,
- /*parallel=*/std::true_type);
+__pattern_any_of(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Pred);
//------------------------------------------------------------------------
// walk1 (pseudo)
@@ -61,25 +59,22 @@ template <class _RandomAccessIterator, class _Function>
void __brick_walk1(_RandomAccessIterator, _RandomAccessIterator, _Function,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Function>
void
-__pattern_walk1(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Function, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk1(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Function) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Function>
void
-__pattern_walk1(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Function, _IsVector,
- /*parallel=*/std::true_type);
+__pattern_walk1(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Function);
-template <class _ExecutionPolicy, class _ForwardIterator, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Brick>
void
-__pattern_walk_brick(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Brick,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Brick) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
void
-__pattern_walk_brick(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Brick,
- /*parallel=*/std::true_type);
+__pattern_walk_brick(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Brick);
//------------------------------------------------------------------------
// walk1_n
@@ -93,25 +88,21 @@ template <class _RandomAccessIterator, class _DifferenceType, class _Function>
_RandomAccessIterator __brick_walk1_n(_RandomAccessIterator, _DifferenceType, _Function,
/*vectorTag=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
_ForwardIterator
-__pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Function, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_walk1_n(_Tag, _ExecutionPolicy&&, _ForwardIterator, _Size, _Function) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function>
_RandomAccessIterator
-__pattern_walk1_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Function, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_walk1_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _Size, _Function);
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
_ForwardIterator
-__pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Brick,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_walk_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator, _Size, _Brick) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
_RandomAccessIterator
-__pattern_walk_brick_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Brick,
- /*is_parallel=*/std::true_type);
+__pattern_walk_brick_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _Size, _Brick);
//------------------------------------------------------------------------
// walk2 (pseudo)
@@ -135,50 +126,48 @@ template <class _RandomAccessIterator1, class _Size, class _RandomAccessIterator
_RandomAccessIterator2 __brick_walk2_n(_RandomAccessIterator1, _Size, _RandomAccessIterator2, _Function,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function>
_ForwardIterator2
-__pattern_walk2(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk2(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Function,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Function>
_RandomAccessIterator2
-__pattern_walk2(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Function,
- _IsVector,
- /*parallel=*/std::true_type);
+__pattern_walk2(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _Function);
-template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
+ class _Function>
_ForwardIterator2
-__pattern_walk2_n(_ExecutionPolicy&&, _ForwardIterator1, _Size, _ForwardIterator2, _Function, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk2_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _Size, _ForwardIterator2, _Function) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2,
- class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
+ class _RandomAccessIterator2, class _Function>
_RandomAccessIterator2
-__pattern_walk2_n(_ExecutionPolicy&&, _RandomAccessIterator1, _Size, _RandomAccessIterator2, _Function, _IsVector,
- /*parallel=*/std::true_type);
+__pattern_walk2_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _Size, _RandomAccessIterator2,
+ _Function);
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Brick>
_ForwardIterator2
-__pattern_walk2_brick(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Brick,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk2_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _Brick) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Brick>
_RandomAccessIterator2
-__pattern_walk2_brick(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _Brick,
- /*parallel=*/std::true_type);
+__pattern_walk2_brick(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _Brick);
-template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
+ class _Brick>
_ForwardIterator2
-__pattern_walk2_brick_n(_ExecutionPolicy&&, _ForwardIterator1, _Size, _ForwardIterator2, _Brick,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk2_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _Size, _ForwardIterator2, _Brick) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
+ class _RandomAccessIterator2, class _Brick>
_RandomAccessIterator2
-__pattern_walk2_brick_n(_ExecutionPolicy&&, _RandomAccessIterator1, _Size, _RandomAccessIterator2, _Brick,
- /*parallel=*/std::true_type);
+__pattern_walk2_brick_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _Size,
+ _RandomAccessIterator2, _Brick);
//------------------------------------------------------------------------
// walk3 (pseudo)
@@ -195,18 +184,17 @@ _RandomAccessIterator3 __brick_walk3(_RandomAccessIterator1, _RandomAccessIterat
_RandomAccessIterator3, _Function,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3,
- class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3,
+ class _Function>
_ForwardIterator3
-__pattern_walk3(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator3,
- _Function, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_walk3(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator3,
+ _Function) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Function>
_RandomAccessIterator3
-__pattern_walk3(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator3, _Function, _IsVector, /*parallel=*/std::true_type);
+__pattern_walk3(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator3, _Function);
//------------------------------------------------------------------------
// equal
@@ -220,17 +208,16 @@ template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Bin
bool __brick_equal(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _BinaryPredicate,
/* is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _BinaryPredicate,
- _IsVector, /* is_parallel = */ std::false_type) noexcept;
+__pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _BinaryPredicate, _IsVector, /* is_parallel = */ std::true_type);
+__pattern_equal(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _BinaryPredicate);
template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
bool __brick_equal(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2, _BinaryPredicate,
@@ -240,17 +227,16 @@ template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Bin
bool __brick_equal(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2,
_BinaryPredicate, /* is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _BinaryPredicate, _IsVector, /* is_parallel = */ std::false_type) noexcept;
+__pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _BinaryPredicate, _IsVector, /* is_parallel = */ std::true_type);
+__pattern_equal(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _BinaryPredicate);
//------------------------------------------------------------------------
// find_if
@@ -264,15 +250,14 @@ template <class _RandomAccessIterator, class _Predicate>
_RandomAccessIterator __brick_find_if(_RandomAccessIterator, _RandomAccessIterator, _Predicate,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
_ForwardIterator
-__pattern_find_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_find_if(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
_RandomAccessIterator
-__pattern_find_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Predicate, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_find_if(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Predicate);
//------------------------------------------------------------------------
// find_end
@@ -288,19 +273,16 @@ _RandomAccessIterator1 __brick_find_end(_RandomAccessIterator1, _RandomAccessIte
_RandomAccessIterator2, _BinaryPredicate,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_find_end(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_find_end(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_find_end(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::true_type) noexcept;
+__pattern_find_end(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _BinaryPredicate) noexcept;
//------------------------------------------------------------------------
// find_first_of
@@ -316,17 +298,16 @@ _RandomAccessIterator1 __brick_find_first_of(_RandomAccessIterator1, _RandomAcce
_RandomAccessIterator2, _BinaryPredicate,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_find_first_of(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _BinaryPredicate, _IsVector, /*is_parallel=*/std::false_type) noexcept;
+__pattern_find_first_of(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_find_first_of(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _BinaryPredicate, _IsVector, /*is_parallel=*/std::true_type) noexcept;
+__pattern_find_first_of(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _BinaryPredicate) noexcept;
//------------------------------------------------------------------------
// search
@@ -342,19 +323,16 @@ _RandomAccessIterator1 __brick_search(_RandomAccessIterator1, _RandomAccessItera
_RandomAccessIterator2, _BinaryPredicate,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_search(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_search(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_search(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::true_type) noexcept;
+__pattern_search(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _BinaryPredicate) noexcept;
//------------------------------------------------------------------------
// search_n
@@ -370,19 +348,16 @@ _RandomAccessIterator
__brick_search_n(_RandomAccessIterator, _RandomAccessIterator, _Size, const _Tp&, _BinaryPredicate,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate,
- class IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
_ForwardIterator
-__pattern_search_n(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Size, const _Tp&, _BinaryPredicate,
- IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_search_n(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Size, const _Tp&,
+ _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp, class _BinaryPredicate,
- class IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp,
+ class _BinaryPredicate>
_RandomAccessIterator
-__pattern_search_n(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Size, const _Tp&,
- _BinaryPredicate, IsVector,
- /*is_parallel=*/std::true_type) noexcept;
+__pattern_search_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Size,
+ const _Tp&, _BinaryPredicate) noexcept;
//------------------------------------------------------------------------
// copy_n
@@ -424,14 +399,12 @@ _OutputIterator __brick_move(_RandomAccessIterator, _RandomAccessIterator, _Outp
// swap_ranges
//------------------------------------------------------------------------
template <class _ForwardIterator, class _OutputIterator>
-_OutputIterator
-__brick_swap_ranges(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
- /*vector=*/std::false_type) noexcept;
+_OutputIterator __brick_swap_ranges(_ForwardIterator, _ForwardIterator, _OutputIterator,
+ /*vector=*/std::false_type) noexcept;
template <class _RandomAccessIterator, class _OutputIterator>
-_OutputIterator
-__brick_swap_ranges(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
- /*vector=*/std::true_type) noexcept;
+_OutputIterator __brick_swap_ranges(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
+ /*vector=*/std::true_type) noexcept;
//------------------------------------------------------------------------
// copy_if
@@ -474,16 +447,16 @@ void
__brick_partition_by_mask(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator1, _OutputIterator2, bool*,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
_OutputIterator
-__pattern_copy_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _UnaryPredicate, _IsVector,
- /*parallel=*/std::false_type) noexcept;
+__pattern_copy_if(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator,
+ _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _UnaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _UnaryPredicate>
_OutputIterator
-__pattern_copy_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator, _UnaryPredicate,
- _IsVector, /*parallel=*/std::true_type);
+__pattern_copy_if(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _OutputIterator, _UnaryPredicate);
//------------------------------------------------------------------------
// count
@@ -499,15 +472,14 @@ typename std::iterator_traits<_ForwardIterator>::
diff erence_type
__brick_count(_ForwardIterator, _ForwardIterator, _Predicate,
/* is_vector = */ std::false_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
typename std::iterator_traits<_ForwardIterator>::
diff erence_type
-__pattern_count(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate,
- /* is_parallel */ std::false_type, _IsVector) noexcept;
+__pattern_count(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type
-__pattern_count(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Predicate,
- /* is_parallel */ std::true_type, _IsVector);
+__pattern_count(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Predicate);
//------------------------------------------------------------------------
// unique
@@ -521,15 +493,14 @@ template <class _RandomAccessIterator, class _BinaryPredicate>
_RandomAccessIterator __brick_unique(_RandomAccessIterator, _RandomAccessIterator, _BinaryPredicate,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
_ForwardIterator
-__pattern_unique(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_unique(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
_RandomAccessIterator
-__pattern_unique(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _BinaryPredicate, _IsVector,
- /*is_parallel=*/std::true_type) noexcept;
+__pattern_unique(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _BinaryPredicate) noexcept;
//------------------------------------------------------------------------
// unique_copy
@@ -543,11 +514,10 @@ template <class _RandomAccessIterator, class _OutputIterator, class _BinaryPredi
_OutputIterator __brick_unique_copy(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator, _BinaryPredicate,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryPredicate>
_OutputIterator
-__pattern_unique_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryPredicate,
- _IsVector, /*parallel=*/std::false_type) noexcept;
+__pattern_unique_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator,
+ _BinaryPredicate) noexcept;
template <class _ExecutionPolicy, class _DifferenceType, class _RandomAccessIterator, class _BinaryPredicate>
_DifferenceType
@@ -559,11 +529,11 @@ _DifferenceType
__brick_calc_mask_2(_RandomAccessIterator, _RandomAccessIterator, bool* __restrict, _BinaryPredicate,
/*vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _BinaryPredicate>
_OutputIterator
-__pattern_unique_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
- _BinaryPredicate, _IsVector, /*parallel=*/std::true_type);
+__pattern_unique_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _OutputIterator, _BinaryPredicate);
//------------------------------------------------------------------------
// reverse
@@ -585,15 +555,13 @@ template <class _RandomAccessIterator>
void __brick_reverse(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator>
void
-__pattern_reverse(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_reverse(_Tag, _ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
void
-__pattern_reverse(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_reverse(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator);
//------------------------------------------------------------------------
// reverse_copy
@@ -607,15 +575,15 @@ template <class _RandomAccessIterator, class _OutputIterator>
_OutputIterator __brick_reverse_copy(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator>
_OutputIterator
-__pattern_reverse_copy(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _OutputIterator, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_reverse_copy(_Tag, _ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator,
+ _OutputIterator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator>
_OutputIterator
-__pattern_reverse_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_reverse_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _OutputIterator);
//------------------------------------------------------------------------
// rotate
@@ -629,15 +597,14 @@ template <class _RandomAccessIterator>
_RandomAccessIterator __brick_rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator>
_ForwardIterator
-__pattern_rotate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_rotate(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
_RandomAccessIterator
-__pattern_rotate(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_rotate(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _RandomAccessIterator);
//------------------------------------------------------------------------
// rotate_copy
@@ -652,17 +619,15 @@ _OutputIterator __brick_rotate_copy(_RandomAccessIterator, _RandomAccessIterator
_OutputIterator,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator>
_OutputIterator
-__pattern_rotate_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator, _OutputIterator,
- _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_rotate_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator,
+ _OutputIterator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator>
_OutputIterator
-__pattern_rotate_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
- _OutputIterator, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_rotate_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _RandomAccessIterator, _OutputIterator);
//------------------------------------------------------------------------
// is_partitioned
@@ -676,15 +641,14 @@ template <class _RandomAccessIterator, class _UnaryPredicate>
bool __brick_is_partitioned(_RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
bool
-__pattern_is_partitioned(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_is_partitioned(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
bool
-__pattern_is_partitioned(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_is_partitioned(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _UnaryPredicate);
//------------------------------------------------------------------------
// partition
@@ -698,15 +662,14 @@ template <class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator __brick_partition(_RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
_ForwardIterator
-__pattern_partition(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_partition(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_partition(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_partition(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _UnaryPredicate);
//------------------------------------------------------------------------
// stable_partition
@@ -720,16 +683,15 @@ template <class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator __brick_stable_partition(_RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate>
_BidirectionalIterator
-__pattern_stable_partition(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _UnaryPredicate,
- _IsVector,
- /*is_parallelization=*/std::false_type) noexcept;
+__pattern_stable_partition(_Tag, _ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator,
+ _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_stable_partition(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
- /*is_parallelization=*/std::true_type) noexcept;
+__pattern_stable_partition(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _UnaryPredicate) noexcept;
//------------------------------------------------------------------------
// partition_copy
@@ -746,85 +708,74 @@ std::pair<_OutputIterator1, _OutputIterator2> __brick_partition_copy(_RandomAcce
_UnaryPredicate,
/*is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
- class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
+ class _UnaryPredicate>
std::pair<_OutputIterator1, _OutputIterator2>
-__pattern_partition_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator1, _OutputIterator2,
- _UnaryPredicate, _IsVector,
- /*is_parallelization=*/std::false_type) noexcept;
+__pattern_partition_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator1,
+ _OutputIterator2, _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator1, class _OutputIterator2,
- class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator1,
+ class _OutputIterator2, class _UnaryPredicate>
std::pair<_OutputIterator1, _OutputIterator2>
-__pattern_partition_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator1,
- _OutputIterator2, _UnaryPredicate, _IsVector,
- /*is_parallelization=*/std::true_type);
+__pattern_partition_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _OutputIterator1, _OutputIterator2, _UnaryPredicate);
//------------------------------------------------------------------------
// sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector,
- class _IsMoveConstructible>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsMoveConstructible>
void
-__pattern_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector /*is_vector*/,
- /*is_parallel=*/std::false_type, _IsMoveConstructible) noexcept;
+__pattern_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
+ _IsMoveConstructible) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector /*is_vector*/,
- /*is_parallel=*/std::true_type,
+__pattern_sort(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
/*is_move_constructible=*/std::true_type);
//------------------------------------------------------------------------
// stable_sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
- _IsVector /*is_vector*/,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_stable_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare,
- _IsVector /*is_vector*/,
- /*is_parallel=*/std::true_type);
+__pattern_stable_sort(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare);
//------------------------------------------------------------------------
// partial_sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_partial_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
- _Compare, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_partial_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_partial_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
- _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_partial_sort(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _RandomAccessIterator, _Compare);
//------------------------------------------------------------------------
// partial_sort_copy
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
_RandomAccessIterator2
-__pattern_partial_sort_copy(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _Compare, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_partial_sort_copy(_Tag, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
_RandomAccessIterator2
-__pattern_partial_sort_copy(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_partial_sort_copy(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1,
+ _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2, _Compare);
//------------------------------------------------------------------------
// adjacent_find
@@ -840,30 +791,27 @@ _ForwardIterator
__brick_adjacent_find(_ForwardIterator, _ForwardIterator, _BinaryPredicate,
/* IsVector = */ std::false_type, bool) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
_ForwardIterator
-__pattern_adjacent_find(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate,
- /* is_parallel */ std::false_type, _IsVector, bool) noexcept;
+__pattern_adjacent_find(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate, bool) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
_RandomAccessIterator
-__pattern_adjacent_find(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _BinaryPredicate,
- /* is_parallel */ std::true_type, _IsVector, bool);
+__pattern_adjacent_find(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _BinaryPredicate, bool);
//------------------------------------------------------------------------
// nth_element
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_nth_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare,
- _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_nth_element(_Tag, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_nth_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare,
- _IsVector,
- /*is_parallel=*/std::true_type) noexcept;
+__pattern_nth_element(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _RandomAccessIterator, _Compare) noexcept;
//------------------------------------------------------------------------
// fill, fill_n
@@ -878,15 +826,13 @@ void
__brick_fill(_ForwardIterator, _ForwardIterator, const _Tp&,
/* __is_vector = */ std::false_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Tp>
void
-__pattern_fill(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&,
- /*is_parallel=*/std::false_type, _IsVector) noexcept;
+__pattern_fill(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Tp>
_RandomAccessIterator
-__pattern_fill(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, const _Tp&,
- /*is_parallel=*/std::true_type, _IsVector);
+__pattern_fill(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, const _Tp&);
template <class _RandomAccessIterator, class _Size, class _Tp>
_RandomAccessIterator
@@ -898,15 +844,13 @@ _OutputIterator
__brick_fill_n(_OutputIterator, _Size, const _Tp&,
/* __is_vector = */ std::false_type) noexcept;
-template <class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp>
_OutputIterator
-__pattern_fill_n(_ExecutionPolicy&&, _OutputIterator, _Size, const _Tp&,
- /*is_parallel=*/std::false_type, _IsVector) noexcept;
+__pattern_fill_n(_Tag, _ExecutionPolicy&&, _OutputIterator, _Size, const _Tp&) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp>
_RandomAccessIterator
-__pattern_fill_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, const _Tp&,
- /*is_parallel=*/std::true_type, _IsVector);
+__pattern_fill_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _Size, const _Tp&);
//------------------------------------------------------------------------
// generate, generate_n
@@ -920,15 +864,14 @@ template <class _ForwardIterator, class _Generator>
void __brick_generate(_ForwardIterator, _ForwardIterator, _Generator,
/* is_vector = */ std::false_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Generator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Generator>
void
-__pattern_generate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Generator,
- /*is_parallel=*/std::false_type, _IsVector) noexcept;
+__pattern_generate(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Generator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Generator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Generator>
_RandomAccessIterator
-__pattern_generate(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Generator,
- /*is_parallel=*/std::true_type, _IsVector);
+__pattern_generate(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Generator);
template <class _RandomAccessIterator, class Size, class _Generator>
_RandomAccessIterator __brick_generate_n(_RandomAccessIterator, Size, _Generator,
@@ -938,15 +881,13 @@ template <class OutputIterator, class Size, class _Generator>
OutputIterator __brick_generate_n(OutputIterator, Size, _Generator,
/* is_vector = */ std::false_type) noexcept;
-template <class _ExecutionPolicy, class OutputIterator, class Size, class _Generator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class OutputIterator, class Size, class _Generator>
OutputIterator
-__pattern_generate_n(_ExecutionPolicy&&, OutputIterator, Size, _Generator,
- /*is_parallel=*/std::false_type, _IsVector) noexcept;
+__pattern_generate_n(_Tag, _ExecutionPolicy&&, OutputIterator, Size, _Generator) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class Size, class _Generator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class Size, class _Generator>
_RandomAccessIterator
-__pattern_generate_n(_ExecutionPolicy&&, _RandomAccessIterator, Size, _Generator,
- /*is_parallel=*/std::true_type, _IsVector);
+__pattern_generate_n(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, Size, _Generator);
//------------------------------------------------------------------------
// remove
@@ -959,15 +900,14 @@ template <class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator __brick_remove_if(_RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
_ForwardIterator
-__pattern_remove_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
- /*is_parallel*/ std::false_type) noexcept;
+__pattern_remove_if(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_remove_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
- /*is_parallel*/ std::true_type) noexcept;
+__pattern_remove_if(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _UnaryPredicate) noexcept;
//------------------------------------------------------------------------
// merge
@@ -983,18 +923,17 @@ _OutputIterator __brick_merge(_RandomAccessIterator1, _RandomAccessIterator1, _R
_RandomAccessIterator2, _OutputIterator, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_merge(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _OutputIterator, _Compare, _IsVector, /* is_parallel = */ std::false_type) noexcept;
+__pattern_merge(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _OutputIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_merge(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector,
- /* is_parallel = */ std::true_type);
+__pattern_merge(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator, _Compare);
//------------------------------------------------------------------------
// inplace_merge
@@ -1008,34 +947,30 @@ template <class _RandomAccessIterator, class _Compare>
void __brick_inplace_merge(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _Compare>
void
-__pattern_inplace_merge(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator,
- _Compare, _IsVector,
- /* is_parallel = */ std::false_type) noexcept;
+__pattern_inplace_merge(_Tag, _ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator,
+ _BidirectionalIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_inplace_merge(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
- _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_inplace_merge(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _RandomAccessIterator, _Compare);
//------------------------------------------------------------------------
// includes
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
bool
-__pattern_includes(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _Compare, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_includes(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
bool
-__pattern_includes(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_includes(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _Compare);
//------------------------------------------------------------------------
// set_union
@@ -1051,17 +986,17 @@ _OutputIterator __brick_set_union(_RandomAccessIterator1, _RandomAccessIterator1
_RandomAccessIterator2, _OutputIterator, _Compare,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_union(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::false_type) noexcept;
+__pattern_set_union(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _OutputIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_set_union(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
+__pattern_set_union(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator, _Compare);
//------------------------------------------------------------------------
// set_intersection
@@ -1077,19 +1012,18 @@ _OutputIterator __brick_set_intersection(_RandomAccessIterator1, _RandomAccessIt
_RandomAccessIterator2, _OutputIterator, _Compare,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_intersection(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator2, _OutputIterator, _Compare, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_set_intersection(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _OutputIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_set_intersection(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_set_intersection(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1,
+ _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator,
+ _Compare);
//------------------------------------------------------------------------
// set_
diff erence
@@ -1105,17 +1039,17 @@ _OutputIterator __brick_set_
diff erence(_RandomAccessIterator1, _RandomAccessIter
_RandomAccessIterator2, _OutputIterator, _Compare,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_
diff erence(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::false_type) noexcept;
+__pattern_set_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _OutputIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_set_
diff erence(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
+__pattern_set_
diff erence(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator, _Compare);
//------------------------------------------------------------------------
// set_symmetric_
diff erence
@@ -1131,19 +1065,18 @@ _OutputIterator __brick_set_symmetric_
diff erence(_RandomAccessIterator1, _Random
_RandomAccessIterator2, _OutputIterator, _Compare,
/*__is_vector=*/std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_symmetric_
diff erence(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator2, _OutputIterator, _Compare, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_set_symmetric_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _OutputIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_set_symmetric_
diff erence(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
- _RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_set_symmetric_
diff erence(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1,
+ _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2,
+ _OutputIterator, _Compare);
//------------------------------------------------------------------------
// is_heap_until
@@ -1157,15 +1090,14 @@ template <class _RandomAccessIterator, class _Compare>
_RandomAccessIterator __brick_is_heap_until(_RandomAccessIterator, _RandomAccessIterator, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
_RandomAccessIterator
-__pattern_is_heap_until(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector,
- /* is_parallel = */ std::false_type) noexcept;
+__pattern_is_heap_until(_Tag, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
_RandomAccessIterator
-__pattern_is_heap_until(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector,
- /* is_parallel = */ std::true_type) noexcept;
+__pattern_is_heap_until(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare) noexcept;
//------------------------------------------------------------------------
// min_element
@@ -1179,15 +1111,14 @@ template <typename _RandomAccessIterator, typename _Compare>
_RandomAccessIterator __brick_min_element(_RandomAccessIterator, _RandomAccessIterator, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare, typename _IsVector>
+template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
_ForwardIterator
-__pattern_min_element(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare, _IsVector,
- /* is_parallel = */ std::false_type) noexcept;
+__pattern_min_element(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare) noexcept;
-template <typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _IsVector>
+template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
_RandomAccessIterator
-__pattern_min_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector,
- /* is_parallel = */ std::true_type);
+__pattern_min_element(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare);
//------------------------------------------------------------------------
// minmax_element
@@ -1202,15 +1133,14 @@ std::pair<_RandomAccessIterator, _RandomAccessIterator>
__brick_minmax_element(_RandomAccessIterator, _RandomAccessIterator, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare, typename _IsVector>
+template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
std::pair<_ForwardIterator, _ForwardIterator>
-__pattern_minmax_element(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare, _IsVector,
- /* is_parallel = */ std::false_type) noexcept;
+__pattern_minmax_element(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare) noexcept;
-template <typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _IsVector>
+template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
std::pair<_RandomAccessIterator, _RandomAccessIterator>
-__pattern_minmax_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector,
- /* is_parallel = */ std::true_type);
+__pattern_minmax_element(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Compare);
//------------------------------------------------------------------------
// mismatch
@@ -1227,17 +1157,16 @@ std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
_Predicate,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
std::pair<_ForwardIterator1, _ForwardIterator2>
-__pattern_mismatch(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
- _Predicate, _IsVector,
- /* is_parallel = */ std::false_type) noexcept;
+__pattern_mismatch(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
+ _Predicate) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Predicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Predicate>
std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
-__pattern_mismatch(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _RandomAccessIterator2, _Predicate, _IsVector, /* is_parallel = */ std::true_type) noexcept;
+__pattern_mismatch(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
+ _RandomAccessIterator2, _RandomAccessIterator2, _Predicate) noexcept;
//------------------------------------------------------------------------
// lexicographical_compare
@@ -1253,17 +1182,17 @@ bool __brick_lexicographical_compare(_RandomAccessIterator1, _RandomAccessIterat
_RandomAccessIterator2, _Compare,
/* __is_vector = */ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
bool
-__pattern_lexicographical_compare(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator2, _Compare, _IsVector, /* is_parallel = */ std::false_type) noexcept;
+__pattern_lexicographical_compare(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
+ _ForwardIterator2, _Compare) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
bool
-__pattern_lexicographical_compare(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
- _RandomAccessIterator2, _RandomAccessIterator2, _Compare, _IsVector,
- /* is_parallel = */ std::true_type) noexcept;
+__pattern_lexicographical_compare(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1,
+ _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2,
+ _Compare) noexcept;
} // namespace __internal
} // namespace __pstl
diff --git a/pstl/include/pstl/internal/algorithm_impl.h b/pstl/include/pstl/internal/algorithm_impl.h
index 1f4d9878d12cc..2b505d94611f6 100644
--- a/pstl/include/pstl/internal/algorithm_impl.h
+++ b/pstl/include/pstl/internal/algorithm_impl.h
@@ -51,25 +51,27 @@ __brick_any_of(const _RandomAccessIterator __first, const _RandomAccessIterator
return __unseq_backend::__simd_or(__first, __last - __first, __pred);
};
-template <class _ExecutionPolicy, class _ForwardIterator, class _Pred, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Pred>
bool
-__pattern_any_of(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred,
- _IsVector __is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_any_of(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) noexcept
{
- return __internal::__brick_any_of(__first, __last, __pred, __is_vector);
+ return __internal::__brick_any_of(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Pred, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Pred>
bool
-__pattern_any_of(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Pred __pred,
- _IsVector __is_vector, /*parallel=*/std::true_type)
+__pattern_any_of(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Pred __pred)
{
- return __internal::__except_handler([&]() {
- return __internal::__parallel_or(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__pred, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- return __internal::__brick_any_of(__i, __j, __pred, __is_vector);
- });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __internal::__parallel_or(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
+ { return __internal::__brick_any_of(__i, __j, __pred, _IsVector{}); });
+ });
}
// [alg.foreach]
@@ -104,48 +106,51 @@ __brick_walk1(_RandomAccessIterator __first, _RandomAccessIterator __last, _Func
__unseq_backend::__simd_walk_1(__first, __last - __first, __f);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Function>
void
-__pattern_walk1(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Function __f,
- _IsVector __is_vector,
- /*parallel=*/std::false_type) noexcept
+__pattern_walk1(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Function __f) noexcept
{
- __internal::__brick_walk1(__first, __last, __f, __is_vector);
+ __internal::__brick_walk1(__first, __last, __f, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Function>
void
-__pattern_walk1(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Function __f,
- _IsVector __is_vector,
- /*parallel=*/std::true_type)
-{
- __internal::__except_handler([&]() {
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__f, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- __internal::__brick_walk1(__i, __j, __f, __is_vector);
- });
- });
+__pattern_walk1(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Function __f)
+{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__f](_RandomAccessIterator __i, _RandomAccessIterator __j)
+ { __internal::__brick_walk1(__i, __j, __f, _IsVector{}); });
+ });
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Brick>
void
-__pattern_walk_brick(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Brick __brick,
- /*parallel=*/std::false_type) noexcept
+__pattern_walk_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _Brick __brick) noexcept
{
__brick(__first, __last);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
void
-__pattern_walk_brick(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Brick __brick,
- /*parallel=*/std::true_type)
+__pattern_walk_brick(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Brick __brick)
{
- __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j) { __brick(__i, __j); });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j)
+ { __brick(__i, __j); });
+ });
}
//------------------------------------------------------------------------
@@ -167,44 +172,45 @@ __brick_walk1_n(_RandomAccessIterator __first, _DifferenceType __n, _Function __
return __unseq_backend::__simd_walk_1(__first, __n, __f);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
_ForwardIterator
-__pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Function __f, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_walk1_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Function __f) noexcept
{
- return __internal::__brick_walk1_n(__first, __n, __f, __is_vector);
+ return __internal::__brick_walk1_n(__first, __n, __f, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function>
_RandomAccessIterator
-__pattern_walk1_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n, _Function __f,
- _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_walk1_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n,
+ _Function __f)
{
- __internal::__pattern_walk1(std::forward<_ExecutionPolicy>(__exec), __first, __first + __n, __f, __is_vector,
- std::true_type());
+ __internal::__pattern_walk1(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __n, __f);
+
return __first + __n;
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
_ForwardIterator
-__pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Brick __brick,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_walk_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Brick __brick) noexcept
{
return __brick(__first, __n);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
_RandomAccessIterator
-__pattern_walk_brick_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n, _Brick __brick,
- /*is_parallel=*/std::true_type)
+__pattern_walk_brick_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _Size __n, _Brick __brick)
{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __first + __n,
- [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j) { __brick(__i, __j - __i); });
- return __first + __n;
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __first + __n,
+ [__brick](_RandomAccessIterator __i, _RandomAccessIterator __j) { __brick(__i, __j - __i); });
+ return __first + __n;
+ });
}
//------------------------------------------------------------------------
@@ -249,95 +255,107 @@ __brick_walk2_n(_RandomAccessIterator1 __first1, _Size __n, _RandomAccessIterato
return __unseq_backend::__simd_walk_2(__first1, __n, __first2, __f);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function>
_ForwardIterator2
-__pattern_walk2(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
- _Function __f, _IsVector __is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_walk2(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _Function __f) noexcept
{
- return __internal::__brick_walk2(__first1, __last1, __first2, __f, __is_vector);
+ return __internal::__brick_walk2(__first1, __last1, __first2, __f, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Function,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Function>
_RandomAccessIterator2
-__pattern_walk2(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _Function __f, _IsVector __is_vector, /*parallel=*/std::true_type)
+__pattern_walk2(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Function __f)
{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__f, __first1, __first2, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- __internal::__brick_walk2(__i, __j, __first2 + (__i - __first1), __f, __is_vector);
- });
- return __first2 + (__last1 - __first1);
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__f, __first1, __first2](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ { __internal::__brick_walk2(__i, __j, __first2 + (__i - __first1), __f, _IsVector{}); });
+ return __first2 + (__last1 - __first1);
+ });
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
+ class _Function>
_ForwardIterator2
-__pattern_walk2_n(_ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2, _Function __f,
- _IsVector is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_walk2_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2,
+ _Function __f) noexcept
{
- return __internal::__brick_walk2_n(__first1, __n, __first2, __f, is_vector);
+ return __internal::__brick_walk2_n(__first1, __n, __first2, __f, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2,
- class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
+ class _RandomAccessIterator2, class _Function>
_RandomAccessIterator2
-__pattern_walk2_n(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _Size __n,
- _RandomAccessIterator2 __first2, _Function __f, _IsVector is_vector, /*parallel=*/std::true_type)
+__pattern_walk2_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _Size __n, _RandomAccessIterator2 __first2, _Function __f)
{
- return __internal::__pattern_walk2(std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n, __first2, __f,
- is_vector, std::true_type());
+ return __internal::__pattern_walk2(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
+ __first2, __f);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Brick>
_ForwardIterator2
-__pattern_walk2_brick(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _Brick __brick, /*parallel=*/std::false_type) noexcept
+__pattern_walk2_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _Brick __brick) noexcept
{
return __brick(__first1, __last1, __first2);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Brick>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Brick>
_RandomAccessIterator2
-__pattern_walk2_brick(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _Brick __brick, /*parallel=*/std::true_type)
+__pattern_walk2_brick(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Brick __brick)
{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- __brick(__i, __j, __first2 + (__i - __first1));
- });
- return __first2 + (__last1 - __first1);
- });
-}
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2, class _Brick>
-_RandomAccessIterator2
-__pattern_walk2_brick_n(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _Size __n,
- _RandomAccessIterator2 __first2, _Brick __brick, /*parallel=*/std::true_type)
-{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
- [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- __brick(__i, __j - __i, __first2 + (__i - __first1));
- });
- return __first2 + __n;
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ { __brick(__i, __j, __first2 + (__i - __first1)); });
+ return __first2 + (__last1 - __first1);
+ });
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Brick>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2,
+ class _Brick>
_ForwardIterator2
-__pattern_walk2_brick_n(_ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2,
- _Brick __brick, /*parallel=*/std::false_type) noexcept
+__pattern_walk2_brick_n(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2,
+ _Brick __brick) noexcept
{
return __brick(__first1, __n, __first2);
}
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _Size,
+ class _RandomAccessIterator2, class _Brick>
+_RandomAccessIterator2
+__pattern_walk2_brick_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _Size __n, _RandomAccessIterator2 __first2, _Brick __brick)
+{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
+ [__first1, __first2, __brick](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ { __brick(__i, __j - __i, __first2 + (__i - __first1)); });
+ return __first2 + __n;
+ });
+}
+
//------------------------------------------------------------------------
// walk3 (pseudo)
//
@@ -361,31 +379,35 @@ __brick_walk3(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _
return __unseq_backend::__simd_walk_3(__first1, __last1 - __first1, __first2, __first3, __f);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3,
- class _Function, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator3,
+ class _Function>
_ForwardIterator3
-__pattern_walk3(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
- _ForwardIterator3 __first3, _Function __f, _IsVector __is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_walk3(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator3 __first3, _Function __f) noexcept
{
- return __internal::__brick_walk3(__first1, __last1, __first2, __first3, __f, __is_vector);
+ return __internal::__brick_walk3(__first1, __last1, __first2, __first3, __f, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Function, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Function>
_RandomAccessIterator3
-__pattern_walk3(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator3 __first3, _Function __f, _IsVector __is_vector,
- /*parallel=*/std::true_type)
+__pattern_walk3(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator3 __first3,
+ _Function __f)
{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__f, __first1, __first2, __first3, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- __internal::__brick_walk3(__i, __j, __first2 + (__i - __first1), __first3 + (__i - __first1), __f,
- __is_vector);
- });
- return __first3 + (__last1 - __first1);
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__f, __first1, __first2, __first3](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
+ __internal::__brick_walk3(__i, __j, __first2 + (__i - __first1), __first3 + (__i - __first1), __f,
+ _IsVector{});
+ });
+ return __first3 + (__last1 - __first1);
+ });
}
//------------------------------------------------------------------------
@@ -411,34 +433,37 @@ __brick_equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _
return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).first == __last1;
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
- _ForwardIterator2 __last2, _BinaryPredicate __p, _IsVector __is_vector, /* is_parallel = */
- std::false_type) noexcept
+__pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __p) noexcept
{
- return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, __is_vector);
+ return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __p,
- _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_equal(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _BinaryPredicate __p)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__last1 - __first1 != __last2 - __first2)
return false;
- return __internal::__except_handler([&]() {
- return !__internal::__parallel_or(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__first1, __first2, __p, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
- __p, __is_vector);
- });
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ return !__internal::__parallel_or(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__first1, __first2, __p](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ {
+ return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1),
+ __first2 + (__j - __first1), __p, _IsVector{});
+ });
+ });
}
//------------------------------------------------------------------------
@@ -461,29 +486,30 @@ __brick_equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _
return __unseq_backend::__simd_first(__first1, __last1 - __first1, __first2, std::not_fn(__p)).first == __last1;
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
- _BinaryPredicate __p, _IsVector __is_vector, /* is_parallel = */ std::false_type) noexcept
+__pattern_equal(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _BinaryPredicate __p) noexcept
{
- return __internal::__brick_equal(__first1, __last1, __first2, __p, __is_vector);
+ return __internal::__brick_equal(__first1, __last1, __first2, __p, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
bool
-__pattern_equal(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _BinaryPredicate __p, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_equal(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _BinaryPredicate __p)
{
- return __internal::__except_handler([&]() {
- return !__internal::__parallel_or(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__first1, __first2, __p, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1), __p, __is_vector);
- });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return !__internal::__parallel_or(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__first1, __first2, __p](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ { return !__internal::__brick_equal(__i, __j, __first2 + (__i - __first1), __p, _IsVector{}); });
+ });
}
//------------------------------------------------------------------------
@@ -508,30 +534,31 @@ __brick_find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pr
[&__pred](_RandomAccessIterator __it, _SizeType __i) { return __pred(__it[__i]); });
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
_ForwardIterator
-__pattern_find_if(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
- _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_find_if(_Tag __tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _Predicate __pred) noexcept
{
- return __internal::__brick_find_if(__first, __last, __pred, __is_vector);
+ return __internal::__brick_find_if(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
_RandomAccessIterator
-__pattern_find_if(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Predicate __pred, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_find_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Predicate __pred)
{
- return __internal::__except_handler([&]() {
- return __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__pred, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- return __internal::__brick_find_if(__i, __j, __pred, __is_vector);
- },
- std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(),
- /*is_first=*/true);
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __internal::__parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
+ { return __internal::__brick_find_if(__i, __j, __pred, _IsVector{}); },
+ std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(),
+ /*is_first=*/true);
+ });
}
//------------------------------------------------------------------------
@@ -646,42 +673,43 @@ __brick_find_end(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
return __find_subrange(__first, __last, __last, __s_first, __s_last, __pred, false, std::true_type());
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_find_end(_ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
- _ForwardIterator2 __s_last, _BinaryPredicate __pred, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_find_end(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
+ _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_find_end(__first, __last, __s_first, __s_last, __pred, __is_vector);
+ return __internal::__brick_find_end(__first, __last, __s_first, __s_last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_find_end(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last, _BinaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::true_type) noexcept
+__pattern_find_end(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last,
+ _BinaryPredicate __pred) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__last - __first == __s_last - __s_first)
{
- const bool __res = __internal::__pattern_equal(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- __s_first, __pred, __is_vector, std::true_type());
+ const bool __res = __internal::__pattern_equal(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __s_first, __pred);
return __res ? __first : __last;
}
else
{
- return __internal::__except_handler([&]() {
- return __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__last, __s_first, __s_last, __pred, __is_vector](_RandomAccessIterator1 __i,
- _RandomAccessIterator1 __j) {
- return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, false,
- __is_vector);
- },
- std::greater<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(),
- /*is_first=*/false);
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __internal::__parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__last, __s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
+ return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, false,
+ _IsVector{});
+ },
+ std::greater<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(),
+ /*is_first=*/false);
+ });
}
}
@@ -704,31 +732,33 @@ __brick_find_first_of(_RandomAccessIterator1 __first, _RandomAccessIterator1 __l
return __unseq_backend::__simd_find_first_of(__first, __last, __s_first, __s_last, __pred);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_find_first_of(_ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
- _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_find_first_of(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
+ _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_find_first_of(__first, __last, __s_first, __s_last, __pred, __is_vector);
+ return __internal::__brick_find_first_of(__first, __last, __s_first, __s_last, __pred,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_find_first_of(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last, _BinaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::true_type) noexcept
+__pattern_find_first_of(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first,
+ _RandomAccessIterator2 __s_last, _BinaryPredicate __pred) noexcept
{
- return __internal::__except_handler([&]() {
- return __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__s_first, __s_last, __pred, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- return __internal::__brick_find_first_of(__i, __j, __s_first, __s_last, __pred, __is_vector);
- },
- std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(), /*is_first=*/true);
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __internal::__parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ { return __internal::__brick_find_first_of(__i, __j, __s_first, __s_last, __pred, _IsVector{}); },
+ std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(), /*is_first=*/true);
+ });
}
//------------------------------------------------------------------------
@@ -750,42 +780,43 @@ __brick_search(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _R
return __internal::__find_subrange(__first, __last, __last, __s_first, __s_last, __pred, true, std::true_type());
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
_ForwardIterator1
-__pattern_search(_ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
- _ForwardIterator2 __s_last, _BinaryPredicate __pred, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_search(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first, _ForwardIterator1 __last,
+ _ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_search(__first, __last, __s_first, __s_last, __pred, __is_vector);
+ return __internal::__brick_search(__first, __last, __s_first, __s_last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator1
-__pattern_search(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last, _BinaryPredicate __pred,
- _IsVector __is_vector,
- /*is_parallel=*/std::true_type) noexcept
+__pattern_search(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __s_first, _RandomAccessIterator2 __s_last,
+ _BinaryPredicate __pred) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__last - __first == __s_last - __s_first)
{
- const bool __res = __internal::__pattern_equal(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- __s_first, __pred, __is_vector, std::true_type());
+ const bool __res = __internal::__pattern_equal(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __s_first, __pred);
return __res ? __first : __last;
}
else
{
- return __internal::__except_handler([&]() {
- return __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__last, __s_first, __s_last, __pred, __is_vector](_RandomAccessIterator1 __i,
- _RandomAccessIterator1 __j) {
- return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, true,
- __is_vector);
- },
- std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(), /*is_first=*/true);
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __internal::__parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__last, __s_first, __s_last, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
+ return __internal::__find_subrange(__i, __j, __last, __s_first, __s_last, __pred, true,
+ _IsVector{});
+ },
+ std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(),
+ /*is_first=*/true);
+ });
}
}
@@ -808,41 +839,41 @@ __brick_search_n(_RandomAccessIterator __first, _RandomAccessIterator __last, _S
return __internal::__find_subrange(__first, __last, __last, __count, __value, __pred, std::true_type());
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
_ForwardIterator
-__pattern_search_n(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Size __count,
- const _Tp& __value, _BinaryPredicate __pred, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_search_n(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Size __count,
+ const _Tp& __value, _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_search_n(__first, __last, __count, __value, __pred, __is_vector);
+ return __internal::__brick_search_n(__first, __last, __count, __value, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp,
+ class _BinaryPredicate>
_RandomAccessIterator
-__pattern_search_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Size __count, const _Tp& __value, _BinaryPredicate __pred, _IsVector __is_vector,
- /*is_parallel=*/std::true_type) noexcept
+__pattern_search_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Size __count, const _Tp& __value, _BinaryPredicate __pred) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (static_cast<_Size>(__last - __first) == __count)
{
- const bool __result = !__internal::__pattern_any_of(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__value, &__pred](const _Tp& __val) { return !__pred(__val, __value); }, __is_vector,
- /*is_parallel*/ std::true_type());
+ const bool __result =
+ !__internal::__pattern_any_of(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__value, &__pred](const _Tp& __val) { return !__pred(__val, __value); });
return __result ? __first : __last;
}
else
{
- return __internal::__except_handler([&__exec, __first, __last, __count, &__value, __pred, __is_vector]() {
- return __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__last, __count, &__value, __pred, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- return __internal::__find_subrange(__i, __j, __last, __count, __value, __pred, __is_vector);
- },
- std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(), /*is_first=*/true);
- });
+ return __internal::__except_handler(
+ [&__exec, __first, __last, __count, &__value, __pred]()
+ {
+ return __internal::__parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__last, __count, &__value, __pred](_RandomAccessIterator __i, _RandomAccessIterator __j)
+ { return __internal::__find_subrange(__i, __j, __last, __count, __value, __pred, _IsVector{}); },
+ std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(),
+ /*is_first=*/true);
+ });
}
}
@@ -995,7 +1026,7 @@ __brick_calc_mask_1(_ForwardIterator __first, _ForwardIterator __last, bool* __r
auto __count_true = _DifferenceType(0);
auto __size = __last - __first;
- static_assert(__is_random_access_iterator<_ForwardIterator>::value,
+ static_assert(__are_random_access_iterators<_ForwardIterator>::value,
"Pattern-brick error. Should be a random access iterator.");
for (; __first != __last; ++__first, ++__mask)
@@ -1078,48 +1109,51 @@ __brick_partition_by_mask(_RandomAccessIterator1 __first, _RandomAccessIterator1
#endif
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
_OutputIterator
-__pattern_copy_if(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
- _UnaryPredicate __pred, _IsVector __is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_copy_if(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
+ _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_copy_if(__first, __last, __result, __pred, __is_vector);
+ return __internal::__brick_copy_if(__first, __last, __result, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _UnaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _UnaryPredicate>
_RandomAccessIterator2
-__pattern_copy_if(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __result, _UnaryPredicate __pred, _IsVector __is_vector,
- /*parallel=*/std::true_type)
+__pattern_copy_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _UnaryPredicate __pred)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType;
const _DifferenceType __n = __last - __first;
if (_DifferenceType(1) < __n)
{
__par_backend::__buffer<bool> __mask_buf(__n);
- return __internal::__except_handler([&__exec, __n, __first, __result, __is_vector, __pred, &__mask_buf]() {
- bool* __mask = __mask_buf.get();
- _DifferenceType __m{};
- __par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
- [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
- return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
- __mask + __i, __pred, __is_vector)
- .first;
- },
- std::plus<_DifferenceType>(), // Combine
- [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
- __internal::__brick_copy_by_mask(
- __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
- [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; }, __is_vector);
- },
- [&__m](_DifferenceType __total) { __m = __total; });
- return __result + __m;
- });
+ return __internal::__except_handler(
+ [&__exec, __n, __first, __result, __pred, &__mask_buf]()
+ {
+ bool* __mask = __mask_buf.get();
+ _DifferenceType __m{};
+ __par_backend::__parallel_strict_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
+ [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
+ return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
+ __mask + __i, __pred, _IsVector{})
+ .first;
+ },
+ std::plus<_DifferenceType>(), // Combine
+ [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
+ __internal::__brick_copy_by_mask(
+ __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
+ [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; }, _IsVector{});
+ },
+ [&__m](_DifferenceType __total) { __m = __total; });
+ return __result + __m;
+ });
}
// trivial sequence - use serial algorithm
- return __internal::__brick_copy_if(__first, __last, __result, __pred, __is_vector);
+ return __internal::__brick_copy_if(__first, __last, __result, __pred, _IsVector{});
}
//------------------------------------------------------------------------
@@ -1141,28 +1175,30 @@ __brick_count(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pr
return std::count_if(__first, __last, __pred);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
typename std::iterator_traits<_ForwardIterator>::
diff erence_type
-__pattern_count(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred,
- /* is_parallel */ std::false_type, _IsVector __is_vector) noexcept
+__pattern_count(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) noexcept
{
- return __internal::__brick_count(__first, __last, __pred, __is_vector);
+ return __internal::__brick_count(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate>
typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type
-__pattern_count(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Predicate __pred,
- /* is_parallel */ std::true_type, _IsVector __is_vector)
+__pattern_count(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Predicate __pred)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type _SizeType;
- return __internal::__except_handler([&]() {
- return __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, _SizeType(0),
- [__pred, __is_vector](_RandomAccessIterator __begin, _RandomAccessIterator __end, _SizeType __value)
- -> _SizeType { return __value + __internal::__brick_count(__begin, __end, __pred, __is_vector); },
- std::plus<_SizeType>());
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __par_backend::__parallel_reduce(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, _SizeType(0),
+ [__pred](_RandomAccessIterator __begin, _RandomAccessIterator __end, _SizeType __value) -> _SizeType
+ { return __value + __internal::__brick_count(__begin, __end, __pred, _IsVector{}); },
+ std::plus<_SizeType>());
+ });
}
//------------------------------------------------------------------------
@@ -1186,21 +1222,23 @@ __brick_unique(_RandomAccessIterator __first, _RandomAccessIterator __last, _Bin
return std::unique(__first, __last, __pred);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
_ForwardIterator
-__pattern_unique(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_unique(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_unique(__first, __last, __pred, __is_vector);
+ return __internal::__brick_unique(__first, __last, __pred, typename _Tag::__is_vector{});
}
// That function is shared between two algorithms - remove_if (__pattern_remove_if) and unique (pattern unique). But a mask calculation is
diff erent.
// So, a caller passes _CalcMask brick into remove_elements.
-template <class _ExecutionPolicy, class _ForwardIterator, class _CalcMask, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _ForwardIterator, class _CalcMask>
_ForwardIterator
-__remove_elements(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _CalcMask __calc_mask,
- _IsVector __is_vector)
+__remove_elements(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _ForwardIterator __first,
+ _ForwardIterator __last, _CalcMask __calc_mask)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_ForwardIterator>::
diff erence_type _DifferenceType;
typedef typename std::iterator_traits<_ForwardIterator>::value_type _Tp;
_DifferenceType __n = __last - __first;
@@ -1209,9 +1247,10 @@ __remove_elements(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardI
return __internal::__except_handler([&]() {
bool* __mask = __mask_buf.get();
_DifferenceType __min = __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), _DifferenceType(0), __n, __n,
- [__first, __mask, &__calc_mask, __is_vector](_DifferenceType __i, _DifferenceType __j,
- _DifferenceType __local_min) -> _DifferenceType {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), _DifferenceType(0), __n, __n,
+ [__first, __mask, &__calc_mask](_DifferenceType __i, _DifferenceType __j,
+ _DifferenceType __local_min) -> _DifferenceType
+ {
// Create mask
__calc_mask(__mask + __i, __mask + __j, __first + __i);
@@ -1221,17 +1260,16 @@ __remove_elements(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardI
return __local_min;
}
// find first iterator that should be removed
- bool* __result = __internal::__brick_find_if(__mask + __i, __mask + __j,
- [](bool __val) { return !__val; }, __is_vector);
+ bool* __result = __internal::__brick_find_if(
+ __mask + __i, __mask + __j, [](bool __val) { return !__val; }, _IsVector{});
if (__result - __mask == __j)
{
return __local_min;
}
return std::min(__local_min, _DifferenceType(__result - __mask));
},
- [](_DifferenceType __local_min1, _DifferenceType __local_min2) -> _DifferenceType {
- return std::min(__local_min1, __local_min2);
- });
+ [](_DifferenceType __local_min1, _DifferenceType __local_min2) -> _DifferenceType
+ { return std::min(__local_min1, __local_min2); });
// No elements to remove - exit
if (__min == __n)
@@ -1247,39 +1285,44 @@ __remove_elements(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardI
_DifferenceType __m{};
// 2. Elements that doesn't satisfy pred are moved to result
__par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
- [__mask, __is_vector](_DifferenceType __i, _DifferenceType __len) {
- return __internal::__brick_count(__mask + __i, __mask + __i + __len, [](bool __val) { return __val; },
- __is_vector);
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
+ [__mask](_DifferenceType __i, _DifferenceType __len)
+ {
+ return __internal::__brick_count(
+ __mask + __i, __mask + __i + __len, [](bool __val) { return __val; }, _IsVector{});
},
std::plus<_DifferenceType>(),
- [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) {
+ [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial)
+ {
__internal::__brick_copy_by_mask(
__first + __i, __first + __i + __len, __result + __initial, __mask + __i,
- [](_ForwardIterator __x, _Tp* __z) {
- __internal::__invoke_if_else(std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
- [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
+ [](_ForwardIterator __x, _Tp* __z)
+ {
+ __internal::__invoke_if_else(
+ std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
+ [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
},
- __is_vector);
+ _IsVector{});
},
[&__m](_DifferenceType __total) { __m = __total; });
// 3. Elements from result are moved to [first, last)
__par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
- [__result, __first, __is_vector](_Tp* __i, _Tp* __j) {
- __invoke_if_else(std::is_trivial<_Tp>(),
- [&]() { __brick_move(__i, __j, __first + (__i - __result), __is_vector); },
- [&]() { __brick_move_destroy()(__i, __j, __first + (__i - __result), __is_vector); });
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
+ [__result, __first](_Tp* __i, _Tp* __j)
+ {
+ __invoke_if_else(
+ std::is_trivial<_Tp>(), [&]() { __brick_move(__i, __j, __first + (__i - __result), _IsVector{}); },
+ [&]() { __brick_move_destroy()(__i, __j, __first + (__i - __result), _IsVector{}); });
});
return __first + __m;
});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
_RandomAccessIterator
-__pattern_unique(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _BinaryPredicate __pred, _IsVector __is_vector, /*is_parallel=*/std::true_type) noexcept
+__pattern_unique(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _BinaryPredicate __pred) noexcept
{
typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
@@ -1290,16 +1333,16 @@ __pattern_unique(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Rand
if (__first + 1 == __last || __first + 2 == __last)
{
// Trivial sequence - use serial algorithm
- return __internal::__brick_unique(__first, __last, __pred, __is_vector);
+ return __internal::__brick_unique(__first, __last, __pred, _IsVector{});
}
return __internal::__remove_elements(
- std::forward<_ExecutionPolicy>(__exec), ++__first, __last,
- [&__pred, __is_vector](bool* __b, bool* __e, _RandomAccessIterator __it) {
+ __tag, std::forward<_ExecutionPolicy>(__exec), ++__first, __last,
+ [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it)
+ {
__internal::__brick_walk3(
__b, __e, __it - 1, __it,
- [&__pred](bool& __x, _ReferenceType __y, _ReferenceType __z) { __x = !__pred(__y, __z); }, __is_vector);
- },
- __is_vector);
+ [&__pred](bool& __x, _ReferenceType __y, _ReferenceType __z) { __x = !__pred(__y, __z); }, _IsVector{});
+ });
}
//------------------------------------------------------------------------
@@ -1326,13 +1369,12 @@ __brick_unique_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __las
#endif
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryPredicate,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryPredicate>
_OutputIterator
-__pattern_unique_copy(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
- _BinaryPredicate __pred, _IsVector __is_vector, /*parallel=*/std::false_type) noexcept
+__pattern_unique_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _OutputIterator __result, _BinaryPredicate __pred) noexcept
{
- return __internal::__brick_unique_copy(__first, __last, __result, __pred, __is_vector);
+ return __internal::__brick_unique_copy(__first, __last, __result, __pred, typename _Tag::__is_vector{});
}
template <class _DifferenceType, class _RandomAccessIterator, class _BinaryPredicate>
@@ -1357,13 +1399,14 @@ __brick_calc_mask_2(_RandomAccessIterator __first, _RandomAccessIterator __last,
return __unseq_backend::__simd_calc_mask_2(__first, __last - __first, __mask, __pred);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryPredicate>
_RandomAccessIterator2
-__pattern_unique_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __result, _BinaryPredicate __pred, _IsVector __is_vector,
- /*parallel=*/std::true_type)
+__pattern_unique_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _BinaryPredicate __pred)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType;
const _DifferenceType __n = __last - __first;
if (_DifferenceType(2) < __n)
@@ -1371,40 +1414,43 @@ __pattern_unique_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
__par_backend::__buffer<bool> __mask_buf(__n);
if (_DifferenceType(2) < __n)
{
- return __internal::__except_handler([&__exec, __n, __first, __result, __pred, __is_vector, &__mask_buf]() {
- bool* __mask = __mask_buf.get();
- _DifferenceType __m{};
- __par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
- [=](_DifferenceType __i, _DifferenceType __len) -> _DifferenceType { // Reduce
- _DifferenceType __extra = 0;
- if (__i == 0)
- {
- // Special boundary case
- __mask[__i] = true;
- if (--__len == 0)
- return 1;
- ++__i;
- ++__extra;
- }
- return __internal::__brick_calc_mask_2<_DifferenceType>(__first + __i, __first + (__i + __len),
- __mask + __i, __pred, __is_vector) +
- __extra;
- },
- std::plus<_DifferenceType>(), // Combine
- [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
- // Phase 2 is same as for __pattern_copy_if
- __internal::__brick_copy_by_mask(
- __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
- [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; }, __is_vector);
- },
- [&__m](_DifferenceType __total) { __m = __total; });
- return __result + __m;
- });
+ return __internal::__except_handler(
+ [&__exec, __n, __first, __result, __pred, &__mask_buf]()
+ {
+ bool* __mask = __mask_buf.get();
+ _DifferenceType __m{};
+ __par_backend::__parallel_strict_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, _DifferenceType(0),
+ [=](_DifferenceType __i, _DifferenceType __len) -> _DifferenceType { // Reduce
+ _DifferenceType __extra = 0;
+ if (__i == 0)
+ {
+ // Special boundary case
+ __mask[__i] = true;
+ if (--__len == 0)
+ return 1;
+ ++__i;
+ ++__extra;
+ }
+ return __internal::__brick_calc_mask_2<_DifferenceType>(
+ __first + __i, __first + (__i + __len), __mask + __i, __pred, _IsVector{}) +
+ __extra;
+ },
+ std::plus<_DifferenceType>(), // Combine
+ [=](_DifferenceType __i, _DifferenceType __len, _DifferenceType __initial) { // Scan
+ // Phase 2 is same as for __pattern_copy_if
+ __internal::__brick_copy_by_mask(
+ __first + __i, __first + (__i + __len), __result + __initial, __mask + __i,
+ [](_RandomAccessIterator1 __x, _RandomAccessIterator2 __z) { *__z = *__x; },
+ _IsVector{});
+ },
+ [&__m](_DifferenceType __total) { __m = __total; });
+ return __result + __m;
+ });
}
}
// trivial sequence - use serial algorithm
- return __internal::__brick_unique_copy(__first, __last, __result, __pred, __is_vector);
+ return __internal::__brick_unique_copy(__first, __last, __result, __pred, _IsVector{});
}
//------------------------------------------------------------------------
@@ -1459,25 +1505,24 @@ __brick_reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, _Ra
});
}
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator>
void
-__pattern_reverse(_ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
- _IsVector _is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_reverse(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last) noexcept
{
- __internal::__brick_reverse(__first, __last, _is_vector);
+ __internal::__brick_reverse(__first, __last, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
void
-__pattern_reverse(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_reverse(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
__par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __first + (__last - __first) / 2,
- [__is_vector, __first, __last](_RandomAccessIterator __inner_first, _RandomAccessIterator __inner_last) {
- __internal::__brick_reverse(__inner_first, __inner_last, __last - (__inner_first - __first), __is_vector);
- });
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __first + (__last - __first) / 2,
+ [__first, __last](_RandomAccessIterator __inner_first, _RandomAccessIterator __inner_last)
+ { __internal::__brick_reverse(__inner_first, __inner_last, __last - (__inner_first - __first), _IsVector{}); });
}
//------------------------------------------------------------------------
@@ -1504,27 +1549,29 @@ __brick_reverse_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __la
__d_first, [](_ReferenceType1 __x, _ReferenceType2 __y) { __y = __x; });
}
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator>
_OutputIterator
-__pattern_reverse_copy(_ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
- _OutputIterator __d_first, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_reverse_copy(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
+ _OutputIterator __d_first) noexcept
{
- return __internal::__brick_reverse_copy(__first, __last, __d_first, __is_vector);
+ return __internal::__brick_reverse_copy(__first, __last, __d_first, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2>
_RandomAccessIterator2
-__pattern_reverse_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __d_first, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_reverse_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __d_first)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
auto __len = __last - __first;
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__is_vector, __first, __len, __d_first](_RandomAccessIterator1 __inner_first,
- _RandomAccessIterator1 __inner_last) {
- __internal::__brick_reverse_copy(__inner_first, __inner_last,
- __d_first + (__len - (__inner_last - __first)),
- __is_vector);
- });
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__first, __len, __d_first](_RandomAccessIterator1 __inner_first, _RandomAccessIterator1 __inner_last)
+ {
+ __internal::__brick_reverse_copy(__inner_first, __inner_last,
+ __d_first + (__len - (__inner_last - __first)), _IsVector{});
+ });
return __d_first + __len;
}
@@ -1585,72 +1632,73 @@ __brick_rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _R
return __ret;
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator>
_ForwardIterator
-__pattern_rotate(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
- _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_rotate(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle,
+ _ForwardIterator __last) noexcept
{
- return __internal::__brick_rotate(__first, __middle, __last, __is_vector);
+ return __internal::__brick_rotate(__first, __middle, __last, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator>
_RandomAccessIterator
-__pattern_rotate(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __middle,
- _RandomAccessIterator __last, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_rotate(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __middle, _RandomAccessIterator __last)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator>::value_type _Tp;
auto __n = __last - __first;
auto __m = __middle - __first;
if (__m <= __n / 2)
{
__par_backend::__buffer<_Tp> __buf(__n - __m);
- return __internal::__except_handler([&__exec, __n, __m, __first, __middle, __last, __is_vector, &__buf]() {
- _Tp* __result = __buf.get();
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __middle, __last,
- [__middle, __result, __is_vector](_RandomAccessIterator __b, _RandomAccessIterator __e) {
- __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __middle), __is_vector);
- });
+ return __internal::__except_handler(
+ [&__exec, __n, __m, __first, __middle, __last, &__buf]()
+ {
+ _Tp* __result = __buf.get();
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __middle, __last,
+ [__middle, __result](_RandomAccessIterator __b, _RandomAccessIterator __e)
+ { __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __middle), _IsVector{}); });
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle,
- [__last, __middle, __is_vector](_RandomAccessIterator __b, _RandomAccessIterator __e) {
- __internal::__brick_move(__b, __e, __b + (__last - __middle), __is_vector);
- });
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle,
+ [__last, __middle](_RandomAccessIterator __b, _RandomAccessIterator __e)
+ { __internal::__brick_move(__b, __e, __b + (__last - __middle), _IsVector{}); });
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __result, __result + (__n - __m),
- [__first, __result, __is_vector](_Tp* __b, _Tp* __e) {
- __brick_move_destroy()(__b, __e, __first + (__b - __result), __is_vector);
- });
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + (__n - __m),
+ [__first, __result](_Tp* __b, _Tp* __e)
+ { __brick_move_destroy()(__b, __e, __first + (__b - __result), _IsVector{}); });
- return __first + (__last - __middle);
- });
+ return __first + (__last - __middle);
+ });
}
else
{
__par_backend::__buffer<_Tp> __buf(__m);
- return __internal::__except_handler([&__exec, __n, __m, __first, __middle, __last, __is_vector, &__buf]() {
- _Tp* __result = __buf.get();
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle,
- [__first, __result, __is_vector](_RandomAccessIterator __b, _RandomAccessIterator __e) {
- __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __first), __is_vector);
- });
+ return __internal::__except_handler(
+ [&__exec, __n, __m, __first, __middle, __last, &__buf]()
+ {
+ _Tp* __result = __buf.get();
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle,
+ [__first, __result](_RandomAccessIterator __b, _RandomAccessIterator __e)
+ { __internal::__brick_uninitialized_move(__b, __e, __result + (__b - __first), _IsVector{}); });
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __middle, __last,
- [__first, __middle, __is_vector](_RandomAccessIterator __b, _RandomAccessIterator __e) {
- __internal::__brick_move(__b, __e, __first + (__b - __middle), __is_vector);
- });
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __middle, __last,
+ [__first, __middle](_RandomAccessIterator __b, _RandomAccessIterator __e)
+ { __internal::__brick_move(__b, __e, __first + (__b - __middle), _IsVector{}); });
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
- [__n, __m, __first, __result, __is_vector](_Tp* __b, _Tp* __e) {
- __brick_move_destroy()(
- __b, __e, __first + ((__n - __m) + (__b - __result)), __is_vector);
- });
+ __par_backend::__parallel_for(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __result, __result + __m,
+ [__n, __m, __first, __result](_Tp* __b, _Tp* __e)
+ { __brick_move_destroy()(__b, __e, __first + ((__n - __m) + (__b - __result)), _IsVector{}); });
- return __first + (__last - __middle);
- });
+ return __first + (__last - __middle);
+ });
}
}
@@ -1675,38 +1723,40 @@ __brick_rotate_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __mid
return __internal::__brick_copy(__first, __middle, __res, std::true_type());
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator>
_OutputIterator
-__pattern_rotate_copy(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last,
- _OutputIterator __result, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_rotate_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __middle,
+ _ForwardIterator __last, _OutputIterator __result) noexcept
{
- return __internal::__brick_rotate_copy(__first, __middle, __last, __result, __is_vector);
+ return __internal::__brick_rotate_copy(__first, __middle, __last, __result, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2>
_RandomAccessIterator2
-__pattern_rotate_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __middle,
- _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_rotate_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __middle, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
__par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__first, __last, __middle, __result, __is_vector](_RandomAccessIterator1 __b, _RandomAccessIterator1 __e) {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__first, __last, __middle, __result](_RandomAccessIterator1 __b, _RandomAccessIterator1 __e)
+ {
if (__b > __middle)
{
- __internal::__brick_copy(__b, __e, __result + (__b - __middle), __is_vector);
+ __internal::__brick_copy(__b, __e, __result + (__b - __middle), _IsVector{});
}
else
{
_RandomAccessIterator2 __new_result = __result + ((__last - __middle) + (__b - __first));
if (__e < __middle)
{
- __internal::__brick_copy(__b, __e, __new_result, __is_vector);
+ __internal::__brick_copy(__b, __e, __new_result, _IsVector{});
}
else
{
- __internal::__brick_copy(__b, __middle, __new_result, __is_vector);
- __internal::__brick_copy(__middle, __e, __result, __is_vector);
+ __internal::__brick_copy(__b, __middle, __new_result, _IsVector{});
+ __internal::__brick_copy(__middle, __e, __result, _IsVector{});
}
}
});
@@ -1752,18 +1802,18 @@ __brick_is_partitioned(_RandomAccessIterator __first, _RandomAccessIterator __la
}
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
bool
-__pattern_is_partitioned(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_is_partitioned(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_is_partitioned(__first, __last, __pred, __is_vector);
+ return __internal::__brick_is_partitioned(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
bool
-__pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _UnaryPredicate __pred, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_is_partitioned(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _UnaryPredicate __pred)
{
if (__first == __last)
{
@@ -1771,6 +1821,8 @@ __pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
}
else
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
return __internal::__except_handler([&]() {
// State of current range:
// broken - current range is not partitioned by pred
@@ -1794,9 +1846,10 @@ __pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
__broken, __broken, __true_false, __broken};
__init = __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
- [&__pred, &__table, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j,
- _ReduceType __value) -> _ReduceType {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
+ [&__pred, &__table](_RandomAccessIterator __i, _RandomAccessIterator __j,
+ _ReduceType __value) -> _ReduceType
+ {
if (__value == __broken)
{
return __broken;
@@ -1807,11 +1860,11 @@ __pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
{
// find first element that don't satisfy pred
_RandomAccessIterator __x =
- __internal::__brick_find_if(__i + 1, __j, std::not_fn(__pred), __is_vector);
+ __internal::__brick_find_if(__i + 1, __j, std::not_fn(__pred), _IsVector{});
if (__x != __j)
{
// find first element after "x" that satisfy pred
- _RandomAccessIterator __y = __internal::__brick_find_if(__x + 1, __j, __pred, __is_vector);
+ _RandomAccessIterator __y = __internal::__brick_find_if(__x + 1, __j, __pred, _IsVector{});
// if it was found then range isn't partitioned by pred
if (__y != __j)
{
@@ -1831,7 +1884,7 @@ __pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
{ // if first element doesn't satisfy pred
// then we should find the first element that satisfy pred.
// If we found it then range isn't partitioned by pred
- if (__internal::__brick_find_if(__i + 1, __j, __pred, __is_vector) != __j)
+ if (__internal::__brick_find_if(__i + 1, __j, __pred, _IsVector{}) != __j)
{
return __broken;
}
@@ -1844,7 +1897,8 @@ __pattern_is_partitioned(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
return (__value == -1) ? __res : __table[__value * 4 + __res];
},
- [&__table](_ReduceType __val1, _ReduceType __val2) -> _ReduceType {
+ [&__table](_ReduceType __val1, _ReduceType __val2) -> _ReduceType
+ {
if (__val1 == __broken || __val2 == __broken)
{
return __broken;
@@ -1878,19 +1932,20 @@ __brick_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _
return std::partition(__first, __last, __pred);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
_ForwardIterator
-__pattern_partition(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+__pattern_partition(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_partition(__first, __last, __pred, __is_vector);
+ return __internal::__brick_partition(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _UnaryPredicate __pred, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_partition(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _UnaryPredicate __pred)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
// partitioned range: elements before pivot satisfy pred (true part),
// elements after pivot don't satisfy pred (false part)
@@ -1905,7 +1960,8 @@ __pattern_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _R
_PartitionRange __init{__last, __last, __last};
// lambda for merging two partitioned ranges to one partitioned range
- auto __reductor = [&__exec, __is_vector](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange {
+ auto __reductor = [&__exec](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange
+ {
auto __size1 = __val1.__end - __val1.__pivot;
auto __size2 = __val2.__pivot - __val2.__begin;
auto __new_begin = __val2.__begin - (__val1.__end - __val1.__begin);
@@ -1920,10 +1976,10 @@ __pattern_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _R
else if (__size2 > __size1)
{
__par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size1,
- [__val1, __val2, __size1, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size1,
+ [__val1, __val2, __size1](_RandomAccessIterator __i, _RandomAccessIterator __j) {
__internal::__brick_swap_ranges(__i, __j, (__val2.__pivot - __size1) + (__i - __val1.__pivot),
- __is_vector);
+ _IsVector{});
});
return {__new_begin, __val2.__pivot - __size1, __val2.__end};
}
@@ -1931,20 +1987,21 @@ __pattern_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _R
else
{
__par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size2,
- [__val1, __val2, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- __internal::__brick_swap_ranges(__i, __j, __val2.__begin + (__i - __val1.__pivot), __is_vector);
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __val1.__pivot, __val1.__pivot + __size2,
+ [__val1, __val2](_RandomAccessIterator __i, _RandomAccessIterator __j) {
+ __internal::__brick_swap_ranges(__i, __j, __val2.__begin + (__i - __val1.__pivot), _IsVector{});
});
return {__new_begin, __val1.__pivot + __size2, __val2.__end};
}
};
_PartitionRange __result = __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
- [__pred, __is_vector, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
- _PartitionRange __value) -> _PartitionRange {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
+ [__pred, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
+ _PartitionRange __value) -> _PartitionRange
+ {
//1. serial partition
- _RandomAccessIterator __pivot = __internal::__brick_partition(__i, __j, __pred, __is_vector);
+ _RandomAccessIterator __pivot = __internal::__brick_partition(__i, __j, __pred, _IsVector{});
// 2. merging of two ranges (left and right respectively)
return __reductor(__value, {__i, __pivot, __j});
@@ -1975,21 +2032,21 @@ __brick_stable_partition(_RandomAccessIterator __first, _RandomAccessIterator __
return std::stable_partition(__first, __last, __pred);
}
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate>
_BidirectionalIterator
-__pattern_stable_partition(_ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
- _UnaryPredicate __pred, _IsVector __is_vector,
- /*is_parallelization=*/std::false_type) noexcept
+__pattern_stable_partition(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __last,
+ _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_stable_partition(__first, __last, __pred, __is_vector);
+ return __internal::__brick_stable_partition(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_stable_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _UnaryPredicate __pred, _IsVector __is_vector,
- /*is_parallelization=*/std::true_type) noexcept
+__pattern_stable_partition(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _UnaryPredicate __pred) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
// partitioned range: elements before pivot satisfy pred (true part),
// elements after pivot don't satisfy pred (false part)
struct _PartitionRange
@@ -2003,7 +2060,8 @@ __pattern_stable_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __fi
_PartitionRange __init{__last, __last, __last};
// lambda for merging two partitioned ranges to one partitioned range
- auto __reductor = [__is_vector](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange {
+ auto __reductor = [](_PartitionRange __val1, _PartitionRange __val2) -> _PartitionRange
+ {
auto __size1 = __val1.__end - __val1.__pivot;
auto __new_begin = __val2.__begin - (__val1.__end - __val1.__begin);
@@ -2016,17 +2074,18 @@ __pattern_stable_partition(_ExecutionPolicy&& __exec, _RandomAccessIterator __fi
// then we should swap the false part of left range and last part of true part of right range
else
{
- __internal::__brick_rotate(__val1.__pivot, __val2.__begin, __val2.__pivot, __is_vector);
+ __internal::__brick_rotate(__val1.__pivot, __val2.__begin, __val2.__pivot, _IsVector{});
return {__new_begin, __val2.__pivot - __size1, __val2.__end};
}
};
_PartitionRange __result = __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
- [&__pred, __is_vector, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
- _PartitionRange __value) -> _PartitionRange {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __init,
+ [&__pred, __reductor](_RandomAccessIterator __i, _RandomAccessIterator __j,
+ _PartitionRange __value) -> _PartitionRange
+ {
//1. serial stable_partition
- _RandomAccessIterator __pivot = __internal::__brick_stable_partition(__i, __j, __pred, __is_vector);
+ _RandomAccessIterator __pivot = __internal::__brick_stable_partition(__i, __j, __pred, _IsVector{});
// 2. merging of two ranges (left and right respectively)
return __reductor(__value, {__i, __pivot, __j});
@@ -2062,159 +2121,176 @@ __brick_partition_copy(_RandomAccessIterator1 __first, _RandomAccessIterator1 __
#endif
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
- class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
+ class _UnaryPredicate>
std::pair<_OutputIterator1, _OutputIterator2>
-__pattern_partition_copy(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
- _OutputIterator1 __out_true, _OutputIterator2 __out_false, _UnaryPredicate __pred,
- _IsVector __is_vector, /*is_parallelization=*/std::false_type) noexcept
+__pattern_partition_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _OutputIterator1 __out_true, _OutputIterator2 __out_false, _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred, __is_vector);
+ return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _UnaryPredicate>
std::pair<_RandomAccessIterator2, _RandomAccessIterator3>
-__pattern_partition_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __out_true, _RandomAccessIterator3 __out_false, _UnaryPredicate __pred,
- _IsVector __is_vector, /*is_parallelization=*/std::true_type)
+__pattern_partition_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __out_true,
+ _RandomAccessIterator3 __out_false, _UnaryPredicate __pred)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType;
typedef std::pair<_DifferenceType, _DifferenceType> _ReturnType;
const _DifferenceType __n = __last - __first;
if (_DifferenceType(1) < __n)
{
__par_backend::__buffer<bool> __mask_buf(__n);
- return __internal::__except_handler([&__exec, __n, __first, __out_true, __out_false, __is_vector, __pred,
- &__mask_buf]() {
- bool* __mask = __mask_buf.get();
- _ReturnType __m{};
- __par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n, std::make_pair(_DifferenceType(0), _DifferenceType(0)),
- [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
- return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
- __mask + __i, __pred, __is_vector);
- },
- [](const _ReturnType& __x, const _ReturnType& __y) -> _ReturnType {
- return std::make_pair(__x.first + __y.first, __x.second + __y.second);
- }, // Combine
- [=](_DifferenceType __i, _DifferenceType __len, _ReturnType __initial) { // Scan
- __internal::__brick_partition_by_mask(__first + __i, __first + (__i + __len),
- __out_true + __initial.first, __out_false + __initial.second,
- __mask + __i, __is_vector);
- },
- [&__m](_ReturnType __total) { __m = __total; });
- return std::make_pair(__out_true + __m.first, __out_false + __m.second);
- });
+ return __internal::__except_handler(
+ [&__exec, __n, __first, __out_true, __out_false, __pred, &__mask_buf]()
+ {
+ bool* __mask = __mask_buf.get();
+ _ReturnType __m{};
+ __par_backend::__parallel_strict_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n,
+ std::make_pair(_DifferenceType(0), _DifferenceType(0)),
+ [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
+ return __internal::__brick_calc_mask_1<_DifferenceType>(__first + __i, __first + (__i + __len),
+ __mask + __i, __pred, _IsVector{});
+ },
+ [](const _ReturnType& __x, const _ReturnType& __y) -> _ReturnType
+ { return std::make_pair(__x.first + __y.first, __x.second + __y.second); }, // Combine
+ [=](_DifferenceType __i, _DifferenceType __len, _ReturnType __initial) { // Scan
+ __internal::__brick_partition_by_mask(
+ __first + __i, __first + (__i + __len), __out_true + __initial.first,
+ __out_false + __initial.second, __mask + __i, _IsVector{});
+ },
+ [&__m](_ReturnType __total) { __m = __total; });
+ return std::make_pair(__out_true + __m.first, __out_false + __m.second);
+ });
}
// trivial sequence - use serial algorithm
- return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred, __is_vector);
+ return __internal::__brick_partition_copy(__first, __last, __out_true, __out_false, __pred, _IsVector{});
}
//------------------------------------------------------------------------
// sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector,
- class _IsMoveConstructible>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsMoveConstructible>
void
-__pattern_sort(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
- _IsVector /*is_vector*/, /*is_parallel=*/std::false_type, _IsMoveConstructible) noexcept
+__pattern_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
+ _IsMoveConstructible) noexcept
{
std::sort(__first, __last, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
- _IsVector /*is_vector*/, /*is_parallel=*/std::true_type, /*is_move_constructible=*/std::true_type)
+__pattern_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp, /*is_move_constructible=*/std::true_type)
{
- __internal::__except_handler([&]() {
- __par_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- [](_RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp) { std::sort(__first, __last, __comp); });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_stable_sort(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
+ [](_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
+ { std::sort(__first, __last, __comp); });
+ });
}
//------------------------------------------------------------------------
// stable_sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
- _IsVector /*is_vector*/, /*is_parallel=*/std::false_type) noexcept
+__pattern_stable_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
+ _Compare __comp) noexcept
{
std::stable_sort(__first, __last, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_stable_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp, _IsVector /*is_vector*/, /*is_parallel=*/std::true_type)
+__pattern_stable_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp)
{
- __internal::__except_handler([&]() {
- __par_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- [](_RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp) { std::stable_sort(__first, __last, __comp); });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_stable_sort(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
+ [](_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
+ { std::stable_sort(__first, __last, __comp); });
+ });
}
//------------------------------------------------------------------------
// partial_sort
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_partial_sort(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __middle,
- _RandomAccessIterator __last, _Compare __comp, _IsVector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_partial_sort(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __middle,
+ _RandomAccessIterator __last, _Compare __comp) noexcept
{
std::partial_sort(__first, __middle, __last, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __middle,
- _RandomAccessIterator __last, _Compare __comp, _IsVector, /*is_parallel=*/std::true_type)
+__pattern_partial_sort(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
const auto __n = __middle - __first;
if (__n == 0)
return;
- __internal::__except_handler([&]() {
- __par_backend::__parallel_stable_sort(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- [__n](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Compare __comp) {
- if (__n < __end - __begin)
- std::partial_sort(__begin, __begin + __n, __end, __comp);
- else
- std::sort(__begin, __end, __comp);
- },
- __n);
- });
+ __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_stable_sort(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
+ [__n](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Compare __comp)
+ {
+ if (__n < __end - __begin)
+ std::partial_sort(__begin, __begin + __n, __end, __comp);
+ else
+ std::sort(__begin, __end, __comp);
+ },
+ __n);
+ });
}
//------------------------------------------------------------------------
// partial_sort_copy
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare>
_RandomAccessIterator
-__pattern_partial_sort_copy(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
- _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp, _IsVector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_partial_sort_copy(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp) noexcept
{
return std::partial_sort_copy(__first, __last, __d_first, __d_last, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
_RandomAccessIterator2
-__pattern_partial_sort_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __d_first, _RandomAccessIterator2 __d_last, _Compare __comp,
- _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_partial_sort_copy(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first,
+ _RandomAccessIterator1 __last, _RandomAccessIterator2 __d_first,
+ _RandomAccessIterator2 __d_last, _Compare __comp)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__last == __first || __d_last == __d_first)
{
return __d_first;
@@ -2225,15 +2301,15 @@ __pattern_partial_sort_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __
if (__n2 >= __n1)
{
__par_backend::__parallel_stable_sort(
- std::forward<_ExecutionPolicy>(__exec), __d_first, __d_first + __n1, __comp,
- [__first, __d_first, __is_vector](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j,
- _Compare __comp) {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __d_first, __d_first + __n1, __comp,
+ [__first, __d_first](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j, _Compare __comp)
+ {
_RandomAccessIterator1 __i1 = __first + (__i - __d_first);
_RandomAccessIterator1 __j1 = __first + (__j - __d_first);
// 1. Copy elements from input to output
#if !defined(_PSTL_ICC_18_OMP_SIMD_BROKEN)
- __internal::__brick_copy(__i1, __j1, __i, __is_vector);
+ __internal::__brick_copy(__i1, __j1, __i, _IsVector{});
#else
std::copy(__i1, __j1, __i);
#endif
@@ -2250,32 +2326,33 @@ __pattern_partial_sort_copy(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __
__par_backend::__buffer<_T1> __buf(__n1);
_T1* __r = __buf.get();
- __par_backend::__parallel_stable_sort(std::forward<_ExecutionPolicy>(__exec), __r, __r + __n1, __comp,
- [__n2, __first, __r](_T1* __i, _T1* __j, _Compare __comp) {
- _RandomAccessIterator1 __it = __first + (__i - __r);
+ __par_backend::__parallel_stable_sort(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n1, __comp,
+ [__n2, __first, __r](_T1* __i, _T1* __j, _Compare __comp)
+ {
+ _RandomAccessIterator1 __it = __first + (__i - __r);
- // 1. Copy elements from input to raw memory
- for (_T1* __k = __i; __k != __j; ++__k, ++__it)
- {
- ::new (__k) _T2(*__it);
- }
+ // 1. Copy elements from input to raw memory
+ for (_T1* __k = __i; __k != __j; ++__k, ++__it)
+ {
+ ::new (__k) _T2(*__it);
+ }
- // 2. Sort elements in temporary __buffer
- if (__n2 < __j - __i)
- std::partial_sort(__i, __i + __n2, __j, __comp);
- else
- std::sort(__i, __j, __comp);
- },
- __n2);
+ // 2. Sort elements in temporary __buffer
+ if (__n2 < __j - __i)
+ std::partial_sort(__i, __i + __n2, __j, __comp);
+ else
+ std::sort(__i, __j, __comp);
+ },
+ __n2);
// 3. Move elements from temporary __buffer to output
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __r, __r + __n2,
- [__r, __d_first, __is_vector](_T1* __i, _T1* __j) {
- __brick_move_destroy()(__i, __j, __d_first + (__i - __r), __is_vector);
- });
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __r + __n2, __r + __n1,
- [__is_vector](_T1* __i, _T1* __j) { __brick_destroy(__i, __j, __is_vector); });
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n2,
+ [__r, __d_first](_T1* __i, _T1* __j)
+ { __brick_move_destroy()(__i, __j, __d_first + (__i - __r), _IsVector{}); });
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r + __n2,
+ __r + __n1,
+ [](_T1* __i, _T1* __j) { __brick_destroy(__i, __j, _IsVector{}); });
return __d_first + __n2;
}
@@ -2301,78 +2378,79 @@ __brick_adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _Binary
return std::adjacent_find(__first, __last, __pred);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
_ForwardIterator
-__pattern_adjacent_find(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred,
- /* is_parallel */ std::false_type, _IsVector __is_vector, bool __or_semantic) noexcept
+__pattern_adjacent_find(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _BinaryPredicate __pred, bool __or_semantic) noexcept
{
- return __internal::__brick_adjacent_find(__first, __last, __pred, __is_vector, __or_semantic);
+ return __internal::__brick_adjacent_find(__first, __last, __pred, typename _Tag::__is_vector{}, __or_semantic);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate>
_RandomAccessIterator
-__pattern_adjacent_find(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _BinaryPredicate __pred, /* is_parallel */ std::true_type, _IsVector __is_vector,
- bool __or_semantic)
+__pattern_adjacent_find(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _BinaryPredicate __pred, bool __or_semantic)
{
if (__last - __first < 2)
return __last;
- return __internal::__except_handler([&]() {
- return __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __last,
- [__last, __pred, __is_vector, __or_semantic](_RandomAccessIterator __begin, _RandomAccessIterator __end,
- _RandomAccessIterator __value) -> _RandomAccessIterator {
- // TODO: investigate performance benefits from the use of shared variable for the result,
- // checking (compare_and_swap idiom) its __value at __first.
- if (__or_semantic && __value < __last)
- { //found
- __par_backend::__cancel_execution();
- return __value;
- }
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
- if (__value > __begin)
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __par_backend::__parallel_reduce(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last, __last,
+ [__last, __pred, __or_semantic](_RandomAccessIterator __begin, _RandomAccessIterator __end,
+ _RandomAccessIterator __value) -> _RandomAccessIterator
{
- // modify __end to check the predicate on the boundary __values;
- // TODO: to use a custom range with boundaries overlapping
- // TODO: investigate what if we remove "if" below and run algorithm on range [__first, __last-1)
- // then check the pair [__last-1, __last)
- if (__end != __last)
- ++__end;
-
- //correct the global result iterator if the "brick" returns a local "__last"
- const _RandomAccessIterator __res =
- __internal::__brick_adjacent_find(__begin, __end, __pred, __is_vector, __or_semantic);
- if (__res < __end)
- __value = __res;
- }
- return __value;
- },
- [](_RandomAccessIterator __x, _RandomAccessIterator __y) -> _RandomAccessIterator {
- return __x < __y ? __x : __y;
- } //reduce a __value
- );
- });
+ // TODO: investigate performance benefits from the use of shared variable for the result,
+ // checking (compare_and_swap idiom) its __value at __first.
+ if (__or_semantic && __value < __last)
+ { //found
+ __par_backend::__cancel_execution();
+ return __value;
+ }
+
+ if (__value > __begin)
+ {
+ // modify __end to check the predicate on the boundary __values;
+ // TODO: to use a custom range with boundaries overlapping
+ // TODO: investigate what if we remove "if" below and run algorithm on range [__first, __last-1)
+ // then check the pair [__last-1, __last)
+ if (__end != __last)
+ ++__end;
+
+ //correct the global result iterator if the "brick" returns a local "__last"
+ const _RandomAccessIterator __res =
+ __internal::__brick_adjacent_find(__begin, __end, __pred, _IsVector{}, __or_semantic);
+ if (__res < __end)
+ __value = __res;
+ }
+ return __value;
+ },
+ [](_RandomAccessIterator __x, _RandomAccessIterator __y) -> _RandomAccessIterator
+ { return __x < __y ? __x : __y; } //reduce a __value
+ );
+ });
}
//------------------------------------------------------------------------
// nth_element
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_nth_element(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __nth,
- _RandomAccessIterator __last, _Compare __comp, _IsVector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_nth_element(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __nth,
+ _RandomAccessIterator __last, _Compare __comp) noexcept
{
std::nth_element(__first, __nth, __last, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_nth_element(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __nth,
- _RandomAccessIterator __last, _Compare __comp, _IsVector __is_vector,
- /*is_parallel=*/std::true_type) noexcept
+__pattern_nth_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) noexcept
{
if (__first == __last || __nth == __last)
{
@@ -2384,10 +2462,8 @@ __pattern_nth_element(_ExecutionPolicy&& __exec, _RandomAccessIterator __first,
_RandomAccessIterator __x;
do
{
- __x = __internal::__pattern_partition(std::forward<_ExecutionPolicy>(__exec), __first + 1, __last,
- [&__comp, __first](const _Tp& __x) { return __comp(__x, *__first); },
- __is_vector,
- /*is_parallel=*/std::true_type());
+ __x = __internal::__pattern_partition(__tag, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last,
+ [&__comp, __first](const _Tp& __x) { return __comp(__x, *__first); });
--__x;
if (__x != __first)
{
@@ -2434,28 +2510,28 @@ __brick_fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val
std::fill(__first, __last, __value);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Tp>
void
-__pattern_fill(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value,
- /*is_parallel=*/std::false_type, _IsVector __is_vector) noexcept
+__pattern_fill(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) noexcept
{
- __internal::__brick_fill(__first, __last, __value, __is_vector);
+ __internal::__brick_fill(__first, __last, __value, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Tp>
_RandomAccessIterator
-__pattern_fill(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- const _Tp& __value,
- /*is_parallel=*/std::true_type, _IsVector __is_vector)
+__pattern_fill(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, const _Tp& __value)
{
- return __internal::__except_handler([&__exec, __first, __last, &__value, __is_vector]() {
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__value, __is_vector](_RandomAccessIterator __begin, _RandomAccessIterator __end) {
- __internal::__brick_fill(__begin, __end, __value, __is_vector);
- });
- return __last;
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&__exec, __first, __last, &__value]()
+ {
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__value](_RandomAccessIterator __begin, _RandomAccessIterator __end)
+ { __internal::__brick_fill(__begin, __end, __value, _IsVector{}); });
+ return __last;
+ });
}
template <class _RandomAccessIterator, class _Size, class _Tp>
@@ -2473,21 +2549,20 @@ __brick_fill_n(_OutputIterator __first, _Size __count, const _Tp& __value, /* __
return std::fill_n(__first, __count, __value);
}
-template <class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp>
_OutputIterator
-__pattern_fill_n(_ExecutionPolicy&&, _OutputIterator __first, _Size __count, const _Tp& __value,
- /*is_parallel=*/std::false_type, _IsVector __is_vector) noexcept
+__pattern_fill_n(_Tag, _ExecutionPolicy&&, _OutputIterator __first, _Size __count, const _Tp& __value) noexcept
{
- return __internal::__brick_fill_n(__first, __count, __value, __is_vector);
+ return __internal::__brick_fill_n(__first, __count, __value, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp>
_RandomAccessIterator
-__pattern_fill_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __count, const _Tp& __value,
- /*is_parallel=*/std::true_type, _IsVector __is_vector)
+__pattern_fill_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _Size __count, const _Tp& __value)
{
- return __internal::__pattern_fill(std::forward<_ExecutionPolicy>(__exec), __first, __first + __count, __value,
- std::true_type(), __is_vector);
+ return __internal::__pattern_fill(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __count,
+ __value);
}
//------------------------------------------------------------------------
@@ -2509,27 +2584,28 @@ __brick_generate(_ForwardIterator __first, _ForwardIterator __last, _Generator _
std::generate(__first, __last, __g);
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Generator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Generator>
void
-__pattern_generate(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Generator __g,
- /*is_parallel=*/std::false_type, _IsVector __is_vector) noexcept
+__pattern_generate(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Generator __g) noexcept
{
- __internal::__brick_generate(__first, __last, __g, __is_vector);
+ __internal::__brick_generate(__first, __last, __g, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Generator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Generator>
_RandomAccessIterator
-__pattern_generate(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Generator __g,
- /*is_parallel=*/std::true_type, _IsVector __is_vector)
+__pattern_generate(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Generator __g)
{
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__g, __is_vector](_RandomAccessIterator __begin, _RandomAccessIterator __end) {
- __internal::__brick_generate(__begin, __end, __g, __is_vector);
- });
- return __last;
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__g](_RandomAccessIterator __begin, _RandomAccessIterator __end)
+ { __internal::__brick_generate(__begin, __end, __g, _IsVector{}); });
+ return __last;
+ });
}
template <class _RandomAccessIterator, class Size, class _Generator>
@@ -2547,23 +2623,22 @@ __brick_generate_n(OutputIterator __first, Size __count, _Generator __g, /* is_v
return std::generate_n(__first, __count, __g);
}
-template <class _ExecutionPolicy, class _OutputIterator, class _Size, class _Generator, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _OutputIterator, class _Size, class _Generator>
_OutputIterator
-__pattern_generate_n(_ExecutionPolicy&&, _OutputIterator __first, _Size __count, _Generator __g,
- /*is_parallel=*/std::false_type, _IsVector __is_vector) noexcept
+__pattern_generate_n(_Tag, _ExecutionPolicy&&, _OutputIterator __first, _Size __count, _Generator __g) noexcept
{
- return __internal::__brick_generate_n(__first, __count, __g, __is_vector);
+ return __internal::__brick_generate_n(__first, __count, __g, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Generator, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Generator>
_RandomAccessIterator
-__pattern_generate_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __count, _Generator __g,
- /*is_parallel=*/std::true_type, _IsVector __is_vector)
+__pattern_generate_n(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _Size __count, _Generator __g)
{
- static_assert(__is_random_access_iterator<_RandomAccessIterator>::value,
+ static_assert(__are_random_access_iterators<_RandomAccessIterator>::value,
"Pattern-brick error. Should be a random access iterator.");
- return __internal::__pattern_generate(std::forward<_ExecutionPolicy>(__exec), __first, __first + __count, __g,
- std::true_type(), __is_vector);
+ return __internal::__pattern_generate(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __first + __count,
+ __g);
}
//------------------------------------------------------------------------
@@ -2590,34 +2665,34 @@ __brick_remove_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _
#endif
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
_ForwardIterator
-__pattern_remove_if(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred,
- _IsVector __is_vector, /*is_parallel*/ std::false_type) noexcept
+__pattern_remove_if(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _UnaryPredicate __pred) noexcept
{
- return __internal::__brick_remove_if(__first, __last, __pred, __is_vector);
+ return __internal::__brick_remove_if(__first, __last, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate>
_RandomAccessIterator
-__pattern_remove_if(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _UnaryPredicate __pred, _IsVector __is_vector, /*is_parallel*/ std::true_type) noexcept
+__pattern_remove_if(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _UnaryPredicate __pred) noexcept
{
typedef typename std::iterator_traits<_RandomAccessIterator>::reference _ReferenceType;
if (__first == __last || __first + 1 == __last)
{
// Trivial sequence - use serial algorithm
- return __internal::__brick_remove_if(__first, __last, __pred, __is_vector);
+ return __internal::__brick_remove_if(__first, __last, __pred, _IsVector{});
}
return __internal::__remove_elements(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__pred, __is_vector](bool* __b, bool* __e, _RandomAccessIterator __it) {
- __internal::__brick_walk2(__b, __e, __it, [&__pred](bool& __x, _ReferenceType __y) { __x = !__pred(__y); },
- __is_vector);
- },
- __is_vector);
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__pred](bool* __b, bool* __e, _RandomAccessIterator __it)
+ {
+ __internal::__brick_walk2(
+ __b, __e, __it, [&__pred](bool& __x, _ReferenceType __y) { __x = !__pred(__y); }, _IsVector{});
+ });
}
//------------------------------------------------------------------------
@@ -2643,29 +2718,32 @@ __brick_merge(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _
return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_merge(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
- _ForwardIterator2 __last2, _OutputIterator __d_first, _Compare __comp, _IsVector __is_vector,
- /* is_parallel = */ std::false_type) noexcept
+__pattern_merge(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __d_first,
+ _Compare __comp) noexcept
{
- return __internal::__brick_merge(__first1, __last1, __first2, __last2, __d_first, __comp, __is_vector);
+ return __internal::__brick_merge(__first1, __last1, __first2, __last2, __d_first, __comp,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Compare>
_RandomAccessIterator3
-__pattern_merge(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __d_first,
- _Compare __comp, _IsVector __is_vector, /* is_parallel = */ std::true_type)
+__pattern_merge(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _RandomAccessIterator3 __d_first, _Compare __comp)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
__par_backend::__parallel_merge(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first, __comp,
- [__is_vector](_RandomAccessIterator1 __f1, _RandomAccessIterator1 __l1, _RandomAccessIterator2 __f2,
- _RandomAccessIterator2 __l2, _RandomAccessIterator3 __f3, _Compare __comp) {
- return __internal::__brick_merge(__f1, __l1, __f2, __l2, __f3, __comp, __is_vector);
- });
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first,
+ __comp,
+ [](_RandomAccessIterator1 __f1, _RandomAccessIterator1 __l1, _RandomAccessIterator2 __f2,
+ _RandomAccessIterator2 __l2, _RandomAccessIterator3 __f3, _Compare __comp)
+ { return __internal::__brick_merge(__f1, __l1, __f2, __l2, __f3, __comp, _IsVector{}); });
return __d_first + (__last1 - __first1) + (__last2 - __first2);
}
@@ -2689,21 +2767,21 @@ __brick_inplace_merge(_RandomAccessIterator __first, _RandomAccessIterator __mid
std::inplace_merge(__first, __middle, __last, __comp);
}
-template <class _ExecutionPolicy, class _BidirectionalIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _BidirectionalIterator, class _Compare>
void
-__pattern_inplace_merge(_ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __middle,
- _BidirectionalIterator __last, _Compare __comp, _IsVector __is_vector,
- /* is_parallel = */ std::false_type) noexcept
+__pattern_inplace_merge(_Tag, _ExecutionPolicy&&, _BidirectionalIterator __first, _BidirectionalIterator __middle,
+ _BidirectionalIterator __last, _Compare __comp) noexcept
{
- __internal::__brick_inplace_merge(__first, __middle, __last, __comp, __is_vector);
+ __internal::__brick_inplace_merge(__first, __middle, __last, __comp, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
void
-__pattern_inplace_merge(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __middle,
- _RandomAccessIterator __last, _Compare __comp, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_inplace_merge(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__first == __last || __first == __middle || __middle == __last)
{
return;
@@ -2712,52 +2790,57 @@ __pattern_inplace_merge(_ExecutionPolicy&& __exec, _RandomAccessIterator __first
auto __n = __last - __first;
__par_backend::__buffer<_Tp> __buf(__n);
_Tp* __r = __buf.get();
- __internal::__except_handler([&]() {
- auto __move_values = [](_RandomAccessIterator __x, _Tp* __z) {
- __internal::__invoke_if_else(std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
- [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
- };
+ __internal::__except_handler(
+ [&]()
+ {
+ auto __move_values = [](_RandomAccessIterator __x, _Tp* __z)
+ {
+ __internal::__invoke_if_else(
+ std::is_trivial<_Tp>(), [&]() { *__z = std::move(*__x); },
+ [&]() { ::new (std::addressof(*__z)) _Tp(std::move(*__x)); });
+ };
- auto __move_sequences = [](_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Tp* __first2) {
- return __internal::__brick_uninitialized_move(__first1, __last1, __first2, _IsVector());
- };
+ auto __move_sequences = [](_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Tp* __first2)
+ { return __internal::__brick_uninitialized_move(__first1, __last1, __first2, _IsVector()); };
- __par_backend::__parallel_merge(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle, __middle, __last, __r, __comp,
- [__n, __move_values, __move_sequences](_RandomAccessIterator __f1, _RandomAccessIterator __l1,
- _RandomAccessIterator __f2, _RandomAccessIterator __l2, _Tp* __f3,
- _Compare __comp) {
- (__utils::__serial_move_merge(__n))(__f1, __l1, __f2, __l2, __f3, __comp, __move_values, __move_values,
- __move_sequences, __move_sequences);
- return __f3 + (__l1 - __f1) + (__l2 - __f2);
- });
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __r, __r + __n,
- [__r, __first, __is_vector](_Tp* __i, _Tp* __j) {
- __brick_move_destroy()(__i, __j, __first + (__i - __r), __is_vector);
- });
- });
+ __par_backend::__parallel_merge(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __middle, __middle, __last, __r,
+ __comp,
+ [__n, __move_values, __move_sequences](_RandomAccessIterator __f1, _RandomAccessIterator __l1,
+ _RandomAccessIterator __f2, _RandomAccessIterator __l2,
+ _Tp* __f3, _Compare __comp)
+ {
+ (__utils::__serial_move_merge(__n))(__f1, __l1, __f2, __l2, __f3, __comp, __move_values,
+ __move_values, __move_sequences, __move_sequences);
+ return __f3 + (__l1 - __f1) + (__l2 - __f2);
+ });
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __r, __r + __n,
+ [__r, __first](_Tp* __i, _Tp* __j)
+ { __brick_move_destroy()(__i, __j, __first + (__i - __r), _IsVector{}); });
+ });
}
//------------------------------------------------------------------------
// includes
//------------------------------------------------------------------------
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
bool
-__pattern_includes(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp, _IsVector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_includes(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp) noexcept
{
return std::includes(__first1, __last1, __first2, __last2, __comp);
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
bool
-__pattern_includes(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _Compare __comp, _IsVector,
- /*is_parallel=*/std::true_type)
+__pattern_includes(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _Compare __comp)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__first2 >= __last2)
return true;
@@ -2771,51 +2854,55 @@ __pattern_includes(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _
if (__last2 - __first2 == 1)
return !__comp(*__first1, *__first2) && !__comp(*__first2, *__first1);
- return __internal::__except_handler([&]() {
- return !__internal::__parallel_or(
- std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
- [__first1, __last1, __first2, __last2, &__comp](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j) {
- _PSTL_ASSERT(__j > __i);
- //_PSTL_ASSERT(__j - __i > 1);
-
- //1. moving boundaries to "consume" subsequence of equal elements
- auto __is_equal = [&__comp](_RandomAccessIterator2 __a, _RandomAccessIterator2 __b) -> bool {
- return !__comp(*__a, *__b) && !__comp(*__b, *__a);
- };
-
- //1.1 left bound, case "aaa[aaaxyz...]" - searching "x"
- if (__i > __first2 && __is_equal(__i, __i - 1))
+ return __internal::__except_handler(
+ [&]()
+ {
+ return !__internal::__parallel_or(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
+ [__first1, __last1, __first2, __last2, &__comp](_RandomAccessIterator2 __i, _RandomAccessIterator2 __j)
{
- //whole subrange continues to content equal elements - return "no op"
- if (__is_equal(__i, __j - 1))
- return false;
+ _PSTL_ASSERT(__j > __i);
+ //_PSTL_ASSERT(__j - __i > 1);
- __i = std::upper_bound(__i, __last2, *__i, __comp);
- }
+ //1. moving boundaries to "consume" subsequence of equal elements
+ auto __is_equal = [&__comp](_RandomAccessIterator2 __a, _RandomAccessIterator2 __b) -> bool
+ { return !__comp(*__a, *__b) && !__comp(*__b, *__a); };
+
+ //1.1 left bound, case "aaa[aaaxyz...]" - searching "x"
+ if (__i > __first2 && __is_equal(__i, __i - 1))
+ {
+ //whole subrange continues to content equal elements - return "no op"
+ if (__is_equal(__i, __j - 1))
+ return false;
- //1.2 right bound, case "[...aaa]aaaxyz" - searching "x"
- if (__j < __last2 && __is_equal(__j - 1, __j))
- __j = std::upper_bound(__j, __last2, *__j, __comp);
+ __i = std::upper_bound(__i, __last2, *__i, __comp);
+ }
- //2. testing is __a subsequence of the second range included into the first range
- auto __b = std::lower_bound(__first1, __last1, *__i, __comp);
+ //1.2 right bound, case "[...aaa]aaaxyz" - searching "x"
+ if (__j < __last2 && __is_equal(__j - 1, __j))
+ __j = std::upper_bound(__j, __last2, *__j, __comp);
- _PSTL_ASSERT(!__comp(*(__last1 - 1), *__b));
- _PSTL_ASSERT(!__comp(*(__j - 1), *__i));
- return !std::includes(__b, __last1, __i, __j, __comp);
- });
- });
+ //2. testing is __a subsequence of the second range included into the first range
+ auto __b = std::lower_bound(__first1, __last1, *__i, __comp);
+
+ _PSTL_ASSERT(!__comp(*(__last1 - 1), *__b));
+ _PSTL_ASSERT(!__comp(*(__j - 1), *__i));
+ return !std::includes(__b, __last1, __i, __j, __comp);
+ });
+ });
}
constexpr auto __set_algo_cut_off = 1000;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector, class _SizeFunction, class _SetOP>
+template <class _IsVector, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2,
+ class _OutputIterator, class _Compare, class _SizeFunction, class _SetOP>
_OutputIterator
-__parallel_set_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
- _SizeFunction __size_func, _SetOP __set_op, _IsVector __is_vector)
+__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)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_ForwardIterator1>::
diff erence_type _DifferenceType;
typedef typename std::iterator_traits<_OutputIterator>::value_type _Tp;
@@ -2834,99 +2921,100 @@ __parallel_set_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _Forwar
__par_backend::__buffer<_Tp> __buf(__size_func(__n1, __n2));
- return __internal::__except_handler([&__exec, __n1, __first1, __last1, __first2, __last2, __result, __is_vector,
- __comp, __size_func, __set_op, &__buf]() {
- auto __buffer = __buf.get();
- _DifferenceType __m{};
- auto __scan = [=](_DifferenceType, _DifferenceType, const _SetRange& __s) { // Scan
- if (!__s.empty())
- __brick_move_destroy()(__buffer + __s.__buf_pos, __buffer + (__s.__buf_pos + __s.__len),
- __result + __s.__pos, __is_vector);
- };
- __par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n1, _SetRange{0, 0, 0}, //-1, 0},
- [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
- //[__b; __e) - a subrange of the first sequence, to reduce
- _ForwardIterator1 __b = __first1 + __i, __e = __first1 + (__i + __len);
+ return __internal::__except_handler(
+ [&__exec, __n1, __first1, __last1, __first2, __last2, __result, __comp, __size_func, __set_op, &__buf]()
+ {
+ auto __buffer = __buf.get();
+ _DifferenceType __m{};
+ auto __scan = [=](_DifferenceType, _DifferenceType, const _SetRange& __s) { // Scan
+ if (!__s.empty())
+ __brick_move_destroy()(__buffer + __s.__buf_pos, __buffer + (__s.__buf_pos + __s.__len),
+ __result + __s.__pos, _IsVector{});
+ };
+ __par_backend::__parallel_strict_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n1, _SetRange{0, 0, 0}, //-1, 0},
+ [=](_DifferenceType __i, _DifferenceType __len) { // Reduce
+ //[__b; __e) - a subrange of the first sequence, to reduce
+ _ForwardIterator1 __b = __first1 + __i, __e = __first1 + (__i + __len);
- //try searching for the first element which not equal to *__b
- if (__b != __first1)
- __b = std::upper_bound(__b, __last1, *__b, __comp);
+ //try searching for the first element which not equal to *__b
+ if (__b != __first1)
+ __b = std::upper_bound(__b, __last1, *__b, __comp);
- //try searching for the first element which not equal to *__e
- if (__e != __last1)
- __e = std::upper_bound(__e, __last1, *__e, __comp);
+ //try searching for the first element which not equal to *__e
+ if (__e != __last1)
+ __e = std::upper_bound(__e, __last1, *__e, __comp);
- //check is [__b; __e) empty
- if (__e - __b < 1)
- {
- _ForwardIterator2 __bb = __last2;
- if (__b != __last1)
- __bb = std::lower_bound(__first2, __last2, *__b, __comp);
+ //check is [__b; __e) empty
+ if (__e - __b < 1)
+ {
+ _ForwardIterator2 __bb = __last2;
+ if (__b != __last1)
+ __bb = std::lower_bound(__first2, __last2, *__b, __comp);
- const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
- return _SetRange{0, 0, __buf_pos};
- }
+ const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
+ return _SetRange{0, 0, __buf_pos};
+ }
- //try searching for "corresponding" subrange [__bb; __ee) in the second sequence
- _ForwardIterator2 __bb = __first2;
- if (__b != __first1)
- __bb = std::lower_bound(__first2, __last2, *__b, __comp);
+ //try searching for "corresponding" subrange [__bb; __ee) in the second sequence
+ _ForwardIterator2 __bb = __first2;
+ if (__b != __first1)
+ __bb = std::lower_bound(__first2, __last2, *__b, __comp);
- _ForwardIterator2 __ee = __last2;
- if (__e != __last1)
- __ee = std::lower_bound(__bb, __last2, *__e, __comp);
+ _ForwardIterator2 __ee = __last2;
+ if (__e != __last1)
+ __ee = std::lower_bound(__bb, __last2, *__e, __comp);
- const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
- auto __buffer_b = __buffer + __buf_pos;
- auto __res = __set_op(__b, __e, __bb, __ee, __buffer_b, __comp);
+ const _DifferenceType __buf_pos = __size_func((__b - __first1), (__bb - __first2));
+ auto __buffer_b = __buffer + __buf_pos;
+ auto __res = __set_op(__b, __e, __bb, __ee, __buffer_b, __comp);
- return _SetRange{0, __res - __buffer_b, __buf_pos};
- },
- [](const _SetRange& __a, const _SetRange& __b) { // Combine
- if (__b.__buf_pos > __a.__buf_pos || ((__b.__buf_pos == __a.__buf_pos) && !__b.empty()))
- return _SetRange{__a.__pos + __a.__len + __b.__pos, __b.__len, __b.__buf_pos};
- return _SetRange{__b.__pos + __b.__len + __a.__pos, __a.__len, __a.__buf_pos};
- },
- __scan, // Scan
- [&__m, &__scan](const _SetRange& __total) { // Apex
- //final scan
- __scan(0, 0, __total);
- __m = __total.__pos + __total.__len;
- });
- return __result + __m;
- });
+ return _SetRange{0, __res - __buffer_b, __buf_pos};
+ },
+ [](const _SetRange& __a, const _SetRange& __b) { // Combine
+ if (__b.__buf_pos > __a.__buf_pos || ((__b.__buf_pos == __a.__buf_pos) && !__b.empty()))
+ return _SetRange{__a.__pos + __a.__len + __b.__pos, __b.__len, __b.__buf_pos};
+ return _SetRange{__b.__pos + __b.__len + __a.__pos, __a.__len, __a.__buf_pos};
+ },
+ __scan, // Scan
+ [&__m, &__scan](const _SetRange& __total) { // Apex
+ //final scan
+ __scan(0, 0, __total);
+ __m = __total.__pos + __total.__len;
+ });
+ return __result + __m;
+ });
}
//a shared parallel pattern for '__pattern_set_union' and '__pattern_set_symmetric_
diff erence'
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _SetUnionOp, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare, class _SetUnionOp>
_OutputIterator
-__parallel_set_union_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+__parallel_set_union_op(_Tag __tag, _ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
- _Compare __comp, _SetUnionOp __set_union_op, _IsVector __is_vector)
+ _Compare __comp, _SetUnionOp __set_union_op)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_ForwardIterator1>::
diff erence_type _DifferenceType;
const auto __n1 = __last1 - __first1;
const auto __n2 = __last2 - __first2;
- auto copy_range1 = [__is_vector](_ForwardIterator1 __begin, _ForwardIterator1 __end, _OutputIterator __res) {
- return __internal::__brick_copy(__begin, __end, __res, __is_vector);
- };
- auto copy_range2 = [__is_vector](_ForwardIterator2 __begin, _ForwardIterator2 __end, _OutputIterator __res) {
- return __internal::__brick_copy(__begin, __end, __res, __is_vector);
- };
+ auto copy_range1 = [](_ForwardIterator1 __begin, _ForwardIterator1 __end, _OutputIterator __res)
+ { return __internal::__brick_copy(__begin, __end, __res, typename _Tag::__is_vector{}); };
+ auto copy_range2 = [](_ForwardIterator2 __begin, _ForwardIterator2 __end, _OutputIterator __res)
+ { return __internal::__brick_copy(__begin, __end, __res, typename _Tag::__is_vector{}); };
// {1} {}: parallel copying just first sequence
if (__n2 == 0)
- return __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
- copy_range1, std::true_type());
+ return __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ __result, copy_range1);
// {} {2}: parallel copying justmake second sequence
if (__n1 == 0)
- return __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first2, __last2, __result,
- copy_range2, std::true_type());
+ return __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
+ __result, copy_range2);
// testing whether the sequences are intersected
_ForwardIterator1 __left_bound_seq_1 = std::lower_bound(__first1, __last1, *__first2, __comp);
@@ -2935,14 +3023,16 @@ __parallel_set_union_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _
{
//{1} < {2}: seq2 is wholly greater than seq1, so, do parallel copying seq1 and seq2
__par_backend::__parallel_invoke(
- std::forward<_ExecutionPolicy>(__exec),
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
- copy_range1, std::true_type());
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ __result, copy_range1);
},
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
- __result + __n1, copy_range2, std::true_type());
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
+ __result + __n1, copy_range2);
});
return __result + __n1 + __n2;
}
@@ -2954,14 +3044,16 @@ __parallel_set_union_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _
{
//{2} < {1}: seq2 is wholly greater than seq1, so, do parallel copying seq1 and seq2
__par_backend::__parallel_invoke(
- std::forward<_ExecutionPolicy>(__exec),
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first2, __last2, __result,
- copy_range2, std::true_type());
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2, __last2,
+ __result, copy_range2);
},
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- __result + __n2, copy_range1, std::true_type());
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ __result + __n2, copy_range1);
});
return __result + __n1 + __n2;
}
@@ -2972,17 +3064,19 @@ __parallel_set_union_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _
auto __res_or = __result;
__result += __m1; //we know proper offset due to [first1; left_bound_seq_1) < [first2; last2)
__par_backend::__parallel_invoke(
- std::forward<_ExecutionPolicy>(__exec),
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
//do parallel copying of [first1; left_bound_seq_1)
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first1, __left_bound_seq_1,
- __res_or, copy_range1, std::true_type());
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __left_bound_seq_1, __res_or, copy_range1);
},
- [=, &__result] {
+ [=, &__result]
+ {
__result = __internal::__parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2, __result,
- __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; }, __set_union_op,
- __is_vector);
+ __tag, std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2,
+ __result, __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; },
+ __set_union_op);
});
return __result;
}
@@ -2994,24 +3088,26 @@ __parallel_set_union_op(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _
auto __res_or = __result;
__result += __m2; //we know proper offset due to [first2; left_bound_seq_2) < [first1; last1)
__par_backend::__parallel_invoke(
- std::forward<_ExecutionPolicy>(__exec),
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec),
//do parallel copying of [first2; left_bound_seq_2)
- [=] {
- __internal::__pattern_walk2_brick(std::forward<_ExecutionPolicy>(__exec), __first2, __left_bound_seq_2,
- __res_or, copy_range2, std::true_type());
+ [=]
+ {
+ __internal::__pattern_walk2_brick(__tag, std::forward<_ExecutionPolicy>(__exec), __first2,
+ __left_bound_seq_2, __res_or, copy_range2);
},
- [=, &__result] {
+ [=, &__result]
+ {
__result = __internal::__parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2, __result,
- __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; }, __set_union_op,
- __is_vector);
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2,
+ __result, __comp, [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; },
+ __set_union_op);
});
return __result;
}
return __internal::__parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
- [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; }, __set_union_op, __is_vector);
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
+ [](_DifferenceType __n, _DifferenceType __m) { return __n + __m; }, __set_union_op);
}
//------------------------------------------------------------------------
@@ -3048,23 +3144,23 @@ __brick_set_union(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last
return std::set_union(__first1, __last1, __first2, __last2, __result, __comp);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_union(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp,
- _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_set_union(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
+ _Compare __comp) noexcept
{
- return __internal::__brick_set_union(__first1, __last1, __first2, __last2, __result, __comp, __is_vector);
+ return __internal::__brick_set_union(__first1, __last1, __first2, __last2, __result, __comp,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _OutputIterator, class _Compare>
_OutputIterator
-__pattern_set_union(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _OutputIterator __result,
- _Compare __comp, _IsVector __is_vector, /*__is_parallel=*/std::true_type)
+__pattern_set_union(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _OutputIterator __result, _Compare __comp)
{
const auto __n1 = __last1 - __first1;
@@ -3076,13 +3172,13 @@ __pattern_set_union(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
typedef typename std::iterator_traits<_OutputIterator>::value_type _Tp;
return __parallel_set_union_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
[](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
- _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
+ _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
+ {
return __pstl::__utils::__set_union_construct(__first1, __last1, __first2, __last2, __result, __comp,
__BrickCopyConstruct<_IsVector>());
- },
- __is_vector);
+ });
}
//------------------------------------------------------------------------
@@ -3109,23 +3205,23 @@ __brick_set_intersection(_RandomAccessIterator1 __first1, _RandomAccessIterator1
return std::set_intersection(__first1, __last1, __first2, __last2, __result, __comp);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_intersection(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+__pattern_set_intersection(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
- _Compare __comp, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+ _Compare __comp) noexcept
{
- return __internal::__brick_set_intersection(__first1, __last1, __first2, __last2, __result, __comp, __is_vector);
+ return __internal::__brick_set_intersection(__first1, __last1, __first2, __last2, __result, __comp,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Compare>
_RandomAccessIterator3
-__pattern_set_intersection(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
- _RandomAccessIterator3 __result, _Compare __comp, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_set_intersection(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
+ _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp)
{
typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType;
@@ -3154,14 +3250,13 @@ __pattern_set_intersection(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __f
{
//we know proper offset due to [first1; left_bound_seq_1) < [first2; last2)
return __internal::__parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2, __result, __comp,
- [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
+ __tag, std::forward<_ExecutionPolicy>(__exec), __left_bound_seq_1, __last1, __first2, __last2, __result,
+ __comp, [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
[](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
_RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
return __pstl::__utils::__set_intersection_construct(__first1, __last1, __first2, __last2, __result,
__comp);
- },
- __is_vector);
+ });
}
const auto __m2 = __last2 - __left_bound_seq_2 + __n1;
@@ -3169,14 +3264,13 @@ __pattern_set_intersection(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __f
{
//we know proper offset due to [first2; left_bound_seq_2) < [first1; last1)
__result = __internal::__parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2, __result, __comp,
- [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2, __result,
+ __comp, [](_DifferenceType __n, _DifferenceType __m) { return std::min(__n, __m); },
[](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
_RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
return __pstl::__utils::__set_intersection_construct(__first2, __last2, __first1, __last1, __result,
__comp);
- },
- __is_vector);
+ });
return __result;
}
@@ -3207,23 +3301,23 @@ __brick_set_
diff erence(_RandomAccessIterator1 __first1, _RandomAccessIterator1 _
return std::set_
diff erence(__first1, __last1, __first2, __last2, __result, __comp);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_
diff erence(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+__pattern_set_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
- _Compare __comp, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+ _Compare __comp) noexcept
{
- return __internal::__brick_set_
diff erence(__first1, __last1, __first2, __last2, __result, __comp, __is_vector);
+ return __internal::__brick_set_
diff erence(__first1, __last1, __first2, __last2, __result, __comp,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Compare>
_RandomAccessIterator3
-__pattern_set_
diff erence(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
- _RandomAccessIterator3 __result, _Compare __comp, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_set_
diff erence(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
+ _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp)
{
typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType;
@@ -3238,44 +3332,38 @@ __pattern_set_
diff erence(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __fir
// {1} \ {}: parallel copying just first sequence
if (__n2 == 0)
return __internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
- [__is_vector](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res) {
- return __internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- std::true_type());
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
+ [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
+ { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
// testing whether the sequences are intersected
_RandomAccessIterator1 __left_bound_seq_1 = std::lower_bound(__first1, __last1, *__first2, __comp);
//{1} < {2}: seq 2 is wholly greater than seq 1, so, parallel copying just first sequence
if (__left_bound_seq_1 == __last1)
return __internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
- [__is_vector](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res) {
- return __internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- std::true_type());
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
+ [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
+ { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
// testing whether the sequences are intersected
_RandomAccessIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp);
//{2} < {1}: seq 1 is wholly greater than seq 2, so, parallel copying just first sequence
if (__left_bound_seq_2 == __last2)
return __internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
- [__is_vector](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res) {
- return __internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- std::true_type());
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __result,
+ [](_RandomAccessIterator1 __begin, _RandomAccessIterator1 __end, _RandomAccessIterator3 __res)
+ { return __internal::__brick_copy(__begin, __end, __res, _IsVector{}); });
if (__n1 + __n2 > __set_algo_cut_off)
return __parallel_set_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
[](_DifferenceType __n, _DifferenceType) { return __n; },
[](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
- _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
+ _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
+ {
return __pstl::__utils::__set_
diff erence_construct(__first1, __last1, __first2, __last2, __result,
__comp, __BrickCopyConstruct<_IsVector>());
- },
- __is_vector);
+ });
// use serial algorithm
return std::set_
diff erence(__first1, __last1, __first2, __last2, __result, __comp);
@@ -3305,24 +3393,24 @@ __brick_set_symmetric_
diff erence(_RandomAccessIterator1 __first1, _RandomAccessI
return std::set_symmetric_
diff erence(__first1, __last1, __first2, __last2, __result, __comp);
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
- class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
+ class _Compare>
_OutputIterator
-__pattern_set_symmetric_
diff erence(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+__pattern_set_symmetric_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _OutputIterator __result,
- _Compare __comp, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+ _Compare __comp) noexcept
{
return __internal::__brick_set_symmetric_
diff erence(__first1, __last1, __first2, __last2, __result, __comp,
- __is_vector);
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
- class _RandomAccessIterator3, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _RandomAccessIterator3, class _Compare>
_RandomAccessIterator3
-__pattern_set_symmetric_
diff erence(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
- _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
- _RandomAccessIterator2 __last2, _RandomAccessIterator3 __result, _Compare __comp,
- _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_set_symmetric_
diff erence(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec,
+ _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
+ _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _RandomAccessIterator3 __result, _Compare __comp)
{
const auto __n1 = __last1 - __first1;
@@ -3334,13 +3422,13 @@ __pattern_set_symmetric_
diff erence(_ExecutionPolicy&& __exec, _RandomAccessItera
typedef typename std::iterator_traits<_RandomAccessIterator3>::value_type _Tp;
return __internal::__parallel_set_union_op(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
+ __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
[](_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
- _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp) {
+ _RandomAccessIterator2 __last2, _Tp* __result, _Compare __comp)
+ {
return __pstl::__utils::__set_symmetric_
diff erence_construct(__first1, __last1, __first2, __last2, __result,
__comp, __BrickCopyConstruct<_IsVector>());
- },
- __is_vector);
+ });
}
//------------------------------------------------------------------------
@@ -3368,12 +3456,12 @@ __brick_is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __las
[&__comp](_RandomAccessIterator __it, _SizeType __i) { return __comp(__it[(__i - 1) / 2], __it[__i]); });
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
_RandomAccessIterator
-__pattern_is_heap_until(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp, _IsVector __is_vector, /* is_parallel = */ std::false_type) noexcept
+__pattern_is_heap_until(_Tag, _ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
+ _Compare __comp) noexcept
{
- return __internal::__brick_is_heap_until(__first, __last, __comp, __is_vector);
+ return __internal::__brick_is_heap_until(__first, __last, __comp, typename _Tag::__is_vector{});
}
template <class _RandomAccessIterator, class _DifferenceType, class _Compare>
@@ -3402,22 +3490,27 @@ __is_heap_until_local(_RandomAccessIterator __first, _DifferenceType __begin, _D
[&__comp](_RandomAccessIterator __it, _DifferenceType __i) { return __comp(__it[(__i - 1) / 2], __it[__i]); });
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
_RandomAccessIterator
-__pattern_is_heap_until(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp, _IsVector __is_vector, /* is_parallel = */ std::true_type) noexcept
+__pattern_is_heap_until(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__last - __first < 2)
return __last;
- return __internal::__except_handler([&]() {
- return __parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__first, __comp, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j) {
- return __internal::__is_heap_until_local(__first, __i - __first, __j - __first, __comp, __is_vector);
- },
- std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(), /*is_first=*/true);
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __parallel_find(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__first, __comp](_RandomAccessIterator __i, _RandomAccessIterator __j) {
+ return __internal::__is_heap_until_local(__first, __i - __first, __j - __first, __comp,
+ _IsVector{});
+ },
+ std::less<typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type>(), /*is_first=*/true);
+ });
}
//------------------------------------------------------------------------
@@ -3444,35 +3537,39 @@ __brick_min_element(_RandomAccessIterator __first, _RandomAccessIterator __last,
#endif
}
-template <typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare, typename _IsVector>
+template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
_ForwardIterator
-__pattern_min_element(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp,
- _IsVector __is_vector, /* is_parallel = */ std::false_type) noexcept
+__pattern_min_element(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _Compare __comp) noexcept
{
- return __internal::__brick_min_element(__first, __last, __comp, __is_vector);
+ return __internal::__brick_min_element(__first, __last, __comp, typename _Tag::__is_vector{});
}
-template <typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _IsVector>
+template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
_RandomAccessIterator
-__pattern_min_element(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp, _IsVector __is_vector, /* is_parallel = */ std::true_type)
+__pattern_min_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp)
{
if (__first == __last)
return __last;
- return __internal::__except_handler([&]() {
- return __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first + 1, __last, __first,
- [=](_RandomAccessIterator __begin, _RandomAccessIterator __end,
- _RandomAccessIterator __init) -> _RandomAccessIterator {
- const _RandomAccessIterator subresult =
- __internal::__brick_min_element(__begin, __end, __comp, __is_vector);
- return __internal::__cmp_iterators_by_values(__init, subresult, __comp);
- },
- [=](_RandomAccessIterator __it1, _RandomAccessIterator __it2) -> _RandomAccessIterator {
- return __internal::__cmp_iterators_by_values(__it1, __it2, __comp);
- });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __par_backend::__parallel_reduce(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last, __first,
+ [=](_RandomAccessIterator __begin, _RandomAccessIterator __end,
+ _RandomAccessIterator __init) -> _RandomAccessIterator
+ {
+ const _RandomAccessIterator subresult =
+ __internal::__brick_min_element(__begin, __end, __comp, _IsVector{});
+ return __internal::__cmp_iterators_by_values(__init, subresult, __comp);
+ },
+ [=](_RandomAccessIterator __it1, _RandomAccessIterator __it2) -> _RandomAccessIterator
+ { return __internal::__cmp_iterators_by_values(__it1, __it2, __comp); });
+ });
}
//------------------------------------------------------------------------
@@ -3499,34 +3596,39 @@ __brick_minmax_element(_RandomAccessIterator __first, _RandomAccessIterator __la
#endif
}
-template <typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare, typename _IsVector>
+template <typename _Tag, typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare>
std::pair<_ForwardIterator, _ForwardIterator>
-__pattern_minmax_element(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp,
- _IsVector __is_vector, /* is_parallel = */ std::false_type) noexcept
+__pattern_minmax_element(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _Compare __comp) noexcept
{
- return __internal::__brick_minmax_element(__first, __last, __comp, __is_vector);
+ return __internal::__brick_minmax_element(__first, __last, __comp, typename _Tag::__is_vector{});
}
-template <typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _IsVector>
+template <typename _IsVector, typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare>
std::pair<_RandomAccessIterator, _RandomAccessIterator>
-__pattern_minmax_element(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Compare __comp, _IsVector __is_vector, /* is_parallel = */ std::true_type)
+__pattern_minmax_element(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp)
{
if (__first == __last)
return std::make_pair(__first, __first);
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
return __internal::__except_handler([&]() {
typedef std::pair<_RandomAccessIterator, _RandomAccessIterator> _Result;
return __par_backend::__parallel_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first + 1, __last, std::make_pair(__first, __first),
- [=](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Result __init) -> _Result {
- const _Result __subresult = __internal::__brick_minmax_element(__begin, __end, __comp, __is_vector);
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first + 1, __last,
+ std::make_pair(__first, __first),
+ [=](_RandomAccessIterator __begin, _RandomAccessIterator __end, _Result __init) -> _Result
+ {
+ const _Result __subresult = __internal::__brick_minmax_element(__begin, __end, __comp, _IsVector{});
return std::make_pair(
__internal::__cmp_iterators_by_values(__subresult.first, __init.first, __comp),
__internal::__cmp_iterators_by_values(__init.second, __subresult.second, std::not_fn(__comp)));
},
- [=](_Result __p1, _Result __p2) -> _Result {
+ [=](_Result __p1, _Result __p2) -> _Result
+ {
return std::make_pair(
__internal::__cmp_iterators_by_values(__p1.first, __p2.first, __comp),
__internal::__cmp_iterators_by_values(__p2.second, __p1.second, std::not_fn(__comp)));
@@ -3569,29 +3671,31 @@ __brick_mismatch(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1
return __unseq_backend::__simd_first(__first1, __n, __first2, std::not_fn(__pred));
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
std::pair<_ForwardIterator1, _ForwardIterator2>
-__pattern_mismatch(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Predicate __pred, _IsVector __is_vector,
- /* is_parallel = */ std::false_type) noexcept
+__pattern_mismatch(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Predicate __pred) noexcept
{
- return __internal::__brick_mismatch(__first1, __last1, __first2, __last2, __pred, __is_vector);
+ return __internal::__brick_mismatch(__first1, __last1, __first2, __last2, __pred, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Predicate,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Predicate>
std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
-__pattern_mismatch(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _Predicate __pred,
- _IsVector __is_vector, /* is_parallel = */ std::true_type) noexcept
+__pattern_mismatch(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _Predicate __pred) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
return __internal::__except_handler([&]() {
auto __n = std::min(__last1 - __first1, __last2 - __first2);
auto __result = __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
- [__first1, __first2, __pred, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
+ [__first1, __first2, __pred](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ {
return __internal::__brick_mismatch(__i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
- __pred, __is_vector)
+ __pred, _IsVector{})
.first;
},
std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(), /*is_first=*/true);
@@ -3649,23 +3753,25 @@ __brick_lexicographical_compare(_RandomAccessIterator1 __first1, _RandomAccessIt
}
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare>
bool
-__pattern_lexicographical_compare(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
- _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp,
- _IsVector __is_vector, /* is_parallel = */ std::false_type) noexcept
+__pattern_lexicographical_compare(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+ _ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp) noexcept
{
- return __internal::__brick_lexicographical_compare(__first1, __last1, __first2, __last2, __comp, __is_vector);
+ return __internal::__brick_lexicographical_compare(__first1, __last1, __first2, __last2, __comp,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Compare>
bool
-__pattern_lexicographical_compare(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
- _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2,
- _RandomAccessIterator2 __last2, _Compare __comp, _IsVector __is_vector,
- /* is_parallel = */ std::true_type) noexcept
+__pattern_lexicographical_compare(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec,
+ _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
+ _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _Compare __comp) noexcept
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
if (__first2 == __last2)
{ // if second sequence is empty
return false;
@@ -3682,13 +3788,14 @@ __pattern_lexicographical_compare(_ExecutionPolicy&& __exec, _RandomAccessIterat
--__last2;
auto __n = std::min(__last1 - __first1, __last2 - __first2);
auto __result = __internal::__parallel_find(
- std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
- [__first1, __first2, &__comp, __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j) {
- return __internal::__brick_mismatch(__i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
- [&__comp](const _RefType1 __x, const _RefType2 __y) {
- return !__comp(__x, __y) && !__comp(__y, __x);
- },
- __is_vector)
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __first1 + __n,
+ [__first1, __first2, &__comp](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j)
+ {
+ return __internal::__brick_mismatch(
+ __i, __j, __first2 + (__i - __first1), __first2 + (__j - __first1),
+ [&__comp](const _RefType1 __x, const _RefType2 __y)
+ { return !__comp(__x, __y) && !__comp(__y, __x); },
+ _IsVector{})
.first;
},
std::less<typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type>(), /*is_first=*/true);
diff --git a/pstl/include/pstl/internal/execution_defs.h b/pstl/include/pstl/internal/execution_defs.h
index 1e232fc858daa..d7c4126972338 100644
--- a/pstl/include/pstl/internal/execution_defs.h
+++ b/pstl/include/pstl/internal/execution_defs.h
@@ -26,88 +26,20 @@ inline namespace v1
// 2.4, Sequential execution policy
class sequenced_policy
{
- public:
- // For internal use only
- static constexpr std::false_type
- __allow_unsequenced()
- {
- return std::false_type{};
- }
- static constexpr std::false_type
- __allow_vector()
- {
- return std::false_type{};
- }
- static constexpr std::false_type
- __allow_parallel()
- {
- return std::false_type{};
- }
};
// 2.5, Parallel execution policy
class parallel_policy
{
- public:
- // For internal use only
- static constexpr std::false_type
- __allow_unsequenced()
- {
- return std::false_type{};
- }
- static constexpr std::false_type
- __allow_vector()
- {
- return std::false_type{};
- }
- static constexpr std::true_type
- __allow_parallel()
- {
- return std::true_type{};
- }
};
// 2.6, Parallel+Vector execution policy
class parallel_unsequenced_policy
{
- public:
- // For internal use only
- static constexpr std::true_type
- __allow_unsequenced()
- {
- return std::true_type{};
- }
- static constexpr std::true_type
- __allow_vector()
- {
- return std::true_type{};
- }
- static constexpr std::true_type
- __allow_parallel()
- {
- return std::true_type{};
- }
};
class unsequenced_policy
{
- public:
- // For internal use only
- static constexpr std::true_type
- __allow_unsequenced()
- {
- return std::true_type{};
- }
- static constexpr std::true_type
- __allow_vector()
- {
- return std::true_type{};
- }
- static constexpr std::false_type
- __allow_parallel()
- {
- return std::false_type{};
- }
};
// 2.8, Execution policy objects
@@ -153,6 +85,12 @@ template <class ExecPolicy, class T>
using __enable_if_execution_policy =
typename std::enable_if<__pstl::execution::is_execution_policy<typename std::decay<ExecPolicy>::type>::value,
T>::type;
+
+template <class _IsVector>
+struct __serial_tag;
+template <class _IsVector>
+struct __parallel_tag;
+
} // namespace __internal
} // namespace __pstl
diff --git a/pstl/include/pstl/internal/execution_impl.h b/pstl/include/pstl/internal/execution_impl.h
index dfe214bab6cb7..5dc622b441221 100644
--- a/pstl/include/pstl/internal/execution_impl.h
+++ b/pstl/include/pstl/internal/execution_impl.h
@@ -23,76 +23,76 @@ namespace __pstl
namespace __internal
{
-using namespace __pstl::execution;
+template <typename _IteratorTag, typename... _IteratorTypes>
+using __are_iterators_of = std::conjunction<
+ std::is_base_of<_IteratorTag, typename std::iterator_traits<std::decay_t<_IteratorTypes>>::iterator_category>...>;
-template <typename _IteratorType>
-struct __is_random_access_iterator
- : std::is_same<typename std::iterator_traits<_IteratorType>::iterator_category,
- std::random_access_iterator_tag>
-{
-};
+template <typename... _IteratorTypes>
+using __are_random_access_iterators = __are_iterators_of<std::random_access_iterator_tag, _IteratorTypes...>;
-template <typename Policy>
-struct __policy_traits
+struct __serial_backend_tag
{
};
-
-template <>
-struct __policy_traits<sequenced_policy>
+struct __tbb_backend_tag
{
- typedef std::false_type __allow_parallel;
- typedef std::false_type __allow_unsequenced;
- typedef std::false_type __allow_vector;
};
-
-template <>
-struct __policy_traits<unsequenced_policy>
+struct __openmp_backend_tag
{
- typedef std::false_type __allow_parallel;
- typedef std::true_type __allow_unsequenced;
- typedef std::true_type __allow_vector;
};
-template <>
-struct __policy_traits<parallel_policy>
+#if defined(_PSTL_PAR_BACKEND_TBB)
+using __par_backend_tag = __tbb_backend_tag;
+#elif defined(_PSTL_PAR_BACKEND_OPENMP)
+using __par_backend_tag = __openmp_backend_tag;
+#elif defined(_PSTL_PAR_BACKEND_SERIAL)
+using __par_backend_tag = __serial_backend_tag;
+#else
+# error "A parallel backend must be specified";
+#endif
+
+template <class _IsVector>
+struct __serial_tag
{
- typedef std::true_type __allow_parallel;
- typedef std::false_type __allow_unsequenced;
- typedef std::false_type __allow_vector;
+ using __is_vector = _IsVector;
};
-template <>
-struct __policy_traits<parallel_unsequenced_policy>
+template <class _IsVector>
+struct __parallel_tag
{
- typedef std::true_type __allow_parallel;
- typedef std::true_type __allow_unsequenced;
- typedef std::true_type __allow_vector;
+ using __is_vector = _IsVector;
+ // backend tag can be change depending on
+ // TBB availability in the environment
+ using __backend_tag = __par_backend_tag;
};
-template <typename _ExecutionPolicy>
-using __allow_vector =
- typename __internal::__policy_traits<typename std::decay<_ExecutionPolicy>::type>::__allow_vector;
+template <class _IsVector, class... _IteratorTypes>
+using __tag_type = typename std::conditional<__internal::__are_random_access_iterators<_IteratorTypes...>::value,
+ __parallel_tag<_IsVector>, __serial_tag<_IsVector>>::type;
-template <typename _ExecutionPolicy>
-using __allow_unsequenced =
- typename __internal::__policy_traits<typename std::decay<_ExecutionPolicy>::type>::__allow_unsequenced;
+template <class... _IteratorTypes>
+__serial_tag</*_IsVector = */ std::false_type>
+__select_backend(__pstl::execution::sequenced_policy, _IteratorTypes&&...)
+{
+ return {};
+}
-template <typename _ExecutionPolicy>
-using __allow_parallel =
- typename __internal::__policy_traits<typename std::decay<_ExecutionPolicy>::type>::__allow_parallel;
+template <class... _IteratorTypes>
+__serial_tag<__internal::__are_random_access_iterators<_IteratorTypes...>>
+__select_backend(__pstl::execution::unsequenced_policy, _IteratorTypes&&...)
+{
+ return {};
+}
-template <typename _ExecutionPolicy, typename... _IteratorTypes>
-typename std::conjunction<__allow_vector<_ExecutionPolicy>,
- __is_random_access_iterator<_IteratorTypes>...>::type
-__is_vectorization_preferred(_ExecutionPolicy&&)
+template <class... _IteratorTypes>
+__tag_type</*_IsVector = */ std::false_type, _IteratorTypes...>
+__select_backend(__pstl::execution::parallel_policy, _IteratorTypes&&...)
{
return {};
}
-template <typename _ExecutionPolicy, typename... _IteratorTypes>
-typename std::conjunction<__allow_parallel<_ExecutionPolicy>,
- __is_random_access_iterator<_IteratorTypes>...>::type
-__is_parallelization_preferred(_ExecutionPolicy&&)
+template <class... _IteratorTypes>
+__tag_type<__internal::__are_random_access_iterators<_IteratorTypes...>, _IteratorTypes...>
+__select_backend(__pstl::execution::parallel_unsequenced_policy, _IteratorTypes&&...)
{
return {};
}
diff --git a/pstl/include/pstl/internal/glue_algorithm_impl.h b/pstl/include/pstl/internal/glue_algorithm_impl.h
index 9b4c56c6f7555..fb0c19d776658 100644
--- a/pstl/include/pstl/internal/glue_algorithm_impl.h
+++ b/pstl/include/pstl/internal/glue_algorithm_impl.h
@@ -32,10 +32,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
any_of(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
{
- return __pstl::__internal::__pattern_any_of(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_any_of(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __pred);
}
// [alg.all_of]
@@ -62,20 +62,19 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Function>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
for_each(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Function __f)
{
- __pstl::__internal::__pattern_walk1(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __f,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_walk1(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __f);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f)
{
- return __pstl::__internal::__pattern_walk1_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n, __f,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_walk1_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ __f);
}
// [alg.find]
@@ -84,10 +83,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
find_if(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
{
- return __pstl::__internal::__pattern_find_if(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_find_if(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
@@ -111,12 +110,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
find_end(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
_ForwardIterator2 __s_last, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_find_end(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __s_first, __s_last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __s_first);
+
+ return __pstl::__internal::__pattern_find_end(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __s_first, __s_last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -134,12 +131,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
find_first_of(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last,
_ForwardIterator2 __s_first, _ForwardIterator2 __s_last, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_find_first_of(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __s_first, __s_last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __s_first);
+
+ return __pstl::__internal::__pattern_find_first_of(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __s_first, __s_last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -156,23 +151,20 @@ template <class _ExecutionPolicy, class _ForwardIterator>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
adjacent_find(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
- return __pstl::__internal::__pattern_adjacent_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, std::equal_to<_ValueType>(),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- /*first_semantic*/ false);
+ return __pstl::__internal::__pattern_adjacent_find(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, std::equal_to<_ValueType>(), /*first_semantic*/ false);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
adjacent_find(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_adjacent_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- /*first_semantic*/ false);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_adjacent_find(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pred, /*first_semantic*/ false);
}
// [alg.count]
@@ -185,12 +177,11 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy,
typename iterator_traits<_ForwardIterator>::
diff erence_type>
count(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
- return __pstl::__internal::__pattern_count(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__value](const _ValueType& __x) { return __value == __x; },
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ return __pstl::__internal::__pattern_count(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__value](const _ValueType& __x) { return __value == __x; });
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate>
@@ -198,10 +189,9 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy,
typename iterator_traits<_ForwardIterator>::
diff erence_type>
count_if(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred)
{
- return __pstl::__internal::__pattern_count(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_count(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __pred);
}
// [alg.search]
@@ -211,12 +201,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
search(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __s_first,
_ForwardIterator2 __s_last, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_search(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __s_first, __s_last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __s_first);
+
+ return __pstl::__internal::__pattern_search(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __s_first, __s_last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -232,10 +220,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __count,
const _Tp& __value, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_search_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __count, __value, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_search_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __count, __value, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
@@ -253,34 +241,28 @@ template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterato
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator2>
copy(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __result)
{
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [__is_vector](_ForwardIterator1 __begin, _ForwardIterator1 __end, _ForwardIterator2 __res) {
- return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
+ [](_ForwardIterator1 __begin, _ForwardIterator1 __end, _ForwardIterator2 __res)
+ { return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector{}); });
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator2>
copy_n(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _Size __n, _ForwardIterator2 __result)
{
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__pattern_walk2_brick_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
- [__is_vector](_ForwardIterator1 __begin, _Size __sz, _ForwardIterator2 __res) {
- return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector);
- },
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+ [](_ForwardIterator1 __begin, _Size __sz, _ForwardIterator2 __res)
+ { return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector{}); });
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
@@ -288,12 +270,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
copy_if(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __result,
_Predicate __pred)
{
- return __pstl::__internal::__pattern_copy_if(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_copy_if(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __result, __pred);
}
// [alg.swap]
@@ -305,16 +285,16 @@ swap_ranges(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardItera
{
typedef typename iterator_traits<_ForwardIterator1>::reference _ReferenceType1;
typedef typename iterator_traits<_ForwardIterator2>::reference _ReferenceType2;
- return __pstl::__internal::__pattern_walk2(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2,
- [](_ReferenceType1 __x, _ReferenceType2 __y) {
- using std::swap;
- swap(__x, __y);
- },
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_walk2(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2,
+ [](_ReferenceType1 __x, _ReferenceType2 __y)
+ {
+ using std::swap;
+ swap(__x, __y);
+ });
}
// [alg.transform]
@@ -326,13 +306,12 @@ transform(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator
{
typedef typename iterator_traits<_ForwardIterator1>::reference _InputType;
typedef typename iterator_traits<_ForwardIterator2>::reference _OutputType;
- return __pstl::__internal::__pattern_walk2(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [__op](_InputType __x, _OutputType __y) mutable { __y = __op(__x); },
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_walk2(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __result,
+ [__op](_InputType __x, _OutputType __y) mutable { __y = __op(__x); });
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator,
@@ -344,13 +323,12 @@ transform(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterato
typedef typename iterator_traits<_ForwardIterator1>::reference _Input1Type;
typedef typename iterator_traits<_ForwardIterator2>::reference _Input2Type;
typedef typename iterator_traits<_ForwardIterator>::reference _OutputType;
+
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __result);
+
return __pstl::__internal::__pattern_walk3(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __result,
- [__op](_Input1Type x, _Input2Type y, _OutputType z) mutable { z = __op(x, y); },
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __result,
+ [__op](_Input1Type x, _Input2Type y, _OutputType z) mutable { z = __op(x, y); });
}
// [alg.replace]
@@ -361,16 +339,17 @@ replace_if(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator
const _Tp& __new_value)
{
typedef typename iterator_traits<_ForwardIterator>::reference _ElementType;
- __pstl::__internal::__pattern_walk1(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__pred, &__new_value](_ElementType __elem) {
- if (__pred(__elem))
- {
- __elem = __new_value;
- }
- },
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_walk1(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__pred, &__new_value](_ElementType __elem)
+ {
+ if (__pred(__elem))
+ {
+ __elem = __new_value;
+ }
+ });
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp>
@@ -389,13 +368,12 @@ replace_copy_if(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIt
{
typedef typename iterator_traits<_ForwardIterator1>::reference _InputType;
typedef typename iterator_traits<_ForwardIterator2>::reference _OutputType;
+
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
return __pstl::__internal::__pattern_walk2(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [__pred, &__new_value](_InputType __x, _OutputType __y) mutable { __y = __pred(__x) ? __new_value : __x; },
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
+ [__pred, &__new_value](_InputType __x, _OutputType __y) mutable { __y = __pred(__x) ? __new_value : __x; });
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp>
@@ -413,10 +391,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Tp>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
fill(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)
{
- __pstl::__internal::__pattern_fill(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __value,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_fill(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __value);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
@@ -426,10 +404,10 @@ fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, const
if (__count <= 0)
return __first;
- return __pstl::__internal::__pattern_fill_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __count, __value,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_fill_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __count, __value);
}
// [alg.generate]
@@ -437,10 +415,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Generator>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g)
{
- __pstl::__internal::__pattern_generate(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __g,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_generate(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __g);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Generator>
@@ -450,10 +428,10 @@ generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, _
if (__count <= 0)
return __first;
- return __pstl::__internal::__pattern_generate_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __count, __g,
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_generate_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __count, __g);
}
// [alg.remove]
@@ -479,10 +457,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
remove_if(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred)
{
- return __pstl::__internal::__pattern_remove_if(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_remove_if(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp>
@@ -499,10 +477,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
unique(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_unique(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_unique(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator>
@@ -517,12 +495,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
unique_copy(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __result,
_BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_unique_copy(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_unique_copy(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __result, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -538,10 +514,9 @@ template <class _ExecutionPolicy, class _BidirectionalIterator>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
reverse(_ExecutionPolicy&& __exec, _BidirectionalIterator __first, _BidirectionalIterator __last)
{
- __pstl::__internal::__pattern_reverse(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_reverse(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last);
}
template <class _ExecutionPolicy, class _BidirectionalIterator, class _ForwardIterator>
@@ -549,12 +524,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
reverse_copy(_ExecutionPolicy&& __exec, _BidirectionalIterator __first, _BidirectionalIterator __last,
_ForwardIterator __d_first)
{
- return __pstl::__internal::__pattern_reverse_copy(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _BidirectionalIterator, _ForwardIterator>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _BidirectionalIterator, _ForwardIterator>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __d_first);
+
+ return __pstl::__internal::__pattern_reverse_copy(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __d_first);
}
// [alg.rotate]
@@ -563,10 +536,10 @@ template <class _ExecutionPolicy, class _ForwardIterator>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
rotate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last)
{
- return __pstl::__internal::__pattern_rotate(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle, __last,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_rotate(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __middle, __last);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -574,12 +547,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
rotate_copy(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __middle, _ForwardIterator1 __last,
_ForwardIterator2 __result)
{
- return __pstl::__internal::__pattern_rotate_copy(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle, __last, __result,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_rotate_copy(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __middle, __last, __result);
}
// [alg.partitions]
@@ -588,20 +559,19 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
is_partitioned(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred)
{
- return __pstl::__internal::__pattern_is_partitioned(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_is_partitioned(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
partition(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _UnaryPredicate __pred)
{
- return __pstl::__internal::__pattern_partition(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_partition(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pred);
}
template <class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate>
@@ -609,10 +579,9 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _Bidirectiona
stable_partition(_ExecutionPolicy&& __exec, _BidirectionalIterator __first, _BidirectionalIterator __last,
_UnaryPredicate __pred)
{
- return __pstl::__internal::__pattern_stable_partition(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_stable_partition(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __last, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _ForwardIterator1, class _ForwardIterator2,
@@ -621,12 +590,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, std::pair<_Fo
partition_copy(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last,
_ForwardIterator1 __out_true, _ForwardIterator2 __out_false, _UnaryPredicate __pred)
{
- return __pstl::__internal::__pattern_partition_copy(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __out_true, __out_false, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator, _ForwardIterator1,
- _ForwardIterator2>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator, _ForwardIterator1,
- _ForwardIterator2>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __out_true, __out_false);
+
+ return __pstl::__internal::__pattern_partition_copy(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __out_true, __out_false, __pred);
}
// [alg.sort]
@@ -635,12 +602,11 @@ template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
typedef typename iterator_traits<_RandomAccessIterator>::value_type _InputType;
- return __pstl::__internal::__pattern_sort(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- typename std::is_move_constructible<_InputType>::type());
+ return __pstl::__internal::__pattern_sort(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __comp, typename std::is_move_constructible<_InputType>::type());
}
template <class _ExecutionPolicy, class _RandomAccessIterator>
@@ -657,10 +623,10 @@ template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
stable_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
- return __pstl::__internal::__pattern_stable_sort(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_stable_sort(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __comp);
}
template <class _ExecutionPolicy, class _RandomAccessIterator>
@@ -678,12 +644,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, std::pair<_Fo
mismatch(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_ForwardIterator2 __last2, _BinaryPredicate __pred)
{
- return __pstl::__internal::__pattern_mismatch(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __pred,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_mismatch(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __last2, __pred);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
@@ -720,10 +684,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_BinaryPredicate __p)
{
- return __pstl::__internal::__pattern_equal(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __p,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_equal(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __p);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -738,10 +702,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_ForwardIterator2 __last2, _BinaryPredicate __p)
{
- return __pstl::__internal::__pattern_equal(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __p,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_equal(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __last2, __p);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -757,17 +721,14 @@ template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterato
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator2>
move(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __d_first)
{
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __d_first);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first,
- [__is_vector](_ForwardIterator1 __begin, _ForwardIterator1 __end, _ForwardIterator2 __res) {
- return __pstl::__internal::__brick_move(__begin, __end, __res, __is_vector);
- },
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first,
+ [](_ForwardIterator1 __begin, _ForwardIterator1 __end, _ForwardIterator2 __res)
+ { return __pstl::__internal::__brick_move(__begin, __end, __res, __is_vector{}); });
}
// [partial.sort]
@@ -777,10 +738,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
partial_sort(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __middle,
_RandomAccessIterator __last, _Compare __comp)
{
- __pstl::__internal::__pattern_partial_sort(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_partial_sort(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __middle, __last, __comp);
}
template <class _ExecutionPolicy, class _RandomAccessIterator>
@@ -799,12 +760,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _RandomAccess
partial_sort_copy(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last,
_RandomAccessIterator __d_first, _RandomAccessIterator __d_last, _Compare __comp)
{
- return __pstl::__internal::__pattern_partial_sort_copy(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first, __d_last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator, _RandomAccessIterator>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator, _RandomAccessIterator>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __d_first);
+
+ return __pstl::__internal::__pattern_partial_sort_copy(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __last, __d_first, __d_last, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator>
@@ -821,11 +780,11 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
is_sorted_until(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
{
- const _ForwardIterator __res = __pstl::__internal::__pattern_adjacent_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __pstl::__internal::__reorder_pred<_Compare>(__comp),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- /*first_semantic*/ false);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ const _ForwardIterator __res =
+ __pstl::__internal::__pattern_adjacent_find(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pstl::__internal::__reorder_pred<_Compare>(__comp),
+ /*first_semantic*/ false);
return __res == __last ? __last : std::next(__res);
}
@@ -841,12 +800,10 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
is_sorted(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
{
- return __pstl::__internal::__pattern_adjacent_find(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- __pstl::__internal::__reorder_pred<_Compare>(__comp),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- /*or_semantic*/ true) == __last;
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_adjacent_find(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __pstl::__internal::__reorder_pred<_Compare>(__comp),
+ /*or_semantic*/ true) == __last;
}
template <class _ExecutionPolicy, class _ForwardIterator>
@@ -864,12 +821,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
merge(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp)
{
- return __pstl::__internal::__pattern_merge(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __d_first);
+
+ return __pstl::__internal::__pattern_merge(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __last2, __d_first, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator>
@@ -886,10 +841,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
inplace_merge(_ExecutionPolicy&& __exec, _BidirectionalIterator __first, _BidirectionalIterator __middle,
_BidirectionalIterator __last, _Compare __comp)
{
- __pstl::__internal::__pattern_inplace_merge(
- std::forward<_ExecutionPolicy>(__exec), __first, __middle, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _BidirectionalIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_inplace_merge(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __middle, __last, __comp);
}
template <class _ExecutionPolicy, class _BidirectionalIterator>
@@ -908,12 +863,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
includes(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_ForwardIterator2 __last2, _Compare __comp)
{
- return __pstl::__internal::__pattern_includes(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_includes(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __last2, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
@@ -932,12 +885,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
set_union(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
_ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp)
{
- return __pstl::__internal::__pattern_set_union(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __result);
+
+ return __pstl::__internal::__pattern_set_union(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1,
+ __last1, __first2, __last2, __result, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator>
@@ -957,12 +908,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
set_intersection(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp)
{
- return __pstl::__internal::__pattern_set_intersection(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __result);
+
+ return __pstl::__internal::__pattern_set_intersection(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first1, __last1, __first2, __last2, __result, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator>
@@ -982,12 +931,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
set_
diff erence(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp)
{
- return __pstl::__internal::__pattern_set_
diff erence(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __result);
+
+ return __pstl::__internal::__pattern_set_
diff erence(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first1, __last1, __first2, __last2, __result, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator>
@@ -1008,12 +955,10 @@ set_symmetric_
diff erence(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _ForwardIterator __result,
_Compare __comp)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2, __result);
+
return __pstl::__internal::__pattern_set_symmetric_
diff erence(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2,
- _ForwardIterator>(__exec));
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __result, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _ForwardIterator>
@@ -1030,10 +975,10 @@ template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _RandomAccessIterator>
is_heap_until(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
{
- return __pstl::__internal::__pattern_is_heap_until(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ return __pstl::__internal::__pattern_is_heap_until(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __comp);
}
template <class _ExecutionPolicy, class _RandomAccessIterator>
@@ -1065,10 +1010,9 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardIterator>
min_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
{
- return __pstl::__internal::__pattern_min_element(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_min_element(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator>
@@ -1100,10 +1044,9 @@ template <class _ExecutionPolicy, class _ForwardIterator, class _Compare>
__pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, std::pair<_ForwardIterator, _ForwardIterator>>
minmax_element(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
{
- return __pstl::__internal::__pattern_minmax_element(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_minmax_element(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator>
@@ -1121,10 +1064,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, void>
nth_element(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __nth,
_RandomAccessIterator __last, _Compare __comp)
{
- __pstl::__internal::__pattern_nth_element(
- std::forward<_ExecutionPolicy>(__exec), __first, __nth, __last, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _RandomAccessIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ __pstl::__internal::__pattern_nth_element(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __nth,
+ __last, __comp);
}
template <class _ExecutionPolicy, class _RandomAccessIterator>
@@ -1143,12 +1086,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, bool>
lexicographical_compare(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _ForwardIterator2 __last2, _Compare __comp)
{
- return __pstl::__internal::__pattern_lexicographical_compare(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __comp,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
+ return __pstl::__internal::__pattern_lexicographical_compare(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first1, __last1, __first2, __last2, __comp);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
diff --git a/pstl/include/pstl/internal/glue_memory_impl.h b/pstl/include/pstl/internal/glue_memory_impl.h
index 5c96e30451256..39c595d697a28 100644
--- a/pstl/include/pstl/internal/glue_memory_impl.h
+++ b/pstl/include/pstl/internal/glue_memory_impl.h
@@ -34,28 +34,25 @@ uninitialized_copy(_ExecutionPolicy&& __exec, _InputIterator __first, _InputIter
typedef typename iterator_traits<_InputIterator>::reference _ReferenceType1;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType2;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::integral_constant < bool, std::is_trivial<_ValueType1>::value&& std::is_trivial<_ValueType2>::value > (),
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [__is_vector](_InputIterator __begin, _InputIterator __end, _ForwardIterator __res) {
- return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
+ [](_InputIterator __begin, _InputIterator __end, _ForwardIterator __res)
+ { return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector{}); });
},
- [&]() {
- return __pstl::__internal::__pattern_walk2(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- __result,
- [](_ReferenceType1 __val1, _ReferenceType2 __val2) {
- ::new (std::addressof(__val2)) _ValueType2(__val1);
- },
- __is_vector, __is_parallel);
+ [&]()
+ {
+ return __pstl::__internal::__pattern_walk2(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __result,
+ [](_ReferenceType1 __val1, _ReferenceType2 __val2)
+ { ::new (std::addressof(__val2)) _ValueType2(__val1); });
});
}
@@ -68,27 +65,25 @@ uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __
typedef typename iterator_traits<_InputIterator>::reference _ReferenceType1;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType2;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::integral_constant < bool, std::is_trivial<_ValueType1>::value&& std::is_trivial<_ValueType2>::value > (),
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk2_brick_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
- [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) {
- return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+ [](_InputIterator __begin, _Size __sz, _ForwardIterator __res)
+ { return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector{}); });
},
- [&]() {
- return __pstl::__internal::__pattern_walk2_n(std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
- [](_ReferenceType1 __val1, _ReferenceType2 __val2) {
- ::new (std::addressof(__val2)) _ValueType2(__val1);
- },
- __is_vector, __is_parallel);
+ [&]()
+ {
+ return __pstl::__internal::__pattern_walk2_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __n, __result,
+ [](_ReferenceType1 __val1, _ReferenceType2 __val2)
+ { ::new (std::addressof(__val2)) _ValueType2(__val1); });
});
}
@@ -103,28 +98,25 @@ uninitialized_move(_ExecutionPolicy&& __exec, _InputIterator __first, _InputIter
typedef typename iterator_traits<_InputIterator>::reference _ReferenceType1;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType2;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::integral_constant < bool, std::is_trivial<_ValueType1>::value&& std::is_trivial<_ValueType2>::value > (),
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk2_brick(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [__is_vector](_InputIterator __begin, _InputIterator __end, _ForwardIterator __res) {
- return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
+ [](_InputIterator __begin, _InputIterator __end, _ForwardIterator __res)
+ { return __pstl::__internal::__brick_copy(__begin, __end, __res, __is_vector{}); });
},
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk2(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
- [](_ReferenceType1 __val1, _ReferenceType2 __val2) {
- ::new (std::addressof(__val2)) _ValueType2(std::move(__val1));
- },
- __is_vector, __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last, __result,
+ [](_ReferenceType1 __val1, _ReferenceType2 __val2)
+ { ::new (std::addressof(__val2)) _ValueType2(std::move(__val1)); });
});
}
@@ -137,28 +129,25 @@ uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __
typedef typename iterator_traits<_InputIterator>::reference _ReferenceType1;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType2;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _InputIterator, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::integral_constant < bool, std::is_trivial<_ValueType1>::value&& std::is_trivial<_ValueType2>::value > (),
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk2_brick_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
- [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) {
- return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+ [](_InputIterator __begin, _Size __sz, _ForwardIterator __res)
+ { return __pstl::__internal::__brick_copy_n(__begin, __sz, __res, __is_vector{}); });
},
- [&]() {
- return __pstl::__internal::__pattern_walk2_n(std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
- [](_ReferenceType1 __val1, _ReferenceType2 __val2) {
- ::new (std::addressof(__val2))
- _ValueType2(std::move(__val1));
- },
- __is_vector, __is_parallel);
+ [&]()
+ {
+ return __pstl::__internal::__pattern_walk2_n(
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n, __result,
+ [](_ReferenceType1 __val1, _ReferenceType2 __val2)
+ { ::new (std::addressof(__val2)) _ValueType2(std::move(__val1)); });
});
}
@@ -171,26 +160,24 @@ uninitialized_fill(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Forward
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
__pstl::__internal::__invoke_if_else(
std::is_arithmetic<_ValueType>(),
- [&]() {
+ [&]()
+ {
__pstl::__internal::__pattern_walk_brick(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__value, &__is_vector](_ForwardIterator __begin, _ForwardIterator __end) {
- __pstl::__internal::__brick_fill(__begin, __end, _ValueType(__value), __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__value](_ForwardIterator __begin, _ForwardIterator __end)
+ { __pstl::__internal::__brick_fill(__begin, __end, _ValueType(__value), __is_vector{}); });
},
- [&]() {
- __pstl::__internal::__pattern_walk1(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [&__value](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(__value); }, __is_vector,
- __is_parallel);
+ [&]()
+ {
+ __pstl::__internal::__pattern_walk1(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [&__value](_ReferenceType __val)
+ { ::new (std::addressof(__val)) _ValueType(__value); });
});
}
@@ -201,26 +188,24 @@ uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::is_arithmetic<_ValueType>(),
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk_brick_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [&__value, &__is_vector](_ForwardIterator __begin, _Size __count) {
- return __pstl::__internal::__brick_fill_n(__begin, __count, _ValueType(__value), __is_vector);
- },
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ [&__value](_ForwardIterator __begin, _Size __count)
+ { return __pstl::__internal::__brick_fill_n(__begin, __count, _ValueType(__value), __is_vector{}); });
},
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk1_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [&__value](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(__value); }, __is_vector,
- __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ [&__value](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(__value); });
});
}
@@ -233,16 +218,15 @@ destroy(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
- __pstl::__internal::__invoke_if_not(std::is_trivially_destructible<_ValueType>(), [&]() {
- __pstl::__internal::__pattern_walk1(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [](_ReferenceType __val) { __val.~_ValueType(); }, __is_vector,
- __is_parallel);
- });
+ __pstl::__internal::__invoke_if_not(std::is_trivially_destructible<_ValueType>(),
+ [&]()
+ {
+ __pstl::__internal::__pattern_walk1(
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [](_ReferenceType __val) { __val.~_ValueType(); });
+ });
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
@@ -252,17 +236,15 @@ destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n)
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
return __pstl::__internal::__invoke_if_else(
std::is_trivially_destructible<_ValueType>(), [&]() { return std::next(__first, __n); },
- [&]() {
- return __pstl::__internal::__pattern_walk1_n(std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [](_ReferenceType __val) { __val.~_ValueType(); }, __is_vector,
- __is_parallel);
+ [&]()
+ {
+ return __pstl::__internal::__pattern_walk1_n(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __n,
+ [](_ReferenceType __val) { __val.~_ValueType(); });
});
}
@@ -275,16 +257,15 @@ uninitialized_default_construct(_ExecutionPolicy&& __exec, _ForwardIterator __fi
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
- __pstl::__internal::__invoke_if_not(std::is_trivial<_ValueType>(), [&]() {
- __pstl::__internal::__pattern_walk1(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType; },
- __is_vector, __is_parallel);
- });
+ __pstl::__internal::__invoke_if_not(std::is_trivial<_ValueType>(),
+ [&]()
+ {
+ __pstl::__internal::__pattern_walk1(
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType; });
+ });
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
@@ -294,17 +275,15 @@ uninitialized_default_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
return __pstl::__internal::__invoke_if_else(
std::is_trivial<_ValueType>(), [&]() { return std::next(__first, __n); },
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk1_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType; }, __is_vector, __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType; });
});
}
@@ -317,25 +296,24 @@ uninitialized_value_construct(_ExecutionPolicy&& __exec, _ForwardIterator __firs
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
__pstl::__internal::__invoke_if_else(
std::is_trivial<_ValueType>(),
- [&]() {
- __pstl::__internal::__pattern_walk_brick(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__is_vector](_ForwardIterator __begin, _ForwardIterator __end) {
- __pstl::__internal::__brick_fill(__begin, __end, _ValueType(),
- __is_vector);
- },
- __is_parallel);
+ [&]()
+ {
+ __pstl::__internal::__pattern_walk_brick(
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [](_ForwardIterator __begin, _ForwardIterator __end)
+ { __pstl::__internal::__brick_fill(__begin, __end, _ValueType(), __is_vector{}); });
},
- [&]() {
- __pstl::__internal::__pattern_walk1(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(); }, __is_vector, __is_parallel);
+ [&]()
+ {
+ __pstl::__internal::__pattern_walk1(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [](_ReferenceType __val)
+ { ::new (std::addressof(__val)) _ValueType(); });
});
}
@@ -346,25 +324,24 @@ uninitialized_value_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __fi
typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType;
typedef typename iterator_traits<_ForwardIterator>::reference _ReferenceType;
- const auto __is_parallel =
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
- const auto __is_vector =
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec);
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+
+ using __is_vector = typename decltype(__dispatch_tag)::__is_vector;
return __pstl::__internal::__invoke_if_else(
std::is_trivial<_ValueType>(),
- [&]() {
- return __pstl::__internal::__pattern_walk_brick_n(std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [__is_vector](_ForwardIterator __begin, _Size __count) {
- return __pstl::__internal::__brick_fill_n(
- __begin, __count, _ValueType(), __is_vector);
- },
- __is_parallel);
+ [&]()
+ {
+ return __pstl::__internal::__pattern_walk_brick_n(
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ [](_ForwardIterator __begin, _Size __count)
+ { return __pstl::__internal::__brick_fill_n(__begin, __count, _ValueType(), __is_vector{}); });
},
- [&]() {
+ [&]()
+ {
return __pstl::__internal::__pattern_walk1_n(
- std::forward<_ExecutionPolicy>(__exec), __first, __n,
- [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(); }, __is_vector, __is_parallel);
+ __dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __n,
+ [](_ReferenceType __val) { ::new (std::addressof(__val)) _ValueType(); });
});
}
diff --git a/pstl/include/pstl/internal/glue_numeric_impl.h b/pstl/include/pstl/internal/glue_numeric_impl.h
index 241b8a3bebc71..ad268b51a16c9 100644
--- a/pstl/include/pstl/internal/glue_numeric_impl.h
+++ b/pstl/include/pstl/internal/glue_numeric_impl.h
@@ -59,14 +59,12 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _Tp>
transform_reduce(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _Tp __init)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+
typedef typename iterator_traits<_ForwardIterator1>::value_type _InputType;
- return __pstl::__internal::__pattern_transform_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __init, std::plus<_InputType>(),
- std::multiplies<_InputType>(),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ return __pstl::__internal::__pattern_transform_reduce(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first1, __last1, __first2, __init, std::plus<_InputType>(),
+ std::multiplies<_InputType>());
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1,
@@ -75,12 +73,10 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _Tp>
transform_reduce(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2)
{
- return __pstl::__internal::__pattern_transform_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __init, __binary_op1, __binary_op2,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2);
+ return __pstl::__internal::__pattern_transform_reduce(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first1, __last1, __first2, __init, __binary_op1,
+ __binary_op2);
}
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation>
@@ -88,10 +84,9 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _Tp>
transform_reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
_BinaryOperation __binary_op, _UnaryOperation __unary_op)
{
- return __pstl::__internal::__pattern_transform_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __init, __binary_op, __unary_op,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator>(__exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first);
+ return __pstl::__internal::__pattern_transform_reduce(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __last, __init, __binary_op, __unary_op);
}
// [exclusive.scan]
@@ -101,12 +96,12 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
exclusive_scan(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last,
_ForwardIterator2 __result, _Tp __init)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
using namespace __pstl;
- return __internal::__pattern_transform_scan(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __pstl::__internal::__no_op(), __init,
- std::plus<_Tp>(), /*inclusive=*/std::false_type(),
- __internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(__exec),
- __internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(__exec));
+ return __internal::__pattern_transform_scan(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __result, __pstl::__internal::__no_op(), __init, std::plus<_Tp>(),
+ /*inclusive=*/std::false_type());
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation>
@@ -114,12 +109,12 @@ __pstl::__internal::__enable_if_execution_policy<_ExecutionPolicy, _ForwardItera
exclusive_scan(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last,
_ForwardIterator2 __result, _Tp __init, _BinaryOperation __binary_op)
{
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
using namespace __pstl;
- return __internal::__pattern_transform_scan(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __pstl::__internal::__no_op(), __init,
- __binary_op, /*inclusive=*/std::false_type(),
- __internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(__exec),
- __internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(__exec));
+ return __internal::__pattern_transform_scan(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ __result, __pstl::__internal::__no_op(), __init, __binary_op,
+ /*inclusive=*/std::false_type());
}
// [inclusive.scan]
@@ -161,13 +156,11 @@ transform_exclusive_scan(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _
_ForwardIterator2 __result, _Tp __init, _BinaryOperation __binary_op,
_UnaryOperation __unary_op)
{
- return __pstl::__internal::__pattern_transform_scan(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __unary_op, __init, __binary_op,
- /*inclusive=*/std::false_type(),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_transform_scan(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __result, __unary_op, __init, __binary_op,
+ /*inclusive=*/std::false_type());
}
// [transform.inclusive.scan]
@@ -179,13 +172,11 @@ transform_inclusive_scan(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _
_ForwardIterator2 __result, _BinaryOperation __binary_op, _UnaryOperation __unary_op,
_Tp __init)
{
- return __pstl::__internal::__pattern_transform_scan(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __result, __unary_op, __init, __binary_op,
- /*inclusive=*/std::true_type(),
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result);
+
+ return __pstl::__internal::__pattern_transform_scan(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec), __first,
+ __last, __result, __unary_op, __init, __binary_op,
+ /*inclusive=*/std::true_type());
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _UnaryOperation,
@@ -218,12 +209,10 @@ adjacent_
diff erence(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _Forwa
if (__first == __last)
return __d_first;
- return __pstl::__internal::__pattern_adjacent_
diff erence(
- std::forward<_ExecutionPolicy>(__exec), __first, __last, __d_first, __op,
- __pstl::__internal::__is_vectorization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec),
- __pstl::__internal::__is_parallelization_preferred<_ExecutionPolicy, _ForwardIterator1, _ForwardIterator2>(
- __exec));
+ auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __d_first);
+
+ return __pstl::__internal::__pattern_adjacent_
diff erence(__dispatch_tag, std::forward<_ExecutionPolicy>(__exec),
+ __first, __last, __d_first, __op);
}
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2>
diff --git a/pstl/include/pstl/internal/numeric_fwd.h b/pstl/include/pstl/internal/numeric_fwd.h
index bcb3e2dd981b6..7f7845bd3e260 100644
--- a/pstl/include/pstl/internal/numeric_fwd.h
+++ b/pstl/include/pstl/internal/numeric_fwd.h
@@ -37,19 +37,17 @@ _Tp __brick_transform_reduce(_ForwardIterator1, _ForwardIterator1, _ForwardItera
_BinaryOperation2,
/*__is_vector=*/std::false_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1,
- class _BinaryOperation2, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp,
+ class _BinaryOperation1, class _BinaryOperation2>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Tp,
- _BinaryOperation1, _BinaryOperation2, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_transform_reduce(_Tag, _ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Tp,
+ _BinaryOperation1, _BinaryOperation2) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Tp,
- class _BinaryOperation1, class _BinaryOperation2, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Tp, class _BinaryOperation1, class _BinaryOperation2>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
- _Tp, _BinaryOperation1, _BinaryOperation2, _IsVector __is_vector,
- /*is_parallel=*/std::true_type);
+__pattern_transform_reduce(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator1,
+ _RandomAccessIterator1, _RandomAccessIterator2, _Tp, _BinaryOperation1, _BinaryOperation2);
//------------------------------------------------------------------------
// transform_reduce (version with unary and binary functions)
@@ -63,19 +61,17 @@ template <class _ForwardIterator, class _Tp, class _BinaryOperation, class _Unar
_Tp __brick_transform_reduce(_ForwardIterator, _ForwardIterator, _Tp, _BinaryOperation, _UnaryOperation,
/*is_vector=*/std::false_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation,
+ class _UnaryOperation>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Tp, _BinaryOperation,
- _UnaryOperation, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_transform_reduce(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Tp, _BinaryOperation,
+ _UnaryOperation) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation,
+ class _UnaryOperation>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Tp, _BinaryOperation,
- _UnaryOperation, _IsVector,
- /*is_parallel=*/std::true_type);
+__pattern_transform_reduce(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _Tp, _BinaryOperation, _UnaryOperation);
//------------------------------------------------------------------------
// transform_exclusive_scan
@@ -93,24 +89,23 @@ std::pair<_OutputIterator, _Tp> __brick_transform_scan(_RandomAccessIterator, _R
_UnaryOperation, _Tp, _BinaryOperation,
/*Inclusive*/ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryOperation,
+ class _Tp, class _BinaryOperation, class _Inclusive>
_OutputIterator
-__pattern_transform_scan(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _UnaryOperation, _Tp,
- _BinaryOperation, _Inclusive, _IsVector,
- /*is_parallel=*/std::false_type) noexcept;
+__pattern_transform_scan(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _UnaryOperation,
+ _Tp, _BinaryOperation, _Inclusive) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _UnaryOperation, class _Tp, class _BinaryOperation, class _Inclusive>
typename std::enable_if<!std::is_floating_point<_Tp>::value, _OutputIterator>::type
-__pattern_transform_scan(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
- _UnaryOperation, _Tp, _BinaryOperation, _Inclusive, _IsVector, /*is_parallel=*/std::true_type);
+__pattern_transform_scan(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&&, _RandomAccessIterator,
+ _RandomAccessIterator, _OutputIterator, _UnaryOperation, _Tp, _BinaryOperation, _Inclusive);
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _UnaryOperation, class _Tp, class _BinaryOperation, class _Inclusive>
typename std::enable_if<std::is_floating_point<_Tp>::value, _OutputIterator>::type
-__pattern_transform_scan(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
- _UnaryOperation, _Tp, _BinaryOperation, _Inclusive, _IsVector, /*is_parallel=*/std::true_type);
+__pattern_transform_scan(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator,
+ _OutputIterator, _UnaryOperation, _Tp, _BinaryOperation, _Inclusive);
//------------------------------------------------------------------------
// adjacent_
diff erence
@@ -125,17 +120,16 @@ _OutputIterator __brick_adjacent_
diff erence(_RandomAccessIterator, _RandomAccess
_BinaryOperation,
/*is_vector*/ std::true_type) noexcept;
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation>
_OutputIterator
-__pattern_adjacent_
diff erence(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryOperation,
- _IsVector, /*is_parallel*/ std::false_type) noexcept;
+__pattern_adjacent_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator,
+ _BinaryOperation) noexcept;
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _BinaryOperation,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _BinaryOperation>
_OutputIterator
-__pattern_adjacent_
diff erence(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
- _BinaryOperation, _IsVector, /*is_parallel*/ std::true_type);
+__pattern_adjacent_
diff erence(__parallel_tag<_IsVector>, _ExecutionPolicy&&, _RandomAccessIterator,
+ _RandomAccessIterator, _OutputIterator, _BinaryOperation);
} // namespace __internal
} // namespace __pstl
diff --git a/pstl/include/pstl/internal/numeric_impl.h b/pstl/include/pstl/internal/numeric_impl.h
index 6a498b6d11ae2..a0387aef50b00 100644
--- a/pstl/include/pstl/internal/numeric_impl.h
+++ b/pstl/include/pstl/internal/numeric_impl.h
@@ -54,38 +54,42 @@ __brick_transform_reduce(_RandomAccessIterator1 __first1, _RandomAccessIterator1
[=, &__binary_op2](_DifferenceType __i) { return __binary_op2(__first1[__i], __first2[__i]); });
}
-template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1,
- class _BinaryOperation2, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Tp,
+ class _BinaryOperation1, class _BinaryOperation2>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
+__pattern_transform_reduce(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1,
_ForwardIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1,
- _BinaryOperation2 __binary_op2, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+ _BinaryOperation2 __binary_op2) noexcept
{
- return __brick_transform_reduce(__first1, __last1, __first2, __init, __binary_op1, __binary_op2, __is_vector);
+ return __brick_transform_reduce(__first1, __last1, __first2, __init, __binary_op1, __binary_op2,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Tp,
- class _BinaryOperation1, class _BinaryOperation2, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _Tp, class _BinaryOperation1, class _BinaryOperation2>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1,
- _BinaryOperation2 __binary_op2, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_transform_reduce(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Tp __init,
+ _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2)
{
- return __internal::__except_handler([&]() {
- return __par_backend::__parallel_transform_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
- [__first1, __first2, __binary_op2](_RandomAccessIterator1 __i) mutable {
- return __binary_op2(*__i, *(__first2 + (__i - __first1)));
- },
- __init,
- __binary_op1, // Combine
- [__first1, __first2, __binary_op1, __binary_op2,
- __is_vector](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j, _Tp __init) -> _Tp {
- return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init, __binary_op1,
- __binary_op2, __is_vector);
- });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __par_backend::__parallel_transform_reduce(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first1, __last1,
+ [__first1, __first2, __binary_op2](_RandomAccessIterator1 __i) mutable
+ { return __binary_op2(*__i, *(__first2 + (__i - __first1))); },
+ __init,
+ __binary_op1, // Combine
+ [__first1, __first2, __binary_op1, __binary_op2](_RandomAccessIterator1 __i, _RandomAccessIterator1 __j,
+ _Tp __init) -> _Tp
+ {
+ return __internal::__brick_transform_reduce(__i, __j, __first2 + (__i - __first1), __init,
+ __binary_op1, __binary_op2, _IsVector{});
+ });
+ });
}
//------------------------------------------------------------------------
@@ -112,31 +116,35 @@ __brick_transform_reduce(_RandomAccessIterator __first, _RandomAccessIterator __
[=, &__unary_op](_DifferenceType __i) { return __unary_op(__first[__i]); });
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation,
+ class _UnaryOperation>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
- _BinaryOperation __binary_op, _UnaryOperation __unary_op, _IsVector __is_vector,
- /*is_parallel=*/std::false_type) noexcept
+__pattern_transform_reduce(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
+ _BinaryOperation __binary_op, _UnaryOperation __unary_op) noexcept
{
- return __internal::__brick_transform_reduce(__first, __last, __init, __binary_op, __unary_op, __is_vector);
+ return __internal::__brick_transform_reduce(__first, __last, __init, __binary_op, __unary_op,
+ typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation,
+ class _UnaryOperation>
_Tp
-__pattern_transform_reduce(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _Tp __init, _BinaryOperation __binary_op, _UnaryOperation __unary_op, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_transform_reduce(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Tp __init, _BinaryOperation __binary_op,
+ _UnaryOperation __unary_op)
{
- return __internal::__except_handler([&]() {
- return __par_backend::__parallel_transform_reduce(
- std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__unary_op](_RandomAccessIterator __i) mutable { return __unary_op(*__i); }, __init, __binary_op,
- [__unary_op, __binary_op, __is_vector](_RandomAccessIterator __i, _RandomAccessIterator __j, _Tp __init) {
- return __internal::__brick_transform_reduce(__i, __j, __init, __binary_op, __unary_op, __is_vector);
- });
- });
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
+ return __internal::__except_handler(
+ [&]()
+ {
+ return __par_backend::__parallel_transform_reduce(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__unary_op](_RandomAccessIterator __i) mutable { return __unary_op(*__i); }, __init, __binary_op,
+ [__unary_op, __binary_op](_RandomAccessIterator __i, _RandomAccessIterator __j, _Tp __init) {
+ return __internal::__brick_transform_reduce(__i, __j, __init, __binary_op, __unary_op, _IsVector{});
+ });
+ });
}
//------------------------------------------------------------------------
@@ -212,55 +220,62 @@ __brick_transform_scan(_RandomAccessIterator __first, _RandomAccessIterator __la
/*is_vector=*/std::false_type());
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _UnaryOperation,
+ class _Tp, class _BinaryOperation, class _Inclusive>
_OutputIterator
-__pattern_transform_scan(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+__pattern_transform_scan(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
_OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op,
- _Inclusive, _IsVector __is_vector, /*is_parallel=*/std::false_type) noexcept
+ _Inclusive) noexcept
{
return __internal::__brick_transform_scan(__first, __last, __result, __unary_op, __init, __binary_op, _Inclusive(),
- __is_vector)
+ typename _Tag::__is_vector{})
.first;
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _UnaryOperation, class _Tp, class _BinaryOperation, class _Inclusive>
typename std::enable_if<!std::is_floating_point<_Tp>::value, _OutputIterator>::type
-__pattern_transform_scan(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op,
- _Inclusive, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_transform_scan(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init,
+ _BinaryOperation __binary_op, _Inclusive)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type _DifferenceType;
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_transform_scan(
- std::forward<_ExecutionPolicy>(__exec), __last - __first,
- [__first, __unary_op](_DifferenceType __i) mutable { return __unary_op(__first[__i]); }, __init,
- __binary_op,
- [__first, __unary_op, __binary_op](_DifferenceType __i, _DifferenceType __j, _Tp __init) {
- // Execute serial __brick_transform_reduce, due to the explicit SIMD vectorization (reduction) requires a commutative operation for the guarantee of correct scan.
- return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op,
- __unary_op,
- /*__is_vector*/ std::false_type());
- },
- [__first, __unary_op, __binary_op, __result, __is_vector](_DifferenceType __i, _DifferenceType __j,
- _Tp __init) {
- return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op,
- __init, __binary_op, _Inclusive(), __is_vector)
- .second;
- });
- return __result + (__last - __first);
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_transform_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __last - __first,
+ [__first, __unary_op](_DifferenceType __i) mutable { return __unary_op(__first[__i]); }, __init,
+ __binary_op,
+ [__first, __unary_op, __binary_op](_DifferenceType __i, _DifferenceType __j, _Tp __init)
+ {
+ // Execute serial __brick_transform_reduce, due to the explicit SIMD vectorization (reduction) requires a commutative operation for the guarantee of correct scan.
+ return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op,
+ __unary_op,
+ /*__is_vector*/ std::false_type());
+ },
+ [__first, __unary_op, __binary_op, __result](_DifferenceType __i, _DifferenceType __j, _Tp __init)
+ {
+ return __internal::__brick_transform_scan(__first + __i, __first + __j, __result + __i, __unary_op,
+ __init, __binary_op, _Inclusive(), _IsVector{})
+ .second;
+ });
+ return __result + (__last - __first);
+ });
}
-template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp,
- class _BinaryOperation, class _Inclusive, class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator,
+ class _UnaryOperation, class _Tp, class _BinaryOperation, class _Inclusive>
typename std::enable_if<std::is_floating_point<_Tp>::value, _OutputIterator>::type
-__pattern_transform_scan(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op,
- _Inclusive, _IsVector __is_vector, /*is_parallel=*/std::true_type)
+__pattern_transform_scan(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _OutputIterator __result, _UnaryOperation __unary_op, _Tp __init,
+ _BinaryOperation __binary_op, _Inclusive)
{
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
typedef typename std::iterator_traits<_RandomAccessIterator>::
diff erence_type _DifferenceType;
_DifferenceType __n = __last - __first;
@@ -268,26 +283,31 @@ __pattern_transform_scan(_ExecutionPolicy&& __exec, _RandomAccessIterator __firs
{
return __result;
}
- return __internal::__except_handler([&]() {
- __par_backend::__parallel_strict_scan(
- std::forward<_ExecutionPolicy>(__exec), __n, __init,
- [__first, __unary_op, __binary_op, __result, __is_vector](_DifferenceType __i, _DifferenceType __len) {
- return __internal::__brick_transform_scan(__first + __i, __first + (__i + __len), __result + __i,
- __unary_op, _Tp{}, __binary_op, _Inclusive(), __is_vector)
- .second;
- },
- __binary_op,
- [__result, &__binary_op](_DifferenceType __i, _DifferenceType __len, _Tp __initial) {
- return *(std::transform(__result + __i, __result + __i + __len, __result + __i,
- [&__initial, &__binary_op](const _Tp& __x) {
- _PSTL_PRAGMA_FORCEINLINE
- return __binary_op(__initial, __x);
- }) -
- 1);
- },
- [](_Tp) {});
- return __result + (__last - __first);
- });
+ return __internal::__except_handler(
+ [&]()
+ {
+ __par_backend::__parallel_strict_scan(
+ __backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __n, __init,
+ [__first, __unary_op, __binary_op, __result](_DifferenceType __i, _DifferenceType __len)
+ {
+ return __internal::__brick_transform_scan(__first + __i, __first + (__i + __len), __result + __i,
+ __unary_op, _Tp{}, __binary_op, _Inclusive(), _IsVector{})
+ .second;
+ },
+ __binary_op,
+ [__result, &__binary_op](_DifferenceType __i, _DifferenceType __len, _Tp __initial)
+ {
+ return *(std::transform(__result + __i, __result + __i + __len, __result + __i,
+ [&__initial, &__binary_op](const _Tp& __x)
+ {
+ _PSTL_PRAGMA_FORCEINLINE
+ return __binary_op(__initial, __x);
+ }) -
+ 1);
+ },
+ [](_Tp) {});
+ return __result + (__last - __first);
+ });
}
//------------------------------------------------------------------------
@@ -320,37 +340,38 @@ __brick_adjacent_
diff erence(_RandomAccessIterator1 __first, _RandomAccessIterato
[&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z) { __z = __op(__x, __y); });
}
-template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation,
- class _IsVector>
+template <class _Tag, class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation>
_OutputIterator
-__pattern_adjacent_
diff erence(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
- _OutputIterator __d_first, _BinaryOperation __op, _IsVector __is_vector,
- /*is_parallel*/ std::false_type) noexcept
+__pattern_adjacent_
diff erence(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last,
+ _OutputIterator __d_first, _BinaryOperation __op) noexcept
{
- return __internal::__brick_adjacent_
diff erence(__first, __last, __d_first, __op, __is_vector);
+ return __internal::__brick_adjacent_
diff erence(__first, __last, __d_first, __op, typename _Tag::__is_vector{});
}
-template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryOperation,
- class _IsVector>
+template <class _IsVector, class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2,
+ class _BinaryOperation>
_RandomAccessIterator2
-__pattern_adjacent_
diff erence(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
- _RandomAccessIterator2 __d_first, _BinaryOperation __op, _IsVector __is_vector,
- /*is_parallel=*/std::true_type)
+__pattern_adjacent_
diff erence(__parallel_tag<_IsVector> __tag, _ExecutionPolicy&& __exec,
+ _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
+ _RandomAccessIterator2 __d_first, _BinaryOperation __op)
{
_PSTL_ASSERT(__first != __last);
typedef typename std::iterator_traits<_RandomAccessIterator1>::reference _ReferenceType1;
typedef typename std::iterator_traits<_RandomAccessIterator2>::reference _ReferenceType2;
+ using __backend_tag = typename decltype(__tag)::__backend_tag;
+
*__d_first = *__first;
- __par_backend::__parallel_for(
- std::forward<_ExecutionPolicy>(__exec), __first, __last - 1,
- [&__op, __is_vector, __d_first, __first](_RandomAccessIterator1 __b, _RandomAccessIterator1 __e) {
- _RandomAccessIterator2 __d_b = __d_first + (__b - __first);
- __internal::__brick_walk3(
- __b, __e, __b + 1, __d_b + 1,
- [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z) { __z = __op(__y, __x); },
- __is_vector);
- });
+ __par_backend::__parallel_for(__backend_tag{}, std::forward<_ExecutionPolicy>(__exec), __first, __last - 1,
+ [&__op, __d_first, __first](_RandomAccessIterator1 __b, _RandomAccessIterator1 __e)
+ {
+ _RandomAccessIterator2 __d_b = __d_first + (__b - __first);
+ __internal::__brick_walk3(
+ __b, __e, __b + 1, __d_b + 1,
+ [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z)
+ { __z = __op(__y, __x); },
+ _IsVector{});
+ });
return __d_first + (__last - __first);
}
diff --git a/pstl/include/pstl/internal/omp/parallel_for.h b/pstl/include/pstl/internal/omp/parallel_for.h
index 729f26f531428..0f841e5311810 100644
--- a/pstl/include/pstl/internal/omp/parallel_for.h
+++ b/pstl/include/pstl/internal/omp/parallel_for.h
@@ -42,7 +42,7 @@ __parallel_for_body(_Index __first, _Index __last, _Fp __f)
template <class _ExecutionPolicy, class _Index, class _Fp>
void
-__parallel_for(_ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
+__parallel_for(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
{
if (omp_in_parallel())
{
diff --git a/pstl/include/pstl/internal/omp/parallel_invoke.h b/pstl/include/pstl/internal/omp/parallel_invoke.h
index 0db8677798f86..045ccbe9a18cb 100644
--- a/pstl/include/pstl/internal/omp/parallel_invoke.h
+++ b/pstl/include/pstl/internal/omp/parallel_invoke.h
@@ -31,7 +31,7 @@ __parallel_invoke_body(_F1&& __f1, _F2&& __f2)
template <class _ExecutionPolicy, typename _F1, typename _F2>
void
-__parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
+__parallel_invoke(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
{
if (omp_in_parallel())
{
diff --git a/pstl/include/pstl/internal/omp/parallel_merge.h b/pstl/include/pstl/internal/omp/parallel_merge.h
index 23feb9e9ef82f..e6f82c5e1866c 100644
--- a/pstl/include/pstl/internal/omp/parallel_merge.h
+++ b/pstl/include/pstl/internal/omp/parallel_merge.h
@@ -64,9 +64,9 @@ __parallel_merge_body(std::size_t __size_x, std::size_t __size_y, _RandomAccessI
template <class _ExecutionPolicy, typename _RandomAccessIterator1, typename _RandomAccessIterator2,
typename _RandomAccessIterator3, typename _Compare, typename _LeafMerge>
void
-__parallel_merge(_ExecutionPolicy&& /*__exec*/, _RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe,
- _RandomAccessIterator2 __ys, _RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp,
- _LeafMerge __leaf_merge)
+__parallel_merge(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&& /*__exec*/, _RandomAccessIterator1 __xs,
+ _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, _RandomAccessIterator2 __ye,
+ _RandomAccessIterator3 __zs, _Compare __comp, _LeafMerge __leaf_merge)
{
std::size_t __size_x = __xe - __xs;
diff --git a/pstl/include/pstl/internal/omp/parallel_reduce.h b/pstl/include/pstl/internal/omp/parallel_reduce.h
index f0b5afc459f52..841d48fc30515 100644
--- a/pstl/include/pstl/internal/omp/parallel_reduce.h
+++ b/pstl/include/pstl/internal/omp/parallel_reduce.h
@@ -45,8 +45,8 @@ __parallel_reduce_body(_RandomAccessIterator __first, _RandomAccessIterator __la
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Value, typename _RealBody, typename _Reduction>
_Value
-__parallel_reduce(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Value __identity,
- _RealBody __real_body, _Reduction __reduction)
+__parallel_reduce(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Value __identity, _RealBody __real_body, _Reduction __reduction)
{
// We don't create a nested parallel region in an existing parallel region:
// just create tasks.
diff --git a/pstl/include/pstl/internal/omp/parallel_scan.h b/pstl/include/pstl/internal/omp/parallel_scan.h
index a358a9bde0fa2..f3eb967ca4fb2 100644
--- a/pstl/include/pstl/internal/omp/parallel_scan.h
+++ b/pstl/include/pstl/internal/omp/parallel_scan.h
@@ -97,8 +97,8 @@ __parallel_strict_scan_body(_Index __n, _Tp __initial, _Rp __reduce, _Cp __combi
template <class _ExecutionPolicy, typename _Index, typename _Tp, typename _Rp, typename _Cp, typename _Sp, typename _Ap>
void
-__parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __reduce, _Cp __combine, _Sp __scan,
- _Ap __apex)
+__parallel_strict_scan(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _Index __n, _Tp __initial,
+ _Rp __reduce, _Cp __combine, _Sp __scan, _Ap __apex)
{
if (__n <= __default_chunk_size)
{
diff --git a/pstl/include/pstl/internal/omp/parallel_stable_partial_sort.h b/pstl/include/pstl/internal/omp/parallel_stable_partial_sort.h
index d4ae512dc9c99..06cd55bb4899b 100644
--- a/pstl/include/pstl/internal/omp/parallel_stable_partial_sort.h
+++ b/pstl/include/pstl/internal/omp/parallel_stable_partial_sort.h
@@ -20,8 +20,9 @@ namespace __omp_backend
template <typename _RandomAccessIterator, typename _Compare, typename _LeafSort>
void
-__parallel_stable_partial_sort(_RandomAccessIterator __xs, _RandomAccessIterator __xe, _Compare __comp,
- _LeafSort __leaf_sort, std::size_t /* __nsort */)
+__parallel_stable_partial_sort(__pstl::__internal::__openmp_backend_tag, _RandomAccessIterator __xs,
+ _RandomAccessIterator __xe, _Compare __comp, _LeafSort __leaf_sort,
+ std::size_t /* __nsort */)
{
// TODO: "Parallel partial sort needs to be implemented.");
__leaf_sort(__xs, __xe, __comp);
diff --git a/pstl/include/pstl/internal/omp/parallel_stable_sort.h b/pstl/include/pstl/internal/omp/parallel_stable_sort.h
index 6f9dce528960c..e4d0676627260 100644
--- a/pstl/include/pstl/internal/omp/parallel_stable_sort.h
+++ b/pstl/include/pstl/internal/omp/parallel_stable_sort.h
@@ -115,8 +115,9 @@ __parallel_stable_sort_body(_RandomAccessIterator __xs, _RandomAccessIterator __
template <class _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _LeafSort>
void
-__parallel_stable_sort(_ExecutionPolicy&& /*__exec*/, _RandomAccessIterator __xs, _RandomAccessIterator __xe,
- _Compare __comp, _LeafSort __leaf_sort, std::size_t __nsort = 0)
+__parallel_stable_sort(__pstl::__internal::__openmp_backend_tag __tag, _ExecutionPolicy&& /*__exec*/,
+ _RandomAccessIterator __xs, _RandomAccessIterator __xe, _Compare __comp, _LeafSort __leaf_sort,
+ std::size_t __nsort = 0)
{
auto __count = static_cast<std::size_t>(__xe - __xs);
if (__count <= __default_chunk_size || __nsort < __count)
@@ -136,7 +137,7 @@ __parallel_stable_sort(_ExecutionPolicy&& /*__exec*/, _RandomAccessIterator __xs
}
else
{
- __pstl::__omp_backend::__parallel_stable_partial_sort(__xs, __xe, __comp, __leaf_sort, __nsort);
+ __pstl::__omp_backend::__parallel_stable_partial_sort(__tag, __xs, __xe, __comp, __leaf_sort, __nsort);
}
}
else
@@ -149,7 +150,7 @@ __parallel_stable_sort(_ExecutionPolicy&& /*__exec*/, _RandomAccessIterator __xs
}
else
{
- __pstl::__omp_backend::__parallel_stable_partial_sort(__xs, __xe, __comp, __leaf_sort, __nsort);
+ __pstl::__omp_backend::__parallel_stable_partial_sort(__tag, __xs, __xe, __comp, __leaf_sort, __nsort);
}
}
}
diff --git a/pstl/include/pstl/internal/omp/parallel_transform_reduce.h b/pstl/include/pstl/internal/omp/parallel_transform_reduce.h
index e7422872eab24..1d4cc0a5974d2 100644
--- a/pstl/include/pstl/internal/omp/parallel_transform_reduce.h
+++ b/pstl/include/pstl/internal/omp/parallel_transform_reduce.h
@@ -81,8 +81,9 @@ __transform_reduce_body(_RandomAccessIterator __first, _RandomAccessIterator __l
template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryOp, class _Value, class _Combiner,
class _Reduction>
_Value
-__parallel_transform_reduce(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last,
- _UnaryOp __unary_op, _Value __init, _Combiner __combiner, _Reduction __reduction)
+__parallel_transform_reduce(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _UnaryOp __unary_op, _Value __init, _Combiner __combiner,
+ _Reduction __reduction)
{
_Value __result = __init;
if (omp_in_parallel())
diff --git a/pstl/include/pstl/internal/omp/parallel_transform_scan.h b/pstl/include/pstl/internal/omp/parallel_transform_scan.h
index f20621269b230..f83628994bc21 100644
--- a/pstl/include/pstl/internal/omp/parallel_transform_scan.h
+++ b/pstl/include/pstl/internal/omp/parallel_transform_scan.h
@@ -20,8 +20,8 @@ namespace __omp_backend
template <class _ExecutionPolicy, class _Index, class _Up, class _Tp, class _Cp, class _Rp, class _Sp>
_Tp
-__parallel_transform_scan(_ExecutionPolicy&&, _Index __n, _Up /* __u */, _Tp __init, _Cp /* __combine */,
- _Rp /* __brick_reduce */, _Sp __scan)
+__parallel_transform_scan(__pstl::__internal::__openmp_backend_tag, _ExecutionPolicy&&, _Index __n, _Up /* __u */,
+ _Tp __init, _Cp /* __combine */, _Rp /* __brick_reduce */, _Sp __scan)
{
// TODO: parallelize this function.
return __scan(_Index(0), __n, __init);
diff --git a/pstl/include/pstl/internal/parallel_backend_serial.h b/pstl/include/pstl/internal/parallel_backend_serial.h
index 65033c9f5ea4d..ad2c5fc60ec3f 100644
--- a/pstl/include/pstl/internal/parallel_backend_serial.h
+++ b/pstl/include/pstl/internal/parallel_backend_serial.h
@@ -54,15 +54,15 @@ __cancel_execution()
template <class _ExecutionPolicy, class _Index, class _Fp>
void
-__parallel_for(_ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
+__parallel_for(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
{
__f(__first, __last);
}
template <class _ExecutionPolicy, class _Value, class _Index, typename _RealBody, typename _Reduction>
_Value
-__parallel_reduce(_ExecutionPolicy&&, _Index __first, _Index __last, const _Value& __identity,
- const _RealBody& __real_body, const _Reduction&)
+__parallel_reduce(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last,
+ const _Value& __identity, const _RealBody& __real_body, const _Reduction&)
{
if (__first == __last)
{
@@ -76,16 +76,16 @@ __parallel_reduce(_ExecutionPolicy&&, _Index __first, _Index __last, const _Valu
template <class _ExecutionPolicy, class _Index, class _UnaryOp, class _Tp, class _BinaryOp, class _Reduce>
_Tp
-__parallel_transform_reduce(_ExecutionPolicy&&, _Index __first, _Index __last, _UnaryOp, _Tp __init, _BinaryOp,
- _Reduce __reduce)
+__parallel_transform_reduce(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last,
+ _UnaryOp, _Tp __init, _BinaryOp, _Reduce __reduce)
{
return __reduce(__first, __last, __init);
}
template <class _ExecutionPolicy, typename _Index, typename _Tp, typename _Rp, typename _Cp, typename _Sp, typename _Ap>
void
-__parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __reduce, _Cp __combine, _Sp __scan,
- _Ap __apex)
+__parallel_strict_scan(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _Index __n, _Tp __initial,
+ _Rp __reduce, _Cp __combine, _Sp __scan, _Ap __apex)
{
_Tp __sum = __initial;
if (__n)
@@ -97,15 +97,16 @@ __parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __redu
template <class _ExecutionPolicy, class _Index, class _UnaryOp, class _Tp, class _BinaryOp, class _Reduce, class _Scan>
_Tp
-__parallel_transform_scan(_ExecutionPolicy&&, _Index __n, _UnaryOp, _Tp __init, _BinaryOp, _Reduce, _Scan __scan)
+__parallel_transform_scan(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _Index __n, _UnaryOp,
+ _Tp __init, _BinaryOp, _Reduce, _Scan __scan)
{
return __scan(_Index(0), __n, __init);
}
template <class _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _LeafSort>
void
-__parallel_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
- _LeafSort __leaf_sort, std::size_t = 0)
+__parallel_stable_sort(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator __first,
+ _RandomAccessIterator __last, _Compare __comp, _LeafSort __leaf_sort, std::size_t = 0)
{
__leaf_sort(__first, __last, __comp);
}
@@ -113,16 +114,16 @@ __parallel_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __first, _Rando
template <class _ExecutionPolicy, typename _RandomAccessIterator1, typename _RandomAccessIterator2,
typename _RandomAccessIterator3, typename _Compare, typename _LeafMerge>
void
-__parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
- _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __outit,
- _Compare __comp, _LeafMerge __leaf_merge)
+__parallel_merge(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator1 __first1,
+ _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2,
+ _RandomAccessIterator3 __outit, _Compare __comp, _LeafMerge __leaf_merge)
{
__leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp);
}
template <class _ExecutionPolicy, typename _F1, typename _F2>
void
-__parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
+__parallel_invoke(__pstl::__internal::__serial_backend_tag, _ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
{
std::forward<_F1>(__f1)();
std::forward<_F2>(__f2)();
diff --git a/pstl/include/pstl/internal/parallel_backend_tbb.h b/pstl/include/pstl/internal/parallel_backend_tbb.h
index 8f1e39527abfe..e336f69799eb0 100644
--- a/pstl/include/pstl/internal/parallel_backend_tbb.h
+++ b/pstl/include/pstl/internal/parallel_backend_tbb.h
@@ -102,7 +102,7 @@ class __parallel_for_body
// wrapper over tbb::parallel_for
template <class _ExecutionPolicy, class _Index, class _Fp>
void
-__parallel_for(_ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
+__parallel_for(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
{
tbb::this_task_arena::isolate([=]() {
tbb::parallel_for(tbb::blocked_range<_Index>(__first, __last), __parallel_for_body<_Index, _Fp>(__f));
@@ -113,8 +113,8 @@ __parallel_for(_ExecutionPolicy&&, _Index __first, _Index __last, _Fp __f)
// wrapper over tbb::parallel_reduce
template <class _ExecutionPolicy, class _Value, class _Index, typename _RealBody, typename _Reduction>
_Value
-__parallel_reduce(_ExecutionPolicy&&, _Index __first, _Index __last, const _Value& __identity,
- const _RealBody& __real_body, const _Reduction& __reduction)
+__parallel_reduce(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last,
+ const _Value& __identity, const _RealBody& __real_body, const _Reduction& __reduction)
{
return tbb::this_task_arena::isolate([__first, __last, &__identity, &__real_body, &__reduction]() -> _Value {
return tbb::parallel_reduce(
@@ -194,8 +194,8 @@ struct __par_trans_red_body
template <class _ExecutionPolicy, class _Index, class _Up, class _Tp, class _Cp, class _Rp>
_Tp
-__parallel_transform_reduce(_ExecutionPolicy&&, _Index __first, _Index __last, _Up __u, _Tp __init, _Cp __combine,
- _Rp __brick_reduce)
+__parallel_transform_reduce(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _Index __first, _Index __last,
+ _Up __u, _Tp __init, _Cp __combine, _Rp __brick_reduce)
{
__tbb_backend::__par_trans_red_body<_Index, _Up, _Tp, _Cp, _Rp> __body(__u, __init, __combine, __brick_reduce);
// The grain size of 3 is used in order to provide mininum 2 elements for each body
@@ -357,8 +357,8 @@ __downsweep(_Index __i, _Index __m, _Index __tilesize, _Tp* __r, _Index __lastsi
// T must have a trivial constructor and destructor.
template <class _ExecutionPolicy, typename _Index, typename _Tp, typename _Rp, typename _Cp, typename _Sp, typename _Ap>
void
-__parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __reduce, _Cp __combine, _Sp __scan,
- _Ap __apex)
+__parallel_strict_scan(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _Index __n, _Tp __initial,
+ _Rp __reduce, _Cp __combine, _Sp __scan, _Ap __apex)
{
tbb::this_task_arena::isolate([=, &__combine]() {
if (__n > 1)
@@ -397,8 +397,8 @@ __parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __redu
template <class _ExecutionPolicy, class _Index, class _Up, class _Tp, class _Cp, class _Rp, class _Sp>
_Tp
-__parallel_transform_scan(_ExecutionPolicy&&, _Index __n, _Up __u, _Tp __init, _Cp __combine, _Rp __brick_reduce,
- _Sp __scan)
+__parallel_transform_scan(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _Index __n, _Up __u, _Tp __init,
+ _Cp __combine, _Rp __brick_reduce, _Sp __scan)
{
__trans_scan_body<_Index, _Up, _Tp, _Cp, _Rp, _Sp> __body(__u, __init, __combine, __brick_reduce, __scan);
auto __range = tbb::blocked_range<_Index>(0, __n);
@@ -1157,8 +1157,8 @@ __stable_sort_func<_RandomAccessIterator1, _RandomAccessIterator2, _Compare, _Le
template <class _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _LeafSort>
void
-__parallel_stable_sort(_ExecutionPolicy&&, _RandomAccessIterator __xs, _RandomAccessIterator __xe, _Compare __comp,
- _LeafSort __leaf_sort, std::size_t __nsort = 0)
+__parallel_stable_sort(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator __xs,
+ _RandomAccessIterator __xe, _Compare __comp, _LeafSort __leaf_sort, std::size_t __nsort = 0)
{
tbb::this_task_arena::isolate([=, &__nsort]() {
//sorting based on task tree and parallel merge
@@ -1251,9 +1251,9 @@ operator()(__task* __self)
template <class _ExecutionPolicy, typename _RandomAccessIterator1, typename _RandomAccessIterator2,
typename _RandomAccessIterator3, typename _Compare, typename _LeafMerge>
void
-__parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __xs, _RandomAccessIterator1 __xe,
- _RandomAccessIterator2 __ys, _RandomAccessIterator2 __ye, _RandomAccessIterator3 __zs, _Compare __comp,
- _LeafMerge __leaf_merge)
+__parallel_merge(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _RandomAccessIterator1 __xs,
+ _RandomAccessIterator1 __xe, _RandomAccessIterator2 __ys, _RandomAccessIterator2 __ye,
+ _RandomAccessIterator3 __zs, _Compare __comp, _LeafMerge __leaf_merge)
{
typedef typename std::iterator_traits<_RandomAccessIterator1>::
diff erence_type _DifferenceType1;
typedef typename std::iterator_traits<_RandomAccessIterator2>::
diff erence_type _DifferenceType2;
@@ -1282,7 +1282,7 @@ __parallel_merge(_ExecutionPolicy&&, _RandomAccessIterator1 __xs, _RandomAccessI
//------------------------------------------------------------------------
template <class _ExecutionPolicy, typename _F1, typename _F2>
void
-__parallel_invoke(_ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
+__parallel_invoke(__pstl::__internal::__tbb_backend_tag, _ExecutionPolicy&&, _F1&& __f1, _F2&& __f2)
{
//TODO: a version of tbb::this_task_arena::isolate with variadic arguments pack should be added in the future
tbb::this_task_arena::isolate([&]() { tbb::parallel_invoke(std::forward<_F1>(__f1), std::forward<_F2>(__f2)); });
diff --git a/pstl/include/pstl/internal/parallel_impl.h b/pstl/include/pstl/internal/parallel_impl.h
index 247ff44c9556e..76b3f43e0d523 100644
--- a/pstl/include/pstl/internal/parallel_impl.h
+++ b/pstl/include/pstl/internal/parallel_impl.h
@@ -28,17 +28,19 @@ namespace __internal
//-----------------------------------------------------------------------
/** Return extremum value returned by brick f[i,j) for subranges [i,j) of [first,last)
Each f[i,j) must return a value in [i,j). */
-template <class _ExecutionPolicy, class _Index, class _Brick, class _Compare>
+template <class _BackendTag, class _ExecutionPolicy, class _Index, class _Brick, class _Compare>
_Index
-__parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f, _Compare __comp, bool __b_first)
+__parallel_find(_BackendTag __tag, _ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f,
+ _Compare __comp, bool __b_first)
{
typedef typename std::iterator_traits<_Index>::
diff erence_type _DifferenceType;
const _DifferenceType __n = __last - __first;
_DifferenceType __initial_dist = __b_first ? __n : -1;
std::atomic<_DifferenceType> __extremum(__initial_dist);
// TODO: find out what is better here: parallel_for or parallel_reduce
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__comp, __f, __first, &__extremum](_Index __i, _Index __j) {
+ __par_backend::__parallel_for(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__comp, __f, __first, &__extremum](_Index __i, _Index __j)
+ {
// See "Reducing Contention Through Priority Updates", PPoPP '13, for discussion of
// why using a shared variable scales fairly well in this situation.
if (__comp(__i - __first, __extremum))
@@ -63,13 +65,14 @@ __parallel_find(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick
// parallel_or
//------------------------------------------------------------------------
//! Return true if brick f[i,j) returns true for some subrange [i,j) of [first,last)
-template <class _ExecutionPolicy, class _Index, class _Brick>
+template <class _BackendTag, class _ExecutionPolicy, class _Index, class _Brick>
bool
-__parallel_or(_ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
+__parallel_or(_BackendTag __tag, _ExecutionPolicy&& __exec, _Index __first, _Index __last, _Brick __f)
{
std::atomic<bool> __found(false);
- __par_backend::__parallel_for(std::forward<_ExecutionPolicy>(__exec), __first, __last,
- [__f, &__found](_Index __i, _Index __j) {
+ __par_backend::__parallel_for(__tag, std::forward<_ExecutionPolicy>(__exec), __first, __last,
+ [__f, &__found](_Index __i, _Index __j)
+ {
if (!__found.load(std::memory_order_relaxed) && __f(__i, __j))
{
__found.store(true, std::memory_order_relaxed);
diff --git a/pstl/test/std/numerics/numeric.ops/scan.fail.cpp b/pstl/test/std/numerics/numeric.ops/scan.fail.cpp
index 8202dc2207c14..b17944ae08464 100644
--- a/pstl/test/std/numerics/numeric.ops/scan.fail.cpp
+++ b/pstl/test/std/numerics/numeric.ops/scan.fail.cpp
@@ -14,16 +14,6 @@
struct CustomPolicy
{
- constexpr std::false_type
- __allow_vector()
- {
- return std::false_type{};
- }
- constexpr std::false_type
- __allow_parallel()
- {
- return std::false_type{};
- }
} policy;
int32_t
diff --git a/pstl/test/support/utils.h b/pstl/test/support/utils.h
index d223204849176..ed6d48b9471ac 100644
--- a/pstl/test/support/utils.h
+++ b/pstl/test/support/utils.h
@@ -1305,7 +1305,11 @@ static void
invoke_if(Policy&&, F f)
{
#if defined(_PSTL_ICC_16_VC14_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN) || defined(_PSTL_ICC_17_VC141_TEST_SIMD_LAMBDA_DEBUG_32_BROKEN)
- __pstl::__internal::invoke_if_not(__pstl::__internal::allow_unsequenced<Policy>(), f);
+ using decay_policy = typename std::decay<Policy>::type;
+ using allow_unsequenced =
+ std::integral_constant<bool, (std::is_same<decay_policy, std::execution::unsequenced_policy>::value ||
+ std::is_same<decay_policy, std::execution::parallel_unsequenced_policy>::value)>;
+ __pstl::__internal::__invoke_if_not(allow_unsequenced{}, f);
#else
f();
#endif
More information about the libcxx-commits
mailing list