Home
last modified time | relevance | path

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

12345678

/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Daccess.h44 concept __member_begin = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
45 { _LIBCPP_AUTO_CAST(__t.begin()) } -> input_or_output_iterator; in requires()
52 …er_begin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
53 { _LIBCPP_AUTO_CAST(begin(__t)) } -> input_or_output_iterator;
58 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[]) const noexcept in operator()
61 return __t + 0; in operator()
65 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[_Np]) const noexcept in operator()
68 return __t + 0; in operator()
73 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
74 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.begin()))) { in operator()
[all …]
H A Drend.h40 concept __member_rend = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
41 ranges::rbegin(__t); in requires()
42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires()
49 …ber_rend<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
50 ranges::rbegin(__t);
51 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
55 …rse = __can_borrow<_Tp> && !__member_rend<_Tp> && !__unqualified_rend<_Tp> && requires(_Tp&& __t) {
56 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
57 { ranges::begin(__t) } -> bidirectional_iterator;
64 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
[all …]
H A Dsize.h51 concept __member_size = __size_enabled<_Tp> && requires(_Tp&& __t) { in requires() argument
52 { _LIBCPP_AUTO_CAST(__t.size()) } -> __integer_like; in requires()
57 …nabled<_Tp> && !__member_size<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
58 { _LIBCPP_AUTO_CAST(size(__t)) } -> __integer_like;
63 …e<_Tp> && !__unqualified_size<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
64 { ranges::begin(__t) } -> forward_iterator;
65 { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>;
83 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr __integer_like auto operator()(_Tp&& __t) const in operator()
84 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.size()))) { in operator()
85 return _LIBCPP_AUTO_CAST(__t.size()); in operator()
[all …]
H A Drbegin.h39 concept __member_rbegin = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
40 { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator; in requires()
47 …r_rbegin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) {
48 { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator;
53 … __can_borrow<_Tp> && !__member_rbegin<_Tp> && !__unqualified_rbegin<_Tp> && requires(_Tp&& __t) {
54 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
55 { ranges::begin(__t) } -> bidirectional_iterator;
61 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
62 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.rbegin()))) { in operator()
63 return _LIBCPP_AUTO_CAST(__t.rbegin()); in operator()
[all …]
H A Dempty.h32 concept __member_empty = requires(_Tp&& __t) { bool(__t.empty()); }; in requires() argument
35 concept __can_invoke_size = !__member_empty<_Tp> && requires(_Tp&& __t) { ranges::size(__t); };
38 … __can_compare_begin_end = !__member_empty<_Tp> && !__can_invoke_size<_Tp> && requires(_Tp&& __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()
[all …]
H A Ddata.h43 concept __member_data = __can_borrow<_Tp> && requires(_Tp&& __t) { in requires() argument
44 { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object; in requires()
48 concept __ranges_begin_invocable = !__member_data<_Tp> && __can_borrow<_Tp> && requires(_Tp&& __t) {
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()
78 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const
[all …]
H A Dall.h42 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(
43 …noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t)))) -> decltype(_LIBCPP_AUTO_CAST(std::forward<_T…
44 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
48 …quires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__… in requires()
49 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
50 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { in operator()
51 return ranges::ref_view{std::forward<_Tp>(__t)};
56 …!ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } …
57 requires(_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
58 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const in operator()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__bit/
H A Dcountr.h28 [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR int __countr_zero_impl(_Tp __t) _NOEXCEPT… in __countr_zero_impl() argument
29 _LIBCPP_ASSERT_INTERNAL(__t != 0, "__countr_zero_impl called with zero value"); in __countr_zero_impl()
32 return __builtin_ctz(static_cast<unsigned int>(__t)); in __countr_zero_impl()
34 return __builtin_ctzl(static_cast<unsigned long>(__t)); in __countr_zero_impl()
36 return __builtin_ctzll(static_cast<unsigned long long>(__t)); in __countr_zero_impl()
39 unsigned long long __ull = static_cast<unsigned long long>(__t); in __countr_zero_impl()
41 …return __ull == 0ull ? __ulldigits + std::__countr_zero_impl<_Tp>(__t >> __ulldigits) : __builtin_… in __countr_zero_impl()
45 while (static_cast<unsigned long long>(__t) == 0uLL) { in __countr_zero_impl()
47 __t >>= __ulldigits; in __countr_zero_impl()
49 return __ret + __builtin_ctzll(static_cast<unsigned long long>(__t)); in __countr_zero_impl()
[all …]
H A Dpopcount.h26 [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR int __popcount_impl(_Tp __t) _NOEXCEPT { in __popcount_impl() argument
28 return __builtin_popcount(static_cast<unsigned int>(__t)); in __popcount_impl()
30 return __builtin_popcountl(static_cast<unsigned long>(__t)); in __popcount_impl()
32 return __builtin_popcountll(static_cast<unsigned long long>(__t)); in __popcount_impl()
35 return __t != 0 ? __builtin_popcountll(static_cast<unsigned long long>(__t)) + in __popcount_impl()
36 … std::__popcount_impl<_Tp>(__t >> numeric_limits<unsigned long long>::digits) in __popcount_impl()
40 while (__t != 0) { in __popcount_impl()
41 __ret += __builtin_popcountll(static_cast<unsigned long long>(__t)); in __popcount_impl()
42 __t >>= std::numeric_limits<unsigned long long>::digits; in __popcount_impl()
50 [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR int __popcount(_Tp __t) _NOEXCEPT { in __popcount() argument
[all …]
H A Dcountl.h27 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int __countl_zero(_Tp __t) _NOEXCEPT { in __countl_zero() argument
30 return __builtin_clzg(__t, numeric_limits<_Tp>::digits); in __countl_zero()
32 if (__t == 0) in __countl_zero()
36 return __builtin_clz(static_cast<unsigned int>(__t)) - in __countl_zero()
39 return __builtin_clzl(static_cast<unsigned long>(__t)) - in __countl_zero()
42 return __builtin_clzll(static_cast<unsigned long long>(__t)) - in __countl_zero()
49 __t = std::__rotl(__t, __ulldigits); in __countl_zero()
50 if ((__iter = std::__countl_zero(static_cast<unsigned long long>(__t))) != __ulldigits) in __countl_zero()
62 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr int countl_zero(_Tp __t) noexcept { in countl_zero() argument
63 return std::__countl_zero(__t); in countl_zero()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dstrong_order.h46 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
47 noexcept(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 -> decltype(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
49 return strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
55 …_LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<1… in __go()
57 int32_t __rx = std::bit_cast<int32_t>(__t); in __go()
63 int64_t __rx = std::bit_cast<int64_t>(__t); in __go()
68 } else if (__t < __u) { in __go()
70 } else if (__t > __u) { in __go()
72 } else if (__t == __u) { in __go()
[all …]
H A Dcompare_partial_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
44 { std::forward<_Up>(__u) < std::forward<_Tp>(__t) } -> __boolean_testable; in requires()
46 …_LIBCPP_HIDE_FROM_ABI static constexpr partial_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<… in __go()
47 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent in __go()
[all …]
H A Dweak_order.h39 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<3>) noexcept(
40 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
41 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
42 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
48 …_LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<2>)… in __go()
49 partial_ordering __po = (__t <=> __u); in __go()
58 bool __t_is_nan = __math::isnan(__t); in __go()
60 bool __t_is_negative = __math::signbit(__t); in __go()
74 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
75 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
[all …]
H A Dcompare_strong_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
45 …_LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<0… in __go()
46 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? strong_ordering::less in __go()
[all …]
H A Dcompare_weak_order_fallback.h34 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
35 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
41 requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) { in requires()
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
45 …_LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<0>)… in __go()
46 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) in __go()
[all …]
H A Dpartial_order.h37 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
38 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
39 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
40 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
46 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
47 … noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 …-> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))))…
49 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
54 …_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(
55 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
[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()
40 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_not_equal(_Tp __t, _Up __u) noexcept { in cmp_not_equal() argument
41 return !std::cmp_equal(__t, __u); in cmp_not_equal()
45 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_less(_Tp __t, _Up __u) noexcept { in cmp_less() argument
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()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h54 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
55 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u))) //
56 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) {
57 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
80 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
81 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u))) //
82 -> decltype(std::forward<_T1>(__t) - std::forward<_T2>(__u)) {
83 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
106 _LIBCPP_CONSTEXPR_SINCE_CXX14 _LIBCPP_HIDE_FROM_ABI auto operator()(_T1&& __t, _T2&& __u) const
107 noexcept(noexcept(std::forward<_T1>(__t) * std::forward<_T2>(__u))) //
[all …]
H A Dranges_operations.h32 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
33 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
34 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
43 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
44 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
45 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
54 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
55 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
56 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
65 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t, _Up&& __u) const in operator()
[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);
49 *__result = __t;
52 __t in partial_sum()
[all...]
H A Dgcd_lcm.h41 constexpr _LIBCPP_HIDE_FROM_ABI _Result operator()(_Source __t) const noexcept {
42 if (__t >= 0)
43 return __t;
44 if (__t == numeric_limits<_Source>::min())
45 return -static_cast<_Result>(__t);
46 return -__t;
52 constexpr _LIBCPP_HIDE_FROM_ABI _Result operator()(_Source __t) const noexcept { return __t; }
85 _Tp __t = __b >> std::__countr_zero(__b);
86 if (__a > __t) {
87 __b = __a - __t;
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h49 requires(_Tp&& __t, _Up&& __u) { in requires() argument
50 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
61 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
62 __swap(__t[0], __u[0]);
75 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp&& __t, _Up&& __u) const in operator()
76 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator()
77 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
83 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp (&__t)[_Size], _Up (&__u)[_Size]) const in operator()
84 noexcept(noexcept((*this)(*__t, *__u))) { in operator()
87 (*this)(__t[__i], __u[__i]); in operator()
[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/__cxx03/__numeric/
H A Dpartial_sum.h30 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
31 *__result = __t; in partial_sum()
33 __t = __t + *__first; in partial_sum()
34 *__result = __t; in partial_sum()
44 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
45 *__result = __t; in partial_sum()
47 __t = __binary_op(__t, *__first); in partial_sum()
48 *__result = __t; in partial_sum()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__bit/
H A Dcountr.h39 _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI int __countr_zero(_Tp __t) _NOEXCEPT { in __countr_zero() argument
41 return __builtin_ctzg(__t, numeric_limits<_Tp>::digits); in __countr_zero()
43 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()

12345678