__cxx03/__algorithm/ranges_contains_subrange.h

0001 //===----------------------------------------------------------------------===//
0002 //
0003 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
0004 // See https://llvm.org/LICENSE.txt for license information.
0005 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
0006 //
0007 //===----------------------------------------------------------------------===//
0008
0009 #ifndef _LIBCPP___CXX03___ALGORITHM_RANGES_CONTAINS_SUBRANGE_H
0010 #define _LIBCPP___CXX03___ALGORITHM_RANGES_CONTAINS_SUBRANGE_H
0011
0012 #include <__cxx03/__algorithm/ranges_search.h>
0013 #include <__cxx03/__config>
0014 #include <__cxx03/__functional/identity.h>
0015 #include <__cxx03/__functional/ranges_operations.h>
0016 #include <__cxx03/__functional/reference_wrapper.h>
0017 #include <__cxx03/__iterator/concepts.h>
0018 #include <__cxx03/__iterator/indirectly_comparable.h>
0019 #include <__cxx03/__iterator/projected.h>
0020 #include <__cxx03/__ranges/access.h>
0021 #include <__cxx03/__ranges/concepts.h>
0022 #include <__cxx03/__ranges/size.h>
0023 #include <__cxx03/__ranges/subrange.h>
0024 #include <__cxx03/__utility/move.h>
0025
0026 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0027 #  pragma GCC system_header
0028 #endif
0029
0030 _LIBCPP_PUSH_MACROS
0031 #include <__cxx03/__undef_macros>
0032
0033 #if _LIBCPP_STD_VER >= 23
0034
0035 _LIBCPP_BEGIN_NAMESPACE_STD
0036
0037 namespace ranges {
0038 namespace __contains_subrange {
0039 struct __fn {
0040   template <forward_iterator _Iter1,
0041             sentinel_for<_Iter1> _Sent1,
0042             forward_iterator _Iter2,
0043             sentinel_for<_Iter2> _Sent2,
0044             class _Pred  = ranges::equal_to,
0045             class _Proj1 = identity,
0046             class _Proj2 = identity>
0047     requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
0048   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool static operator()(
0049       _Iter1 __first1,
0050       _Sent1 __last1,
0051       _Iter2 __first2,
0052       _Sent2 __last2,
0053       _Pred __pred   = {},
0054       _Proj1 __proj1 = {},
0055       _Proj2 __proj2 = {}) {
0056     if (__first2 == __last2)
0057       return true;
0058
0059     auto __ret = ranges::search(
0060         std::move(__first1), __last1, std::move(__first2), __last2, __pred, std::ref(__proj1), std::ref(__proj2));
0061     return __ret.empty() == false;
0062   }
0063
0064   template <forward_range _Range1,
0065             forward_range _Range2,
0066             class _Pred  = ranges::equal_to,
0067             class _Proj1 = identity,
0068             class _Proj2 = identity>
0069     requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
0070   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool static
0071   operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) {
0072     if constexpr (sized_range<_Range2>) {
0073       if (ranges::size(__range2) == 0)
0074         return true;
0075     } else {
0076       if (ranges::begin(__range2) == ranges::end(__range2))
0077         return true;
0078     }
0079
0080     auto __ret = ranges::search(__range1, __range2, __pred, std::ref(__proj1), std::ref(__proj2));
0081     return __ret.empty() == false;
0082   }
0083 };
0084 } // namespace __contains_subrange
0085
0086 inline namespace __cpo {
0087 inline constexpr auto contains_subrange = __contains_subrange::__fn{};
0088 } // namespace __cpo
0089 } // namespace ranges
0090
0091 _LIBCPP_END_NAMESPACE_STD
0092
0093 #endif // _LIBCPP_STD_VER >= 23
0094
0095 _LIBCPP_POP_MACROS
0096
0097 #endif // _LIBCPP___CXX03___ALGORITHM_RANGES_CONTAINS_SUBRANGE_H