v1/__algorithm/ranges_equal_range.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___ALGORITHM_RANGES_EQUAL_RANGE_H
0010 #define _LIBCPP___ALGORITHM_RANGES_EQUAL_RANGE_H
0011
0012 #include <__algorithm/equal_range.h>
0013 #include <__algorithm/iterator_operations.h>
0014 #include <__config>
0015 #include <__functional/identity.h>
0016 #include <__functional/invoke.h>
0017 #include <__functional/ranges_operations.h>
0018 #include <__iterator/concepts.h>
0019 #include <__iterator/iterator_traits.h>
0020 #include <__iterator/projected.h>
0021 #include <__ranges/access.h>
0022 #include <__ranges/concepts.h>
0023 #include <__ranges/dangling.h>
0024 #include <__ranges/subrange.h>
0025 #include <__utility/forward.h>
0026 #include <__utility/move.h>
0027 #include <__utility/pair.h>
0028
0029 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
0030 #  pragma GCC system_header
0031 #endif
0032
0033 _LIBCPP_PUSH_MACROS
0034 #include <__undef_macros>
0035
0036 #if _LIBCPP_STD_VER >= 20
0037
0038 _LIBCPP_BEGIN_NAMESPACE_STD
0039
0040 namespace ranges {
0041 struct __equal_range {
0042   template <forward_iterator _Iter,
0043             sentinel_for<_Iter> _Sent,
0044             class _Tp,
0045             class _Proj                                                           = identity,
0046             indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>> _Comp = ranges::less>
0047   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter>
0048   operator()(_Iter __first, _Sent __last, const _Tp& __value, _Comp __comp = {}, _Proj __proj = {}) const {
0049     auto __ret = std::__equal_range<_RangeAlgPolicy>(std::move(__first), std::move(__last), __value, __comp, __proj);
0050     return {std::move(__ret.first), std::move(__ret.second)};
0051   }
0052
0053   template <forward_range _Range,
0054             class _Tp,
0055             class _Proj                                                                        = identity,
0056             indirect_strict_weak_order<const _Tp*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
0057   [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_subrange_t<_Range>
0058   operator()(_Range&& __range, const _Tp& __value, _Comp __comp = {}, _Proj __proj = {}) const {
0059     auto __ret =
0060         std::__equal_range<_RangeAlgPolicy>(ranges::begin(__range), ranges::end(__range), __value, __comp, __proj);
0061     return {std::move(__ret.first), std::move(__ret.second)};
0062   }
0063 };
0064
0065 inline namespace __cpo {
0066 inline constexpr auto equal_range = __equal_range{};
0067 } // namespace __cpo
0068 } // namespace ranges
0069
0070 _LIBCPP_END_NAMESPACE_STD
0071
0072 #endif // _LIBCPP_STD_VER >= 20
0073
0074 _LIBCPP_POP_MACROS
0075
0076 #endif // _LIBCPP___ALGORITHM_RANGES_EQUAL_RANGE_H