Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfind_end.h43 _Sent2 __last2, in __find_end_impl() argument
52 if (__first2 == __last2) in __find_end_impl()
66 if (++__m2 == __last2) { // Pattern exhaused, record answer and search for another one in __find_end_impl()
102 auto __last2 = _IterOps::next(__first2, __sent2); in __find_end() local
104 if (__first2 == __last2) in __find_end()
107 _Iter2 __l2 = __last2; in __find_end()
154 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2); in __find_end() local
156 auto __len2 = __last2 - __first2; in __find_end()
164 _Iter2 __l2 = __last2; in __find_end()
191 _ForwardIterator2 __last2, in __find_end_classic() argument
[all …]
H A Dis_permutation.h76 _Sent2 __last2,
93 for (auto __j = __first2; __j != __last2; ++__j) {
132 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
138 std::move(__last2),
157 _Sent2 __last2,
163 while (__first1 != __last1 && __first2 != __last2) {
171 return __first2 == __last2;
172 if (__first2 == __last2) // Second range is shorter
179 _D2 __l2 = _IterOps<_AlgPolicy>::distance(__first2, __last2);
184 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
[all …]
H A Dsearch.h40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument
41 if (__first2 == __last2) in __search_forward_impl()
58 …if (++__m2 == __last2) // If pattern exhausted, __first1 is the answer (works for 1 element patter… in __search_forward_impl()
87 _Sent2 __last2, in __search_random_access_impl() argument
109 if (++__m2 == __last2) in __search_random_access_impl()
131 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
132 auto __size2 = __last2 - __first2; in __search_impl()
142 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
158 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
159 …return std::__search_forward_impl<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __pred,… in __search_impl()
[all …]
H A Dset_intersection.h93 _Sent2 __last2, in __set_intersection() argument
101 while (__first2 != __last2) { in __set_intersection()
113 std::__lower_bound_onesided<_AlgPolicy>(__first2, __last2, *__first1, __comp, __proj); in __set_intersection()
120 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
138 _Sent2 __last2, in __set_intersection() argument
143 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
158 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
166 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_intersection() argument
171 std::move(__last2), in __set_intersection()
183 _InputIterator2 __last2, in set_intersection() argument
[all …]
H A Dmerge.h29 _InputIterator2 __last2, in __merge()
33 if (__first2 == __last2) in __merge()
43 return std::copy(__first2, __last2, __result); in __merge()
51 _InputIterator2 __last2, in merge()
54 return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); in merge()
62 _InputIterator2 __last2, in merge()
64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
28 __merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge() argument
52 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) merge() argument
61 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) merge() argument
H A Dlexicographical_compare_three_way.h38 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
50 _Len2 __len2 = __last2 - __first2;
68 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
72 bool __exhausted2 = __first2 == __last2;
94 … __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp __comp)
104 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
108 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
114 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in lexicographical_compare_three_way() argument
116 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), std::compare_thr… in lexicographical_compare_three_way()
H A Dlexicographical_compare.h28 _InputIterator2 __last2, in __lexicographical_compare() argument
30 for (; __first2 != __last2; ++__first1, (void)++__first2) { in __lexicographical_compare()
44 _InputIterator2 __last2, in lexicographical_compare() argument
46 …_lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare()
51 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in lexicographical_compare() argument
52 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __less<>()); in lexicographical_compare()
H A Dfind_first_of.h28 _ForwardIterator2 __last2, in __find_first_of_ce() argument
31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce()
42 _ForwardIterator2 __last2, in find_first_of() argument
44 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
49 …ator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) { in find_first_of() argument
50 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); in find_first_of()
H A Dranges_ends_with.h46 _Sent2 __last2, in __ends_with_fn_impl_bidirectional()
52 auto __rbegin2 = std::make_reverse_iterator(__last2); in __ends_with_fn_impl_bidirectional()
63 _Sent2 __last2, in __ends_with_fn_impl()
69 …return __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __… in __ends_with_fn_impl()
73 auto __n2 = ranges::distance(__first2, __last2); in __ends_with_fn_impl()
83 std::move(__last2), in __ends_with_fn_impl()
103 _Sent2 __last2, 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()
119 std::move(__last2), in __ends_with_fn_impl_with_offset()
140 _Sent2 __last2, in operator()
[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()
57 _InputIterator2 __last2, in set_difference()
61 __first1, __last1, __first2, __last2, __result, __comp)
70 _InputIterator2 __last2, in set_difference()
72 return std::__set_difference<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __result, __less<>()).second;
33 __set_difference(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp) __set_difference() argument
54 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_difference() argument
67 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_difference() argument
H A Dincludes.h35 _Sent2 __last2, in __includes() argument
39 for (; __first2 != __last2; ++__first1) { in __includes()
54 _InputIterator2 __last2, in includes() argument
63 std::move(__last2), in includes()
71 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in includes() argument
72 …udes(std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __less<>()); in includes()
H A Dset_symmetric_difference.h45 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_symmetric_difference()
47 if (__first2 == __last2) { in __set_symmetric_difference()
66 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); in __set_symmetric_difference()
76 _InputIterator2 __last2, in set_symmetric_difference()
83 std::move(__last2), in set_symmetric_difference()
94 _InputIterator2 __last2, in set_symmetric_difference()
100 std::move(__last2), in set_symmetric_difference()
42 __set_symmetric_difference(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_symmetric_difference() argument
73 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_symmetric_difference() argument
91 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_symmetric_difference() argument
H A Dset_union.h44 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_union()
46 if (__first2 == __last2) { in __set_union()
62 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); in __set_union()
72 _InputIterator2 __last2, in set_union()
79 std::move(__last2), in set_union()
90 _InputIterator2 __last2, in set_union()
96 std::move(__last2), in set_union()
41 __set_union(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_union() argument
69 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_union() argument
87 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_union() argument
H A Dequal.h74 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, … in __equal_impl() argument
75 while (__first1 != __last1 && __first2 != __last2) { in __equal_impl()
81 return __first1 == __last1 && __first2 == __last2; in __equal_impl()
103 _InputIterator2 __last2, in equal() argument
107 if (std::distance(__first1, __last1) != std::distance(__first2, __last2)) in equal()
115 std::__unwrap_iter(__last2), in equal()
123 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in equal() argument
124 return std::equal(__first1, __last1, __first2, __last2, __equal_to()); in equal()
H A Dstable_sort.h49 value_type* __last2 = __first2; in __insertion_sort_move() local
50 ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1)); in __insertion_sort_move()
52 for (++__last2; ++__first1 != __last1; ++__last2) { in __insertion_sort_move()
53 value_type* __j2 = __last2; in __insertion_sort_move()
75 _InputIterator2 __last2, in __merge_move_construct() argument
85 for (; __first2 != __last2; ++__first2, (void)++__result, __d.template __incr<value_type>()) in __merge_move_construct()
90 if (__first2 == __last2) { in __merge_move_construct()
113 _InputIterator2 __last2, in __merge_move_assign() argument
119 if (__first2 == __last2) { in __merge_move_assign()
132 for (; __first2 != __last2; ++__first2, (void)++__result) in __merge_move_assign()
H A Dranges_search.h43 _Sent2 __last2, in __ranges_search_impl()
48 auto __size2 = ranges::distance(__first2, __last2); 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()
84 _Sent2 __last2, in operator()
88 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
H A Dmismatch.h69 auto __last2 = __first2 + (__last1 - __first1); in __mismatch_vectorized() local
108 __first2 = __last2 - __vec_size; in __mismatch_vectorized()
170 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __mismatch() argument
171 while (__first1 != __last1 && __first2 != __last2) { in __mismatch()
182 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Tp* __last2, _Pred& __pred, _Proj1& __proj1… in __mismatch() argument
183 auto __len = std::min(__last1 - __first1, __last2 - __first2); in __mismatch()
192 _InputIterator2 __last2, in mismatch() argument
199 std::__unwrap_iter(__last2), in mismatch()
208 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { in mismatch() argument
209 return std::mismatch(__first1, __last1, __first2, __last2, __equal_to()); in mismatch()
H A Dranges_merge.h58 _Sent2&& __last2, in __merge_impl()
63 for (; __first1 != __last1 && __first2 != __last2; ++__result) { in __merge_impl()
73 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out));
91 _Sent2 __last2,
96 return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
55 __merge_impl(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __merge_impl() argument
H A Dranges_mismatch.h46 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
49 auto __range2 = std::__unwrap_range(__first2, __last2); in __go()
55 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,… in __go()
69 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator()
71 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
H A Dranges_is_permutation.h43 _Sent2 __last2, in __is_permutation_func_impl()
48 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,… in __is_permutation_func_impl()
63 _Sent2 __last2, in operator()
68 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
H A Dranges_lexicographical_compare.h41 _Sent2 __last2, in __lexicographical_compare_impl()
45 while (__first2 != __last2) { in __lexicographical_compare_impl()
67 _Sent2 __last2, in operator()
72 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __comp, __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/__pstl/cpu_algos/
H A Dmerge.h40 _ForwardIterator2 __last2, in operator()
51 __last2, in operator()
73 return __result + (__last1 - __first1) + (__last2 - __first2); in operator()
75 return std::merge(__first1, __last1, __first2, __last2, __result, __comp); in operator()

12