[pstl] Iterator types renaming: ForwardIterator -> RandomAccessIterator; for parallel patterns/bricks
https://reviews.llvm.org/D96266
This commit is contained in:
Mikhail Dvorskiy
parent
f515ca8995
commit
5856f20205
|
|
@ -32,9 +32,9 @@ bool
|
|||
__brick_any_of(const _ForwardIterator, const _ForwardIterator, _Pred,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Pred>
|
||||
template <class _RandomAccessIterator, class _Pred>
|
||||
bool
|
||||
__brick_any_of(const _ForwardIterator, const _ForwardIterator, _Pred,
|
||||
__brick_any_of(const _RandomAccessIterator, const _RandomAccessIterator, _Pred,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Pred, class _IsVector>
|
||||
|
|
@ -42,9 +42,9 @@ bool
|
|||
__pattern_any_of(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Pred, _IsVector,
|
||||
/*parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Pred, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Pred, class _IsVector>
|
||||
bool
|
||||
__pattern_any_of(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Pred, _IsVector,
|
||||
__pattern_any_of(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Pred, _IsVector,
|
||||
/*parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -66,9 +66,9 @@ void
|
|||
__pattern_walk1(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Function, _IsVector,
|
||||
/*parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Function, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Function, class _IsVector>
|
||||
void
|
||||
__pattern_walk1(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Function, _IsVector,
|
||||
__pattern_walk1(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Function, _IsVector,
|
||||
/*parallel=*/std::true_type);
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Brick>
|
||||
|
|
@ -76,9 +76,9 @@ void
|
|||
__pattern_walk_brick(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Brick,
|
||||
/*parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Brick>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Brick>
|
||||
void
|
||||
__pattern_walk_brick(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Brick,
|
||||
__pattern_walk_brick(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Brick,
|
||||
/*parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -123,26 +123,28 @@ template <class _ForwardIterator1, class _ForwardIterator2, class _Function>
|
|||
_ForwardIterator2 __brick_walk2(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Function>
|
||||
_ForwardIterator2 __brick_walk2(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Function>
|
||||
_RandomAccessIterator2 __brick_walk2(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Function,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function>
|
||||
_ForwardIterator2 __brick_walk2_n(_ForwardIterator1, _Size, _ForwardIterator2, _Function,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function>
|
||||
_ForwardIterator2 __brick_walk2_n(_ForwardIterator1, _Size, _ForwardIterator2, _Function,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _Size, class _RandomAccessIterator2, class _Function>
|
||||
_RandomAccessIterator2 __brick_walk2_n(_RandomAccessIterator1, _Size, _RandomAccessIterator2, _Function,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function, class _IsVector>
|
||||
_ForwardIterator2
|
||||
__pattern_walk2(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function, _IsVector,
|
||||
/*parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Function, class _IsVector>
|
||||
_ForwardIterator2
|
||||
__pattern_walk2(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Function, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Function,
|
||||
class _IsVector>
|
||||
_RandomAccessIterator2
|
||||
__pattern_walk2(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Function,
|
||||
_IsVector,
|
||||
/*parallel=*/std::true_type);
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2, class _Function,
|
||||
|
|
@ -267,9 +269,9 @@ _ForwardIterator
|
|||
__pattern_find_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_find_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_find_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Predicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -281,10 +283,10 @@ _ForwardIterator1 __brick_find_end(_ForwardIterator1, _ForwardIterator1, _Forwar
|
|||
_BinaryPredicate,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
|
||||
_ForwardIterator1 __brick_find_end(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
|
||||
_RandomAccessIterator1 __brick_find_end(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
|
|
@ -293,11 +295,11 @@ __pattern_find_end(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _Fo
|
|||
_BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
_ForwardIterator1
|
||||
__pattern_find_end(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate, _IsVector,
|
||||
_RandomAccessIterator1
|
||||
__pattern_find_end(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -309,10 +311,10 @@ _ForwardIterator1 __brick_find_first_of(_ForwardIterator1, _ForwardIterator1, _F
|
|||
_BinaryPredicate,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
|
||||
_ForwardIterator1 __brick_find_first_of(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
|
||||
_RandomAccessIterator1 __brick_find_first_of(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
|
|
@ -320,11 +322,11 @@ _ForwardIterator1
|
|||
__pattern_find_first_of(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate, _IsVector, /*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
_ForwardIterator1
|
||||
__pattern_find_first_of(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate, _IsVector, /*is_parallel=*/std::true_type) noexcept;
|
||||
_RandomAccessIterator1
|
||||
__pattern_find_first_of(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate, _IsVector, /*is_parallel=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
// search
|
||||
|
|
@ -335,10 +337,10 @@ _ForwardIterator1 __brick_search(_ForwardIterator1, _ForwardIterator1, _ForwardI
|
|||
_BinaryPredicate,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate>
|
||||
_ForwardIterator1 __brick_search(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate>
|
||||
_RandomAccessIterator1 __brick_search(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
|
|
@ -347,11 +349,11 @@ __pattern_search(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _Forw
|
|||
_BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryPredicate,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryPredicate,
|
||||
class _IsVector>
|
||||
_ForwardIterator1
|
||||
__pattern_search(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_BinaryPredicate, _IsVector,
|
||||
_RandomAccessIterator1
|
||||
__pattern_search(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -363,9 +365,9 @@ _ForwardIterator
|
|||
__brick_search_n(_ForwardIterator, _ForwardIterator, _Size, const _Tp&, _BinaryPredicate,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
|
||||
_ForwardIterator
|
||||
__brick_search_n(_ForwardIterator, _ForwardIterator, _Size, const _Tp&, _BinaryPredicate,
|
||||
template <class _RandomAccessIterator, class _Size, class _Tp, class _BinaryPredicate>
|
||||
_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,
|
||||
|
|
@ -390,8 +392,8 @@ template <class _ForwardIterator, class _Size, class _OutputIterator>
|
|||
_OutputIterator __brick_copy_n(_ForwardIterator, _Size, _OutputIterator,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Size, class _OutputIterator>
|
||||
_OutputIterator __brick_copy_n(_ForwardIterator, _Size, _OutputIterator,
|
||||
template <class _RandomAccessIterator, class _Size, class _OutputIterator>
|
||||
_OutputIterator __brick_copy_n(_RandomAccessIterator, _Size, _OutputIterator,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -426,9 +428,9 @@ _OutputIterator
|
|||
__brick_swap_ranges(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator>
|
||||
template <class _RandomAccessIterator, class _OutputIterator>
|
||||
_OutputIterator
|
||||
__brick_swap_ranges(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_swap_ranges(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -439,8 +441,8 @@ template <class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
|
|||
_OutputIterator __brick_copy_if(_ForwardIterator, _ForwardIterator, _OutputIterator, _UnaryPredicate,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator, class _UnaryPredicate>
|
||||
_OutputIterator __brick_copy_if(_ForwardIterator, _ForwardIterator, _OutputIterator, _UnaryPredicate,
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _UnaryPredicate>
|
||||
_OutputIterator __brick_copy_if(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator, _UnaryPredicate,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _DifferenceType, class _ForwardIterator, class _UnaryPredicate>
|
||||
|
|
@ -457,9 +459,9 @@ void
|
|||
__brick_copy_by_mask(_ForwardIterator, _ForwardIterator, _OutputIterator, bool*,
|
||||
/*vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator>
|
||||
template <class _RandomAccessIterator, class _OutputIterator>
|
||||
void
|
||||
__brick_copy_by_mask(_ForwardIterator, _ForwardIterator, _OutputIterator, bool* __restrict,
|
||||
__brick_copy_by_mask(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator, bool* __restrict,
|
||||
/*vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator1, class _OutputIterator2>
|
||||
|
|
@ -487,9 +489,9 @@ __pattern_copy_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterat
|
|||
// count
|
||||
//------------------------------------------------------------------------
|
||||
|
||||
template <class _ForwardIterator, class _Predicate>
|
||||
typename std::iterator_traits<_ForwardIterator>::difference_type
|
||||
__brick_count(_ForwardIterator, _ForwardIterator, _Predicate,
|
||||
template <class _RandomAccessIterator, class _Predicate>
|
||||
typename std::iterator_traits<_RandomAccessIterator>::difference_type
|
||||
__brick_count(_RandomAccessIterator, _RandomAccessIterator, _Predicate,
|
||||
/* is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Predicate>
|
||||
|
|
@ -502,9 +504,9 @@ typename std::iterator_traits<_ForwardIterator>::difference_type
|
|||
__pattern_count(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate,
|
||||
/* is_parallel */ std::false_type, _IsVector) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Predicate, class _IsVector>
|
||||
typename std::iterator_traits<_ForwardIterator>::difference_type
|
||||
__pattern_count(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Predicate,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Predicate, class _IsVector>
|
||||
typename std::iterator_traits<_RandomAccessIterator>::difference_type
|
||||
__pattern_count(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Predicate,
|
||||
/* is_parallel */ std::true_type, _IsVector);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -515,18 +517,18 @@ template <class _ForwardIterator, class _BinaryPredicate>
|
|||
_ForwardIterator __brick_unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _BinaryPredicate>
|
||||
_ForwardIterator __brick_unique(_ForwardIterator, _ForwardIterator, _BinaryPredicate,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
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>
|
||||
_ForwardIterator
|
||||
__pattern_unique(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _BinaryPredicate, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_unique(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _BinaryPredicate, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _BinaryPredicate, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_unique(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _BinaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -571,16 +573,16 @@ template <class _BidirectionalIterator>
|
|||
void __brick_reverse(_BidirectionalIterator, _BidirectionalIterator,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator>
|
||||
void __brick_reverse(_BidirectionalIterator, _BidirectionalIterator,
|
||||
template <class _RandomAccessIterator>
|
||||
void __brick_reverse(_RandomAccessIterator, _RandomAccessIterator,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator>
|
||||
void __brick_reverse(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator>
|
||||
void __brick_reverse(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator,
|
||||
template <class _RandomAccessIterator>
|
||||
void __brick_reverse(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _BidirectionalIterator, class _IsVector>
|
||||
|
|
@ -588,9 +590,9 @@ void
|
|||
__pattern_reverse(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _BidirectionalIterator, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
|
||||
void
|
||||
__pattern_reverse(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _IsVector,
|
||||
__pattern_reverse(_RandomAccessIterator&&, _RandomAccessIterator, _RandomAccessIterator, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -601,8 +603,8 @@ template <class _BidirectionalIterator, class _OutputIterator>
|
|||
_OutputIterator __brick_reverse_copy(_BidirectionalIterator, _BidirectionalIterator, _OutputIterator,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator, class _OutputIterator>
|
||||
_OutputIterator __brick_reverse_copy(_BidirectionalIterator, _BidirectionalIterator, _OutputIterator,
|
||||
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>
|
||||
|
|
@ -610,9 +612,9 @@ _OutputIterator
|
|||
__pattern_reverse_copy(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _OutputIterator, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _BidirectionalIterator, class _OutputIterator, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_reverse_copy(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _OutputIterator, _IsVector,
|
||||
__pattern_reverse_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -623,18 +625,18 @@ template <class _ForwardIterator>
|
|||
_ForwardIterator __brick_rotate(_ForwardIterator, _ForwardIterator, _ForwardIterator,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator>
|
||||
_ForwardIterator __brick_rotate(_ForwardIterator, _ForwardIterator, _ForwardIterator,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator>
|
||||
_RandomAccessIterator __brick_rotate(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_rotate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_rotate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_rotate(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -645,8 +647,9 @@ template <class _ForwardIterator, class _OutputIterator>
|
|||
_OutputIterator __brick_rotate_copy(_ForwardIterator, _ForwardIterator, _ForwardIterator, _OutputIterator,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator>
|
||||
_OutputIterator __brick_rotate_copy(_ForwardIterator, _ForwardIterator, _ForwardIterator, _OutputIterator,
|
||||
template <class _RandomAccessIterator, class _OutputIterator>
|
||||
_OutputIterator __brick_rotate_copy(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
|
||||
_OutputIterator,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _IsVector>
|
||||
|
|
@ -655,10 +658,10 @@ __pattern_rotate_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _F
|
|||
_IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_rotate_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _ForwardIterator, _OutputIterator,
|
||||
_IsVector,
|
||||
__pattern_rotate_copy(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
|
||||
_OutputIterator, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -669,8 +672,8 @@ template <class _ForwardIterator, class _UnaryPredicate>
|
|||
bool __brick_is_partitioned(_ForwardIterator, _ForwardIterator, _UnaryPredicate,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _UnaryPredicate>
|
||||
bool __brick_is_partitioned(_ForwardIterator, _ForwardIterator, _UnaryPredicate,
|
||||
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>
|
||||
|
|
@ -678,9 +681,9 @@ bool
|
|||
__pattern_is_partitioned(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
|
||||
bool
|
||||
__pattern_is_partitioned(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
__pattern_is_partitioned(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -691,18 +694,18 @@ template <class _ForwardIterator, class _UnaryPredicate>
|
|||
_ForwardIterator __brick_partition(_ForwardIterator, _ForwardIterator, _UnaryPredicate,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _UnaryPredicate>
|
||||
_ForwardIterator __brick_partition(_ForwardIterator, _ForwardIterator, _UnaryPredicate,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
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>
|
||||
_ForwardIterator
|
||||
__pattern_partition(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_partition(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_partition(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -713,9 +716,9 @@ template <class _BidirectionalIterator, class _UnaryPredicate>
|
|||
_BidirectionalIterator __brick_stable_partition(_BidirectionalIterator, _BidirectionalIterator, _UnaryPredicate,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator, class _UnaryPredicate>
|
||||
_BidirectionalIterator __brick_stable_partition(_BidirectionalIterator, _BidirectionalIterator, _UnaryPredicate,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
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>
|
||||
_BidirectionalIterator
|
||||
|
|
@ -723,10 +726,9 @@ __pattern_stable_partition(_ExecutionPolicy&&, _BidirectionalIterator, _Bidirect
|
|||
_IsVector,
|
||||
/*is_parallelization=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _BidirectionalIterator, class _UnaryPredicate, class _IsVector>
|
||||
_BidirectionalIterator
|
||||
__pattern_stable_partition(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _UnaryPredicate,
|
||||
_IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_stable_partition(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallelization=*/std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -738,10 +740,11 @@ std::pair<_OutputIterator1, _OutputIterator2>
|
|||
__brick_partition_copy(_ForwardIterator, _ForwardIterator, _OutputIterator1, _OutputIterator2, _UnaryPredicate,
|
||||
/*is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator1, class _OutputIterator2, class _UnaryPredicate>
|
||||
std::pair<_OutputIterator1, _OutputIterator2>
|
||||
__brick_partition_copy(_ForwardIterator, _ForwardIterator, _OutputIterator1, _OutputIterator2, _UnaryPredicate,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator, class _OutputIterator1, class _OutputIterator2, class _UnaryPredicate>
|
||||
std::pair<_OutputIterator1, _OutputIterator2> __brick_partition_copy(_RandomAccessIterator, _RandomAccessIterator,
|
||||
_OutputIterator1, _OutputIterator2,
|
||||
_UnaryPredicate,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator1, class _OutputIterator2,
|
||||
class _UnaryPredicate, class _IsVector>
|
||||
|
|
@ -809,25 +812,27 @@ __pattern_partial_sort(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessI
|
|||
// partial_sort_copy
|
||||
//------------------------------------------------------------------------
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_partial_sort_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _RandomAccessIterator,
|
||||
_RandomAccessIterator, _Compare, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
|
||||
class _IsVector>
|
||||
_RandomAccessIterator2
|
||||
__pattern_partial_sort_copy(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _RandomAccessIterator, class _Compare, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_partial_sort_copy(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _RandomAccessIterator,
|
||||
_RandomAccessIterator, _Compare, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
|
||||
class _IsVector>
|
||||
_RandomAccessIterator2
|
||||
__pattern_partial_sort_copy(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
// adjacent_find
|
||||
//------------------------------------------------------------------------
|
||||
|
||||
template <class _ForwardIterator, class _BinaryPredicate>
|
||||
_ForwardIterator
|
||||
__brick_adjacent_find(_ForwardIterator, _ForwardIterator, _BinaryPredicate,
|
||||
template <class _RandomAccessIterator, class _BinaryPredicate>
|
||||
_RandomAccessIterator
|
||||
__brick_adjacent_find(_RandomAccessIterator, _RandomAccessIterator, _BinaryPredicate,
|
||||
/* IsVector = */ std::true_type, bool) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _BinaryPredicate>
|
||||
|
|
@ -863,9 +868,9 @@ __pattern_nth_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIt
|
|||
//------------------------------------------------------------------------
|
||||
// fill, fill_n
|
||||
//------------------------------------------------------------------------
|
||||
template <class _ForwardIterator, class _Tp>
|
||||
template <class _RandomAccessIterator, class _Tp>
|
||||
void
|
||||
__brick_fill(_ForwardIterator, _ForwardIterator, const _Tp&,
|
||||
__brick_fill(_RandomAccessIterator, _RandomAccessIterator, const _Tp&,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Tp>
|
||||
|
|
@ -878,14 +883,14 @@ void
|
|||
__pattern_fill(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&,
|
||||
/*is_parallel=*/std::false_type, _IsVector) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_fill(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, const _Tp&,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_fill(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, const _Tp&,
|
||||
/*is_parallel=*/std::true_type, _IsVector);
|
||||
|
||||
template <class _OutputIterator, class _Size, class _Tp>
|
||||
_OutputIterator
|
||||
__brick_fill_n(_OutputIterator, _Size, const _Tp&,
|
||||
template <class _RandomAccessIterator, class _Size, class _Tp>
|
||||
_RandomAccessIterator
|
||||
__brick_fill_n(_RandomAccessIterator, _Size, const _Tp&,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _OutputIterator, class _Size, class _Tp>
|
||||
|
|
@ -898,9 +903,9 @@ _OutputIterator
|
|||
__pattern_fill_n(_ExecutionPolicy&&, _OutputIterator, _Size, const _Tp&,
|
||||
/*is_parallel=*/std::false_type, _IsVector) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _OutputIterator, class _Size, class _Tp, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_fill_n(_ExecutionPolicy&&, _OutputIterator, _Size, const _Tp&,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Tp, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_fill_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, const _Tp&,
|
||||
/*is_parallel=*/std::true_type, _IsVector);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -920,14 +925,14 @@ void
|
|||
__pattern_generate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Generator,
|
||||
/*is_parallel=*/std::false_type, _IsVector) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Generator, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_generate(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Generator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Generator, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_generate(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Generator,
|
||||
/*is_parallel=*/std::true_type, _IsVector);
|
||||
|
||||
template <class OutputIterator, class Size, class _Generator>
|
||||
OutputIterator __brick_generate_n(OutputIterator, Size, _Generator,
|
||||
/* is_vector = */ std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator, class Size, class _Generator>
|
||||
_RandomAccessIterator __brick_generate_n(_RandomAccessIterator, Size, _Generator,
|
||||
/* is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class OutputIterator, class Size, class _Generator>
|
||||
OutputIterator __brick_generate_n(OutputIterator, Size, _Generator,
|
||||
|
|
@ -938,9 +943,9 @@ OutputIterator
|
|||
__pattern_generate_n(_ExecutionPolicy&&, OutputIterator, Size, _Generator,
|
||||
/*is_parallel=*/std::false_type, _IsVector) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class OutputIterator, class Size, class _Generator, class _IsVector>
|
||||
OutputIterator
|
||||
__pattern_generate_n(_ExecutionPolicy&&, OutputIterator, Size, _Generator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class Size, class _Generator, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_generate_n(_ExecutionPolicy&&, _RandomAccessIterator, Size, _Generator,
|
||||
/*is_parallel=*/std::true_type, _IsVector);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -959,9 +964,9 @@ _ForwardIterator
|
|||
__pattern_remove_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel*/ std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _UnaryPredicate, class _IsVector>
|
||||
_ForwardIterator
|
||||
__pattern_remove_if(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _UnaryPredicate, _IsVector,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _UnaryPredicate, class _IsVector>
|
||||
_RandomAccessIterator
|
||||
__pattern_remove_if(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _UnaryPredicate, _IsVector,
|
||||
/*is_parallel*/ std::true_type) noexcept;
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -973,9 +978,9 @@ _OutputIterator __brick_merge(_ForwardIterator1, _ForwardIterator1, _ForwardIter
|
|||
_OutputIterator, _Compare,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_merge(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_merge(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
|
|
@ -999,8 +1004,8 @@ template <class _BidirectionalIterator, class _Compare>
|
|||
void __brick_inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <class _BidirectionalIterator, class _Compare>
|
||||
void __brick_inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare,
|
||||
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>
|
||||
|
|
@ -1009,9 +1014,9 @@ __pattern_inplace_merge(_ExecutionPolicy&&, _BidirectionalIterator, _Bidirection
|
|||
_Compare, _IsVector,
|
||||
/* is_parallel = */ std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _BidirectionalIterator, class _Compare, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Compare, class _IsVector>
|
||||
void
|
||||
__pattern_inplace_merge(_ExecutionPolicy&&, _BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator,
|
||||
__pattern_inplace_merge(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator,
|
||||
_Compare, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
|
|
@ -1025,10 +1030,11 @@ __pattern_includes(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _Fo
|
|||
_Compare, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
|
||||
class _IsVector>
|
||||
bool
|
||||
__pattern_includes(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_Compare, _IsVector,
|
||||
__pattern_includes(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -1040,9 +1046,9 @@ _OutputIterator __brick_set_union(_ForwardIterator1, _ForwardIterator1, _Forward
|
|||
_OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_union(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_union(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
|
|
@ -1051,11 +1057,11 @@ _OutputIterator
|
|||
__pattern_set_union(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
|
||||
class _Compare, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_set_union(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
|
||||
__pattern_set_union(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
// set_intersection
|
||||
|
|
@ -1066,9 +1072,9 @@ _OutputIterator __brick_set_intersection(_ForwardIterator1, _ForwardIterator1, _
|
|||
_OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_intersection(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_intersection(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
|
|
@ -1078,11 +1084,12 @@ __pattern_set_intersection(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterat
|
|||
_ForwardIterator2, _OutputIterator, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
|
||||
class _Compare, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_set_intersection(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
|
||||
_ForwardIterator2, _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
|
||||
__pattern_set_intersection(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
// set_difference
|
||||
|
|
@ -1093,9 +1100,9 @@ _OutputIterator __brick_set_difference(_ForwardIterator1, _ForwardIterator1, _Fo
|
|||
_OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_difference(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_difference(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
|
|
@ -1104,11 +1111,11 @@ _OutputIterator
|
|||
__pattern_set_difference(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
|
||||
class _Compare, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_set_difference(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
|
||||
__pattern_set_difference(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare, _IsVector, /*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
// set_symmetric_difference
|
||||
|
|
@ -1119,9 +1126,9 @@ _OutputIterator __brick_set_symmetric_difference(_ForwardIterator1, _ForwardIter
|
|||
_ForwardIterator2, _OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_symmetric_difference(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
|
||||
_ForwardIterator2, _OutputIterator, _Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator, class _Compare>
|
||||
_OutputIterator __brick_set_symmetric_difference(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _OutputIterator, _Compare,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
|
|
@ -1131,11 +1138,11 @@ __pattern_set_symmetric_difference(_ExecutionPolicy&&, _ForwardIterator1, _Forwa
|
|||
_ForwardIterator2, _OutputIterator, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _OutputIterator,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _OutputIterator,
|
||||
class _Compare, class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_set_symmetric_difference(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
|
||||
_ForwardIterator2, _OutputIterator, _Compare, _IsVector,
|
||||
__pattern_set_symmetric_difference(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
|
||||
_RandomAccessIterator2, _RandomAccessIterator2, _OutputIterator, _Compare, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -1168,9 +1175,9 @@ template <typename _ForwardIterator, typename _Compare>
|
|||
_ForwardIterator __brick_min_element(_ForwardIterator, _ForwardIterator, _Compare,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <typename _ForwardIterator, typename _Compare>
|
||||
_ForwardIterator __brick_min_element(_ForwardIterator, _ForwardIterator, _Compare,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
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>
|
||||
_ForwardIterator
|
||||
|
|
@ -1190,18 +1197,19 @@ template <typename _ForwardIterator, typename _Compare>
|
|||
std::pair<_ForwardIterator, _ForwardIterator> __brick_minmax_element(_ForwardIterator, _ForwardIterator, _Compare,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <typename _ForwardIterator, typename _Compare>
|
||||
std::pair<_ForwardIterator, _ForwardIterator> __brick_minmax_element(_ForwardIterator, _ForwardIterator, _Compare,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
template <typename _RandomAccessIterator, typename _Compare>
|
||||
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>
|
||||
std::pair<_ForwardIterator, _ForwardIterator>
|
||||
__pattern_minmax_element(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare, _IsVector,
|
||||
/* is_parallel = */ std::false_type) noexcept;
|
||||
|
||||
template <typename _ExecutionPolicy, typename _ForwardIterator, typename _Compare, typename _IsVector>
|
||||
std::pair<_ForwardIterator, _ForwardIterator>
|
||||
__pattern_minmax_element(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Compare, _IsVector,
|
||||
template <typename _ExecutionPolicy, typename _RandomAccessIterator, typename _Compare, typename _IsVector>
|
||||
std::pair<_RandomAccessIterator, _RandomAccessIterator>
|
||||
__pattern_minmax_element(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Compare, _IsVector,
|
||||
/* is_parallel = */ std::true_type);
|
||||
|
||||
//------------------------------------------------------------------------
|
||||
|
|
@ -1213,10 +1221,11 @@ std::pair<_ForwardIterator1, _ForwardIterator2> __brick_mismatch(_ForwardIterato
|
|||
_ForwardIterator2, _ForwardIterator2, _Predicate,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Predicate>
|
||||
std::pair<_ForwardIterator1, _ForwardIterator2> __brick_mismatch(_ForwardIterator1, _ForwardIterator1,
|
||||
_ForwardIterator2, _ForwardIterator2, _Predicate,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Predicate>
|
||||
std::pair<_RandomAccessIterator1, _RandomAccessIterator2>
|
||||
__brick_mismatch(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _RandomAccessIterator2,
|
||||
_Predicate,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Predicate, class _IsVector>
|
||||
std::pair<_ForwardIterator1, _ForwardIterator2>
|
||||
|
|
@ -1239,9 +1248,9 @@ bool __brick_lexicographical_compare(_ForwardIterator1, _ForwardIterator1, _Forw
|
|||
_Compare,
|
||||
/* __is_vector = */ std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Compare>
|
||||
bool __brick_lexicographical_compare(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _ForwardIterator2,
|
||||
_Compare,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare>
|
||||
bool __brick_lexicographical_compare(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2,
|
||||
_RandomAccessIterator2, _Compare,
|
||||
/* __is_vector = */ std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
|
||||
|
|
@ -1249,10 +1258,12 @@ bool
|
|||
__pattern_lexicographical_compare(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
|
||||
_ForwardIterator2, _Compare, _IsVector, /* is_parallel = */ std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _Compare, class _IsVector>
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _Compare,
|
||||
class _IsVector>
|
||||
bool
|
||||
__pattern_lexicographical_compare(_ExecutionPolicy&&, _ForwardIterator1, _ForwardIterator1, _ForwardIterator2,
|
||||
_ForwardIterator2, _Compare, _IsVector, /* is_parallel = */ std::true_type) noexcept;
|
||||
__pattern_lexicographical_compare(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAccessIterator1,
|
||||
_RandomAccessIterator2, _RandomAccessIterator2, _Compare, _IsVector,
|
||||
/* is_parallel = */ std::true_type) noexcept;
|
||||
|
||||
} // namespace __internal
|
||||
} // namespace __pstl
|
||||
|
|
|
|||
File diff suppressed because it is too large
Load diff
|
|
@ -39,13 +39,13 @@ __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _O
|
|||
return __result;
|
||||
}
|
||||
|
||||
template <typename _ForwardIterator, typename _OutputIterator>
|
||||
template <typename _RandomAccessIterator, typename _OutputIterator>
|
||||
_OutputIterator
|
||||
__brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_uninitialized_move(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
/*vector=*/std::true_type) noexcept
|
||||
{
|
||||
using __ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
||||
using _ReferenceType1 = typename std::iterator_traits<_ForwardIterator>::reference;
|
||||
using _ReferenceType1 = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
||||
using _ReferenceType2 = typename std::iterator_traits<_OutputIterator>::reference;
|
||||
|
||||
return __unseq_backend::__simd_walk_2(
|
||||
|
|
@ -63,12 +63,12 @@ __brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type)
|
|||
__first->~_ValueType();
|
||||
}
|
||||
|
||||
template <typename _Iterator>
|
||||
template <typename _RandomAccessIterator>
|
||||
void
|
||||
__brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::true_type) noexcept
|
||||
__brick_destroy(_RandomAccessIterator __first, _RandomAccessIterator __last, /*vector*/ std::true_type) noexcept
|
||||
{
|
||||
using _ValueType = typename std::iterator_traits<_Iterator>::value_type;
|
||||
using _ReferenceType = typename std::iterator_traits<_Iterator>::reference;
|
||||
using _ValueType = typename std::iterator_traits<_RandomAccessIterator>::value_type;
|
||||
using _ReferenceType = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
||||
|
||||
__unseq_backend::__simd_walk_1(__first, __last - __first, [](_ReferenceType __x) { __x.~_ValueType(); });
|
||||
}
|
||||
|
|
@ -90,13 +90,13 @@ __brick_uninitialized_copy(_ForwardIterator __first, _ForwardIterator __last, _O
|
|||
return __result;
|
||||
}
|
||||
|
||||
template <typename _ForwardIterator, typename _OutputIterator>
|
||||
template <typename _RandomAccessIterator, typename _OutputIterator>
|
||||
_OutputIterator
|
||||
__brick_uninitialized_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_uninitialized_copy(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
/*vector=*/std::true_type) noexcept
|
||||
{
|
||||
using __ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
||||
using _ReferenceType1 = typename std::iterator_traits<_ForwardIterator>::reference;
|
||||
using _ReferenceType1 = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
||||
using _ReferenceType2 = typename std::iterator_traits<_OutputIterator>::reference;
|
||||
|
||||
return __unseq_backend::__simd_walk_2(
|
||||
|
|
|
|||
|
|
@ -26,9 +26,10 @@ namespace __internal
|
|||
// transform_reduce (version with two binary functions, according to draft N4659)
|
||||
//------------------------------------------------------------------------
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
|
||||
_Tp __brick_transform_reduce(_ForwardIterator1, _ForwardIterator1, _ForwardIterator2, _Tp, _BinaryOperation1,
|
||||
_BinaryOperation2,
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Tp, class _BinaryOperation1,
|
||||
class _BinaryOperation2>
|
||||
_Tp __brick_transform_reduce(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Tp,
|
||||
_BinaryOperation1, _BinaryOperation2,
|
||||
/*__is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
|
||||
|
|
@ -54,8 +55,8 @@ __pattern_transform_reduce(_ExecutionPolicy&&, _RandomAccessIterator1, _RandomAc
|
|||
// transform_reduce (version with unary and binary functions)
|
||||
//------------------------------------------------------------------------
|
||||
|
||||
template <class _ForwardIterator, class _Tp, class _UnaryOperation, class _BinaryOperation>
|
||||
_Tp __brick_transform_reduce(_ForwardIterator, _ForwardIterator, _Tp, _BinaryOperation, _UnaryOperation,
|
||||
template <class _RandomAccessIterator, class _Tp, class _UnaryOperation, class _BinaryOperation>
|
||||
_Tp __brick_transform_reduce(_RandomAccessIterator, _RandomAccessIterator, _Tp, _BinaryOperation, _UnaryOperation,
|
||||
/*is_vector=*/std::true_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation>
|
||||
|
|
@ -69,10 +70,10 @@ __pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterato
|
|||
_UnaryOperation, _IsVector,
|
||||
/*is_parallel=*/std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
|
||||
class _IsVector>
|
||||
_Tp
|
||||
__pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _Tp, _BinaryOperation,
|
||||
__pattern_transform_reduce(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _Tp, _BinaryOperation,
|
||||
_UnaryOperation, _IsVector,
|
||||
/*is_parallel=*/std::true_type);
|
||||
|
||||
|
|
@ -87,8 +88,8 @@ std::pair<_OutputIterator, _Tp> __brick_transform_scan(_ForwardIterator, _Forwar
|
|||
_UnaryOperation, _Tp, _BinaryOperation,
|
||||
/*Inclusive*/ std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation>
|
||||
std::pair<_OutputIterator, _Tp> __brick_transform_scan(_ForwardIterator, _ForwardIterator, _OutputIterator,
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation>
|
||||
std::pair<_OutputIterator, _Tp> __brick_transform_scan(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
|
||||
_UnaryOperation, _Tp, _BinaryOperation,
|
||||
/*Inclusive*/ std::true_type) noexcept;
|
||||
|
||||
|
|
@ -119,8 +120,9 @@ template <class _ForwardIterator, class _OutputIterator, class _BinaryOperation>
|
|||
_OutputIterator __brick_adjacent_difference(_ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryOperation,
|
||||
/*is_vector*/ std::false_type) noexcept;
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator, class _BinaryOperation>
|
||||
_OutputIterator __brick_adjacent_difference(_ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryOperation,
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _BinaryOperation>
|
||||
_OutputIterator __brick_adjacent_difference(_RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
|
||||
_BinaryOperation,
|
||||
/*is_vector*/ std::true_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation,
|
||||
|
|
@ -129,11 +131,11 @@ _OutputIterator
|
|||
__pattern_adjacent_difference(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryOperation,
|
||||
_IsVector, /*is_parallel*/ std::false_type) noexcept;
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _OutputIterator, class _BinaryOperation,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _OutputIterator, class _BinaryOperation,
|
||||
class _IsVector>
|
||||
_OutputIterator
|
||||
__pattern_adjacent_difference(_ExecutionPolicy&&, _ForwardIterator, _ForwardIterator, _OutputIterator, _BinaryOperation,
|
||||
_IsVector, /*is_parallel*/ std::true_type);
|
||||
__pattern_adjacent_difference(_ExecutionPolicy&&, _RandomAccessIterator, _RandomAccessIterator, _OutputIterator,
|
||||
_BinaryOperation, _IsVector, /*is_parallel*/ std::true_type);
|
||||
|
||||
} // namespace __internal
|
||||
} // namespace __pstl
|
||||
|
|
|
|||
|
|
@ -40,13 +40,15 @@ __brick_transform_reduce(_ForwardIterator1 __first1, _ForwardIterator1 __last1,
|
|||
return std::inner_product(__first1, __last1, __first2, __init, __binary_op1, __binary_op2);
|
||||
}
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class _Tp, class _BinaryOperation1,
|
||||
class _BinaryOperation2>
|
||||
_Tp
|
||||
__brick_transform_reduce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _Tp __init,
|
||||
_BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2,
|
||||
__brick_transform_reduce(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1,
|
||||
_RandomAccessIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1,
|
||||
_BinaryOperation2 __binary_op2,
|
||||
/*is_vector=*/std::true_type) noexcept
|
||||
{
|
||||
typedef typename std::iterator_traits<_ForwardIterator1>::difference_type _DifferenceType;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator1>::difference_type _DifferenceType;
|
||||
return __unseq_backend::__simd_transform_reduce(
|
||||
__last1 - __first1, __init, __binary_op1,
|
||||
[=, &__binary_op2](_DifferenceType __i) { return __binary_op2(__first1[__i], __first2[__i]); });
|
||||
|
|
@ -98,12 +100,13 @@ __brick_transform_reduce(_ForwardIterator __first, _ForwardIterator __last, _Tp
|
|||
return std::transform_reduce(__first, __last, __init, __binary_op, __unary_op);
|
||||
}
|
||||
|
||||
template <class _ForwardIterator, class _Tp, class _UnaryOperation, class _BinaryOperation>
|
||||
template <class _RandomAccessIterator, class _Tp, class _UnaryOperation, class _BinaryOperation>
|
||||
_Tp
|
||||
__brick_transform_reduce(_ForwardIterator __first, _ForwardIterator __last, _Tp __init, _BinaryOperation __binary_op,
|
||||
_UnaryOperation __unary_op, /*is_vector=*/std::true_type) noexcept
|
||||
__brick_transform_reduce(_RandomAccessIterator __first, _RandomAccessIterator __last, _Tp __init,
|
||||
_BinaryOperation __binary_op, _UnaryOperation __unary_op,
|
||||
/*is_vector=*/std::true_type) noexcept
|
||||
{
|
||||
typedef typename std::iterator_traits<_ForwardIterator>::difference_type _DifferenceType;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type _DifferenceType;
|
||||
return __unseq_backend::__simd_transform_reduce(
|
||||
__last - __first, __init, __binary_op,
|
||||
[=, &__unary_op](_DifferenceType __i) { return __unary_op(__first[__i]); });
|
||||
|
|
@ -119,18 +122,18 @@ __pattern_transform_reduce(_ExecutionPolicy&&, _ForwardIterator __first, _Forwar
|
|||
return __internal::__brick_transform_reduce(__first, __last, __init, __binary_op, __unary_op, __is_vector);
|
||||
}
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator, class _Tp, class _BinaryOperation, class _UnaryOperation,
|
||||
class _IsVector>
|
||||
_Tp
|
||||
__pattern_transform_reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init,
|
||||
_BinaryOperation __binary_op, _UnaryOperation __unary_op, _IsVector __is_vector,
|
||||
__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)
|
||||
{
|
||||
return __internal::__except_handler([&]() {
|
||||
return __par_backend::__parallel_transform_reduce(
|
||||
std::forward<_ExecutionPolicy>(__exec), __first, __last,
|
||||
[__unary_op](_ForwardIterator __i) mutable { return __unary_op(*__i); }, __init, __binary_op,
|
||||
[__unary_op, __binary_op, __is_vector](_ForwardIterator __i, _ForwardIterator __j, _Tp __init) {
|
||||
[__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);
|
||||
});
|
||||
});
|
||||
|
|
@ -159,9 +162,9 @@ __brick_transform_scan(_ForwardIterator __first, _ForwardIterator __last, _Outpu
|
|||
}
|
||||
|
||||
// Inclusive form
|
||||
template <class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation>
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation>
|
||||
std::pair<_OutputIterator, _Tp>
|
||||
__brick_transform_scan(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_transform_scan(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
_UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op,
|
||||
/*Inclusive*/ std::true_type, /*is_vector=*/std::false_type) noexcept
|
||||
{
|
||||
|
|
@ -181,10 +184,10 @@ using is_arithmetic_udop = std::integral_constant<bool, std::is_arithmetic<_Tp>:
|
|||
|
||||
// [restriction] - T shall be DefaultConstructible.
|
||||
// [violation] - default ctor of T shall set the identity value for binary_op.
|
||||
template <class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation,
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation,
|
||||
class _Inclusive>
|
||||
typename std::enable_if<!is_arithmetic_udop<_Tp, _BinaryOperation>::value, std::pair<_OutputIterator, _Tp>>::type
|
||||
__brick_transform_scan(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_transform_scan(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
_UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, _Inclusive,
|
||||
/*is_vector=*/std::true_type) noexcept
|
||||
{
|
||||
|
|
@ -198,10 +201,10 @@ __brick_transform_scan(_ForwardIterator __first, _ForwardIterator __last, _Outpu
|
|||
#endif
|
||||
}
|
||||
|
||||
template <class _ForwardIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation,
|
||||
template <class _RandomAccessIterator, class _OutputIterator, class _UnaryOperation, class _Tp, class _BinaryOperation,
|
||||
class _Inclusive>
|
||||
typename std::enable_if<is_arithmetic_udop<_Tp, _BinaryOperation>::value, std::pair<_OutputIterator, _Tp>>::type
|
||||
__brick_transform_scan(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
||||
__brick_transform_scan(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
||||
_UnaryOperation __unary_op, _Tp __init, _BinaryOperation __binary_op, _Inclusive,
|
||||
/*is_vector=*/std::true_type) noexcept
|
||||
{
|
||||
|
|
@ -299,15 +302,16 @@ __brick_adjacent_difference(_ForwardIterator __first, _ForwardIterator __last, _
|
|||
return std::adjacent_difference(__first, __last, __d_first, __op);
|
||||
}
|
||||
|
||||
template <class _ForwardIterator1, class _ForwardIterator2, class BinaryOperation>
|
||||
_ForwardIterator2
|
||||
__brick_adjacent_difference(_ForwardIterator1 __first, _ForwardIterator1 __last, _ForwardIterator2 __d_first,
|
||||
BinaryOperation __op, /*is_vector=*/std::true_type) noexcept
|
||||
template <class _RandomAccessIterator1, class _RandomAccessIterator2, class BinaryOperation>
|
||||
_RandomAccessIterator2
|
||||
__brick_adjacent_difference(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
|
||||
_RandomAccessIterator2 __d_first, BinaryOperation __op,
|
||||
/*is_vector=*/std::true_type) noexcept
|
||||
{
|
||||
_PSTL_ASSERT(__first != __last);
|
||||
|
||||
typedef typename std::iterator_traits<_ForwardIterator1>::reference _ReferenceType1;
|
||||
typedef typename std::iterator_traits<_ForwardIterator2>::reference _ReferenceType2;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator1>::reference _ReferenceType1;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator2>::reference _ReferenceType2;
|
||||
|
||||
auto __n = __last - __first;
|
||||
*__d_first = *__first;
|
||||
|
|
@ -326,22 +330,22 @@ __pattern_adjacent_difference(_ExecutionPolicy&&, _ForwardIterator __first, _For
|
|||
return __internal::__brick_adjacent_difference(__first, __last, __d_first, __op, __is_vector);
|
||||
}
|
||||
|
||||
template <class _ExecutionPolicy, class _ForwardIterator1, class _ForwardIterator2, class _BinaryOperation,
|
||||
template <class _ExecutionPolicy, class _RandomAccessIterator1, class _RandomAccessIterator2, class _BinaryOperation,
|
||||
class _IsVector>
|
||||
_ForwardIterator2
|
||||
__pattern_adjacent_difference(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _ForwardIterator1 __last,
|
||||
_ForwardIterator2 __d_first, _BinaryOperation __op, _IsVector __is_vector,
|
||||
_RandomAccessIterator2
|
||||
__pattern_adjacent_difference(_ExecutionPolicy&& __exec, _RandomAccessIterator1 __first, _RandomAccessIterator1 __last,
|
||||
_RandomAccessIterator2 __d_first, _BinaryOperation __op, _IsVector __is_vector,
|
||||
/*is_parallel=*/std::true_type)
|
||||
{
|
||||
_PSTL_ASSERT(__first != __last);
|
||||
typedef typename std::iterator_traits<_ForwardIterator1>::reference _ReferenceType1;
|
||||
typedef typename std::iterator_traits<_ForwardIterator2>::reference _ReferenceType2;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator1>::reference _ReferenceType1;
|
||||
typedef typename std::iterator_traits<_RandomAccessIterator2>::reference _ReferenceType2;
|
||||
|
||||
*__d_first = *__first;
|
||||
__par_backend::__parallel_for(
|
||||
std::forward<_ExecutionPolicy>(__exec), __first, __last - 1,
|
||||
[&__op, __is_vector, __d_first, __first](_ForwardIterator1 __b, _ForwardIterator1 __e) {
|
||||
_ForwardIterator2 __d_b = __d_first + (__b - __first);
|
||||
[&__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); },
|
||||
|
|
|
|||
Loading…
Reference in a new issue