Home
last modified time | relevance | path

Searched refs:__t (Results 1 – 25 of 135) sorted by relevance

123456

/llvm-project-15.0.7/libcxx/include/__ranges/
H A Daccess.h42 requires(_Tp&& __t) { in requires() argument
54 requires(_Tp && __t) {
63 return __t + 0; in operator()
70 return __t + 0; in operator()
78 return _LIBCPP_AUTO_CAST(__t.begin()); in operator()
86 return _LIBCPP_AUTO_CAST(begin(__t)); in operator()
113 requires(_Tp&& __t) { in requires() argument
126 requires(_Tp && __t) {
136 return __t + _Np; in operator()
144 return _LIBCPP_AUTO_CAST(__t.end()); in operator()
[all …]
H A Drend.h39 requires(_Tp&& __t) { in requires() argument
40 ranges::rbegin(__t); in requires()
41 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires()
52 requires(_Tp&& __t) {
53 ranges::rbegin(__t);
54 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
62 requires(_Tp&& __t) {
63 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
74 return _LIBCPP_AUTO_CAST(__t.rend()); in operator()
82 return _LIBCPP_AUTO_CAST(rend(__t)); in operator()
[all …]
H A Dsize.h49 requires(_Tp&& __t) { in requires() argument
58 requires(_Tp&& __t) {
67 requires(_Tp&& __t) {
68 { ranges::begin(__t) } -> forward_iterator;
90 return _LIBCPP_AUTO_CAST(__t.size()); in operator()
97 return _LIBCPP_AUTO_CAST(size(__t)); in operator()
103 noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))))
104 -> decltype( std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t)))
105 { return std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t));
122 requires requires (_Tp&& __t) { ranges::size(__t); } in requires()
[all …]
H A Drbegin.h38 requires(_Tp&& __t) { in requires() argument
50 requires(_Tp&& __t) {
59 requires(_Tp&& __t) {
60 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
61 { ranges::begin(__t) } -> bidirectional_iterator;
70 return _LIBCPP_AUTO_CAST(__t.rbegin()); in operator()
76 noexcept(noexcept(_LIBCPP_AUTO_CAST(rbegin(__t)))) in operator()
78 return _LIBCPP_AUTO_CAST(rbegin(__t)); in operator()
84 noexcept(noexcept(ranges::end(__t))) in operator()
106 constexpr auto operator()(_Tp&& __t) const
[all …]
H A Dempty.h34 requires(_Tp&& __t) { in requires() argument
35 bool(__t.empty()); in requires()
41 requires(_Tp&& __t) { ranges::size(__t); };
47 requires(_Tp&& __t) {
48 bool(ranges::begin(__t) == ranges::end(__t));
55 noexcept(noexcept(bool(__t.empty()))) { in operator()
56 return bool(__t.empty()); in operator()
61 noexcept(noexcept(ranges::size(__t))) { in operator()
62 return ranges::size(__t) == 0; in operator()
67 noexcept(noexcept(bool(ranges::begin(__t) == ranges::end(__t)))) { in operator()
[all …]
H A Ddata.h40 requires(_Tp&& __t) { in requires() argument
41 { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object; in requires()
48 requires(_Tp&& __t) {
49 { ranges::begin(__t) } -> contiguous_iterator;
55 constexpr auto operator()(_Tp&& __t) const in operator()
56 noexcept(noexcept(__t.data())) { in operator()
57 return __t.data(); in operator()
62 constexpr auto operator()(_Tp&& __t) const in operator()
64 return std::to_address(ranges::begin(__t)); in operator()
82 constexpr auto operator()(_Tp&& __t) const
[all …]
H A Dall.h40 constexpr auto operator()(_Tp&& __t) const
42 -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t)))
44 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
49 requires (_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } in requires()
51 constexpr auto operator()(_Tp&& __t) const in operator()
52 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) in operator()
54 return ranges::ref_view{std::forward<_Tp>(__t)};
59 !requires (_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } &&
60 requires (_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
62 constexpr auto operator()(_Tp&& __t) const in operator()
[all …]
/llvm-project-15.0.7/libcxx/include/
H A Dbit98 return __t;
99 return (__t >> (__cnt % __dig)) | (__t << (__dig - (__cnt % __dig)));
107 if (__t == 0)
125 __t = std::__rotr(__t, __ulldigits);
140 return __t;
141 return (__t << (__cnt % __dig)) | (__t >> (__dig - (__cnt % __dig)));
161 if (__t == 0)
206 return __t != 0 && (((__t & (__t - 1)) == 0));
217 return __t == 0 ? 0 : _Tp{1} << std::__bit_log2(__t);
222 if (__t < 2)
[all …]
H A D__split_buffer445 _VSTD::swap(__first_, __t.__first_);
446 _VSTD::swap(__begin_, __t.__begin_);
447 _VSTD::swap(__end_, __t.__end_);
466 __t.__end_ = __t.__begin_ + (__end_ - __begin_);
467 _VSTD::swap(__first_, __t.__first_);
469 _VSTD::swap(__end_, __t.__end_);
502 _VSTD::swap(__end_, __t.__end_);
532 _VSTD::swap(__end_, __t.__end_);
564 _VSTD::swap(__end_, __t.__end_);
594 _VSTD::swap(__end_, __t.__end_);
[all …]
/llvm-project-15.0.7/libcxx/include/__compare/
H A Dstrong_order.h40 __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)
51 int32_t __rx = _VSTD::bit_cast<int32_t>(__t); in __go()
57 int64_t __rx = _VSTD::bit_cast<int64_t>(__t); in __go()
62 } else if (__t < __u) { in __go()
64 } else if (__t > __u) { in __go()
66 } else if (__t == __u) { in __go()
73 if (__t == 0 || _VSTD::isinf(__t)) { in __go()
77 (void)_VSTD::frexp(__t, &__texp); in __go()
85 bool __t_is_nan = _VSTD::isnan(__t); in __go()
87 bool __t_is_negative = _VSTD::signbit(__t); in __go()
[all …]
H A Dweak_order.h35 __go(_Tp&& __t, _Up&& __u, __priority_tag<3>)
36 … noexcept(noexcept(weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
37 … -> decltype( weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
38 … { return weak_ordering(weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
43 __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept in __go()
45 partial_ordering __po = (__t <=> __u); in __go()
54 bool __t_is_nan = _VSTD::isnan(__t); in __go()
56 bool __t_is_negative = _VSTD::signbit(__t); in __go()
71 __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
79 __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
[all …]
H A Dcompare_partial_order_fallback.h33 __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
34 … noexcept(noexcept(_VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
35 … -> decltype( _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
36 … { return _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
41 __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
43 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
47 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
52 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
58 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
59 … noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
[all …]
H A Dpartial_order.h34 __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)
35 …noexcept(noexcept(partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u…
36 …-> decltype( partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u…
37 …{ return partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u…
42 __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
50 __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
52 …-> decltype( partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>…
56 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
57 … noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>())))
58 … -> decltype( __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()))
[all …]
H A Dcompare_strong_order_fallback.h33 __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
34 … noexcept(noexcept(_VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
35 … -> decltype( _VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
36 … { return _VSTD::strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
41 __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
42 … noexcept(noexcept(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? strong_ordering::equal :
43 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
45 … -> decltype( _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? strong_ordering::equal :
46 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
50 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
[all …]
H A Dcompare_weak_order_fallback.h33 __go(_Tp&& __t, _Up&& __u, __priority_tag<1>)
34 … noexcept(noexcept(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
35 -> decltype( _VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
36 … { return _VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
41 __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)
43 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
46 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
50 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
55 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
56 … noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
[all …]
/llvm-project-15.0.7/libcxx/include/__functional/
H A Doperations.h46 auto operator()(_T1&& __t, _T2&& __u) const
74 auto operator()(_T1&& __t, _T2&& __u) const
102 auto operator()(_T1&& __t, _T2&& __u) const
130 auto operator()(_T1&& __t, _T2&& __u) const
158 auto operator()(_T1&& __t, _T2&& __u) const
216 auto operator()(_T1&& __t, _T2&& __u) const
267 auto operator()(_T1&& __t, _T2&& __u) const
295 auto operator()(_T1&& __t, _T2&& __u) const
325 auto operator()(_T1&& __t, _T2&& __u) const
353 auto operator()(_T1&& __t, _T2&& __u) const
[all …]
H A Dranges_operations.h30 [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const in operator()
32 return _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u); in operator()
41 [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const in operator()
43 return !(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u)); in operator()
52 [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const in operator()
54 return _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u); in operator()
63 [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const in operator()
65 return !(_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t)); in operator()
74 [[nodiscard]] constexpr bool operator()(_Tp &&__t, _Up &&__u) const in operator()
76 return _VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t); in operator()
[all …]
H A Dreference_wrapper.h68 ref(_Tp& __t) _NOEXCEPT in ref() argument
70 return reference_wrapper<_Tp>(__t); in ref()
76 ref(reference_wrapper<_Tp> __t) _NOEXCEPT in ref() argument
78 return __t; in ref()
84 cref(const _Tp& __t) _NOEXCEPT in cref() argument
86 return reference_wrapper<const _Tp>(__t); in cref()
92 cref(reference_wrapper<_Tp> __t) _NOEXCEPT in cref() argument
94 return __t; in cref()
/llvm-project-15.0.7/libcxx/include/__utility/
H A Dcmp.h44 bool cmp_equal(_Tp __t, _Up __u) noexcept in cmp_equal() argument
47 return __t == __u; in cmp_equal()
49 return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u; in cmp_equal()
58 return !_VSTD::cmp_equal(__t, __u); in cmp_not_equal()
63 bool cmp_less(_Tp __t, _Up __u) noexcept in cmp_less() argument
66 return __t < __u; in cmp_less()
68 return __t < 0 ? true : make_unsigned_t<_Tp>(__t) < __u; in cmp_less()
75 bool cmp_greater(_Tp __t, _Up __u) noexcept in cmp_greater() argument
77 return _VSTD::cmp_less(__u, __t); in cmp_greater()
84 return !_VSTD::cmp_greater(__t, __u); in cmp_less_equal()
[all …]
/llvm-project-15.0.7/libcxx/include/__numeric/
H A Dpartial_sum.h30 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
31 *__result = __t; in partial_sum()
35 __t = _VSTD::move(__t) + *__first; in partial_sum()
37 __t = __t + *__first; in partial_sum()
39 *__result = __t; in partial_sum()
53 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
54 *__result = __t; in partial_sum()
58 __t = __binary_op(_VSTD::move(__t), *__first); in partial_sum()
60 __t = __binary_op(__t, *__first); in partial_sum()
62 *__result = __t; in partial_sum()
/llvm-project-15.0.7/libcxx/include/__concepts/
H A Dswappable.h41 requires(_Tp&& __t, _Up&& __u) { in requires() argument
42 swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); in requires()
52 __swap(__t[0], __u[0]);
66 constexpr void operator()(_Tp&& __t, _Up&& __u) const in operator()
69 swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); in operator()
76 noexcept(noexcept((*this)(*__t, *__u))) in operator()
80 (*this)(__t[__i], __u[__i]); in operator()
105 requires(_Tp&& __t, _Up&& __u) { in requires() argument
106 ranges::swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Tp>(__t)); in requires()
108 ranges::swap(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); in requires()
[all …]
H A Dtotally_ordered.h29 requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) { in requires() argument
30 { __t < __u } -> __boolean_testable; in requires()
31 { __t > __u } -> __boolean_testable; in requires()
32 { __t <= __u } -> __boolean_testable; in requires()
33 { __t >= __u } -> __boolean_testable; in requires()
34 { __u < __t } -> __boolean_testable; in requires()
35 { __u > __t } -> __boolean_testable; in requires()
36 { __u <= __t } -> __boolean_testable; in requires()
37 { __u >= __t } -> __boolean_testable; in requires()
/llvm-project-15.0.7/libcxx/include/__iterator/
H A Diter_move.h38 requires (_Tp&& __t) { in requires() argument
39 iter_move(std::forward<_Tp>(__t)); in requires()
45 requires (_Tp&& __t) {
46 *__t;
47 requires is_lvalue_reference_v<decltype(*__t)>;
54 requires (_Tp&& __t) {
55 *__t;
56 requires (!is_lvalue_reference_v<decltype(*__t)>);
92 requires requires(_Tp& __t) { { ranges::iter_move(__t) } -> __can_reference; } in requires() argument
/llvm-project-15.0.7/clang/lib/Headers/
H A Darm_acle.h142 __clz(uint32_t __t) { in __clz() argument
152 __clzll(uint64_t __t) { in __clzll() argument
158 __cls(uint32_t __t) { in __cls() argument
172 __clsll(uint64_t __t) { in __clsll() argument
178 __rev(uint32_t __t) { in __rev() argument
204 return (((uint64_t)__rev16(__t >> 32)) << 32) | __rev16(__t); in __rev16ll()
218 __revsh(int16_t __t) { in __revsh() argument
224 __rbit(uint32_t __t) { in __rbit() argument
241 return __rbit(__t); in __rbitl()
302 __qdbl(int32_t __t) { in __qdbl() argument
[all …]
/llvm-project-15.0.7/libcxx/src/support/win32/
H A Dthread_win32.cpp192 bool __libcpp_thread_isnull(const __libcpp_thread_t *__t) { in __libcpp_thread_isnull() argument
193 return *__t == 0; in __libcpp_thread_isnull()
203 *__t = reinterpret_cast<HANDLE>(_beginthreadex(nullptr, 0, in __libcpp_thread_create()
207 if (*__t) in __libcpp_thread_create()
217 __libcpp_thread_id __libcpp_thread_get_id(const __libcpp_thread_t *__t) in __libcpp_thread_get_id() argument
219 return GetThreadId(*__t); in __libcpp_thread_get_id()
222 int __libcpp_thread_join(__libcpp_thread_t *__t) in __libcpp_thread_join() argument
224 if (WaitForSingleObjectEx(*__t, INFINITE, FALSE) == WAIT_FAILED) in __libcpp_thread_join()
226 if (!CloseHandle(*__t)) in __libcpp_thread_join()
231 int __libcpp_thread_detach(__libcpp_thread_t *__t) in __libcpp_thread_detach() argument
[all …]

123456