1 //===----------------------------------------------------------------------===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 9 #ifndef _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H 10 #define _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H 11 12 #include <__config> 13 #include <__functional/identity.h> 14 #include <__functional/invoke.h> 15 #include <__functional/ranges_operations.h> 16 #include <__iterator/concepts.h> 17 #include <__iterator/indirectly_comparable.h> 18 #include <__ranges/access.h> 19 #include <__ranges/concepts.h> 20 #include <__ranges/dangling.h> 21 #include <__utility/move.h> 22 23 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 24 # pragma GCC system_header 25 #endif 26 27 _LIBCPP_PUSH_MACROS 28 #include <__undef_macros> 29 30 #if _LIBCPP_STD_VER >= 20 31 32 _LIBCPP_BEGIN_NAMESPACE_STD 33 34 namespace ranges { 35 namespace __find_first_of { 36 struct __fn { 37 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2> __find_first_of_impl__fn38 _LIBCPP_HIDE_FROM_ABI constexpr static _Iter1 __find_first_of_impl( 39 _Iter1 __first1, 40 _Sent1 __last1, 41 _Iter2 __first2, 42 _Sent2 __last2, 43 _Pred& __pred, 44 _Proj1& __proj1, 45 _Proj2& __proj2) { 46 for (; __first1 != __last1; ++__first1) { 47 for (auto __j = __first2; __j != __last2; ++__j) { 48 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) 49 return __first1; 50 } 51 } 52 return __first1; 53 } 54 55 template <input_iterator _Iter1, 56 sentinel_for<_Iter1> _Sent1, 57 forward_iterator _Iter2, 58 sentinel_for<_Iter2> _Sent2, 59 class _Pred = ranges::equal_to, 60 class _Proj1 = identity, 61 class _Proj2 = identity> 62 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> operator__fn63 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Iter1 operator()( 64 _Iter1 __first1, 65 _Sent1 __last1, 66 _Iter2 __first2, 67 _Sent2 __last2, 68 _Pred __pred = {}, 69 _Proj1 __proj1 = {}, 70 _Proj2 __proj2 = {}) const { 71 return __find_first_of_impl( 72 std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); 73 } 74 75 template <input_range _Range1, 76 forward_range _Range2, 77 class _Pred = ranges::equal_to, 78 class _Proj1 = identity, 79 class _Proj2 = identity> 80 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2> operator__fn81 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_iterator_t<_Range1> operator()( 82 _Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { 83 return __find_first_of_impl( 84 ranges::begin(__range1), 85 ranges::end(__range1), 86 ranges::begin(__range2), 87 ranges::end(__range2), 88 __pred, 89 __proj1, 90 __proj2); 91 } 92 }; 93 } // namespace __find_first_of 94 95 inline namespace __cpo { 96 inline constexpr auto find_first_of = __find_first_of::__fn{}; 97 } // namespace __cpo 98 } // namespace ranges 99 100 _LIBCPP_END_NAMESPACE_STD 101 102 #endif // _LIBCPP_STD_VER >= 20 103 104 _LIBCPP_POP_MACROS 105 106 #endif // _LIBCPP___ALGORITHM_RANGES_FIND_FIRST_OF_H 107