1*4bdff4beSrobert //===----------------------------------------------------------------------===// 2*4bdff4beSrobert // 3*4bdff4beSrobert // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*4bdff4beSrobert // See https://llvm.org/LICENSE.txt for license information. 5*4bdff4beSrobert // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*4bdff4beSrobert // 7*4bdff4beSrobert //===----------------------------------------------------------------------===// 8*4bdff4beSrobert 9*4bdff4beSrobert #ifndef _LIBCPP___ALGORITHM_RANGES_SEARCH_H 10*4bdff4beSrobert #define _LIBCPP___ALGORITHM_RANGES_SEARCH_H 11*4bdff4beSrobert 12*4bdff4beSrobert #include <__algorithm/iterator_operations.h> 13*4bdff4beSrobert #include <__algorithm/search.h> 14*4bdff4beSrobert #include <__config> 15*4bdff4beSrobert #include <__functional/identity.h> 16*4bdff4beSrobert #include <__functional/ranges_operations.h> 17*4bdff4beSrobert #include <__iterator/advance.h> 18*4bdff4beSrobert #include <__iterator/concepts.h> 19*4bdff4beSrobert #include <__iterator/distance.h> 20*4bdff4beSrobert #include <__iterator/indirectly_comparable.h> 21*4bdff4beSrobert #include <__ranges/access.h> 22*4bdff4beSrobert #include <__ranges/concepts.h> 23*4bdff4beSrobert #include <__ranges/size.h> 24*4bdff4beSrobert #include <__ranges/subrange.h> 25*4bdff4beSrobert #include <__utility/pair.h> 26*4bdff4beSrobert 27*4bdff4beSrobert #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 28*4bdff4beSrobert # pragma GCC system_header 29*4bdff4beSrobert #endif 30*4bdff4beSrobert 31*4bdff4beSrobert #if _LIBCPP_STD_VER > 17 32*4bdff4beSrobert 33*4bdff4beSrobert _LIBCPP_BEGIN_NAMESPACE_STD 34*4bdff4beSrobert 35*4bdff4beSrobert namespace ranges { 36*4bdff4beSrobert namespace __search { 37*4bdff4beSrobert struct __fn { 38*4bdff4beSrobert template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2> __ranges_search_impl__fn39*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI static constexpr subrange<_Iter1> __ranges_search_impl( 40*4bdff4beSrobert _Iter1 __first1, 41*4bdff4beSrobert _Sent1 __last1, 42*4bdff4beSrobert _Iter2 __first2, 43*4bdff4beSrobert _Sent2 __last2, 44*4bdff4beSrobert _Pred& __pred, 45*4bdff4beSrobert _Proj1& __proj1, 46*4bdff4beSrobert _Proj2& __proj2) { 47*4bdff4beSrobert if constexpr (sized_sentinel_for<_Sent2, _Iter2>) { 48*4bdff4beSrobert auto __size2 = ranges::distance(__first2, __last2); 49*4bdff4beSrobert if (__size2 == 0) 50*4bdff4beSrobert return {__first1, __first1}; 51*4bdff4beSrobert 52*4bdff4beSrobert if constexpr (sized_sentinel_for<_Sent1, _Iter1>) { 53*4bdff4beSrobert auto __size1 = ranges::distance(__first1, __last1); 54*4bdff4beSrobert if (__size1 < __size2) { 55*4bdff4beSrobert ranges::advance(__first1, __last1); 56*4bdff4beSrobert return {__first1, __first1}; 57*4bdff4beSrobert } 58*4bdff4beSrobert 59*4bdff4beSrobert if constexpr (random_access_iterator<_Iter1> && random_access_iterator<_Iter2>) { 60*4bdff4beSrobert auto __ret = std::__search_random_access_impl<_RangeAlgPolicy>( 61*4bdff4beSrobert __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); 62*4bdff4beSrobert return {__ret.first, __ret.second}; 63*4bdff4beSrobert } 64*4bdff4beSrobert } 65*4bdff4beSrobert } 66*4bdff4beSrobert 67*4bdff4beSrobert auto __ret = 68*4bdff4beSrobert std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); 69*4bdff4beSrobert return {__ret.first, __ret.second}; 70*4bdff4beSrobert } 71*4bdff4beSrobert 72*4bdff4beSrobert template <forward_iterator _Iter1, sentinel_for<_Iter1> _Sent1, 73*4bdff4beSrobert forward_iterator _Iter2, sentinel_for<_Iter2> _Sent2, 74*4bdff4beSrobert class _Pred = ranges::equal_to, 75*4bdff4beSrobert class _Proj1 = identity, 76*4bdff4beSrobert class _Proj2 = identity> 77*4bdff4beSrobert requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 78*4bdff4beSrobert _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr operator__fn79*4bdff4beSrobert subrange<_Iter1> operator()(_Iter1 __first1, _Sent1 __last1, 80*4bdff4beSrobert _Iter2 __first2, _Sent2 __last2, 81*4bdff4beSrobert _Pred __pred = {}, 82*4bdff4beSrobert _Proj1 __proj1 = {}, 83*4bdff4beSrobert _Proj2 __proj2 = {}) const { 84*4bdff4beSrobert return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); 85*4bdff4beSrobert } 86*4bdff4beSrobert 87*4bdff4beSrobert template <forward_range _Range1, 88*4bdff4beSrobert forward_range _Range2, 89*4bdff4beSrobert class _Pred = ranges::equal_to, 90*4bdff4beSrobert class _Proj1 = identity, 91*4bdff4beSrobert class _Proj2 = identity> 92*4bdff4beSrobert requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2> 93*4bdff4beSrobert _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr operator__fn94*4bdff4beSrobert borrowed_subrange_t<_Range1> operator()(_Range1&& __range1, 95*4bdff4beSrobert _Range2&& __range2, 96*4bdff4beSrobert _Pred __pred = {}, 97*4bdff4beSrobert _Proj1 __proj1 = {}, 98*4bdff4beSrobert _Proj2 __proj2 = {}) const { 99*4bdff4beSrobert auto __first1 = ranges::begin(__range1); 100*4bdff4beSrobert if constexpr (sized_range<_Range2>) { 101*4bdff4beSrobert auto __size2 = ranges::size(__range2); 102*4bdff4beSrobert if (__size2 == 0) 103*4bdff4beSrobert return {__first1, __first1}; 104*4bdff4beSrobert if constexpr (sized_range<_Range1>) { 105*4bdff4beSrobert auto __size1 = ranges::size(__range1); 106*4bdff4beSrobert if (__size1 < __size2) { 107*4bdff4beSrobert ranges::advance(__first1, ranges::end(__range1)); 108*4bdff4beSrobert return {__first1, __first1}; 109*4bdff4beSrobert } 110*4bdff4beSrobert } 111*4bdff4beSrobert } 112*4bdff4beSrobert 113*4bdff4beSrobert return __ranges_search_impl( 114*4bdff4beSrobert ranges::begin(__range1), 115*4bdff4beSrobert ranges::end(__range1), 116*4bdff4beSrobert ranges::begin(__range2), 117*4bdff4beSrobert ranges::end(__range2), 118*4bdff4beSrobert __pred, 119*4bdff4beSrobert __proj1, 120*4bdff4beSrobert __proj2); 121*4bdff4beSrobert } 122*4bdff4beSrobert 123*4bdff4beSrobert }; 124*4bdff4beSrobert } // namespace __search 125*4bdff4beSrobert 126*4bdff4beSrobert inline namespace __cpo { 127*4bdff4beSrobert inline constexpr auto search = __search::__fn{}; 128*4bdff4beSrobert } // namespace __cpo 129*4bdff4beSrobert } // namespace ranges 130*4bdff4beSrobert 131*4bdff4beSrobert _LIBCPP_END_NAMESPACE_STD 132*4bdff4beSrobert 133*4bdff4beSrobert #endif // _LIBCPP_STD_VER > 17 134*4bdff4beSrobert 135*4bdff4beSrobert #endif // _LIBCPP___ALGORITHM_RANGES_SEARCH_H 136