Home
last modified time | relevance | path

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

/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dalgorithm_impl.h3041 _ForwardIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp); in __parallel_set_union_op() local
3043 if (__left_bound_seq_2 == __last2) in __parallel_set_union_op()
3084 const auto __m2 = __left_bound_seq_2 - __first2; in __parallel_set_union_op()
3096 __left_bound_seq_2, __res_or, copy_range2); in __parallel_set_union_op()
3101 … __tag, std::forward<_ExecutionPolicy>(__exec), __first1, __last1, __left_bound_seq_2, __last2, in __parallel_set_union_op()
3243 …_RandomAccessIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp); in __pattern_set_intersection() local
3245 if (__left_bound_seq_2 == __last2) in __pattern_set_intersection()
3262 const auto __m2 = __last2 - __left_bound_seq_2 + __n1; in __pattern_set_intersection()
3278 …return std::set_intersection(__left_bound_seq_1, __last1, __left_bound_seq_2, __last2, __result, _… in __pattern_set_intersection()
3349 …_RandomAccessIterator2 __left_bound_seq_2 = std::lower_bound(__first2, __last2, *__first1, __comp); in __pattern_set_difference() local
[all …]