libcxx/include/__algorithm/ranges_find_end.h

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