| /llvm-project/libcxx/include/__algorithm/ |
| H A D | equal.h | 39 for (; __first1 != __last1; ++__first1, (void)++__first2) in __equal_iter_impl() argument
53 return std::__constexpr_memcmp_equal(__first1, __first2, __element_count(__last1 - __first1)); in __equal_iter_impl() argument
66 return std::equal(__first1, __last1, __first2, __equal_to()); in equal() argument
74 while (__first1 != __last1 in __equal_impl() argument
59 equal(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_BinaryPredicate __pred) equal() argument
94 __equal_impl(_Tp * __first1,_Tp * __last1,_Up * __first2,_Up *,_Pred &,_Proj1 &,_Proj2 &) __equal_impl() argument
101 equal(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_BinaryPredicate __pred) equal() argument
123 equal(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2) equal() argument
[all...] |
| H A D | mismatch.h | 41 __mismatch_loop(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch_loop() argument
53 __mismatch(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
61 __mismatch_vectorized(_Iter __first1,_Iter __last1,_Iter __first2) __mismatch_vectorized() argument
128 __mismatch(_Tp * __first1,_Tp * __last1,_Tp * __first2,_Pred &,_Proj1 &,_Proj2 &) __mismatch() argument
141 __mismatch(_Tp * __first1,_Tp * __last1,_Tp * __first2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
154 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_BinaryPredicate __pred) mismatch() argument
163 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2) mismatch() argument
170 __mismatch(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
182 __mismatch(_Tp * __first1,_Tp * __last1,_Tp * __first2,_Tp * __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __mismatch() argument
190 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_BinaryPredicate __pred) mismatch() argument
208 mismatch(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2) mismatch() argument
[all...] |
| H A D | swap_ranges.h | 29 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel… in __swap_ranges()
42 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges()
54 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in swap_ranges()
|
| H A D | search.h | 40 _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_forward_impl() argument
85 _Sent1 __last1, in __search_random_access_impl() argument
131 _Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl() argument
158 __search_impl(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2) __search_impl() argument
165 search(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred) search() argument
177 search(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2) search() argument
[all...] |
| H A D | lexicographical_compare.h | 26 __lexicographical_compare(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) __lexicographical_compare() argument
42 lexicographical_compare(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) lexicographical_compare() argument
51 lexicographical_compare(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2) lexicographical_compare() argument
[all...] |
| H A D | find_first_of.h | 49 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); in find_first_of() argument
26 __find_first_of_ce(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate && __pred) __find_first_of_ce() argument
40 find_first_of(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred) find_first_of() argument
|
| H A D | includes.h | 71 return std::includes(std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __less<>()); in includes() argument
33 __includes(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __includes() argument
52 includes(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) includes() argument
|
| H A D | merge.h | 27 __merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge() argument
49 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
|
| H A D | set_difference.h | 36 __set_difference(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp) __set_difference() argument
55 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_difference() argument
68 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_difference() argument
|
| H A D | find_end.h | 41 __find_end_impl(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Pred & __pred,_Proj1 & __proj1,_Proj2 & __proj2,forward_iterator_tag,forward_iterator_tag) __find_end_impl() argument
101 auto __last1 = _IterOps::next(__first1, __sent1); __find_end() local
153 auto __last1 = _IterOps<_AlgPolicy>::next(__first1, __sent1); __find_end() local
189 __find_end_classic(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate & __pred) __find_end_classic() argument
210 find_end(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_BinaryPredicate __pred) find_end() argument
219 find_end(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2) find_end() argument
[all...] |
| H A D | set_intersection.h | 44 __set_intersection(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_intersection() argument
67 set_intersection(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_intersection() argument
85 set_intersection(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_intersection() argument
[all...] |
| H A D | set_symmetric_difference.h | 45 while (__first1 != __last1) { in __set_symmetric_difference() argument
74 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_symmetric_difference() argument
92 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_symmetric_difference() argument
|
| H A D | set_union.h | 44 for (; __first1 != __last1; ++__result) { in __set_union() argument
70 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_union() argument
88 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_union() argument
|
| H A D | stable_sort.h | 40 __insertion_sort_move(_BidirectionalIterator __first1,_BidirectionalIterator __last1,typename iterator_traits<_BidirectionalIterator>::value_type * __first2,_Compare __comp) __insertion_sort_move() argument
73 __merge_move_construct(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,typename iterator_traits<_InputIterator1>::value_type * __result,_Compare __comp) __merge_move_construct() argument
111 __merge_move_assign(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge_move_assign() argument
146 __stable_sort_move(_RandomAccessIterator __first1,_RandomAccessIterator __last1,_Compare __comp,typename iterator_traits<_RandomAccessIterator>::difference_type __len,typename iterator_traits<_RandomAccessIterator>::value_type * __first2) __stable_sort_move() argument
[all...] |
| H A D | transform.h | 31 _InputIterator1 __last1, in transform()
|
| H A D | pstl.h | 150 _ForwardIterator1 __last1, in equal() argument
170 equal(_ExecutionPolicy&& __policy, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in equal() argument
191 _ForwardIterator1 __last1, in equal() argument
215 _ForwardIterator1 __last1, in equal() argument
373 _ForwardIterator1 __last1, in merge() argument
402 merge(_ExecutionPolicy && __policy,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardIterator2 __last2,_ForwardOutIterator __result) merge() argument
638 transform(_ExecutionPolicy && __policy,_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2,_ForwardOutIterator __result,_BinaryOperation __op) transform() argument
[all...] |
| H A D | lexicographical_compare_three_way.h | 114 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las… in lexicographical_compare_three_way()
|
| H A D | ranges_merge.h | 56 __merge_impl(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __merge_impl() argument
|
| /llvm-project/libcxx/include/__numeric/ |
| H A D | inner_product.h | 27 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in… in inner_product()
40 _InputIterator1 __last1, in inner_product()
|
| H A D | transform_reduce.h | 38 _InputIterator1 __last1, in transform_reduce()
50 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp _… in transform_reduce()
|
| H A D | pstl.h | 96 _ForwardIterator1 __last1, in transform_reduce() argument
126 _ForwardIterator1 __last1, in transform_reduce() argument
|
| /llvm-project/pstl/include/pstl/internal/ |
| H A D | parallel_backend_utils.h | 143 __set_union_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __fi… in __set_union_construct()
171 __set_intersection_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterato… in __set_intersection_construct()
197 __set_difference_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2… in __set_difference_construct()
226 __set_symmetric_difference_construct(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forwar… in __set_symmetric_difference_construct()
|
| H A D | glue_algorithm_impl.h | 283 swap_ranges(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, in swap_ranges()
320 transform(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forwar… in transform()
644 mismatch(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forward… in mismatch()
655 mismatch(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forward… in mismatch()
664 mismatch(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forward… in mismatch()
673 mismatch(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _Forward… in mismatch()
684 equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIte… in equal()
695 equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIte… in equal()
702 equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIte… in equal()
713 equal(_ExecutionPolicy&& __exec, _ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIte… in equal()
[all …]
|
| H A D | algorithm_impl.h | 223 __brick_walk2(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _F… in __brick_walk2()
233 __brick_walk2(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterato… in __brick_walk2()
260 __pattern_walk2(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, in __pattern_walk2()
270 _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Function __f) in __pattern_walk2()
306 …attern_walk2_brick(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, in __pattern_walk2_brick()
316 … _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Brick __brick) in __pattern_walk2_brick()
366 __brick_walk3(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, in __brick_walk3()
376 __brick_walk3(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterato… in __brick_walk3()
385 __pattern_walk3(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, in __pattern_walk3()
395 … _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _RandomAccessIterator3 __first3, in __pattern_walk3()
[all …]
|
| H A D | numeric_impl.h | 36 __brick_transform_reduce(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 _… in __brick_transform_reduce()
46 __brick_transform_reduce(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, in __brick_transform_reduce()
60 …n_transform_reduce(_Tag, _ExecutionPolicy&&, _ForwardIterator1 __first1, _ForwardIterator1 __last1, in __pattern_transform_reduce()
72 … _RandomAccessIterator1 __last1, _RandomAccessIterator2 __first2, _Tp __init, in __pattern_transform_reduce()
|