Home
last modified time | relevance | path

Searched refs:__first1 (Results 1 – 25 of 58) sorted by relevance

123

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dsearch.h40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument
42 return std::make_pair(__first1, __first1); // Everything matches an empty sequence in __search_forward_impl()
46 if (__first1 == __last1) { // return __last1 if no element matches *__first2 in __search_forward_impl()
47 _IterOps<_AlgPolicy>::__advance_to(__first1, __last1); in __search_forward_impl()
48 return std::make_pair(__first1, __first1); in __search_forward_impl()
50 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
52 ++__first1; in __search_forward_impl()
55 _Iter1 __m1 = __first1; in __search_forward_impl()
59 return std::make_pair(__first1, ++__m1); in __search_forward_impl()
66 ++__first1; in __search_forward_impl()
[all …]
H A Dmismatch.h41 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop() argument
42 while (__first1 != __last1) { in __mismatch_loop()
43 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch_loop()
45 ++__first1; in __mismatch_loop()
48 return std::make_pair(std::move(__first1), std::move(__first2)); in __mismatch_loop()
53 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch() argument
54 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
61 __mismatch_vectorized(_Iter __first1, _Iter __last1, _Iter __first2) { in __mismatch_vectorized() argument
68 auto __orig_first1 = __first1; in __mismatch_vectorized()
69 auto __last2 = __first2 + (__last1 - __first1); in __mismatch_vectorized()
[all …]
H A Dequal.h39 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate& __p… in __equal_iter_impl() argument
40 for (; __first1 != __last1; ++__first1, (void)++__first2) in __equal_iter_impl()
41 if (!__pred(*__first1, *__first2)) in __equal_iter_impl()
53 __equal_iter_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _BinaryPredicate&) { in __equal_iter_impl() argument
54 return std::__constexpr_memcmp_equal(__first1, __first2, __element_count(__last1 - __first1)); in __equal_iter_impl()
59 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
61 … std::__unwrap_iter(__first1), std::__unwrap_iter(__last1), std::__unwrap_iter(__first2), __pred); in equal()
66 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
67 return std::equal(__first1, __last1, __first2, __equal_to()); in equal()
74 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, … in __equal_impl() argument
[all …]
H A Dset_intersection.h53 _InForwardIter1& __first1, in __set_intersection_add_output_if_equal() argument
58 *__result = *__first1; in __set_intersection_add_output_if_equal()
60 ++__first1; in __set_intersection_add_output_if_equal()
90 _InForwardIter1 __first1, in __set_intersection() argument
103 std::__lower_bound_onesided<_AlgPolicy>(__first1, __last1, *__first2, __comp, __proj); in __set_intersection()
104 std::swap(__first1_next, __first1); in __set_intersection()
108 __first1 == __first1_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
109 if (__first1 == __last1) in __set_intersection()
113 std::__lower_bound_onesided<_AlgPolicy>(__first2, __last2, *__first1, __comp, __proj); in __set_intersection()
116 __first2 == __first2_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
[all …]
H A Dis_permutation.h73 _Iter1 __first1,
82 for (auto __i = __first1; __i != __last1; ++__i) {
84 auto __match = __first1;
117 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p…
119 for (; __first1 != __last1; ++__first1, (void)++__first2) {
120 if (!__pred(*__first1, *__first2))
124 if (__first1 == __last1)
129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
135 std::move(__first1),
154 _Iter1 __first1,
[all …]
H A Dstable_sort.h39 _BidirectionalIterator __first1, in __insertion_sort_move() argument
46 if (__first1 != __last1) { in __insertion_sort_move()
50 ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
52 for (++__last2; ++__first1 != __last1; ++__last2) { in __insertion_sort_move()
55 if (__comp(*__first1, *--__i2)) { in __insertion_sort_move()
58 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) in __insertion_sort_move()
60 *__j2 = _Ops::__iter_move(__first1); in __insertion_sort_move()
62 ::new ((void*)__j2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
72 _InputIterator1 __first1, in __merge_move_construct() argument
84 if (__first1 == __last1) { in __merge_move_construct()
[all …]
H A Dfind_end.h40 _Iter1 __first1, in __find_end_impl() argument
50 …_Iter1 __match_first = _IterOps<_AlgPolicy>::next(__first1, __last1); // __last1 is the "default" … in __find_end_impl()
56 …if (__first1 == __last1) // if source exhausted return last correct answer (or __last1 if never fo… in __find_end_impl()
58 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __find_end_impl()
60 ++__first1; in __find_end_impl()
63 _Iter1 __m1 = __first1; in __find_end_impl()
67 __match_first = __first1; in __find_end_impl()
69 ++__first1; in __find_end_impl()
76 ++__first1; in __find_end_impl()
92 _Iter1 __first1, in __find_end() argument
[all …]
H A Dlexicographical_compare_three_way.h38 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
39 -> decltype(__comp(*__first1, *__first2)) {
49 _Len1 __len1 = __last1 - __first1;
54 auto __c = __comp(*__first1, *__first2);
58 ++__first1;
68 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
69 -> decltype(__comp(*__first1, *__first2)) {
71 bool __exhausted1 = __first1 == __last1;
82 auto __c = __comp(*__first1, *__first2);
87 ++__first1;
[all …]
H A Dranges_search.h40 _Iter1 __first1, in __ranges_search_impl()
50 return {__first1, __first1}; in __ranges_search_impl()
53 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl()
55 ranges::advance(__first1, __last1); in __ranges_search_impl()
56 return {__first1, __first1}; in __ranges_search_impl()
61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
68 …std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1,… in __ranges_search_impl()
81 _Iter1 __first1, in operator()
88 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
99 auto __first1 = ranges::begin(__range1); local
[all …]
H A Dswap_ranges.h29 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) { in __swap_ranges()
30 while (__first1 != __last1 && __first2 != __last2) { in __swap_ranges()
31 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
32 ++__first1; in __swap_ranges()
36 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2));
42 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges()
43 while (__first1 != __last1) { in __swap_ranges()
44 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
45 ++__first1; in __swap_ranges()
49 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), st in __swap_ranges()
27 __swap_ranges(_ForwardIterator1 __first1,_Sentinel1 __last1,_ForwardIterator2 __first2,_Sentinel2 __last2) __swap_ranges() argument
41 __swap_ranges(_ForwardIterator1 __first1,_Sentinel1 __last1,_ForwardIterator2 __first2) __swap_ranges() argument
53 swap_ranges(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2) swap_ranges() argument
[all...]
H A Dset_difference.h36 _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) { in __set_difference()
37 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
38 if (__comp(*__first1, *__first2)) { in __set_difference()
39 *__result = *__first1; in __set_difference()
40 ++__first1; in __set_difference()
42 } else if (__comp(*__first2, *__first1)) { in __set_difference()
45 ++__first1; in __set_difference()
49 return std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result));
54 _InputIterator1 __first1, in set_difference()
61 __first1, __last in set_difference()
33 __set_difference(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp) __set_difference() argument
51 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_difference() argument
64 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_difference() argument
[all...]
H A Dset_symmetric_difference.h45 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_symmetric_difference()
46 while (__first1 != __last1) { in __set_symmetric_difference()
48 auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result)); in __set_symmetric_difference()
52 if (__comp(*__first1, *__first2)) { in __set_symmetric_difference()
53 *__result = *__first1; in __set_symmetric_difference()
55 ++__first1; in __set_symmetric_difference()
57 if (__comp(*__first2, *__first1)) { in __set_symmetric_difference()
61 ++__first1; in __set_symmetric_difference()
68 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second)));
73 _InputIterator1 __first1, in set_symmetric_difference()
42 __set_symmetric_difference(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_symmetric_difference() argument
70 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_symmetric_difference() argument
88 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_symmetric_difference() argument
[all...]
H A Dmerge.h26 _InputIterator1 __first1,
32 for (; __first1 != __last1; ++__result) { in __merge()
34 return std::copy(__first1, __last1, __result); in __merge()
35 if (__comp(*__first2, *__first1)) { in __merge()
39 *__result = *__first1; in __merge()
40 ++__first1; in __merge()
48 merge(_InputIterator1 __first1,
54 return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); in merge()
59 merge(_InputIterator1 __first1,
64 return std::merge(__first1, __last in merge()
27 __merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge() argument
51 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) merge() argument
60 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) merge() argument
[all...]
H A Dlexicographical_compare.h25 _InputIterator1 __first1, in __lexicographical_compare() argument
30 for (; __first2 != __last2; ++__first1, (void)++__first2) { in __lexicographical_compare()
31 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
33 if (__comp(*__first2, *__first1)) in __lexicographical_compare()
41 _InputIterator1 __first1, in lexicographical_compare() argument
46 …return std::__lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __l… in lexicographical_compare()
51 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las… in lexicographical_compare() argument
52 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __less<>()); in lexicographical_compare()
H A Dfind_first_of.h25 _ForwardIterator1 __first1, in __find_first_of_ce() argument
30 for (; __first1 != __last1; ++__first1) in __find_first_of_ce()
32 if (__pred(*__first1, *__j)) in __find_first_of_ce()
33 return __first1; in __find_first_of_ce()
39 _ForwardIterator1 __first1, in find_first_of() argument
44 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
49 …_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterato… in find_first_of() argument
50 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); in find_first_of()
H A Dincludes.h32 _Iter1 __first1, in __includes() argument
39 for (; __first2 != __last2; ++__first1) { in __includes()
40 if (__first1 == __last1 || in __includes()
41 std::__invoke(__comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __includes()
43 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __includes()
51 includes(_InputIterator1 __first1, in includes() argument
57 …__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value, "Comparator has to be ca… in includes()
60 std::move(__first1), in includes()
71 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
72 …return std::includes(std::move(__first1), std::move(__last1), std::move(__first2), std::move(__las… in includes()
H A Dset_union.h44 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_union()
45 for (; __first1 != __last1; ++__result) { in __set_union()
47 auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result)); in __set_union()
51 if (__comp(*__first2, *__first1)) { in __set_union()
55 if (!__comp(*__first1, *__first2)) { in __set_union()
58 *__result = *__first1; in __set_union()
59 ++__first1; in __set_union()
64 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second)));
69 _InputIterator1 __first1, in set_union()
76 std::move(__first1), in set_union()
41 __set_union(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_union() argument
66 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_union() argument
84 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_union() argument
[all...]
H A Dranges_ends_with.h43 _Iter1 __first1, in __ends_with_fn_impl_bidirectional()
51 auto __rend1 = std::make_reverse_iterator(__first1); in __ends_with_fn_impl_bidirectional()
60 _Iter1 __first1, in __ends_with_fn_impl()
69 …return __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __… in __ends_with_fn_impl()
72 auto __n1 = ranges::distance(__first1, __last1); in __ends_with_fn_impl()
80 std::move(__first1), in __ends_with_fn_impl()
100 _Iter1 __first1, in __ends_with_fn_impl_with_offset()
111 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,… in __ends_with_fn_impl_with_offset()
114 ranges::advance(__first1, __offset); in __ends_with_fn_impl_with_offset()
116 std::move(__first1), in __ends_with_fn_impl_with_offset()
[all …]
H A Dranges_find_first_of.h39 _Iter1 __first1, in __find_first_of_impl()
46 for (; __first1 != __last1; ++__first1) { in __find_first_of_impl()
48 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
49 return __first1; in __find_first_of_impl()
52 return __first1; in __find_first_of_impl()
64 _Iter1 __first1, in operator()
72 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dparallel_backend_utils.h
H A Dalgorithm_impl.h
H A Dglue_algorithm_impl.h
/freebsd/contrib/llvm-project/libcxx/include/__numeric/
H A Dinner_product.h27 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) {
28 for (; __first1 != __last1; ++__first1, (void)++__first2) in inner_product() argument
30 __init = std::move(__init) + *__first1 * *__first2; in inner_product()
32 __init = __init + *__first1 * *__first2; in inner_product()
39 _InputIterator1 __first1,
45 for (; __first1 != __last1; ++__first1, (void)++__first2) in inner_product()
47 __init = __binary_op1(std::move(__init), __binary_op2(*__first1, *__first2)); in inner_product()
49 __init = __binary_op1(__init, __binary_op2(*__first1, *__first in inner_product()
42 inner_product(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init,_BinaryOperation1 __binary_op1,_BinaryOperation2 __binary_op2) inner_product() argument
[all...]
H A Dtransform_reduce.h37 _InputIterator1 __first1, in transform_reduce()
43 for (; __first1 != __last1; ++__first1, (void)++__first2)
44 __init = __b1(std::move(__init), __b2(*__first1, *__first2)); in transform_reduce() argument
50 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) {
51 return std::transform_reduce(__first1, __last1, __first2, std::move(__init), std::plus<>(), std::multiplies<>());
34 transform_reduce(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init,_BinaryOp1 __b1,_BinaryOp2 __b2) transform_reduce() argument
/freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/
H A Dtransform.h35 __simd_transform(_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Function __f) noex… in __simd_transform() argument
38 __f(__first1[__i], __first2[__i]); in __simd_transform()
44 …_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Iterator3 __first3, _Function __f)… in __simd_transform() argument
47 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_transform()
103 _ForwardIterator1 __first1, in operator()
113 __first1, in operator()
115 [&__policy, __op, __first1, __first2, __result]( in operator()
123 __first2 + (__brick_first - __first1), in operator()
124 __result + (__brick_first - __first1), in operator()
129 return __result + (__last1 - __first1); in operator()
[all …]

123