Home
last modified time | relevance | path

Searched refs:_Iter (Results 1 – 25 of 119) sorted by relevance

12345

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Diterator_operations.h50 template <class _Iter>
51 using __value_type _LIBCPP_NODEBUG = iter_value_t<_Iter>;
53 template <class _Iter>
54 using __iterator_category _LIBCPP_NODEBUG = ranges::__iterator_concept<_Iter>;
56 template <class _Iter>
57 using __difference_type _LIBCPP_NODEBUG = iter_difference_t<_Iter>;
74 template <class _Iter>
75 using __value_type _LIBCPP_NODEBUG = typename iterator_traits<_Iter>::value_type;
77 template <class _Iter>
78 using __iterator_category _LIBCPP_NODEBUG = typename iterator_traits<_Iter>::iterator_category;
[all …]
H A Dunwrap_range.h35 template <class _Iter, class _Sent> in __unwrap()
37 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __sent) in __unwrap()
38 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __unwrap()
44 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __last) {
49 __rewrap(_Iter __orig_iter, decltype(std::__unwrap_iter(std::move(__orig_iter))) __iter) in __rewrap()
50 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __rewrap()
55 _LIBCPP_HIDE_FROM_ABI static constexpr auto __rewrap(const _Iter&, _Iter __ite in __rewrap()
[all...]
H A Dunwrap_iter.h37 template <class _Iter, bool = __libcpp_is_contiguous_iterator<_Iter>::value>
39 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter, _Iter __iter) { return __iter… in __rewrap()
40 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } in __unwrap()
47 template <class _Iter>
48 struct __unwrap_iter_impl<_Iter, true> {
49 using _ToAddressT _LIBCPP_NODEBUG = decltype(std::__to_address(std::declval<_Iter>()));
51 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter __orig_iter, _ToAddressT __unw…
55 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ToAddressT __unwrap(_Iter __i) _NOEXCEPT {
60 template <class _Iter,
61 class _Impl = __unwrap_iter_impl<_Iter>,
[all …]
H A Dranges_find_last.h40 template <class _Iter, class _Sent, class _Pred, class _Proj>
41 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter>
42 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl()
44 return subrange<_Iter>(__first, __first); in __find_last_impl()
47 if constexpr (bidirectional_iterator<_Iter>) { in __find_last_impl()
51 return subrange<_Iter>(std::move(__it), std::move(__last_it)); in __find_last_impl()
55 return subrange<_Iter>(std::move(__first), std::move(__last_it)); in __find_last_impl()
57 return subrange<_Iter>(__last_it, __last_it); in __find_last_impl()
60 _Iter __found_it; in __find_last_impl()
69 return subrange<_Iter>(std::move(__found_it), std::move(__first)); in __find_last_impl()
[all …]
H A Dranges_for_each.h38 template <class _Iter, class _Func>
39 using for_each_result = in_fun_result<_Iter, _Func>;
43 template <class _Iter, class _Sent, class _Proj, class _Func>
44 _LIBCPP_HIDE_FROM_ABI constexpr static for_each_result<_Iter, _Func>
45 __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { in __for_each_impl()
49 if constexpr (!std::assignable_from<_Iter&, _Sent> && std::sized_sentinel_for<_Sent, _Iter>) { in __for_each_impl()
60 template <input_iterator _Iter,
61 sentinel_for<_Iter> _Sent,
63 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func>
64 _LIBCPP_HIDE_FROM_ABI constexpr for_each_result<_Iter, _Func>
[all …]
H A Dranges_iterator_concept.h32 using _Iter = __remove_cvref_t<_IterMaybeQualified>; in __get_iterator_concept() local
34 if constexpr (contiguous_iterator<_Iter>) in __get_iterator_concept()
36 else if constexpr (random_access_iterator<_Iter>) in __get_iterator_concept()
38 else if constexpr (bidirectional_iterator<_Iter>) in __get_iterator_concept()
40 else if constexpr (forward_iterator<_Iter>) in __get_iterator_concept()
42 else if constexpr (input_iterator<_Iter>) in __get_iterator_concept()
46 template <class _Iter>
47 using __iterator_concept _LIBCPP_NODEBUG = decltype(ranges::__get_iterator_concept<_Iter>());
H A Dranges_partial_sort.h45 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 _LIBCPP_HIDE_FROM_ABI constexpr static _Iter
47 …__partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __proj) { in __partial_sort_fn_impl()
52 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
53 requires sortable<_Iter, _Comp, _Proj>
54 _LIBCPP_HIDE_FROM_ABI constexpr _Iter
55 …operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) cons… in operator()
H A Dranges_stable_partition.h46 template <class _Iter, class _Sent, class _Proj, class _Pred>
47 _LIBCPP_HIDE_FROM_ABI static _LIBCPP_CONSTEXPR_SINCE_CXX26 subrange<__remove_cvref_t<_Iter>>
48 __stable_partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl()
53 std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>()); in __stable_partition_fn_impl()
58 template <bidirectional_iterator _Iter,
59 sentinel_for<_Iter> _Sent,
61 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
62 requires permutable<_Iter>
63 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 subrange<_Iter>
64 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dsearch_n.h34 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
35 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_Iter, _Iter> __search_n_forward_impl( in __search_n_forward_impl()
36 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl()
51 _Iter __m = __first; in __search_n_forward_impl()
71 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
72 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 std::pair<_Iter, _Iter> __search_n_random_acces… in __search_n_random_access_impl()
73 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl()
74 using difference_type = typename iterator_traits<_Iter>::difference_type; in __search_n_random_access_impl()
112 template <class _Iter,
118 __enable_if_t<__has_random_access_iterator_category<_Iter>::value, int> = 0>
[all …]
H A Dequal_range.h35 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
36 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_Iter, _Iter>
37 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range()
39 _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last); in __equal_range()
42 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range()
50 _Iter __mp1 = __mid; in __equal_range()
51 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
55 return pair<_Iter, _Iter>(__first, __first); in __equal_range()
H A Dranges_nth_element.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 _LIBCPP_HIDE_FROM_ABI constexpr static _Iter
45 __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj) { in __nth_element_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
56 _LIBCPP_HIDE_FROM_ABI constexpr _Iter
57 operator()(_Iter __first, _Iter __nth, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_rotate.h37 template <class _Iter, class _Sent>
38 …_LIBCPP_HIDE_FROM_ABI constexpr static subrange<_Iter> __rotate_fn_impl(_Iter __first, _Iter __mid… in __rotate_fn_impl()
43 template <permutable _Iter, sentinel_for<_Iter> _Sent>
44 …_LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> operator()(_Iter __first, _Iter __middle, _Sent __… in operator()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Diterator_operations.h44 template <class _Iter>
45 using __value_type = typename iterator_traits<_Iter>::value_type;
47 template <class _Iter>
48 using __iterator_category = typename iterator_traits<_Iter>::iterator_category;
50 template <class _Iter>
51 using __difference_type = typename iterator_traits<_Iter>::difference_type;
54 template <class _Iter, class _Distance>
55 _LIBCPP_HIDE_FROM_ABI static void advance(_Iter& __iter, _Distance __count) {
60 template <class _Iter>
61 …CPP_HIDE_FROM_ABI static typename iterator_traits<_Iter>::difference_type distance(_Iter __first, …
[all …]
H A Dunwrap_iter.h37 template <class _Iter, bool = __libcpp_is_contiguous_iterator<_Iter>::value>
39 static _LIBCPP_HIDE_FROM_ABI _Iter __rewrap(_Iter, _Iter __iter) { return __iter; } in __rewrap()
40 static _LIBCPP_HIDE_FROM_ABI _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } in __unwrap()
47 template <class _Iter>
48 struct __unwrap_iter_impl<_Iter, true> {
49 using _ToAddressT = decltype(std::__to_address(std::declval<_Iter>()));
51 static _LIBCPP_HIDE_FROM_ABI _Iter __rewrap(_Iter __orig_iter, _ToAddressT __unwrapped_iter) {
55 …static _LIBCPP_HIDE_FROM_ABI _ToAddressT __unwrap(_Iter __i) _NOEXCEPT { return std::__to_address(…
58 template <class _Iter,
59 class _Impl = __unwrap_iter_impl<_Iter>,
[all …]
H A Dsearch_n.h31 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
32 _LIBCPP_HIDE_FROM_ABI pair<_Iter, _Iter> __search_n_forward_impl( in __search_n_forward_impl()
33 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl()
48 _Iter __m = __first; in __search_n_forward_impl()
68 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class…
69 _LIBCPP_HIDE_FROM_ABI std::pair<_Iter, _Iter> __search_n_random_access_impl( in __search_n_random_access_impl()
70 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl()
71 using difference_type = typename iterator_traits<_Iter>::difference_type; in __search_n_random_access_impl()
109 template <class _Iter,
115 __enable_if_t<__has_random_access_iterator_category<_Iter>::value, int> = 0>
[all …]
H A Dequal_range.h39 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj>
40 _LIBCPP_HIDE_FROM_ABI pair<_Iter, _Iter>
41 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range()
43 _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last); in __equal_range()
46 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range()
54 _Iter __mp1 = __mid; in __equal_range()
55 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
59 return pair<_Iter, _Iter>(__first, __first); in __equal_range()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dcommon_iterator.h46 template <class _Iter>
48 …constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>> && move_constructible<iter_value_…
50 template <input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent>
51 requires(!same_as<_Iter, _Sent> && copyable<_Iter>)
54 _LIBCPP_HIDE_FROM_ABI constexpr const iter_value_t<_Iter>* operator->() const noexcept {
57 iter_value_t<_Iter> __value_;
61 …_LIBCPP_HIDE_FROM_ABI constexpr const iter_value_t<_Iter>& operator*() const noexcept { return __v…
62 iter_value_t<_Iter> __value_;
65 variant<_Iter, _Sent> __hold_;
72 requires default_initializable<_Iter>
[all …]
H A Dcounted_iterator.h47 template <class _Iter>
48 requires requires { typename _Iter::iterator_concept; }
49 struct __counted_iterator_concept<_Iter> {
50 using iterator_concept = typename _Iter::iterator_concept;
56 template <class _Iter>
57 requires requires { typename _Iter::iterator_category; }
58 struct __counted_iterator_category<_Iter> {
59 using iterator_category = typename _Iter::iterator_category;
65 template <indirectly_readable _Iter>
66 struct __counted_iterator_value_type<_Iter> {
[all …]
H A Dcpp17_iterator_concepts.h68 template <class _Iter>
70 …__cpp17_copy_constructible<_Iter> && __cpp17_copy_assignable<_Iter> && __cpp17_destructible<_Iter>…
71 … (is_signed_v<__iter_diff_t<_Iter>> || is_void_v<__iter_diff_t<_Iter>>) && requires(_Iter __iter) { in requires()
73 { ++__iter } -> same_as<_Iter&>; in requires()
76 template <class _Iter>
78 …__cpp17_iterator<_Iter> && __cpp17_equality_comparable<_Iter> && requires(_Iter __lhs, _Iter __rhs… in requires()
84 { *__lhs } -> same_as<__iter_reference<_Iter>>; in requires()
85 { *std::as_const(__lhs) } -> same_as<__iter_reference<_Iter>>; in requires()
87 { ++__lhs } -> same_as<_Iter&>; in requires()
92 template <class _Iter, class _WriteTo>
[all …]
H A Dreverse_iterator.h50 template <class _Iter>
53 : public iterator<typename iterator_traits<_Iter>::iterator_category,
54 typename iterator_traits<_Iter>::value_type,
55 typename iterator_traits<_Iter>::difference_type,
56 typename iterator_traits<_Iter>::pointer,
57 typename iterator_traits<_Iter>::reference>
64 _Iter __t_; // no longer used as of LWG #2360, not removed due to ABI break
68 …static_assert(__has_bidirectional_iterator_category<_Iter>::value || bidirectional_iterator<_Iter>,
73 _Iter current;
76 using iterator_type = _Iter;
[all …]
H A Dmove_iterator.h48 template <class _Iter, class = void>
51 template <class _Iter>
52 requires requires { typename iterator_traits<_Iter>::iterator_category; }
53 struct __move_iter_category_base<_Iter> {
55 … _If< derived_from<typename iterator_traits<_Iter>::iterator_category, random_access_iterator_tag>,
57 typename iterator_traits<_Iter>::iterator_category >;
60 template <class _Iter, class _Sent>
62 { std::declval<const _Iter&>() == std::declval<_Sent>() } -> convertible_to<bool>;
66 template <class _Iter>
69 : public __move_iter_category_base<_Iter>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__iterator/
H A Diterator_traits.h35 template <class _Iter>
44 template <class _Iter>
46 …ing type = _If< __is_primary_template<iterator_traits<_Iter> >::value, _Iter, iterator_traits<_Ite…
48 template <class _Iter>
49 using _ITER_TRAITS = typename __iter_traits_cache<_Iter>::type;
52 template <class _Iter>
53 using _Apply = typename _ITER_TRAITS<_Iter>::iterator_concept;
56 template <class _Iter>
57 using _Apply = typename _ITER_TRAITS<_Iter>::iterator_category;
60 template <class _Iter>
[all …]
H A Dreverse_iterator.h39 template <class _Iter>
41 : public iterator<typename iterator_traits<_Iter>::iterator_category,
42 typename iterator_traits<_Iter>::value_type,
43 typename iterator_traits<_Iter>::difference_type,
44 typename iterator_traits<_Iter>::pointer,
45 typename iterator_traits<_Iter>::reference> {
50 _Iter __t_; // no longer used as of LWG #2360, not removed due to ABI break
54 _Iter current;
57 using iterator_type = _Iter;
60 _If<__has_random_access_iterator_category<_Iter>::value,
[all …]
H A Dmove_iterator.h35 template <class _Iter>
38 typedef _Iter iterator_type;
39 typedef _If< __has_random_access_iterator_category<_Iter>::value,
41 typename iterator_traits<_Iter>::iterator_category >
51 _LIBCPP_HIDE_FROM_ABI explicit move_iterator(_Iter __i) : __current_(std::move(__i)) {} in move_iterator()
62 …template <class _Up, __enable_if_t< !is_same<_Up, _Iter>::value && is_convertible<const _Up&, _Ite…
66 … __enable_if_t< !is_same<_Up, _Iter>::value && is_convertible<const _Up&, _Iter>::value &&
67 is_assignable<_Iter&, const _Up&>::value,
74 _LIBCPP_HIDE_FROM_ABI _Iter base() const { return __current_; } in base()
111 _Iter __current_;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dsubrange.h66 template <class _Pair, class _Iter, class _Sent>
68 !range<_Pair> && __pair_like_no_subrange<_Pair> && constructible_from<_Pair, _Iter, _Sent> &&
69 …__convertible_to_non_slicing<_Iter, tuple_element_t<0, _Pair>> && convertible_to<_Sent, tuple_elem…
71 template <input_or_output_iterator _Iter,
72 sentinel_for<_Iter> _Sent = _Iter,
73 …subrange_kind _Kind = sized_sentinel_for<_Sent, _Iter> ? subrange_kind::sized : subrange_kin…
74 requires(_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>)
75 class subrange : public view_interface<subrange<_Iter, _Sent, _Kind>> {
78 …c constexpr bool _StoreSize = (_Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _Iter>);
85 …using _Size _LIBCPP_NODEBUG = conditional_t<_StoreSize, make_unsigned_t<iter_difference_t<_Iter>>,…
[all …]

12345