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_CONTAINS_SUBRANGE_H
10#define _LIBCPP___ALGORITHM_RANGES_CONTAINS_SUBRANGE_H
11
12#include <__algorithm/ranges_search.h>
13#include <__config>
14#include <__functional/identity.h>
15#include <__functional/ranges_operations.h>
16#include <__functional/reference_wrapper.h>
17#include <__iterator/concepts.h>
18#include <__iterator/indirectly_comparable.h>
19#include <__iterator/projected.h>
20#include <__ranges/access.h>
21#include <__ranges/concepts.h>
22#include <__ranges/size.h>
23#include <__ranges/subrange.h>
24#include <__utility/move.h>
25
26#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
27#  pragma GCC system_header
28#endif
29
30_LIBCPP_PUSH_MACROS
31#include <__undef_macros>
32
33#if _LIBCPP_STD_VER >= 23
34
35_LIBCPP_BEGIN_NAMESPACE_STD
36
37namespace ranges {
38struct __contains_subrange {
39  template <forward_iterator _Iter1,
40            sentinel_for<_Iter1> _Sent1,
41            forward_iterator _Iter2,
42            sentinel_for<_Iter2> _Sent2,
43            class _Pred  = ranges::equal_to,
44            class _Proj1 = identity,
45            class _Proj2 = identity>
46    requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
47  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool static operator()(
48      _Iter1 __first1,
49      _Sent1 __last1,
50      _Iter2 __first2,
51      _Sent2 __last2,
52      _Pred __pred   = {},
53      _Proj1 __proj1 = {},
54      _Proj2 __proj2 = {}) {
55    if (__first2 == __last2)
56      return true;
57
58    auto __ret = ranges::search(
59        std::move(__first1), __last1, std::move(__first2), __last2, __pred, std::ref(__proj1), std::ref(__proj2));
60    return __ret.empty() == false;
61  }
62
63  template <forward_range _Range1,
64            forward_range _Range2,
65            class _Pred  = ranges::equal_to,
66            class _Proj1 = identity,
67            class _Proj2 = identity>
68    requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
69  [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool static
70  operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) {
71    if constexpr (sized_range<_Range2>) {
72      if (ranges::size(__range2) == 0)
73        return true;
74    } else {
75      if (ranges::begin(__range2) == ranges::end(__range2))
76        return true;
77    }
78
79    auto __ret = ranges::search(__range1, __range2, __pred, std::ref(__proj1), std::ref(__proj2));
80    return __ret.empty() == false;
81  }
82};
83
84inline namespace __cpo {
85inline constexpr auto contains_subrange = __contains_subrange{};
86} // namespace __cpo
87} // namespace ranges
88
89_LIBCPP_END_NAMESPACE_STD
90
91#endif // _LIBCPP_STD_VER >= 23
92
93_LIBCPP_POP_MACROS
94
95#endif // _LIBCPP___ALGORITHM_RANGES_CONTAINS_SUBRANGE_H