Home
last modified time | relevance | path

Searched refs:__last2 (Results 1 – 12 of 12) sorted by relevance

/external/llvm-project/pstl/include/pstl/internal/
Dparallel_backend_utils.h144 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct() argument
151 if (__first2 == __last2) in __set_union_construct()
166 return __cc_range(__first2, __last2, __result); in __set_union_construct()
172 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct() argument
176 for (; __first1 != __last1 && __first2 != __last2;) in __set_intersection_construct()
198 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct() argument
205 if (__first2 == __last2) in __set_difference_construct()
227 … _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_symmetric_difference_construct() argument
234 if (__first2 == __last2) in __set_symmetric_difference_construct()
255 return __cc_range(__first2, __last2, __result); in __set_symmetric_difference_construct()
Dalgorithm_impl.h394 … _ForwardIterator2 __last2, _BinaryPredicate __p, /* IsVector = */ std::false_type) noexcept in __brick_equal() argument
396 return std::equal(__first1, __last1, __first2, __last2, __p); in __brick_equal()
402 … _RandomAccessIterator2 __last2, _BinaryPredicate __p, /* is_vector = */ std::true_type) noexcept in __brick_equal() argument
404 if (__last1 - __first1 != __last2 - __first2) in __brick_equal()
414 … _ForwardIterator2 __last2, _BinaryPredicate __p, _IsVector __is_vector, /* is_parallel = */ in __pattern_equal() argument
417 return __internal::__brick_equal(__first1, __last1, __first2, __last2, __p, __is_vector); in __pattern_equal()
424 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __p, in __pattern_equal() argument
427 if (__last1 - __first1 != __last2 - __first2) in __pattern_equal()
2613 _ForwardIterator2 __last2, _OutputIterator __d_first, _Compare __comp, in __brick_merge() argument
2616 return std::merge(__first1, __last1, __first2, __last2, __d_first, __comp); in __brick_merge()
[all …]
Dglue_algorithm_impl.h679 _ForwardIterator2 __last2, _BinaryPredicate __pred) in mismatch() argument
682 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __pred, in mismatch()
701 _ForwardIterator2 __last2) in mismatch() argument
703 … return std::mismatch(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, in mismatch()
739 _ForwardIterator2 __last2, _BinaryPredicate __p) in equal() argument
742 std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __p, in equal()
750 _ForwardIterator2 __last2) in equal() argument
752 …return equal(std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, std::eq… in equal()
865 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp) in merge() argument
868 … std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __first2, __last2, __d_first, __comp, in merge()
[all …]
Dglue_algorithm_defs.h317 _ForwardIterator2 __last2, _BinaryPredicate __pred);
327 _ForwardIterator2 __last2);
347 _ForwardIterator2 __last2, _BinaryPredicate __p);
352 _ForwardIterator2 __last2);
417 _ForwardIterator2 __last2, _ForwardIterator __d_first, _Compare __comp);
422 _ForwardIterator2 __last2, _ForwardIterator __d_first);
439 _ForwardIterator2 __last2, _Compare __comp);
444 _ForwardIterator2 __last2);
452 _ForwardIterator2 __last2, _ForwardIterator __result, _Compare __comp);
457 _ForwardIterator2 __last2, _ForwardIterator __result);
[all …]
Dparallel_backend_serial.h117 … _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _RandomAccessIterator3 __outit, in __parallel_merge() argument
120 __leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp); in __parallel_merge()
Dunseq_backend_simd.h178 const _Index2 __last2 = __first2 + __n; in __simd_first()
214 return std::make_pair(__last1, __last2); in __simd_first()
/external/libcxx/include/
Dalgorithm927 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
932 if (__first2 == __last2)
949 if (++__m2 == __last2)
969 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
973 if (__first2 == __last2)
976 _BidirectionalIterator2 __l2 = __last2;
980 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
1008 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1012 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1020 _RandomAccessIterator2 __l2 = __last2;
[all …]
Dfunctional2840 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
2843 if (__first2 == __last2)
2861 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patte…
2878 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
2884 const _D2 __len2 = __last2 - __first2;
2907 if (++__m2 == __last2)
D__string750 const _CharT *__first2, const _CharT *__last2) {
753 const ptrdiff_t __len2 = __last2 - __first2;
/external/llvm-project/libcxx/include/
Dalgorithm957 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
962 if (__first2 == __last2)
979 if (++__m2 == __last2)
999 … _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BinaryPredicate __pred,
1003 if (__first2 == __last2)
1006 _BidirectionalIterator2 __l2 = __last2;
1010 // Find last element in sequence 1 that matchs *(__last2-1), with a mininum of loop checks
1038 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
1042 typename iterator_traits<_RandomAccessIterator2>::difference_type __len2 = __last2 - __first2;
1050 _RandomAccessIterator2 __l2 = __last2;
[all …]
Dfunctional3049 _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __pred,
3052 if (__first2 == __last2)
3070 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patte…
3087 _RandomAccessIterator2 __first2, _RandomAccessIterator2 __last2, _BinaryPredicate __pred,
3093 const _D2 __len2 = __last2 - __first2;
3116 if (++__m2 == __last2)
D__string954 const _CharT *__first2, const _CharT *__last2) {
957 const ptrdiff_t __len2 = __last2 - __first2;