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_END_H 10 #define _LIBCPP___ALGORITHM_RANGES_FIND_END_H 11 12 #include <__algorithm/find_end.h> 13 #include <__algorithm/iterator_operations.h> 14 #include <__algorithm/ranges_iterator_concept.h> 15 #include <__config> 16 #include <__functional/identity.h> 17 #include <__functional/ranges_operations.h> 18 #include <__iterator/concepts.h> 19 #include <__iterator/indirectly_comparable.h> 20 #include <__iterator/iterator_traits.h> 21 #include <__ranges/access.h> 22 #include <__ranges/concepts.h> 23 #include <__ranges/subrange.h> 24 25 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 26 # pragma GCC system_header 27 #endif 28 29 #if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) 30 31 _LIBCPP_BEGIN_NAMESPACE_STD 32 33 namespace ranges { 34 namespace __find_end { 35 struct __fn { 36 template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1, 37 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2, 38 class _Pred = ranges::equal_to, 39 class _Proj1 = identity, 40 class _Proj2 = identity> 41 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 42 _LIBCPP_HIDE_FROM_ABI constexpr 43 subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1, 44 _Iter2 __first2, _Sent2 __last2, 45 _Pred __pred = {}, 46 _Proj1 __proj1 = {}, 47 _Proj2 __proj2 = {}) const { 48 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( 49 __first1, 50 __last1, 51 __first2, 52 __last2, 53 __pred, 54 __proj1, 55 __proj2, 56 __iterator_concept<_Iter1>(), 57 __iterator_concept<_Iter2>()); 58 return {__ret.first, __ret.second}; 59 } 60 61 template <forward_range _Range1, 62 forward_range _Range2, 63 class _Pred = ranges::equal_to, 64 class _Proj1 = identity, 65 class _Proj2 = identity> 66 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2> 67 _LIBCPP_HIDE_FROM_ABI constexpr 68 borrowed_subrange_t<_Range1> operator()(_Range1&& __range1, 69 _Range2&& __range2, 70 _Pred __pred = {}, 71 _Proj1 __proj1 = {}, 72 _Proj2 __proj2 = {}) const { 73 auto __ret = std::__find_end_impl<_RangeAlgPolicy>( 74 ranges::begin(__range1), 75 ranges::end(__range1), 76 ranges::begin(__range2), 77 ranges::end(__range2), 78 __pred, 79 __proj1, 80 __proj2, 81 __iterator_concept<iterator_t<_Range1>>(), 82 __iterator_concept<iterator_t<_Range2>>()); 83 return {__ret.first, __ret.second}; 84 } 85 }; 86 } // namespace __find_end 87 88 inline namespace __cpo { 89 inline constexpr auto find_end = __find_end::__fn{}; 90 } // namespace __cpo 91 } // namespace ranges 92 93 _LIBCPP_END_NAMESPACE_STD 94 95 #endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) 96 97 #endif // _LIBCPP___ALGORITHM_RANGES_FIND_END_H 98