Home
last modified time | relevance | path

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

123456

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Daccess.h62 return __t + 0; in operator()
69 return __t + 0; in operator()
76 return _LIBCPP_AUTO_CAST(__t.begin()); in operator()
82 noexcept(noexcept(_LIBCPP_AUTO_CAST(begin(__t)))) { in operator()
83 return _LIBCPP_AUTO_CAST(begin(__t)); in operator()
127 return __t + _Np; in operator()
133 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.end()))) { in operator()
134 return _LIBCPP_AUTO_CAST(__t.end()); in operator()
140 noexcept(noexcept(_LIBCPP_AUTO_CAST(end(__t)))) { in operator()
141 return _LIBCPP_AUTO_CAST(end(__t)); in operator()
[all …]
H A Drend.h41 ranges::rbegin(__t); in requires()
42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires()
51 ranges::rbegin(__t);
52 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
57 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
58 { ranges::begin(__t) } -> bidirectional_iterator;
67 return _LIBCPP_AUTO_CAST(__t.rend()); in operator()
73 noexcept(noexcept(_LIBCPP_AUTO_CAST(rend(__t)))) { in operator()
74 return _LIBCPP_AUTO_CAST(rend(__t)); in operator()
80 noexcept(noexcept(ranges::begin(__t))) { in operator()
[all …]
H A Dsize.h52 { _LIBCPP_AUTO_CAST(__t.size()) } -> __integer_like; in requires()
58 { _LIBCPP_AUTO_CAST(size(__t)) } -> __integer_like;
64 { ranges::begin(__t) } -> forward_iterator;
85 return _LIBCPP_AUTO_CAST(__t.size()); in operator()
92 return _LIBCPP_AUTO_CAST(size(__t)); in operator()
98 noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))))
99 -> decltype(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))) {
100 return std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t));
117 requires requires(_Tp&& __t) { ranges::size(__t); } in requires()
119 noexcept(noexcept(ranges::size(__t))) { in operator()
[all …]
H A Drbegin.h40 { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator; in requires()
49 { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator;
55 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
56 { ranges::begin(__t) } -> bidirectional_iterator;
63 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rbegin()))) { in operator()
64 return _LIBCPP_AUTO_CAST(__t.rbegin()); in operator()
70 noexcept(noexcept(_LIBCPP_AUTO_CAST(rbegin(__t)))) { in operator()
71 return _LIBCPP_AUTO_CAST(rbegin(__t)); in operator()
76 …_LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(noexcept(ranges::end(__t… in operator()
77 return std::make_reverse_iterator(ranges::end(__t)); in operator()
[all …]
H A Dempty.h32 concept __member_empty = __workaround_52970<_Tp> && requires(_Tp&& __t) { bool(__t.empty()); }; in requires() argument
35 concept __can_invoke_size = !__member_empty<_Tp> && requires(_Tp&& __t) { ranges::size(__t); };
39 bool(ranges::begin(__t) == ranges::end(__t));
40 { ranges::begin(__t) } -> forward_iterator;
45 …d]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(bool(__t.em… in operator()
46 return bool(__t.empty()); in operator()
50 …_LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(ranges::size(__… in operator()
51 return ranges::size(__t) == 0; in operator()
55 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const in operator()
56 noexcept(noexcept(bool(ranges::begin(__t) == ranges::end(__t)))) { in operator()
[all …]
H A Ddata.h44 { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object; in requires()
49 { ranges::begin(__t) } -> contiguous_iterator;
54 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(noexcept(__t.data())) { in operator()
55 return __t.data(); in operator()
59 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
60 noexcept(noexcept(std::to_address(ranges::begin(__t)))) { in operator()
61 return std::to_address(ranges::begin(__t)); in operator()
81 return ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t));
87 noexcept(noexcept(ranges::data(static_cast<const _Tp&&>(__t))))
88 -> decltype(ranges::data(static_cast<const _Tp&&>(__t))) {
[all …]
H A Dall.h42 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
43 noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t))))
44 -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t))) {
45 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
49 …quires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__… in requires()
51 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { in operator()
52 return ranges::ref_view{std::forward<_Tp>(__t)};
57 …!ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } …
58 requires(_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
60 noexcept(noexcept(ranges::owning_view{std::forward<_Tp>(__t)})) { in operator()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dstrong_order.h52 int32_t __rx = std::bit_cast<int32_t>(__t); in __go()
58 int64_t __rx = std::bit_cast<int64_t>(__t); in __go()
63 } else if (__t < __u) { in __go()
65 } else if (__t > __u) { in __go()
67 } else if (__t == __u) { in __go()
69 return std::signbit(__u) <=> std::signbit(__t); in __go()
74 if (__t == 0 || std::isinf(__t)) { in __go()
78 (void)std::frexp(__t, &__texp); in __go()
86 bool __t_is_nan = std::isnan(__t); in __go()
88 bool __t_is_negative = std::signbit(__t); in __go()
[all …]
H A Dweak_order.h36 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
45 partial_ordering __po = (__t <=> __u); in __go()
54 bool __t_is_nan = std::isnan(__t); in __go()
56 bool __t_is_negative = std::signbit(__t); in __go()
73 return weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
79 noexcept(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
81 return weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
85 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dcompare_partial_order_fallback.h34 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
44 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
49 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
53 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
54 : std::forward<_Up>(__u) < std::forward<_Tp>(__t)
60 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dpartial_order.h35 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
36 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
47 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
53 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
55 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
59 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
60 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
61 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) {
[all …]
H A Dcompare_strong_order_fallback.h34 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
57 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
H A Dcompare_weak_order_fallback.h34 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
36 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u)
57 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__utility/
H A Dcmp.h30 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_equal(_Tp __t, _Up __u) noexcept { in cmp_equal() argument
32 return __t == __u; in cmp_equal()
34 return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u; in cmp_equal()
36 return __u < 0 ? false : __t == make_unsigned_t<_Up>(__u); in cmp_equal()
41 return !std::cmp_equal(__t, __u); in cmp_not_equal()
47 return __t < __u; in cmp_less()
49 return __t < 0 ? true : make_unsigned_t<_Tp>(__t) < __u; in cmp_less()
51 return __u < 0 ? false : __t < make_unsigned_t<_Up>(__u); in cmp_less()
56 return std::cmp_less(__u, __t); in cmp_greater()
61 return !std::cmp_greater(__t, __u); in cmp_less_equal()
[all …]
/freebsd/contrib/llvm-project/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()
34 __t = std::move(__t) + *__first; in partial_sum()
36 __t = __t + *__first; in partial_sum()
38 *__result = __t; in partial_sum()
48 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
49 *__result = __t; in partial_sum()
52 __t = __binary_op(std::move(__t), *__first); in partial_sum()
54 __t = __binary_op(__t, *__first); in partial_sum()
56 *__result = __t; in partial_sum()
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h56 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
82 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
108 return std::forward<_T1>(__t) * std::forward<_T2>(__u);
134 return std::forward<_T1>(__t) / std::forward<_T2>(__u);
160 return std::forward<_T1>(__t) % std::forward<_T2>(__u);
211 return std::forward<_T1>(__t) & std::forward<_T2>(__u);
255 return std::forward<_T1>(__t) | std::forward<_T2>(__u);
281 return std::forward<_T1>(__t) ^ std::forward<_T2>(__u);
309 return std::forward<_T1>(__t) == std::forward<_T2>(__u);
370 return std::forward<_T1>(__t) < std::forward<_T2>(__u);
[all …]
H A Dranges_operations.h34 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
35 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
45 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
46 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
56 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
57 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
67 noexcept(noexcept(bool(!(std::forward<_Up>(__u) < std::forward<_Tp>(__t))))) { in operator()
68 return !(std::forward<_Up>(__u) < std::forward<_Tp>(__t)); in operator()
78 noexcept(noexcept(bool(std::forward<_Up>(__u) < std::forward<_Tp>(__t)))) { in operator()
79 return std::forward<_Up>(__u) < std::forward<_Tp>(__t); in operator()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__bit/
H A Drotate.h24 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp __rotr(_Tp __t, int __cnt) _NOEXCEPT { in __rotr() argument
28 return __t; in __rotr()
32 …return (__t << (__cnt % __dig)) | (__t >> (__dig - (__cnt % __dig))); // rotr with negative __cnt … in __rotr()
35 return (__t >> (__cnt % __dig)) | (__t << (__dig - (__cnt % __dig))); in __rotr()
39 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp __rotl(_Tp __t, int __cnt) _NOEXCEPT { in __rotl() argument
40 return std::__rotr(__t, -__cnt); in __rotl()
46 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Tp rotl(_Tp __t, int __cnt) noexcept { in rotl() argument
47 return std::__rotl(__t, __cnt); in rotl()
51 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Tp rotr(_Tp __t, int __cnt) noexcept { in rotr() argument
52 return std::__rotr(__t, __cnt); in rotr()
H A Dcountl.h56 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int __countl_zero(_Tp __t) _NOEXCEPT { in __countl_zero() argument
58 if (__t == 0) in __countl_zero()
62 return std::__libcpp_clz(static_cast<unsigned int>(__t)) - in __countl_zero()
65 return std::__libcpp_clz(static_cast<unsigned long>(__t)) - in __countl_zero()
68 return std::__libcpp_clz(static_cast<unsigned long long>(__t)) - in __countl_zero()
75 __t = std::__rotl(__t, __ulldigits); in __countl_zero()
76 if ((__iter = std::__countl_zero(static_cast<unsigned long long>(__t))) != __ulldigits) in __countl_zero()
87 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countl_zero(_Tp __t) noexcept { in countl_zero() argument
88 return std::__countl_zero(__t); in countl_zero()
92 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countl_one(_Tp __t) noexcept { in countl_one() argument
[all …]
H A Dcountr.h41 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countr_zero(_Tp __t) noexcept { in countr_zero() argument
42 if (__t == 0) in countr_zero()
46 return std::__libcpp_ctz(static_cast<unsigned int>(__t)); in countr_zero()
48 return std::__libcpp_ctz(static_cast<unsigned long>(__t)); in countr_zero()
50 return std::__libcpp_ctz(static_cast<unsigned long long>(__t)); in countr_zero()
54 while (static_cast<unsigned long long>(__t) == 0uLL) { in countr_zero()
56 __t >>= __ulldigits; in countr_zero()
58 return __ret + std::__libcpp_ctz(static_cast<unsigned long long>(__t)); in countr_zero()
63 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countr_one(_Tp __t) noexcept { in countr_one() argument
64 …return __t != numeric_limits<_Tp>::max() ? std::countr_zero(static_cast<_Tp>(~__t)) : numeric_limi… in countr_one()
H A Dpopcount.h41 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int popcount(_Tp __t) noexcept { in popcount() argument
43 return std::__libcpp_popcount(static_cast<unsigned int>(__t)); in popcount()
45 return std::__libcpp_popcount(static_cast<unsigned long>(__t)); in popcount()
47 return std::__libcpp_popcount(static_cast<unsigned long long>(__t)); in popcount()
50 while (__t != 0) { in popcount()
51 __ret += std::__libcpp_popcount(static_cast<unsigned long long>(__t)); in popcount()
52 __t >>= numeric_limits<unsigned long long>::digits; in popcount()
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h50 requires(_Tp&& __t, _Up&& __u) { in requires() argument
51 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
62 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
63 __swap(__t[0], __u[0]);
76 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp&& __t, _Up&& __u) const in operator()
78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
85 noexcept(noexcept((*this)(*__t, *__u))) { in operator()
88 (*this)(__t[__i], __u[__i]); in operator()
111 ranges::swap(std::forward<_Tp>(__t), std::forward<_Tp>(__t)); in requires()
113 ranges::swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
[all …]
H A Dtotally_ordered.h29 concept __partially_ordered_with = requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_r… 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()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Diter_move.h41 concept __unqualified_iter_move = __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { in requires() argument
43 iter_move(std::forward<_Tp>(__t)); in requires()
47 concept __move_deref = !__unqualified_iter_move<_Tp> && requires(_Tp&& __t) {
48 *__t;
49 requires is_lvalue_reference_v<decltype(*__t)>;
53 concept __just_deref = !__unqualified_iter_move<_Tp> && !__move_deref<_Tp> && requires(_Tp&& __t) {
54 *__t;
55 requires(!is_lvalue_reference_v<decltype(*__t)>);
92 requires requires(_Tp& __t) { in requires() argument
93 { ranges::iter_move(__t) } -> __can_reference; in requires()
/freebsd/contrib/llvm-project/libcxx/include/__exception/
H A Dnested_exception.h47 _LIBCPP_HIDE_FROM_ABI explicit __nested(const _Tp& __t) : _Tp(__t) {} in __nested()
56 _LIBCPP_NORETURN static inline _LIBCPP_HIDE_FROM_ABI void __do_throw(_Tp&& __t) {
57 throw __nested<_Up>(std::forward<_Tp>(__t));
63 …RN static inline _LIBCPP_HIDE_FROM_ABI void __do_throw(_Tp&& __t) { throw std::forward<_Tp>(__t); }
68 _LIBCPP_NORETURN _LIBCPP_HIDE_FROM_ABI void throw_with_nested(_Tp&& __t) {
75 !__libcpp_is_final<_Up>::value>::__do_throw(std::forward<_Tp>(__t));
77 ((void)__t);

123456