| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | search.h | 43 return std::make_pair(__first1, __first1); // Everything matches an empty sequence in __search_forward_impl() 49 return std::make_pair(__first1, __first1); in __search_forward_impl() 53 ++__first1; in __search_forward_impl() 56 _Iter1 __m1 = __first1; in __search_forward_impl() 68 ++__first1; in __search_forward_impl() 97 return std::make_pair(__first1, __first1); in __search_random_access_impl() 101 ++__first1; in __search_random_access_impl() 104 _Iter1 __m1 = __first1; in __search_random_access_impl() 108 return std::make_pair(__first1, __first1 + _DiffT1(__size2)); in __search_random_access_impl() 111 ++__first1; in __search_random_access_impl() [all …]
|
| H A D | equal.h | 27 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 __equal(_RandomAccessIterator1 __first1, _RandomAccessIterator1 __last1, _RandomAccessIterator2 __f… 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 D | is_permutation.h | 63 for (auto __i = __first1; __i != __last1; ++__i) { 65 auto __match = __first1; 101 for (; __first1 != __last1; ++__first1, (void)++__first2) { 102 if (!__pred(*__first1, *__first2)) 106 if (__first1 == __last1) 111 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1); 130 while (__first1 != __last1 && __first2 != __last2) { 133 ++__first1; 137 if (__first1 == __last1) 143 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1); [all …]
|
| H A D | mismatch.h | 27 …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 D | find_end.h | 41 _Iter1 __first1, in __find_end_impl() argument 61 ++__first1; in __find_end_impl() 64 _Iter1 __m1 = __first1; in __find_end_impl() 68 __match_first = __first1; in __find_end_impl() 70 ++__first1; in __find_end_impl() 78 ++__first1; in __find_end_impl() 95 _Iter1 __first1, in __find_end() argument 104 auto __last1 = _IterOps::next(__first1, __sent1); in __find_end() 148 _Iter1 __first1, in __find_end() argument 164 auto __len1 = __last1 - __first1; in __find_end() [all …]
|
| H A D | ranges_search.h | 39 _Iter1 __first1, in __ranges_search_impl() 49 return {__first1, __first1}; in __ranges_search_impl() 52 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl() 54 ranges::advance(__first1, __last1); in __ranges_search_impl() 55 return {__first1, __first1}; in __ranges_search_impl() 60 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl() 78 subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1, in operator() 98 auto __first1 = ranges::begin(__range1); local 102 return {__first1, __first1}; 106 ranges::advance(__first1, ranges::end(__range1)); [all …]
|
| H A D | swap_ranges.h | 28 while (__first1 != __last1 && __first2 != __last2) { in __swap_ranges() 29 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges() 30 ++__first1; 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 42 while (__first1 != __last1) { in __swap_ranges() 43 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges() 44 ++__first1; 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 D | set_difference.h | 33 while (__first1 != __last1 && __first2 != __last2) { in __set_difference() 34 if (__comp(*__first1, *__first2)) { in __set_difference() 35 *__result = *__first1; in __set_difference() 36 ++__first1; in __set_difference() 38 } else if (__comp(*__first2, *__first1)) { in __set_difference() 41 ++__first1; in __set_difference() 45 return std::__copy(std::move(__first1), std::move(__last1), std::move(__result)); in __set_difference() 50 _InputIterator1 __first1, in set_difference() argument 57 …return std::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp).se… in set_difference() 62 _InputIterator1 __first1, in set_difference() argument [all …]
|
| H A D | stable_sort.h | 42 if (__first1 == __last1) in __merge_move_construct() 51 … for (; __first1 != __last1; ++__first1, (void) ++__result, __d.template __incr<value_type>()) in __merge_move_construct() 56 if (__comp(*__first2, *__first1)) in __merge_move_construct() 66 ++__first1; in __merge_move_construct() 79 for (; __first1 != __last1; ++__result) in __merge_move_assign() 83 for (; __first1 != __last1; ++__first1, (void) ++__result) in __merge_move_assign() 87 if (__comp(*__first2, *__first1)) in __merge_move_assign() 94 *__result = _Ops::__iter_move(__first1); in __merge_move_assign() 95 ++__first1; in __merge_move_assign() 127 if (__comp(*--__last1, *__first1)) in __stable_sort_move() [all …]
|
| H A D | set_symmetric_difference.h | 41 while (__first1 != __last1) { in __set_symmetric_difference() 47 if (__comp(*__first1, *__first2)) { in __set_symmetric_difference() 48 *__result = *__first1; in __set_symmetric_difference() 50 ++__first1; in __set_symmetric_difference() 52 if (__comp(*__first2, *__first1)) { in __set_symmetric_difference() 56 ++__first1; in __set_symmetric_difference() 63 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second))); in __set_symmetric_difference() 68 _InputIterator1 __first1, in set_symmetric_difference() argument 76 std::move(__first1), in set_symmetric_difference() 87 _InputIterator1 __first1, in set_symmetric_difference() argument [all …]
|
| H A D | merge.h | 27 __merge(_InputIterator1 __first1, _InputIterator1 __last1, in __merge() argument 30 for (; __first1 != __last1; ++__result) in __merge() 33 return _VSTD::copy(__first1, __last1, __result); in __merge() 34 if (__comp(*__first2, *__first1)) in __merge() 41 *__result = *__first1; in __merge() 42 ++__first1; in __merge() 51 merge(_InputIterator1 __first1, _InputIterator1 __last1, in merge() argument 55 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in merge() 61 merge(_InputIterator1 __first1, _InputIterator1 __last1, in merge() argument 66 return _VSTD::merge(__first1, __last1, __first2, __last2, __result, __less<__v1, __v2>()); in merge()
|
| H A D | set_intersection.h | 42 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection() 43 if (__comp(*__first1, *__first2)) in __set_intersection() 44 ++__first1; in __set_intersection() 46 if (!__comp(*__first2, *__first1)) { in __set_intersection() 47 *__result = *__first1; in __set_intersection() 49 ++__first1; in __set_intersection() 56 _IterOps<_AlgPolicy>::next(std::move(__first1), std::move(__last1)), in __set_intersection() 63 _InputIterator1 __first1, in set_intersection() argument 71 std::move(__first1), in set_intersection() 82 _InputIterator1 __first1, in set_intersection() argument [all …]
|
| H A D | find_first_of.h | 24 _LIBCPP_CONSTEXPR_AFTER_CXX11 _ForwardIterator1 __find_first_of_ce(_ForwardIterator1 __first1, in __find_first_of_ce() argument 29 for (; __first1 != __last1; ++__first1) in __find_first_of_ce() 31 if (__pred(*__first1, *__j)) in __find_first_of_ce() 32 return __first1; 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 D | lexicographical_compare.h | 25 __lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, 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() 42 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, in lexicographical_compare() argument 46 … return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare() 53 lexicographical_compare(_InputIterator1 __first1, _InputIterator1 __last1, in lexicographical_compare() argument 56 return _VSTD::lexicographical_compare(__first1, __last1, __first2, __last2, in lexicographical_compare()
|
| H A D | includes.h | 29 __includes(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, in __includes() argument 31 for (; __first2 != __last2; ++__first1) { in __includes() 32 if (__first1 == __last1 || std::__invoke( 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() 43 _InputIterator1 __first1, 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 61 std::move(__first1), in includes()
|
| H A D | set_union.h | 40 for (; __first1 != __last1; ++__result) { in __set_union() 42 auto __ret1 = std::__copy_impl(std::move(__first1), std::move(__last1), std::move(__result)); in __set_union() 46 if (__comp(*__first2, *__first1)) { in __set_union() 50 if (!__comp(*__first1, *__first2)) { in __set_union() 53 *__result = *__first1; in __set_union() 54 ++__first1; in __set_union() 59 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second))); in __set_union() 64 _InputIterator1 __first1, in set_union() argument 72 std::move(__first1), in set_union() 83 _InputIterator1 __first1, in set_union() argument [all …]
|
| H A D | ranges_find_first_of.h | 37 _Iter1 __find_first_of_impl(_Iter1 __first1, _Sent1 __last1, in __find_first_of_impl() 42 for (; __first1 != __last1; ++__first1) { in __find_first_of_impl() 44 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl() 45 return __first1; in __find_first_of_impl() 48 return __first1; in __find_first_of_impl() 58 _Iter1 operator()(_Iter1 __first1, _Sent1 __last1, in operator() 63 return __find_first_of_impl(std::move(__first1), std::move(__last1),
|
| H A D | ranges_equal.h | 41 bool __equal_impl(_Iter1 __first1, _Sent1 __last1, 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() 49 ++__first1; in __equal_impl() 52 return __first1 == __last1 && __first2 == __last2; in __equal_impl() 64 bool operator()(_Iter1 __first1, _Sent1 __last1, in operator() 70 if (__last1 - __first1 != __last2 - __first2) 73 return __equal_impl(std::move(__first1), std::move(__last1),
|
| H A D | ranges_lexicographical_compare.h | 36 bool __lexicographical_compare_impl(_Iter1 __first1, _Sent1 __last1, in __lexicographical_compare_impl() 42 if (__first1 == __last1 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() 47 ++__first1; in __lexicographical_compare_impl() 59 bool operator()(_Iter1 __first1, _Sent1 __last1, in operator() 64 return __lexicographical_compare_impl(std::move(__first1), std::move(__last1),
|
| H A D | ranges_merge.h | 52 _InIter1&& __first1, 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() 65 *__result = *__first1; in __merge_impl() 66 ++__first1; in __merge_impl() 69 auto __ret1 = ranges::copy(std::move(__first1), std::move(__last1), std::move(__result)); in __merge_impl() 86 _InIter1 __first1, in operator() 94 …return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __pr…
|
| H A D | ranges_mismatch.h | 43 __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() 48 ++__first1; 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 D | parallel_backend_utils.h | 153 if (__comp(*__first2, *__first1)) in __set_union_construct() 163 ++__first1; in __set_union_construct() 178 if (__comp(*__first1, *__first2)) in __set_intersection_construct() 179 ++__first1; in __set_intersection_construct() 186 ++__first1; in __set_intersection_construct() 203 for (; __first1 != __last1;) in __set_difference_construct() 212 ++__first1; in __set_difference_construct() 217 ++__first1; in __set_difference_construct() 232 for (; __first1 != __last1;) in __set_symmetric_difference_construct() 241 ++__first1; in __set_symmetric_difference_construct() [all …]
|
| H A D | algorithm_impl.h | 226 for (; __first1 != __last1; ++__first1, ++__first2) in __brick_walk2() 227 __f(*__first1, *__first2); in __brick_walk2() 237 return __unseq_backend::__simd_walk_2(__first1, __last1 - __first1, __first2, __f); in __brick_walk2() 246 __f(*__first1, *__first2); in __brick_walk2_n() 369 for (; __first1 != __last1; ++__first1, ++__first2, ++__first3) in __brick_walk3() 379 return __unseq_backend::__simd_walk_3(__first1, __last1 - __first1, __first2, __first3, __f); in __brick_walk3() 2850 __first1 = std::lower_bound(__first1, __last1, *__first2, __comp); in __pattern_includes() 2851 if (__first1 == __last1) in __pattern_includes() 2855 return !__comp(*__first1, *__first2) && !__comp(*__first2, *__first1); in __pattern_includes() 2938 _ForwardIterator1 __b = __first1 + __i, __e = __first1 + (__i + __len); in __parallel_set_op() [all …]
|
| /llvm-project-15.0.7/libcxx/include/__numeric/ |
| H A D | inner_product.h | 25 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 D | transform_reduce.h | 34 …BCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 _Tp transform_reduce(_InputIterator1 __first1, in transform_reduce() argument 38 for (; __first1 != __last1; ++__first1, (void)++__first2) in transform_reduce() 39 __init = __b1(__init, __b2(*__first1, *__first2)); in transform_reduce() 44 …BCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17 _Tp transform_reduce(_InputIterator1 __first1, in transform_reduce() argument 47 return _VSTD::transform_reduce(__first1, __last1, __first2, _VSTD::move(__init), _VSTD::plus<>(), in transform_reduce()
|