| /llvm-project-15.0.7/libcxx/include/__functional/ |
| H A D | weak_result_type.h | 42 template <class _Ap, class _Rp> 113 template <class _Rp> 121 template <class _Rp> 129 template <class _Rp> 139 template <class _Rp, class _A1> 145 template <class _Rp, class _A1> 151 template <class _Rp, class _A1> 157 template <class _Rp, class _Cp> 163 template <class _Rp, class _Cp> 169 template <class _Rp, class _Cp> [all …]
|
| H A D | invoke.h | 54 typedef _Rp _ReturnType; 62 typedef _Rp _ReturnType; 70 typedef _Rp _ReturnType; 78 typedef _Rp _ReturnType; 86 typedef _Rp _ReturnType; 94 typedef _Rp _ReturnType; 102 typedef _Rp _ReturnType; 110 typedef _Rp _ReturnType; 118 typedef _Rp _ReturnType; 126 typedef _Rp _ReturnType; [all …]
|
| H A D | function.h | 356 _Rp 1071 function(_Rp(*)(_Ap...)) -> function<_Rp(_Ap...)>; 1194 _Rp 1395 _Rp 1481 _Rp 1567 _Rp 1653 _Rp 1918 _Rp 2196 _Rp 2474 _Rp [all …]
|
| H A D | mem_fn.h | 49 template<class _Rp, class _Tp> 51 __mem_fn<_Rp _Tp::*> 52 mem_fn(_Rp _Tp::* __pm) _NOEXCEPT in mem_fn() 54 return __mem_fn<_Rp _Tp::*>(__pm); in mem_fn()
|
| /llvm-project-15.0.7/libcxx/include/__ranges/ |
| H A D | owning_view.h | 34 template<range _Rp> 35 requires movable<_Rp> && (!__is_std_initializer_list<remove_cvref_t<_Rp>>) 36 class owning_view : public view_interface<owning_view<_Rp>> { 37 _Rp __r_ = _Rp(); 40 owning_view() requires default_initializable<_Rp> = default; 41 _LIBCPP_HIDE_FROM_ABI constexpr owning_view(_Rp&& __r) : __r_(std::move(__r)) {} in owning_view() 46 _LIBCPP_HIDE_FROM_ABI constexpr _Rp& base() & noexcept { return __r_; } in base() 47 _LIBCPP_HIDE_FROM_ABI constexpr const _Rp& base() const& noexcept { return __r_; } in base() 61 _LIBCPP_HIDE_FROM_ABI constexpr auto size() requires sized_range<_Rp> in size() 63 _LIBCPP_HIDE_FROM_ABI constexpr auto size() const requires sized_range<const _Rp> in size() [all …]
|
| H A D | concepts.h | 56 template <range _Rp> 57 using sentinel_t = decltype(ranges::end(declval<_Rp&>())); 59 template <range _Rp> 62 template <range _Rp> 63 using range_value_t = iter_value_t<iterator_t<_Rp>>; 65 template <range _Rp> 66 using range_reference_t = iter_reference_t<iterator_t<_Rp>>; 68 template <range _Rp> 75 template<sized_range _Rp> 98 template <class _Rp, class _Tp> [all …]
|
| H A D | dangling.h | 32 template <range _Rp> 33 using borrowed_iterator_t = _If<borrowed_range<_Rp>, iterator_t<_Rp>, dangling>;
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | future | 684 _Rp 732 __assoc_state<_Rp&>::set_value(_Rp& __arg) 755 _Rp& 1120 _Rp 1202 _Rp& 1369 promise<_Rp>::set_value(const _Rp& __r) 1378 promise<_Rp>::set_value(_Rp&& __r) 1512 promise<_Rp&>::set_value(_Rp& __r) 1691 _Rp 1873 _Rp [all …]
|
| /llvm-project-15.0.7/libcxx/include/__random/ |
| H A D | subtract_with_carry_engine.h | 35 template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp> 41 template<class _UInt, size_t _Wp, size_t _Sp, size_t _Rp> 49 class _UInt, size_t _Wp, size_t _Sp, size_t _Rp> 265 size_t __j = _VSTD::min(_Rp - __x.__i_, _Rp - __y.__i_); 275 size_t __j = _Rp - __y.__i_; 285 size_t __j = _Rp - __x.__i_; 318 for (size_t __j = __x.__i_ + 1; __j < _Rp; ++__j) 335 _UInt __t[_Rp+1]; 336 for (size_t __i = 0; __i < _Rp+1; ++__i) 340 for (size_t __i = 0; __i < _Rp; ++__i) [all …]
|
| H A D | log2.h | 22 template <class _UIntType, _UIntType _Xp, size_t _Rp> 25 template <unsigned long long _Xp, size_t _Rp> 26 struct __log2_imp<unsigned long long, _Xp, _Rp> 28 static const size_t value = _Xp & ((unsigned long long)(1) << _Rp) ? _Rp 29 : __log2_imp<unsigned long long, _Xp, _Rp - 1>::value; 38 template <size_t _Rp> 39 struct __log2_imp<unsigned long long, 0, _Rp> 41 static const size_t value = _Rp + 1; 46 template <__uint128_t _Xp, size_t _Rp> 47 struct __log2_imp<__uint128_t, _Xp, _Rp>
|
| H A D | discard_block_engine.h | 99 template<class _Eng, size_t _Pp, size_t _Rp> 103 const discard_block_engine<_Eng, _Pp, _Rp>& __x, 106 template<class _Eng, size_t _Pp, size_t _Rp> 110 const discard_block_engine<_Eng, _Pp, _Rp>& __x, 114 class _Eng, size_t _Pp, size_t _Rp> 121 class _Eng, size_t _Pp, size_t _Rp> 147 template<class _Eng, size_t _Pp, size_t _Rp> 156 template<class _Eng, size_t _Pp, size_t _Rp> 166 class _Eng, size_t _Pp, size_t _Rp> 180 class _Eng, size_t _Pp, size_t _Rp> [all …]
|
| H A D | uniform_int_distribution.h | 59 static const _Working_result_type _Rp = _Engine::_Max - _Engine::_Min variable 89 if (_Rp == 0) in __independent_bits_engine() 90 __y0_ = _Rp; in __independent_bits_engine() 92 __y0_ = (_Rp >> __w0_) << __w0_; in __independent_bits_engine() 95 if (_Rp - __y0_ > __y0_ / __n_) in __independent_bits_engine() 100 __y0_ = (_Rp >> __w0_) << __w0_; in __independent_bits_engine() 106 __y1_ = (_Rp >> (__w0_ + 1)) << (__w0_ + 1); in __independent_bits_engine() 239 if (_Rp == 1) in operator() 243 if (_Rp == 0) in operator() 245 size_t __w = _Dt - __countl_zero(_Rp) - 1; in operator() [all …]
|
| H A D | mersenne_twister_engine.h | 36 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 45 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 56 class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 65 class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 160 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 170 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 181 class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 416 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 460 template <class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, 474 class _UInt, size_t _Wp, size_t _Np, size_t _Mp, size_t _Rp, [all …]
|
| /llvm-project-15.0.7/libcxx/include/__concepts/ |
| H A D | relation.h | 25 template<class _Rp, class _Tp, class _Up> 27 predicate<_Rp, _Tp, _Tp> && predicate<_Rp, _Up, _Up> && 28 predicate<_Rp, _Tp, _Up> && predicate<_Rp, _Up, _Tp>; 32 template<class _Rp, class _Tp, class _Up> 33 concept equivalence_relation = relation<_Rp, _Tp, _Up>; 37 template<class _Rp, class _Tp, class _Up> 38 concept strict_weak_order = relation<_Rp, _Tp, _Up>;
|
| /llvm-project-15.0.7/libcxx/include/__memory/ |
| H A D | concepts.h | 45 template <class _Rp> 47 range<_Rp> && 48 __nothrow_input_iterator<iterator_t<_Rp>> && 49 __nothrow_sentinel_for<sentinel_t<_Rp>, iterator_t<_Rp>>; 57 template <class _Rp> 59 __nothrow_input_range<_Rp> && 60 __nothrow_forward_iterator<iterator_t<_Rp>>;
|
| /llvm-project-15.0.7/libcxx/include/__numeric/ |
| H A D | gcd_lcm.h | 65 using _Rp = common_type_t<_Tp,_Up>; 66 using _Wp = make_unsigned_t<_Rp>; 67 return static_cast<_Rp>(_VSTD::__gcd( 68 static_cast<_Wp>(__ct_abs<_Rp, _Tp>()(__m)), 69 static_cast<_Wp>(__ct_abs<_Rp, _Up>()(__n)))); 83 using _Rp = common_type_t<_Tp,_Up>; 84 _Rp __val1 = __ct_abs<_Rp, _Tp>()(__m) / _VSTD::gcd(__m, __n); 85 _Rp __val2 = __ct_abs<_Rp, _Up>()(__n); 86 _LIBCPP_ASSERT((numeric_limits<_Rp>::max() / __val1 > __val2), "Overflow in lcm");
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | ranges_min.h | 54 template <input_range _Rp, class _Proj = identity, 55 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> 56 requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*> 58 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 64 if constexpr (forward_range<_Rp>) { 67 range_value_t<_Rp> __result = *__first;
|
| H A D | ranges_max.h | 57 template <input_range _Rp, class _Proj = identity, 58 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> 59 requires indirectly_copyable_storable<iterator_t<_Rp>, range_value_t<_Rp>*> 61 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 67 if constexpr (forward_range<_Rp>) { 71 range_value_t<_Rp> __result = *__first;
|
| H A D | ranges_max_element.h | 42 template <forward_range _Rp, class _Proj = identity, 43 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> 45 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_find_if_not.h | 44 template <input_range _Rp, class _Proj = identity, 45 indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred> 47 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_find.h | 44 template <input_range _Rp, class _Tp, class _Proj = identity> 45 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Rp>, _Proj>, const _Tp*> 47 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, const _Tp& __value, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_minmax_element.h | 51 template <forward_range _Rp, class _Proj = identity, 52 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less> 54 ranges::minmax_element_result<borrowed_iterator_t<_Rp>> 55 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_find_if.h | 53 template <input_range _Rp, class _Proj = identity, 54 indirect_unary_predicate<projected<iterator_t<_Rp>, _Proj>> _Pred> 56 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| /llvm-project-15.0.7/clang/test/SemaCXX/ |
| H A D | linkage2.cpp | 58 template <class _Rp> 60 template <class _Rp> 63 shared_future<_Rp> share(); 65 template <class _Rp> future<_Rp> 67 template <class _Rp> 68 struct shared_future<_Rp&> { 69 shared_future(future<_Rp&>&& __f);
|
| /llvm-project-15.0.7/libcxx/include/__iterator/ |
| H A D | distance.h | 85 template<range _Rp> 87 constexpr range_difference_t<_Rp> operator()(_Rp&& __r) const { in operator() 88 if constexpr (sized_range<_Rp>) { in operator() 89 return static_cast<range_difference_t<_Rp>>(ranges::size(__r)); in operator()
|