| /freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | ranges_iterator_traits.h | 27 using __range_key_type _LIBCPP_NODEBUG = __remove_const_t<typename ranges::range_value_t<_Range>::f… 30 using __range_mapped_type _LIBCPP_NODEBUG = typename ranges::range_value_t<_Range>::second_type; 34 …pair<const typename ranges::range_value_t<_Range>::first_type, typename ranges::range_value_t<_Ran…
|
| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_min.h | 63 requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*> 64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr range_value_t<_Rp> 69 if constexpr (forward_range<_Rp> && !__is_cheap_to_copy<range_value_t<_Rp>>) { 72 range_value_t<_Rp> __result = *__first;
|
| H A D | ranges_max.h | 66 requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*> 67 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr range_value_t<_Rp> 74 if constexpr (forward_range<_Rp> && !__is_cheap_to_copy<range_value_t<_Rp>>) { 80 range_value_t<_Rp> __result = *__first;
|
| H A D | ranges_minmax.h | 79 requires indirectly_copyable_storable<iterator_t<_Range>, range_value_t<_Range>*> 80 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_result<range_value_t<_Range>> 84 using _ValueT = range_value_t<_Range>;
|
| H A D | ranges_unique_copy.h | 91 … (input_iterator<_OutIter> && same_as<range_value_t<_Range>, iter_value_t<_OutIter>>) ||
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | unordered_set | 209 class Hash = hash<ranges::range_value_t<R>>, 210 class Pred = equal_to<ranges::range_value_t<R>>, 211 class Allocator = allocator<ranges::range_value_t<R>>> 213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23 237 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>, 238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 242 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>, 243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 247 -> unordered_set<ranges::range_value_t<R>, Hash, 248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 [all …]
|
| H A D | queue | 87 queue(from_range_t, R&&) -> queue<ranges::range_value_t<R>>; // since C++23 99 -> queue<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C++23 216 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>> 218 -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>>, Compare>; // C++23 241 -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>, 246 … -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>>; // C++23 455 queue(from_range_t, _Range&&) -> queue<ranges::range_value_t<_Range>>; 466 -> queue<ranges::range_value_t<_Range>, deque<ranges::range_value_t<_Range>, _Alloc>>; 759 class _Compare = less<ranges::range_value_t<_Range>>, 762 … -> priority_queue<ranges::range_value_t<_Range>, vector<ranges::range_value_t<_Range>>, _Compare>; [all …]
|
| H A D | stack | 78 stack(from_range_t, R&&) -> stack<ranges::range_value_t<R>>; // since C++23 90 -> stack<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C++23 312 stack(from_range_t, _Range&&) -> stack<ranges::range_value_t<_Range>>; 325 _Alloc) -> stack<ranges::range_value_t<_Range>, deque<ranges::range_value_t<_Range>, _Alloc>>;
|
| H A D | set | 200 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>, 201 class Allocator = allocator<ranges::range_value_t<R>>> 203 -> set<ranges::range_value_t<R>, Compare, Allocator>; // C++23 216 -> set<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>; // C++23 446 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>, 447 class Allocator = allocator<ranges::range_value_t<R>>> 449 -> multiset<ranges::range_value_t<R>, Compare, Allocator>; 462 -> multiset<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>; 913 class _Compare = less<ranges::range_value_t<_Range>>, 914 class _Allocator = allocator<ranges::range_value_t<_Range>>, [all …]
|
| H A D | memory | 206 requires constructible_from<range_value_t<OutputRange>, range_reference_t<InputRange>> 238 requires constructible_from<range_value_t<ForwardRange>, const T&> 279 requires destructible<range_value_t<InputRange>> 306 requires constructible_from<range_value_t<OutputRange>, range_rvalue_reference_t<InputRange>> 337 requires default_initializable<range_value_t<ForwardRange>> 363 requires default_initializable<range_value_t<ForwardRange>>
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/ |
| H A D | unordered_set | 209 class Hash = hash<ranges::range_value_t<R>>, 210 class Pred = equal_to<ranges::range_value_t<R>>, 211 class Allocator = allocator<ranges::range_value_t<R>>> 213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23 237 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>, 238 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 242 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>, 243 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 247 -> unordered_set<ranges::range_value_t<R>, Hash, 248 equal_to<ranges::range_value_t<R>>, Allocator>; // C++23 [all …]
|
| H A D | queue | 87 queue(from_range_t, R&&) -> queue<ranges::range_value_t<R>>; // since C++23 99 -> queue<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C++23 216 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>> 218 -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>>, Compare>; // C++23 241 -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>, 246 … -> priority_queue<ranges::range_value_t<R>, vector<ranges::range_value_t<R>, Allocator>>; // C++23
|
| H A D | set | 200 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>, 201 class Allocator = allocator<ranges::range_value_t<R>>> 203 -> set<ranges::range_value_t<R>, Compare, Allocator>; // C++23 216 -> set<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>; // C++23 446 template<ranges::input_range R, class Compare = less<ranges::range_value_t<R>>, 447 class Allocator = allocator<ranges::range_value_t<R>>> 449 -> multiset<ranges::range_value_t<R>, Compare, Allocator>; 462 -> multiset<ranges::range_value_t<R>, less<ranges::range_value_t<R>>, Allocator>;
|
| H A D | stack | 78 stack(from_range_t, R&&) -> stack<ranges::range_value_t<R>>; // since C++23 90 -> stack<ranges::range_value_t<R>, deque<ranges::range_value_t<R>, Allocator>>; // since C++23
|
| H A D | memory | 206 requires constructible_from<range_value_t<OutputRange>, range_reference_t<InputRange>> 238 requires constructible_from<range_value_t<ForwardRange>, const T&> 279 requires destructible<range_value_t<InputRange>> 306 requires constructible_from<range_value_t<OutputRange>, range_rvalue_reference_t<InputRange>> 337 requires default_initializable<range_value_t<ForwardRange>> 363 requires default_initializable<range_value_t<ForwardRange>>
|
| /freebsd/contrib/llvm-project/libcxx/include/__memory/ |
| H A D | ranges_uninitialized_algorithms.h | 53 requires default_initializable<range_value_t<_ForwardRange>> 90 requires default_initializable<range_value_t<_ForwardRange>> 127 requires constructible_from<range_value_t<_ForwardRange>, const _Tp&> 175 requires constructible_from<range_value_t<_OutputRange>, range_reference_t<_InputRange>> 236 requires constructible_from<range_value_t<_OutputRange>, range_rvalue_reference_t<_InputRange>>
|
| H A D | ranges_destroy.h | 46 requires destructible<range_value_t<_InputRange>>
|
| /freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | split_view.h | 86 constructible_from<_Pattern, single_view<range_value_t<_Range>>> 88 split_view(_Range&& __range, range_value_t<_Range> __elem) in split_view() 119 split_view(_Range&&, range_value_t<_Range>) -> split_view<views::all_t<_Range>, single_view<range_v…
|
| H A D | lazy_split_view.h | 94 constructible_from<_Pattern, single_view<range_value_t<_Range>>> 95 …ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 lazy_split_view(_Range&& __r, range_value_t<_Range> __e) in lazy_split_view() 338 using value_type = range_value_t<_Base>; 408 …range_value_t<_Range>) -> lazy_split_view<views::all_t<_Range>, single_view<range_value_t<_Range>>…
|
| H A D | elements_view.h | 62 requires view<_View> && __has_tuple_element<range_value_t<_View>, _Np> && 162 requires view<_View> && __has_tuple_element<range_value_t<_View>, _Np> && 201 using value_type = remove_cvref_t<tuple_element_t<_Np, range_value_t<_Base>>>; 332 requires view<_View> && __has_tuple_element<range_value_t<_View>, _Np> &&
|
| H A D | to.h | 67 … !input_range<_Container> || convertible_to<range_reference_t<_Range>, range_value_t<_Container>>; 137 return ranges::to<range_value_t<_Container>>(std::forward<decltype(__elem)>(__elem)); in to() 149 using value_type = range_value_t<_Range>;
|
| H A D | concepts.h | 72 using range_value_t = iter_value_t<iterator_t<_Rp>>; variable 146 using __concat_value_t _LIBCPP_NODEBUG = common_type_t<range_value_t<_Rs>...>;
|
| H A D | join_with_view.h | 96 constructible_from<_Pattern, single_view<range_value_t<_InnerRng>>> 97 …_LIBCPP_HIDE_FROM_ABI constexpr explicit join_with_view(_Range&& __r, range_value_t<_InnerRng> __e) in join_with_view() 152 join_with_view(_Range&&, range_value_t<range_reference_t<_Range>>) 153 -> join_with_view<views::all_t<_Range>, single_view<range_value_t<range_reference_t<_Range>>>>;
|
| /freebsd/contrib/llvm-project/libcxx/include/__flat_set/ |
| H A D | flat_multiset.h | 746 class _Compare = less<ranges::range_value_t<_Range>>, 747 class _Allocator = allocator<ranges::range_value_t<_Range>>, 750 ranges::range_value_t<_Range>, 752 …vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_… 756 ranges::range_value_t<_Range>, 757 less<ranges::range_value_t<_Range>>, 758 …vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_…
|
| H A D | flat_set.h | 829 class _Compare = less<ranges::range_value_t<_Range>>, 830 class _Allocator = allocator<ranges::range_value_t<_Range>>, 833 ranges::range_value_t<_Range>, 835 …vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_… 839 ranges::range_value_t<_Range>, 840 less<ranges::range_value_t<_Range>>, 841 …vector<ranges::range_value_t<_Range>, __allocator_traits_rebind_t<_Allocator, ranges::range_value_…
|