1 //===----------------------------------------------------------------------===//
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
7 //===----------------------------------------------------------------------===//
9 #ifndef _LIBCPP___ALGORITHM_RANGES_SEARCH_H
10 #define _LIBCPP___ALGORITHM_RANGES_SEARCH_H
12 #include <__algorithm/iterator_operations.h>
13 #include <__algorithm/search.h>
15 #include <__functional/identity.h>
16 #include <__functional/ranges_operations.h>
17 #include <__iterator/advance.h>
18 #include <__iterator/concepts.h>
19 #include <__iterator/distance.h>
20 #include <__iterator/indirectly_comparable.h>
21 #include <__ranges/access.h>
22 #include <__ranges/concepts.h>
23 #include <__ranges/size.h>
24 #include <__ranges/subrange.h>
26 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
27 # pragma GCC system_header
30 #if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
32 _LIBCPP_BEGIN_NAMESPACE_STD
37 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
38 _LIBCPP_HIDE_FROM_ABI static constexpr subrange<_Iter1> __ranges_search_impl(
46 if constexpr (sized_sentinel_for<_Sent2, _Iter2>) {
47 auto __size2 = ranges::distance(__first2, __last2);
49 return {__first1, __first1};
51 if constexpr (sized_sentinel_for<_Sent1, _Iter1>) {
52 auto __size1 = ranges::distance(__first1, __last1);
53 if (__size1 < __size2) {
54 ranges::advance(__first1, __last1);
55 return {__first1, __first1};
58 if constexpr (random_access_iterator<_Iter1> && random_access_iterator<_Iter2>) {
59 auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>(
60 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2);
61 return {__ret.first, __ret.second};
67 std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
68 return {__ret.first, __ret.second};
71 template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1,
72 forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2,
73 class _Pred = ranges::equal_to,
74 class _Proj1 = identity,
75 class _Proj2 = identity>
76 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
77 _LIBCPP_HIDE_FROM_ABI constexpr
78 subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1,
79 _Iter2 __first2, _Sent2 __last2,
82 _Proj2 __proj2 = {}) const {
83 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
86 template <forward_range _Range1,
87 forward_range _Range2,
88 class _Pred = ranges::equal_to,
89 class _Proj1 = identity,
90 class _Proj2 = identity>
91 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
92 _LIBCPP_HIDE_FROM_ABI constexpr
93 borrowed_subrange_t<_Range1> operator()(_Range1&& __range1,
97 _Proj2 __proj2 = {}) const {
98 auto __first1 = ranges::begin(__range1);
99 if constexpr (sized_range<_Range2>) {
100 auto __size2 = ranges::size(__range2);
102 return {__first1, __first1};
103 if constexpr (sized_range<_Range1>) {
104 auto __size1 = ranges::size(__range1);
105 if (__size1 < __size2) {
106 ranges::advance(__first1, ranges::end(__range1));
107 return {__first1, __first1};
112 return __ranges_search_impl(
113 ranges::begin(__range1),
114 ranges::end(__range1),
115 ranges::begin(__range2),
116 ranges::end(__range2),
123 } // namespace __search
125 inline namespace __cpo {
126 inline constexpr auto search = __search::__fn{};
128 } // namespace ranges
130 _LIBCPP_END_NAMESPACE_STD
132 #endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
134 #endif // _LIBCPP___ALGORITHM_RANGES_SEARCH_H