Home
last modified time | relevance | path

Searched refs:__first2 (Results 1 – 25 of 49) sorted by relevance

12

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dequal.h27 for (; __first1 != __last1; ++__first1, (void)++__first2) in equal()
28 if (!__pred(*__first1, *__first2)) in equal()
35 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
38 return _VSTD::equal(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in equal()
46 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
47 if (!__pred(*__first1, *__first2)) in __equal()
49 return __first1 == __last1 && __first2 == __last2; in __equal()
54 …l(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, in __equal() argument
57 if (_VSTD::distance(__first1, __last1) != _VSTD::distance(__first2, __last2)) in __equal()
60 _BinaryPredicate&>(__first1, __last1, __first2, __pred); in __equal()
[all …]
H A Dis_permutation.h74 for (auto __j = __first2; __j != __last2; ++__j) {
101 for (; __first1 != __last1; ++__first1, (void)++__first2) {
102 if (!__pred(*__first1, *__first2))
114 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
130 while (__first1 != __last1 && __first2 != __last2) {
134 ++__first2;
138 return __first2 == __last2;
139 if (__first2 == __last2) // Second range is shorter
146 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
163 if (std::distance(__first1, __last1) != std::distance(__first2, __last2))
[all …]
H A Dstable_sort.h44 … for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>()) in __merge_move_construct()
49 if (__first2 == __last2) in __merge_move_construct()
56 if (__comp(*__first2, *__first1)) in __merge_move_construct()
60 ++__first2; in __merge_move_construct()
81 if (__first2 == __last2) in __merge_move_assign()
87 if (__comp(*__first2, *__first1)) in __merge_move_assign()
90 ++__first2; in __merge_move_assign()
98 for (; __first2 != __last2; ++__first2, (void) ++__result) in __merge_move_assign()
99 *__result = _Ops::__iter_move(__first2); in __merge_move_assign()
131 ++__first2; in __stable_sort_move()
[all …]
H A Dmismatch.h27 …mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredi… in mismatch() argument
28 for (; __first1 != __last1; ++__first1, (void)++__first2) in mismatch()
29 if (!__pred(*__first1, *__first2)) in mismatch()
31 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
37 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in mismatch() argument
40 return _VSTD::mismatch(__first1, __last1, __first2, __equal_to<__v1, __v2>()); in mismatch()
47 …mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterat… in mismatch() argument
49 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in mismatch()
50 if (!__pred(*__first1, *__first2)) in mismatch()
52 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
[all …]
H A Dswap_ranges.h27 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel… in __swap_ranges() argument
28 while (__first1 != __last1 && __first2 != __last2) { in __swap_ranges()
29 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
31 ++__first2; in __swap_ranges()
34 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); in __swap_ranges()
41 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges() argument
43 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
45 ++__first2; in __swap_ranges()
48 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); in __swap_ranges()
53 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in swap_ranges() argument
[all …]
H A Dfind_end.h43 _Iter2 __first2, in __find_end_impl() argument
53 if (__first2 == __last2) in __find_end_impl()
65 _Iter2 __m2 = __first2; in __find_end_impl()
97 _Iter2 __first2, in __find_end() argument
105 auto __last2 = _IterOps::next(__first2, __sent2); in __find_end()
107 if (__first2 == __last2) in __find_end()
150 _Iter2 __first2, in __find_end() argument
159 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2); in __find_end()
161 auto __len2 = __last2 - __first2; in __find_end()
181 if (__m2 == __first2) in __find_end()
[all …]
H A Dset_union.h41 if (__first2 == __last2) { in __set_union()
44 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_union()
46 if (__comp(*__first2, *__first1)) { in __set_union()
47 *__result = *__first2; in __set_union()
48 ++__first2; in __set_union()
50 if (!__comp(*__first1, *__first2)) { in __set_union()
51 ++__first2; in __set_union()
66 _InputIterator2 __first2, in set_union() argument
74 std::move(__first2), in set_union()
85 _InputIterator2 __first2, in set_union() argument
[all …]
H A Dmerge.h28 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __merge() argument
32 if (__first2 == __last2) in __merge()
34 if (__comp(*__first2, *__first1)) in __merge()
36 *__result = *__first2; in __merge()
37 ++__first2; in __merge()
45 return _VSTD::copy(__first2, __last2, __result); in __merge()
52 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in merge() argument
55 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in merge()
62 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) in merge() argument
66 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); in merge()
H A Dsearch.h38 _Iter2 __first2, _Sent2 __last2, in __search_forward_impl() argument
42 if (__first2 == __last2) in __search_forward_impl()
57 _Iter2 __m2 = __first2; in __search_forward_impl()
85 _Iter2 __first2, _Sent2 __last2, in __search_random_access_impl() argument
105 _Iter2 __m2 = __first2; in __search_random_access_impl()
125 _Iter2 __first2, _Sent2 __last2,
132 auto __size2 = __last2 - __first2;
142 __first2, __last2,
157 _Iter2 __first2, _Sent2 __last2,
166 __first2, __last2,
[all …]
H A Dlexicographical_compare.h26 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare() argument
28 for (; __first2 != __last2; ++__first1, (void) ++__first2) in __lexicographical_compare()
30 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
32 if (__comp(*__first2, *__first1)) in __lexicographical_compare()
43 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare() argument
46 … return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare()
54 _InputIterator2 __first2, _InputIterator2 __last2) in lexicographical_compare() argument
56 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, in lexicographical_compare()
H A Dset_difference.h32 …_InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result,… in __set_difference() argument
33 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
34 if (__comp(*__first1, *__first2)) { in __set_difference()
38 } else if (__comp(*__first2, *__first1)) { in __set_difference()
39 ++__first2; in __set_difference()
42 ++__first2; in __set_difference()
52 _InputIterator2 __first2, in set_difference() argument
57 …return std::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp).se… in set_difference()
64 _InputIterator2 __first2, in set_difference() argument
70 __first2, in set_difference()
H A Dincludes.h29 __includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, in __includes() argument
31 for (; __first2 != __last2; ++__first1) { in __includes()
33 __comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __includes()
35 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __includes()
36 ++__first2; in __includes()
45 _InputIterator2 __first2, in includes() argument
48 static_assert(__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value, in includes()
53 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), in includes()
59 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
63 std::move(__first2), in includes()
H A Dset_symmetric_difference.h42 if (__first2 == __last2) { in __set_symmetric_difference()
45 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_symmetric_difference()
47 if (__comp(*__first1, *__first2)) { in __set_symmetric_difference()
52 if (__comp(*__first2, *__first1)) { in __set_symmetric_difference()
53 *__result = *__first2; in __set_symmetric_difference()
58 ++__first2; in __set_symmetric_difference()
61 auto __ret2 = std::__copy_impl(std::move(__first2), std::move(__last2), std::move(__result)); in __set_symmetric_difference()
70 _InputIterator2 __first2, in set_symmetric_difference() argument
78 std::move(__first2), in set_symmetric_difference()
89 _InputIterator2 __first2, in set_symmetric_difference() argument
[all …]
H A Dset_intersection.h41 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_intersection() argument
42 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
43 if (__comp(*__first1, *__first2)) in __set_intersection()
46 if (!__comp(*__first2, *__first1)) { in __set_intersection()
51 ++__first2; in __set_intersection()
57 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
65 _InputIterator2 __first2, in set_intersection() argument
73 std::move(__first2), in set_intersection()
84 _InputIterator2 __first2, in set_intersection() argument
90 std::move(__first2), in set_intersection()
H A Dranges_equal.h42 _Iter2 __first2, _Sent2 __last2, in __equal_impl()
46 while (__first1 != __last1 && __first2 != __last2) { in __equal_impl()
47 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __equal_impl()
50 ++__first2; in __equal_impl()
52 return __first1 == __last1 && __first2 == __last2; in __equal_impl()
65 _Iter2 __first2, _Sent2 __last2, in operator()
70 if (__last1 - __first1 != __last2 - __first2)
74 std::move(__first2), std::move(__last2),
H A Dfind_first_of.h26 _ForwardIterator2 __first2, in __find_first_of_ce() argument
30 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce()
38 find_first_of(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in find_first_of() argument
40 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
45 …_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterato… in find_first_of() argument
48 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to<__v1, __v2>()); in find_first_of()
H A Dranges_lexicographical_compare.h37 _Iter2 __first2, _Sent2 __last2, in __lexicographical_compare_impl()
41 while (__first2 != __last2) { in __lexicographical_compare_impl()
43 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __lexicographical_compare_impl()
45 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) in __lexicographical_compare_impl()
48 ++__first2; in __lexicographical_compare_impl()
60 _Iter2 __first2, _Sent2 __last2, in operator()
65 std::move(__first2), std::move(__last2),
H A Dranges_merge.h54 _InIter2&& __first2, in __merge_impl() argument
60 for (; __first1 != __last1 && __first2 != __last2; ++__result) { in __merge_impl()
61 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { in __merge_impl()
62 *__result = *__first2; in __merge_impl()
63 ++__first2; in __merge_impl()
70 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out)); in __merge_impl()
88 _InIter2 __first2, in operator()
94 …return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __pr…
H A Dranges_mismatch.h43 __go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, in __go()
45 while (__first1 != __last1 && __first2 != __last2) { in __go()
46 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __go()
49 ++__first2; in __go()
51 return {std::move(__first1), std::move(__first2)}; in __go()
59 mismatch_result<_I1, _I2> operator()(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, in operator()
61 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dparallel_backend_utils.h151 if (__first2 == __last2) in __set_union_construct()
153 if (__comp(*__first2, *__first1)) in __set_union_construct()
156 ++__first2; in __set_union_construct()
162 ++__first2; in __set_union_construct()
178 if (__comp(*__first1, *__first2)) in __set_intersection_construct()
188 ++__first2; in __set_intersection_construct()
205 if (__first2 == __last2) in __set_difference_construct()
208 if (__comp(*__first1, *__first2)) in __set_difference_construct()
218 ++__first2; in __set_difference_construct()
234 if (__first2 == __last2) in __set_symmetric_difference_construct()
[all …]
H A Dalgorithm_impl.h227 __f(*__first1, *__first2); in __brick_walk2()
228 return __first2; in __brick_walk2()
246 __f(*__first1, *__first2); in __brick_walk2_n()
247 return __first2; in __brick_walk2_n()
355 return __first2 + __n; in __pattern_walk2_brick_n()
2844 if (__first2 >= __last2) in __pattern_includes()
2854 if (__last2 - __first2 == 1) in __pattern_includes()
2855 return !__comp(*__first1, *__first2) && !__comp(*__first2, *__first1); in __pattern_includes()
3650 …for (; __first1 != __last1 && __first2 != __last2 && __pred(*__first1, *__first2); ++__first1, ++_… in __mismatch_serial()
3725 if (__first2 == __last2) in __brick_lexicographical_compare()
[all …]
H A Dglue_algorithm_impl.h284 _ForwardIterator2 __first2) in swap_ranges() argument
289 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2); in swap_ranges()
292 __last1, __first2, in swap_ranges()
647 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first1, __first2); in mismatch()
650 __last1, __first2, __last2, __pred); in mismatch()
658 …return std::mismatch(__exec, __first1, __last1, __first2, std::next(__first2, std::distance(__firs… in mismatch()
677 std::next(__first2, std::distance(__first1, __last1))); in mismatch()
690 __last1, __first2, __p); in equal()
708 __last1, __first2, __last2, __p); in equal()
869 __last1, __first2, __last2, __comp); in includes()
[all …]
/llvm-project-15.0.7/libcxx/include/__numeric/
H A Dinner_product.h25 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in… in inner_product() argument
27 for (; __first1 != __last1; ++__first1, (void) ++__first2) in inner_product()
29 __init = _VSTD::move(__init) + *__first1 * *__first2; in inner_product()
31 __init = __init + *__first1 * *__first2; in inner_product()
39 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, in inner_product() argument
42 for (; __first1 != __last1; ++__first1, (void) ++__first2) in inner_product()
44 __init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2)); in inner_product()
46 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); in inner_product()
H A Dtransform_reduce.h36 … _InputIterator2 __first2, _Tp __init, in transform_reduce() argument
38 for (; __first1 != __last1; ++__first1, (void)++__first2) in transform_reduce()
39 __init = __b1(__init, __b2(*__first1, *__first2)); in transform_reduce()
46 … _InputIterator2 __first2, _Tp __init) { in transform_reduce() argument
47 return _VSTD::transform_reduce(__first1, __last1, __first2, _VSTD::move(__init), _VSTD::plus<>(), in transform_reduce()
/llvm-project-15.0.7/libcxx/include/__memory/
H A Duninitialized_algorithms.h534 auto __destruct_first = __first2; in __uninitialized_allocator_copy()
540 ++__first2; in __uninitialized_allocator_copy()
548 return __first2; in __uninitialized_allocator_copy()
571 ++__first2;
573 return __first2;
590 auto __destruct_first = __first2;
600 ++__first2;
608 return __first2;
631 ++__first2;
633 return __first2;
[all …]

12