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_UNIQUE_H |
10 | #define _LIBCPP___ALGORITHM_RANGES_UNIQUE_H |
11 | |
12 | #include <__algorithm/iterator_operations.h> |
13 | #include <__algorithm/make_projected.h> |
14 | #include <__algorithm/unique.h> |
15 | #include <__config> |
16 | #include <__functional/identity.h> |
17 | #include <__functional/invoke.h> |
18 | #include <__functional/ranges_operations.h> |
19 | #include <__iterator/concepts.h> |
20 | #include <__iterator/iterator_traits.h> |
21 | #include <__iterator/permutable.h> |
22 | #include <__iterator/projected.h> |
23 | #include <__ranges/access.h> |
24 | #include <__ranges/concepts.h> |
25 | #include <__ranges/dangling.h> |
26 | #include <__ranges/subrange.h> |
27 | #include <__utility/forward.h> |
28 | #include <__utility/move.h> |
29 | #include <__utility/pair.h> |
30 | |
31 | #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) |
32 | # pragma GCC system_header |
33 | #endif |
34 | |
35 | _LIBCPP_PUSH_MACROS |
36 | #include <__undef_macros> |
37 | |
38 | #if _LIBCPP_STD_VER >= 20 |
39 | |
40 | _LIBCPP_BEGIN_NAMESPACE_STD |
41 | |
42 | namespace ranges { |
43 | namespace __unique { |
44 | |
45 | struct __fn { |
46 | template <permutable _Iter, |
47 | sentinel_for<_Iter> _Sent, |
48 | class _Proj = identity, |
49 | indirect_equivalence_relation<projected<_Iter, _Proj>> _Comp = ranges::equal_to> |
50 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> |
51 | operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { |
52 | auto __ret = |
53 | std::__unique<_RangeAlgPolicy>(std::move(__first), std::move(__last), std::__make_projected(__comp, __proj)); |
54 | return {std::move(__ret.first), std::move(__ret.second)}; |
55 | } |
56 | |
57 | template <forward_range _Range, |
58 | class _Proj = identity, |
59 | indirect_equivalence_relation<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to> |
60 | requires permutable<iterator_t<_Range>> |
61 | [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr borrowed_subrange_t<_Range> |
62 | operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { |
63 | auto __ret = std::__unique<_RangeAlgPolicy>( |
64 | ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj)); |
65 | return {std::move(__ret.first), std::move(__ret.second)}; |
66 | } |
67 | }; |
68 | |
69 | } // namespace __unique |
70 | |
71 | inline namespace __cpo { |
72 | inline constexpr auto unique = __unique::__fn{}; |
73 | } // namespace __cpo |
74 | } // namespace ranges |
75 | |
76 | _LIBCPP_END_NAMESPACE_STD |
77 | |
78 | #endif // _LIBCPP_STD_VER >= 20 |
79 | |
80 | _LIBCPP_POP_MACROS |
81 | |
82 | #endif // _LIBCPP___ALGORITHM_RANGES_UNIQUE_H |
83 | |