| /external/llvm-project/pstl/include/pstl/internal/ |
| D | parallel_backend_utils.h | 143 …_union_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in __set_union_construct() argument
151 if (__first2 == __last2) in __set_union_construct()
153 if (__comp(*__first2, *__first1)) in __set_union_construct()
155 ::new (std::addressof(*__result)) _Tp(*__first2); in __set_union_construct()
156 ++__first2; in __set_union_construct()
161 if (!__comp(*__first1, *__first2)) in __set_union_construct()
162 ++__first2; in __set_union_construct()
166 return __cc_range(__first2, __last2, __result); in __set_union_construct()
171 …ection_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in __set_intersection_construct() argument
176 for (; __first1 != __last1 && __first2 != __last2;) in __set_intersection_construct()
[all …]
|
| D | algorithm_impl.h | 215 __brick_walk2(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _F… in __brick_walk2() argument
218 for (; __first1 != __last1; ++__first1, ++__first2) in __brick_walk2()
219 __f(*__first1, *__first2); in __brick_walk2()
220 return __first2; in __brick_walk2()
225 __brick_walk2(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _F… in __brick_walk2() argument
228 return __unseq_backend::__simd_walk_2(__first1, __last1 - __first1, __first2, __f); in __brick_walk2()
233 __brick_walk2_n(_ForwardIterator1 __first1, _Size __n, _ForwardIterator2 __first2, _Function __f, in __brick_walk2_n() argument
236 for (; __n > 0; --__n, ++__first1, ++__first2) in __brick_walk2_n()
237 __f(*__first1, *__first2); in __brick_walk2_n()
238 return __first2; in __brick_walk2_n()
[all …]
|
| D | glue_algorithm_impl.h | 304 _ForwardIterator2 __first2) in swap_ranges() argument
309 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, in swap_ranges()
341 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in transform() argument
348 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __result, in transform()
678 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in mismatch() argument
682 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __pred, in mismatch()
691 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in mismatch() argument
694 …return std::mismatch(__exec, __first1, __last1, __first2, std::next(__first2, std::distance(__firs… in mismatch()
700 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in mismatch() argument
703 … return std::mismatch(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, in mismatch()
[all …]
|
| D | glue_algorithm_defs.h | 154 _ForwardIterator2 __first2);
166 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
316 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
321 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
326 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
331 …olicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2);
337 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
342 …olicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2);
346 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
351 …Policy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2,
[all …]
|
| D | numeric_impl.h | 36 …duce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _Tp __init, in __brick_transform_reduce() argument
40 return std::inner_product(__first1, __last1, __first2, __init, __binary_op1, __binary_op2); in __brick_transform_reduce()
45 …duce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _Tp __init, in __brick_transform_reduce() argument
52 … [=, &__binary_op2](_DifferenceType __i) { return __binary_op2(__first1[__i], __first2[__i]); }); in __brick_transform_reduce()
59 _ForwardIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, in __pattern_transform_reduce() argument
63 …return __brick_transform_reduce(__first1, __last1, __first2, __init, __binary_op1, __binary_op2, _… in __pattern_transform_reduce()
70 … _RandomAccessIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, in __pattern_transform_reduce() argument
76 [__first1, __first2, __binary_op2](_RandomAccessIterator1 __i) mutable { in __pattern_transform_reduce()
77 return __binary_op2(*__i, *(__first2 + (__i - __first1))); in __pattern_transform_reduce()
81 [__first1, __first2, __binary_op1, __binary_op2, in __pattern_transform_reduce()
[all …]
|
| D | unseq_backend_simd.h | 44 __simd_walk_2(_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Function __f) noexcept in __simd_walk_2() argument
48 __f(__first1[__i], __first2[__i]); in __simd_walk_2()
49 return __first2 + __n; in __simd_walk_2()
54 __simd_walk_3(_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Iterator3 __first3, in __simd_walk_3() argument
59 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_walk_3()
166 __simd_first(_Index1 __first1, _DifferenceType __n, _Index2 __first2, _Pred __pred) noexcept in __simd_first() argument
173 if (__pred(__first1[__i], __first2[__i])) in __simd_first()
175 return std::make_pair(__first1 + __i, __first2 + __i); in __simd_first()
178 const _Index2 __last2 = __first2 + __n; in __simd_first()
190 const _DifferenceType __t = __pred(__first1[__i], __first2[__i]); in __simd_first()
[all …]
|
| D | parallel_backend_tbb.h | 769 operator()(Iterator1 __first1, Iterator1 __last1, Iterator2 __first2) in operator()
772 return std::move(__first1, __last1, __first2); in operator()
776 [__first1, __first2](const tbb::blocked_range<_SizeType>& __range) { in operator()
778 __first2 + __range.begin()); in operator()
780 return __first2 + __n; in operator()
788 operator()(Iterator1 __first1, Iterator1 __last1, Iterator2 __first2) in operator()
792 for (; __first1 != __last1; ++__first1, ++__first2) in operator()
793 __move_value_construct()(__first1, __first2); in operator()
794 return __first2; in operator()
799 [__first1, __first2](const tbb::blocked_range<_SizeType>& __range) { in operator()
[all …]
|
| D | glue_numeric_impl.h | 60 _ForwardIterator2 __first2, _Tp __init) in transform_reduce() argument
64 …std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __init, std::plus<_InputType>… in transform_reduce()
76 …_ForwardIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary… in transform_reduce() argument
79 …std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __init, __binary_op1, __binar… in transform_reduce()
|
| D | parallel_backend_serial.h | 117 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __outit, in __parallel_merge() argument
120 __leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp); in __parallel_merge()
|
| D | glue_numeric_defs.h | 41 _ForwardIterator2 __first2, _Tp __init);
47 _ForwardIterator2 __first2, _Tp __init, _BinaryOperation1 __binary_op1,
|
| /external/libcxx/include/ |
| D | algorithm | 927 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
932 if (__first2 == __last2)
940 if (__pred(*__first1, *__first2))
944 // *__first1 matches *__first2, now match elements after here
946 _ForwardIterator2 __m2 = __first2;
969 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
973 if (__first2 == __last2)
983 if (__first1 == __l1) // return __last1 if no element matches *__first2
993 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
1008 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
[all …]
|
| D | __bit_reference | 863 __bit_iterator<__C2, false> __first2)
865 if (__first1.__ctz_ == __first2.__ctz_)
866 return __swap_ranges_aligned(__first1, __last1, __first2);
867 return __swap_ranges_unaligned(__first1, __last1, __first2);
953 __bit_iterator<_Cp, _IC2> __first2)
970 unsigned __clz_r = __bits_per_word - __first2.__ctz_;
972 … __m = (~__storage_type(0) << __first2.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
973 if (__first2.__ctz_ > __first1.__ctz_)
975 if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
980 if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
[all …]
|
| D | numeric | 208 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in…
210 for (; __first1 != __last1; ++__first1, (void) ++__first2)
211 __init = __init + *__first1 * *__first2;
218 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
221 for (; __first1 != __last1; ++__first1, (void) ++__first2)
222 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
243 _InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2)
245 for (; __first1 != __last1; ++__first1, (void) ++__first2)
246 __init = __b1(__init, __b2(*__first1, *__first2));
254 _InputIterator2 __first2, _Tp __init)
[all …]
|
| D | __string | 750 const _CharT *__first2, const _CharT *__last2) {
753 const ptrdiff_t __len2 = __last2 - __first2;
761 // First element of __first2 is loop invariant.
762 _CharT __f2 = *__first2;
775 // already know that it matches the first byte of __first2: this is because
776 // __first2 is most likely aligned, as it is user's "pattern" string, and
779 if (_Traits::compare(__first1, __first2, __len2) == 0)
|
| D | charconv | 270 __inner_product(_It1 __first1, _It1 __last1, _It2 __first2, _Up __init)
272 for (; __first1 < __last1; ++__first1, ++__first2)
273 __init = __init + *__first1 * *__first2;
|
| D | functional | 2840 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
2843 if (__first2 == __last2)
2847 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
2850 if (__first1 == __last1) // return __last1 if no element matches *__first2
2852 if (__pred(*__first1, *__first2))
2856 // *__first1 matches *__first2, now match elements after here
2858 _ForwardIterator2 __m2 = __first2;
2878 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
2884 const _D2 __len2 = __last2 - __first2;
2898 if (__pred(*__first1, *__first2))
[all …]
|
| D | utility | 258 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2)
260 for(; __first1 != __last1; ++__first1, (void) ++__first2)
261 swap(*__first1, *__first2);
262 return __first2;
|
| /external/llvm-project/libcxx/include/ |
| D | algorithm | 957 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
962 if (__first2 == __last2)
970 if (__pred(*__first1, *__first2))
974 // *__first1 matches *__first2, now match elements after here
976 _ForwardIterator2 __m2 = __first2;
999 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
1003 if (__first2 == __last2)
1013 if (__first1 == __l1) // return __last1 if no element matches *__first2
1023 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
1038 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
[all …]
|
| D | __bit_reference | 868 __bit_iterator<__C2, false> __first2)
870 if (__first1.__ctz_ == __first2.__ctz_)
871 return __swap_ranges_aligned(__first1, __last1, __first2);
872 return __swap_ranges_unaligned(__first1, __last1, __first2);
958 __bit_iterator<_Cp, _IC2> __first2)
975 unsigned __clz_r = __bits_per_word - __first2.__ctz_;
977 … __m = (~__storage_type(0) << __first2.__ctz_) & (~__storage_type(0) >> (__clz_r - __ddn));
978 if (__first2.__ctz_ > __first1.__ctz_)
980 if ((*__first2.__seg_ & __m) != (__b << (__first2.__ctz_ - __first1.__ctz_)))
985 if ((*__first2.__seg_ & __m) != (__b >> (__first1.__ctz_ - __first2.__ctz_)))
[all …]
|
| D | numeric | 223 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in…
225 for (; __first1 != __last1; ++__first1, (void) ++__first2)
227 __init = _VSTD::move(__init) + *__first1 * *__first2;
229 __init = __init + *__first1 * *__first2;
237 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
240 for (; __first1 != __last1; ++__first1, (void) ++__first2)
242 __init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2));
244 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
266 _InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2)
268 for (; __first1 != __last1; ++__first1, (void) ++__first2)
[all …]
|
| D | charconv | 273 __inner_product(_It1 __first1, _It1 __last1, _It2 __first2, _Up __init)
275 for (; __first1 < __last1; ++__first1, ++__first2)
276 __init = __init + *__first1 * *__first2;
|
| D | __string | 954 const _CharT *__first2, const _CharT *__last2) {
957 const ptrdiff_t __len2 = __last2 - __first2;
965 // First element of __first2 is loop invariant.
966 _CharT __f2 = *__first2;
979 // already know that it matches the first byte of __first2: this is because
980 // __first2 is most likely aligned, as it is user's "pattern" string, and
983 if (_Traits::compare(__first1, __first2, __len2) == 0)
|
| D | functional | 3049 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
3052 if (__first2 == __last2)
3056 // Find first element in sequence 1 that matchs *__first2, with a mininum of loop checks
3059 if (__first1 == __last1) // return __last1 if no element matches *__first2
3061 if (__pred(*__first1, *__first2))
3065 // *__first1 matches *__first2, now match elements after here
3067 _ForwardIterator2 __m2 = __first2;
3087 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
3093 const _D2 __len2 = __last2 - __first2;
3107 if (__pred(*__first1, *__first2))
[all …]
|
| D | type_traits | 3990 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2);
4025 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2)
4027 for(; __first1 != __last1; ++__first1, (void) ++__first2)
4028 swap(*__first1, *__first2);
4029 return __first2;
|