1 // -*- C++ -*- 2 //===----------------------------------------------------------------------===// 3 // 4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5 // See https://llvm.org/LICENSE.txt for license information. 6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 // 8 //===----------------------------------------------------------------------===// 9 10 #ifndef _LIBCPP___ITERATOR_CONCEPTS_H 11 #define _LIBCPP___ITERATOR_CONCEPTS_H 12 13 #include <__config> 14 #include <__iterator/incrementable_traits.h> 15 #include <__iterator/iter_move.h> 16 #include <__iterator/iterator_traits.h> 17 #include <__iterator/readable_traits.h> 18 #include <__memory/pointer_traits.h> 19 #include <__utility/forward.h> 20 #include <concepts> 21 #include <type_traits> 22 23 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 24 #pragma GCC system_header 25 #endif 26 27 _LIBCPP_PUSH_MACROS 28 #include <__undef_macros> 29 30 _LIBCPP_BEGIN_NAMESPACE_STD 31 32 #if !defined(_LIBCPP_HAS_NO_RANGES) 33 34 // clang-format off 35 36 // [iterator.concept.readable] 37 template<class _In> 38 concept __indirectly_readable_impl = 39 requires(const _In __i) { 40 typename iter_value_t<_In>; 41 typename iter_reference_t<_In>; 42 typename iter_rvalue_reference_t<_In>; 43 { *__i } -> same_as<iter_reference_t<_In> >; 44 { ranges::iter_move(__i) } -> same_as<iter_rvalue_reference_t<_In> >; 45 } && 46 common_reference_with<iter_reference_t<_In>&&, iter_value_t<_In>&> && 47 common_reference_with<iter_reference_t<_In>&&, iter_rvalue_reference_t<_In>&&> && 48 common_reference_with<iter_rvalue_reference_t<_In>&&, const iter_value_t<_In>&>; 49 50 template<class _In> 51 concept indirectly_readable = __indirectly_readable_impl<remove_cvref_t<_In> >; 52 53 template<indirectly_readable _Tp> 54 using iter_common_reference_t = common_reference_t<iter_reference_t<_Tp>, iter_value_t<_Tp>&>; 55 56 // [iterator.concept.writable] 57 template<class _Out, class _Tp> 58 concept indirectly_writable = 59 requires(_Out&& __o, _Tp&& __t) { 60 *__o = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving 61 *_VSTD::forward<_Out>(__o) = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving 62 const_cast<const iter_reference_t<_Out>&&>(*__o) = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving 63 const_cast<const iter_reference_t<_Out>&&>(*_VSTD::forward<_Out>(__o)) = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving 64 }; 65 66 // [iterator.concept.winc] 67 template<class _Tp> 68 concept __integer_like = integral<_Tp> && !same_as<_Tp, bool>; 69 70 template<class _Tp> 71 concept __signed_integer_like = signed_integral<_Tp>; 72 73 template<class _Ip> 74 concept weakly_incrementable = 75 movable<_Ip> && 76 requires(_Ip __i) { 77 typename iter_difference_t<_Ip>; 78 requires __signed_integer_like<iter_difference_t<_Ip> >; 79 { ++__i } -> same_as<_Ip&>; // not required to be equality-preserving 80 __i++; // not required to be equality-preserving 81 }; 82 83 // [iterator.concept.inc] 84 template<class _Ip> 85 concept incrementable = 86 regular<_Ip> && 87 weakly_incrementable<_Ip> && 88 requires(_Ip __i) { 89 { __i++ } -> same_as<_Ip>; 90 }; 91 92 // [iterator.concept.iterator] 93 template<class _Ip> 94 concept input_or_output_iterator = 95 requires(_Ip __i) { 96 { *__i } -> __referenceable; 97 } && 98 weakly_incrementable<_Ip>; 99 100 // [iterator.concept.sentinel] 101 template<class _Sp, class _Ip> 102 concept sentinel_for = 103 semiregular<_Sp> && 104 input_or_output_iterator<_Ip> && 105 __weakly_equality_comparable_with<_Sp, _Ip>; 106 107 template<class, class> 108 inline constexpr bool disable_sized_sentinel_for = false; 109 110 template<class _Sp, class _Ip> 111 concept sized_sentinel_for = 112 sentinel_for<_Sp, _Ip> && 113 !disable_sized_sentinel_for<remove_cv_t<_Sp>, remove_cv_t<_Ip> > && 114 requires(const _Ip& __i, const _Sp& __s) { 115 { __s - __i } -> same_as<iter_difference_t<_Ip> >; 116 { __i - __s } -> same_as<iter_difference_t<_Ip> >; 117 }; 118 119 // [iterator.concept.input] 120 template<class _Ip> 121 concept input_iterator = 122 input_or_output_iterator<_Ip> && 123 indirectly_readable<_Ip> && 124 requires { typename _ITER_CONCEPT<_Ip>; } && 125 derived_from<_ITER_CONCEPT<_Ip>, input_iterator_tag>; 126 127 // [iterator.concept.forward] 128 template<class _Ip> 129 concept forward_iterator = 130 input_iterator<_Ip> && 131 derived_from<_ITER_CONCEPT<_Ip>, forward_iterator_tag> && 132 incrementable<_Ip> && 133 sentinel_for<_Ip, _Ip>; 134 135 // [iterator.concept.bidir] 136 template<class _Ip> 137 concept bidirectional_iterator = 138 forward_iterator<_Ip> && 139 derived_from<_ITER_CONCEPT<_Ip>, bidirectional_iterator_tag> && 140 requires(_Ip __i) { 141 { --__i } -> same_as<_Ip&>; 142 { __i-- } -> same_as<_Ip>; 143 }; 144 145 template<class _Ip> 146 concept random_access_iterator = 147 bidirectional_iterator<_Ip> && 148 derived_from<_ITER_CONCEPT<_Ip>, random_access_iterator_tag> && 149 totally_ordered<_Ip> && 150 sized_sentinel_for<_Ip, _Ip> && 151 requires(_Ip __i, const _Ip __j, const iter_difference_t<_Ip> __n) { 152 { __i += __n } -> same_as<_Ip&>; 153 { __j + __n } -> same_as<_Ip>; 154 { __n + __j } -> same_as<_Ip>; 155 { __i -= __n } -> same_as<_Ip&>; 156 { __j - __n } -> same_as<_Ip>; 157 { __j[__n] } -> same_as<iter_reference_t<_Ip>>; 158 }; 159 160 template<class _Ip> 161 concept contiguous_iterator = 162 random_access_iterator<_Ip> && 163 derived_from<_ITER_CONCEPT<_Ip>, contiguous_iterator_tag> && 164 is_lvalue_reference_v<iter_reference_t<_Ip>> && 165 same_as<iter_value_t<_Ip>, remove_cvref_t<iter_reference_t<_Ip>>> && 166 (is_pointer_v<_Ip> || requires { sizeof(__pointer_traits_element_type<_Ip>); }) && 167 requires(const _Ip& __i) { 168 { _VSTD::to_address(__i) } -> same_as<add_pointer_t<iter_reference_t<_Ip>>>; 169 }; 170 171 template<class _Ip> 172 concept __has_arrow = input_iterator<_Ip> && (is_pointer_v<_Ip> || requires(_Ip __i) { __i.operator->(); }); 173 174 // [indirectcallable.indirectinvocable] 175 template<class _Fp, class _It> 176 concept indirectly_unary_invocable = 177 indirectly_readable<_It> && 178 copy_constructible<_Fp> && 179 invocable<_Fp&, iter_value_t<_It>&> && 180 invocable<_Fp&, iter_reference_t<_It>> && 181 invocable<_Fp&, iter_common_reference_t<_It>> && 182 common_reference_with< 183 invoke_result_t<_Fp&, iter_value_t<_It>&>, 184 invoke_result_t<_Fp&, iter_reference_t<_It>>>; 185 186 template<class _Fp, class _It> 187 concept indirectly_regular_unary_invocable = 188 indirectly_readable<_It> && 189 copy_constructible<_Fp> && 190 regular_invocable<_Fp&, iter_value_t<_It>&> && 191 regular_invocable<_Fp&, iter_reference_t<_It>> && 192 regular_invocable<_Fp&, iter_common_reference_t<_It>> && 193 common_reference_with< 194 invoke_result_t<_Fp&, iter_value_t<_It>&>, 195 invoke_result_t<_Fp&, iter_reference_t<_It>>>; 196 197 template<class _Fp, class _It> 198 concept indirect_unary_predicate = 199 indirectly_readable<_It> && 200 copy_constructible<_Fp> && 201 predicate<_Fp&, iter_value_t<_It>&> && 202 predicate<_Fp&, iter_reference_t<_It>> && 203 predicate<_Fp&, iter_common_reference_t<_It>>; 204 205 template<class _Fp, class _It1, class _It2> 206 concept indirect_binary_predicate = 207 indirectly_readable<_It1> && indirectly_readable<_It2> && 208 copy_constructible<_Fp> && 209 predicate<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> && 210 predicate<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> && 211 predicate<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> && 212 predicate<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> && 213 predicate<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>; 214 215 template<class _Fp, class _It1, class _It2 = _It1> 216 concept indirect_equivalence_relation = 217 indirectly_readable<_It1> && indirectly_readable<_It2> && 218 copy_constructible<_Fp> && 219 equivalence_relation<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> && 220 equivalence_relation<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> && 221 equivalence_relation<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> && 222 equivalence_relation<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> && 223 equivalence_relation<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>; 224 225 template<class _Fp, class _It1, class _It2 = _It1> 226 concept indirect_strict_weak_order = 227 indirectly_readable<_It1> && indirectly_readable<_It2> && 228 copy_constructible<_Fp> && 229 strict_weak_order<_Fp&, iter_value_t<_It1>&, iter_value_t<_It2>&> && 230 strict_weak_order<_Fp&, iter_value_t<_It1>&, iter_reference_t<_It2>> && 231 strict_weak_order<_Fp&, iter_reference_t<_It1>, iter_value_t<_It2>&> && 232 strict_weak_order<_Fp&, iter_reference_t<_It1>, iter_reference_t<_It2>> && 233 strict_weak_order<_Fp&, iter_common_reference_t<_It1>, iter_common_reference_t<_It2>>; 234 235 template<class _Fp, class... _Its> 236 requires (indirectly_readable<_Its> && ...) && invocable<_Fp, iter_reference_t<_Its>...> 237 using indirect_result_t = invoke_result_t<_Fp, iter_reference_t<_Its>...>; 238 239 template<class _In, class _Out> 240 concept indirectly_movable = 241 indirectly_readable<_In> && 242 indirectly_writable<_Out, iter_rvalue_reference_t<_In>>; 243 244 template<class _In, class _Out> 245 concept indirectly_movable_storable = 246 indirectly_movable<_In, _Out> && 247 indirectly_writable<_Out, iter_value_t<_In>> && 248 movable<iter_value_t<_In>> && 249 constructible_from<iter_value_t<_In>, iter_rvalue_reference_t<_In>> && 250 assignable_from<iter_value_t<_In>&, iter_rvalue_reference_t<_In>>; 251 252 // Note: indirectly_swappable is located in iter_swap.h to prevent a dependency cycle 253 // (both iter_swap and indirectly_swappable require indirectly_readable). 254 255 // clang-format on 256 257 #endif // !defined(_LIBCPP_HAS_NO_RANGES) 258 259 _LIBCPP_END_NAMESPACE_STD 260 261 _LIBCPP_POP_MACROS 262 263 #endif // _LIBCPP___ITERATOR_CONCEPTS_H 264