Home
last modified time | relevance | path

Searched refs:iterator_t (Results 1 – 25 of 113) sorted by relevance

12345

/freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/
H A Dconcepts.h53 concept input_range = range<_Tp> && input_iterator<iterator_t<_Tp>>;
65 using range_difference_t = iter_difference_t<iterator_t<_Rp>>;
68 using range_value_t = iter_value_t<iterator_t<_Rp>>;
71 using range_reference_t = iter_reference_t<iterator_t<_Rp>>;
74 using range_rvalue_reference_t = iter_rvalue_reference_t<iterator_t<_Rp>>;
77 using range_common_reference_t = iter_common_reference_t<iterator_t<_Rp>>;
98 view<_Range> && range<const _Range> && same_as<iterator_t<_Range>, iterator_t<const _Range>> &&
103 concept output_range = range<_Rp> && output_iterator<iterator_t<_Rp>, _Tp>;
106 concept forward_range = input_range<_Tp> && forward_iterator<iterator_t<_Tp>>;
109 concept bidirectional_range = forward_range<_Tp> && bidirectional_iterator<iterator_t<_Tp>>;
[all …]
H A Dsplit_view.h50 indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to>
55 …using _Cache = __non_propagating_cache<subrange<iterator_t<_View>…
67 _LIBCPP_HIDE_FROM_ABI constexpr subrange<iterator_t<_View>> __find_next(iterator_t<_View> __it) { in __find_next()
123 indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to>
127 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __cur_ = iterator_t<_View>();
128 _LIBCPP_NO_UNIQUE_ADDRESS subrange<iterator_t<_View>> __next_ = subrange<iterator_t<_View>>();
136 using value_type = subrange<iterator_t<_View>>;
142 …split_view<_View, _Pattern>& __parent, iterator_t<_View> __current, subrange<iterator_t<_View>> __…
145 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> base() const { return __cur_; }
178 indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to>
H A Dchunk_by_view.h55 template <forward_range _View, indirect_binary_predicate<iterator_t<_View>, iterator_t<_View>> _Pre…
62 using _Cache = __non_propagating_cache<iterator_t<_View>>;
67 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> __find_next(iterator_t<_View> __current) { in __find_next()
78 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> __find_prev(iterator_t<_View> __current) in __find_prev()
137 template <forward_range _View, indirect_binary_predicate<iterator_t<_View>, iterator_t<_View>> _Pre…
143 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __current_ = iterator_t<_View>();
144 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __next_ = iterator_t<_View>();
147 chunk_by_view& __parent, iterator_t<_View> __current, iterator_t<_View> __next) in __iterator()
151 using value_type = subrange<iterator_t<_View>>;
H A Dfilter_view.h55 template <input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
118 using _Cat = typename iterator_traits<iterator_t<_View>>::iterator_category;
127 template <input_range _View, indirect_unary_predicate<iterator_t<_View>> _Pred>
131 _LIBCPP_NO_UNIQUE_ADDRESS iterator_t<_View> __current_ = iterator_t<_View>();
145 requires default_initializable<iterator_t<_View>>
152 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> base() && { return std::move(__current_); }
155 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_View> operator->() const
156 requires __has_arrow<iterator_t<_View>> && copyable<iterator_t<_View>>
192 requires equality_comparable<iterator_t<_View>>
205 requires indirectly_swappable<iterator_t<_View>>
[all …]
H A Delements_view.h146 using _Result = decltype(std::get<_Np>(*std::declval<iterator_t<_Base>>()));
147 using _Cat = typename iterator_traits<iterator_t<_Base>>::iterator_category;
176 iterator_t<_Base> __current_ = iterator_t<_Base>();
205 requires default_initializable<iterator_t<_Base>>
211 requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
216 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() && { return std::move(__current_); }
271 requires equality_comparable<iterator_t<_Base>>
301 requires random_access_range<_Base> && three_way_comparable<iterator_t<_Base>>
325 requires sized_sentinel_for<iterator_t<_Base>, iterator_t<_Base>>
361 requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
[all …]
H A Dtransform_view.h161 using _Cat = typename iterator_traits<iterator_t<_View>>::iterator_category;
190 iterator_t<_Base> __current_ = iterator_t<_Base>();
197 requires default_initializable<iterator_t<_Base>>
200 _LIBCPP_HIDE_FROM_ABI constexpr __iterator(_Parent& __parent, iterator_t<_Base> __current)
207 requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
212 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() && { return std::move(__current_); }
271 requires equality_comparable<iterator_t<_Base>>
301 requires random_access_range<_Base> && three_way_comparable<iterator_t<_Base>>
325 requires sized_sentinel_for<iterator_t<_Base>, iterator_t<_Base>>
372 requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
[all …]
H A Dtake_while_view.h48 …nput_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterator_t<_View>>
81 requires range<const _View> && indirect_unary_predicate<const _Pred, iterator_t<const _View>> in begin()
93 requires range<const _View> && indirect_unary_predicate<const _Pred, iterator_t<const _View>> in end()
103 …nput_range<_View> && is_object_v<_Pred> && indirect_unary_predicate<const _Pred, iterator_t<_View>>
125 …_LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(const iterator_t<_Base>& __x, const __senti…
130 requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
132 operator==(const iterator_t<__maybe_const<_OtherConst, _View>>& __x, const __sentinel& __y) {
H A Dlazy_split_view.h69 indirectly_comparable<iterator_t<_View>, iterator_t<_Pattern>, ranges::equal_to> &&
75 …using _MaybeCurrent = _If<!forward_range<_View>, __non_propagating_cache<iterator_t<_View>>, __emp…
153 …using _MaybeCurrent = _If<forward_range<_View>, iterator_t<_Base>, …
200 _LIBCPP_HIDE_FROM_ABI constexpr __outer_iterator(_Parent& __parent, iterator_t<_Base> __current)
205 requires _Const && convertible_to<iterator_t<_View>, iterator_t<_Base>>
278 …_If< derived_from<typename iterator_traits<iterator_t<_Tp>>::iterator_category, forward_iterator_t…
280 typename iterator_traits<iterator_t<_Tp>>::iterator_category >;
344 …_LIBCPP_HIDE_FROM_ABI constexpr const iterator_t<_Base>& base() const& noexcept { return __i_.__cu…
345 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Base> base() &&
395 requires indirectly_swappable<iterator_t<_Base>>
H A Dzip_view.h252 __tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current_;
255 __tuple_or_pair<iterator_t<__maybe_const<_Const, _Views>>...> __current)
274 …requires _Const && (convertible_to<iterator_t<_Views>, iterator_t<__maybe_const<_Const, _Views>>> …
333 requires(equality_comparable<iterator_t<__maybe_const<_Const, _Views>>> && ...)
368 (three_way_comparable<iterator_t<__maybe_const<_Const, _Views>>> && ...)
396 …requires(sized_sentinel_for<iterator_t<__maybe_const<_Const, _Views>>, iterator_t<__maybe_const<_C…
410 …(noexcept(ranges::iter_move(std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>())) && …
416 (noexcept(ranges::iter_swap(std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>(),
417 … std::declval<const iterator_t<__maybe_const<_Const, _Views>>&>())) &&
419 requires(indirectly_swappable<iterator_t<__maybe_const<_Const, _Views>>> && ...)
[all …]
H A Dcommon_view.h42 requires(!common_range<_View> && copyable<iterator_t<_View>>)
65 return common_iterator<iterator_t<_View>, sentinel_t<_View>>(ranges::begin(__base_)); in begin()
74 … return common_iterator<iterator_t<const _View>, sentinel_t<const _View>>(ranges::begin(__base_)); in begin()
81 return common_iterator<iterator_t<_View>, sentinel_t<_View>>(ranges::end(__base_)); in end()
90 … return common_iterator<iterator_t<const _View>, sentinel_t<const _View>>(ranges::end(__base_)); in end()
H A Djoin_view.h58 using _OuterC = typename iterator_traits<iterator_t<_View>>::iterator_category;
59 using _InnerC = typename iterator_traits<iterator_t<range_reference_t<_View>>>::iterator_category;
88 …using _OuterCache = _If<_UseOuterCache, __non_propagating_cache<iterator_t<_Vie…
172 requires sentinel_for<sentinel_t<_Base>, iterator_t<__maybe_const<_OtherConst, _View>>>
195 using _Outer = iterator_t<_Base>;
196 using _Inner = iterator_t<range_reference_t<_Base>>;
275 …requires _Const && convertible_to<iterator_t<_View>, _Outer> && convertible_to<iterator_t<_InnerRa…
336 …requires __ref_is_glvalue && forward_range<_Base> && equality_comparable<iterator_t<range_referenc…
H A Dsubrange.h109 requires borrowed_range<_Range> && __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
116 requires borrowed_range<_Range> && __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
123 requires __convertible_to_non_slicing<iterator_t<_Range>, _Iter> &&
206 -> subrange<iterator_t<_Range>,
208 (sized_range<_Range> || sized_sentinel_for<sentinel_t<_Range>, iterator_t<_Range>>)
214 -> subrange<iterator_t<_Range>, sentinel_t<_Range>, subrange_kind::sized>;
238 using borrowed_subrange_t = _If<borrowed_range<_Rp>, subrange<iterator_t<_Rp>>, dangling>;
H A Daccess.h99 using iterator_t = decltype(ranges::begin(std::declval<_Tp&>())); variable
108 typename iterator_t<_Tp>; in requires()
109 { _LIBCPP_AUTO_CAST(__t.end()) } -> sentinel_for<iterator_t<_Tp>>; in requires()
118 typename iterator_t<_Tp>;
119 { _LIBCPP_AUTO_CAST(end(__t)) } -> sentinel_for<iterator_t<_Tp>>;
H A Dview_interface.h82 requires contiguous_iterator<iterator_t<_D2>> in data()
89 requires range<const _D2> && contiguous_iterator<iterator_t<const _D2>> in data()
96 requires forward_range<_D2> && sized_sentinel_for<sentinel_t<_D2>, iterator_t<_D2>> in size()
103 …requires forward_range<const _D2> && sized_sentinel_for<sentinel_t<const _D2>, iterator_t<const _D… in size()
H A Dreverse_view.h50 …using _Cache = _If<_UseCache, __non_propagating_cache<reverse_iterator<iterator_t<_View>>>, __empt…
69 _LIBCPP_HIDE_FROM_ABI constexpr reverse_iterator<iterator_t<_View>> begin() { in begin()
80 _LIBCPP_HIDE_FROM_ABI constexpr reverse_iterator<iterator_t<_View>> begin() in begin()
92 _LIBCPP_HIDE_FROM_ABI constexpr reverse_iterator<iterator_t<_View>> end() { in end()
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Dalgorithm75 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
441 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
473 indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
493 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
508 requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
605 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
726 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
764 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
932 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
962 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
[all …]
H A Dranges39 using iterator_t = decltype(ranges::begin(declval<T&>()));
43 using range_difference_t = iter_difference_t<iterator_t<R>>;
47 using range_value_t = iter_value_t<iterator_t<R>>;
49 using range_reference_t = iter_reference_t<iterator_t<R>>;
187 template<input_range V, indirect_unary_predicate<iterator_t<V>> Pred>
205 indirect_unary_predicate<const Pred, iterator_t<V>>
226 requires (!common_range<V> && copyable<iterator_t<V>>)
249 indirect_unary_predicate<const Pred, iterator_t<V>>
289 indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> &&
296 indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to>
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_partial_sort_copy.h81 requires indirectly_copyable<iterator_t<_Range1>, iterator_t<_Range2>> &&
82 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
84 projected<iterator_t<_Range1>, _Proj1>,
85 projected<iterator_t<_Range2>, _Proj2>>
H A Dranges_unique_copy.h90 … indirect_equivalence_relation<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::equal_to>
91 requires indirectly_copyable<iterator_t<_Range>, _OutIter> &&
92 (forward_iterator<iterator_t<_Range>> ||
94 indirectly_copyable_storable<iterator_t<_Range>, _OutIter>)
102 __algo_tag_t<iterator_t<_Range>, _OutIter>());
H A Dranges_find_end.h74 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
85 __iterator_concept<iterator_t<_Range1>>(),
86 __iterator_concept<iterator_t<_Range2>>());
H A Dranges_partition_copy.h88 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
89 …requires indirectly_copyable<iterator_t<_Range>, _OutIter1> && indirectly_copyable<iterator_t<_Ran…
H A Dranges_rotate.h51 requires permutable<iterator_t<_Range>>
53 operator()(_Range&& __range, iterator_t<_Range> __middle) const { in operator()
H A Dranges_rotate_copy.h49 requires indirectly_copyable<iterator_t<_Range>, _OutIter>
51 operator()(_Range&& __range, iterator_t<_Range> __middle, _OutIter __result) const { in operator()
H A Dranges_remove.h47 requires permutable<iterator_t<_Range>> &&
48 … indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
/freebsd-14.2/contrib/llvm-project/libcxx/include/__memory/
H A Dconcepts.h48 …range<_Rp> && __nothrow_input_iterator<iterator_t<_Rp>> && __nothrow_sentinel_for<sentinel_t<_Rp>,…
55 …_nothrow_forward_range = __nothrow_input_range<_Rp> && __nothrow_forward_iterator<iterator_t<_Rp>>;

12345