Home
last modified time | relevance | path

Searched refs:_Ip (Results 1 – 25 of 47) sorted by relevance

12

/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Diterator_traits.h156 template <class _Ip>
157 concept __cpp17_iterator = requires(_Ip __i) { in requires()
159 { ++__i } -> same_as<_Ip&>; in requires()
161 } && copyable<_Ip>; in requires()
163 template <class _Ip>
164 concept __cpp17_input_iterator = __cpp17_iterator<_Ip> && equality_comparable<_Ip> && requires(_Ip … in requires()
165 typename incrementable_traits<_Ip>::difference_type; in requires()
166 typename indirectly_readable_traits<_Ip>::value_type; in requires()
167 …typename common_reference_t<iter_reference_t<_Ip>&&, typename indirectly_readable_traits<_Ip>::val… in requires()
168 …typename common_reference_t<decltype(*__i++)&&, typename indirectly_readable_traits<_Ip>::value_ty… in requires()
[all …]
H A Dconcepts.h87 template <class _Ip>
90 !same_as<_Ip, bool> && // Currently, clang does not handle bool correctly.
91 movable<_Ip> && requires(_Ip __i) {
92 typename iter_difference_t<_Ip>;
93 requires __signed_integer_like<iter_difference_t<_Ip>>;
94 { ++__i } -> same_as<_Ip&>; // not required to be equality-preserving
99 template <class _Ip>
100 concept incrementable = regular<_Ip> && weakly_incrementable<_Ip> && requires(_Ip __i) { in requires()
101 { __i++ } -> same_as<_Ip>; in requires()
105 template <class _Ip>
[all …]
H A Dadvance.h83 template <class _Ip>
84 …_LIBCPP_HIDE_FROM_ABI static constexpr void __advance_forward(_Ip& __i, iter_difference_t<_Ip> __n… in __advance_forward()
91 template <class _Ip>
92 …_LIBCPP_HIDE_FROM_ABI static constexpr void __advance_backward(_Ip& __i, iter_difference_t<_Ip> __… in __advance_backward()
101 template <input_or_output_iterator _Ip>
102 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Ip& __i, iter_difference_t<_Ip> __n) const { in operator()
105 …__n >= 0 || bidirectional_iterator<_Ip>, "If `n < 0`, then `bidirectional_iterator<I>` must be tru… in operator()
108 if constexpr (random_access_iterator<_Ip>) { in operator()
111 } else if constexpr (bidirectional_iterator<_Ip>) { in operator()
126 template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
[all …]
H A Dnext.h47 template <input_or_output_iterator _Ip>
48 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x) const { in operator()
53 template <input_or_output_iterator _Ip>
54 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n) const {
59 template <input_or_output_iterator _Ip, sentinel_for<_Ip> _Sp>
60 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operato
[all...]
H A Diter_move.h62 template <class _Ip>
63 requires __unqualified_iter_move<_Ip>
64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) operator()(_Ip&& __i) const in decltype()
65 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) { in decltype()
66 return iter_move(std::forward<_Ip>(__i)); in decltype()
70 template <class _Ip>
71 requires __move_deref<_Ip>
72 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Ip&& __i) const
73 …noexcept(noexcept(std::move(*std::forward<_Ip>(__i)))) -> decltype(std::move(*std::forward<_Ip>(__…
74 return std::move(*std::forward<_Ip>(__i));
[all …]
H A Dprev.h46 template <bidirectional_iterator _Ip>
47 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x) const { in operator()
52 template <bidirectional_iterator _Ip>
53 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __x, iter_difference_t<_Ip> __n) const {
58 template <bidirectional_iterator _Ip>
59 _LIBCPP_HIDE_FROM_ABI constexpr _Ip operator()(_Ip __
[all...]
H A Ddistance.h58 template <class _Ip, sentinel_for<_Ip> _Sp>
59 requires(!sized_sentinel_for<_Sp, _Ip>)
60 _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Ip> operator()(_Ip __first, _Sp __last) const {
61 iter_difference_t<_Ip> __n = 0;
69 template <class _Ip, sized_sentinel_for<decay_t<_Ip>> _Sp> in operator()
70 _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Ip> operator()(_Ip in operator()
[all...]
H A Dincrementable_traits.h41 template <class _Ip>
42 struct incrementable_traits<const _Ip> : incrementable_traits<_Ip> {};
69 template <class _Ip>
71 typename conditional_t<__is_primary_template<iterator_traits<remove_cvref_t<_Ip> > >::value,
72 incrementable_traits<remove_cvref_t<_Ip> >,
73 iterator_traits<remove_cvref_t<_Ip> > >::difference_type;
H A Dreadable_traits.h50 template <class _Ip>
51 requires is_array_v<_Ip>
52 struct indirectly_readable_traits<_Ip> {
53 using value_type = remove_cv_t<remove_extent_t<_Ip>>;
56 template <class _Ip>
57 struct indirectly_readable_traits<const _Ip> : indirectly_readable_traits<_Ip> {};
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfold.h43 template <class _Ip, class _Tp>
45 _LIBCPP_NO_UNIQUE_ADDRESS _Ip in;
49 requires convertible_to<const _Ip&, _I2> && convertible_to<const _Tp&, _T2>
55 requires convertible_to<_Ip, _I2> && convertible_to<_Tp, _T2>
61 template <class _Ip, class _Tp>
62 using fold_left_with_iter_result = in_value_result<_Ip, _Tp>;
64 template <class _Fp, class _Tp, class _Ip, class _Rp, class _Up = decay_t<_Rp>>
70 invocable<_Fp&, _Up, iter_reference_t<_Ip>> && //
71 assignable_from<_Up&, invoke_result_t<_Fp&, _Up, iter_reference_t<_Ip>>>;
73 template <class _Fp, class _Tp, class _Ip>
[all …]
H A Dranges_min_element.h37 template <class _Ip, class _Sp, class _Proj, class _Comp>
38 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Pro… in __min_element_impl()
42 _Ip __i = __first; in __min_element_impl()
51 template <forward_iterator _Ip,
52 sentinel_for<_Ip> _Sp,
54 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
55 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
56 operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_find_if.h36 template <class _Ip, class _Sp, class _Pred, class _Proj>
37 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& _… in __find_if_impl()
47 template <input_iterator _Ip,
48 sentinel_for<_Ip> _Sp,
50 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
51 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
52 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_copy_n.h37 template <class _Ip, class _Op>
38 using copy_n_result = in_out_result<_Ip, _Op>;
61 template <input_iterator _Ip, weakly_incrementable _Op> in operator()
62 requires indirectly_copyable<_Ip, _Op> in operator()
63 _LIBCPP_HIDE_FROM_ABI constexpr copy_n_result<_Ip, _Op> in operator()
64 operator()(_Ip __first, iter_difference_t<_Ip> __n, _Op __result) const {
H A Dranges_max_element.h37 template <forward_iterator _Ip,
38 sentinel_for<_Ip> _Sp,
40 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
41 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
42 operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_find_if_not.h39 template <input_iterator _Ip,
40 sentinel_for<_Ip> _Sp,
42 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
43 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
44 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_minmax_element.h45 template <forward_iterator _Ip,
46 sentinel_for<_Ip> _Sp,
48 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
49 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<_Ip>
50 operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_find.h53 template <input_iterator _Ip, sentinel_for<_Ip> _Sp, class _Tp, class _Proj = identity>
54 requires indirect_binary_predicate<ranges::equal_to, projected<_Ip, _Proj>, const _Tp*>
55 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Ip
56 operator()(_Ip __first, _Sp __last, const _Tp& __value, _Proj __proj = {}) const { in operator()
/freebsd/contrib/llvm-project/libcxx/include/__tuple/
H A Dtuple_element.h23 template <size_t _Ip, class _Tp>
26 template <size_t _Ip, class _Tp>
27 struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, const _Tp> {
28 typedef _LIBCPP_NODEBUG const typename tuple_element<_Ip, _Tp>::type type;
31 template <size_t _Ip, class _Tp>
32 struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, volatile _Tp> {
33 typedef _LIBCPP_NODEBUG volatile typename tuple_element<_Ip, _Tp>::type type;
36 template <size_t _Ip, class _Tp>
37 struct _LIBCPP_TEMPLATE_VIS tuple_element<_Ip, const volatile _Tp> {
38 typedef _LIBCPP_NODEBUG const volatile typename tuple_element<_Ip, _Tp>::type type;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Dconcepts.h38 template <class _Ip>
40 input_iterator<_Ip> && is_lvalue_reference_v<iter_reference_t<_Ip>> &&
41 same_as<remove_cvref_t<iter_reference_t<_Ip>>, iter_value_t<_Ip>>;
43 template <class _Sp, class _Ip>
44 concept __nothrow_sentinel_for = sentinel_for<_Sp, _Ip>;
50 template <class _Ip>
52 __nothrow_input_iterator<_Ip> && forward_iterator<_Ip>
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__type_traits/
H A Dextent.h28 template <class _Tp, unsigned _Ip = 0>
29 inline constexpr size_t extent_v = __array_extent(_Tp, _Ip);
34 template <class _Tp, unsigned _Ip = 0>
38 template <class _Tp, unsigned _Ip>
39 struct _LIBCPP_TEMPLATE_VIS extent<_Tp[], _Ip> : public integral_constant<size_t, extent<_Tp, _Ip -…
42 template <class _Tp, size_t _Np, unsigned _Ip>
43 struct _LIBCPP_TEMPLATE_VIS extent<_Tp[_Np], _Ip> : public integral_constant<size_t, extent<_Tp, _I…
46 template <class _Tp, unsigned _Ip = 0>
47 inline constexpr size_t extent_v = extent<_Tp, _Ip>::value;
/freebsd/contrib/llvm-project/libcxx/include/__fwd/
H A Dtuple.h32 template <size_t _Ip, class... _Tp>
33 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, tuple<_Tp...> >::ty…
36 template <size_t _Ip, class... _Tp>
37 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, tuple<_Tp...>…
40 template <size_t _Ip, class... _Tp>
41 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, tuple<_Tp...> >::ty…
44 template <size_t _Ip, class... _Tp>
45 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, tuple<_Tp...>…
H A Dpair.h25 template <size_t _Ip, class _T1, class _T2>
26 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, pair<_T1, _T2> >::t…
29 template <size_t _Ip, class _T1, class _T2>
30 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, pair<_T1, _T2…
34 template <size_t _Ip, class _T1, class _T2>
35 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 typename tuple_element<_Ip, pair<_T1, _T2> >::t…
38 template <size_t _Ip, class _T1, class _T2>
39 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const typename tuple_element<_Ip, pair<_T1, _T2…
H A Dcomplex.h26 template <size_t _Ip, class _Tp>
29 template <size_t _Ip, class _Tp>
32 template <size_t _Ip, class _Tp>
35 template <size_t _Ip, class _Tp>
/freebsd/contrib/llvm-project/libcxx/include/
H A Dvariant329 template <size_t _Ip, class _Tp>
332 template <size_t _Ip, class _Tp>
333 using variant_alternative_t = typename variant_alternative<_Ip, _Tp>::type;
335 template <size_t _Ip, class _Tp>
336 struct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, const _Tp> : add_const<variant_alternative_t<_…
338 template <size_t _Ip, class _Tp>
339 …truct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, volatile _Tp> : add_volatile<variant_alternati…
341 template <size_t _Ip, class _Tp>
342 …truct _LIBCPP_TEMPLATE_VIS variant_alternative<_Ip, const volatile _Tp> : add_cv<variant_alternati…
344 template <size_t _Ip, class... _Types>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dsubrange.h231 template <class _Ip, class _Sp, subrange_kind _Kp>
232 inline constexpr bool enable_borrowed_range<subrange<_Ip, _Sp, _Kp>> = true;
244 template <class _Ip, class _Sp, ranges::subrange_kind _Kp>
245 struct tuple_size<ranges::subrange<_Ip, _Sp, _Kp>> : integral_constant<size_t, 2> {};
247 template <class _Ip, class _Sp, ranges::subrange_kind _Kp>
248 struct tuple_element<0, ranges::subrange<_Ip, _Sp, _Kp>> {
249 using type = _Ip;
252 template <class _Ip, class _Sp, ranges::subrange_kind _Kp>
253 struct tuple_element<1, ranges::subrange<_Ip, _Sp, _Kp>> {
257 template <class _Ip, class _Sp, ranges::subrange_kind _Kp>
[all …]

12