/freebsd-current/contrib/llvm-project/libcxx/include/__bit/ |
H A D | has_single_bit.h | 27 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr bool has_single_bit(_Tp __t) noexcept { 28 return __t != 0 && (((__t & (__t - 1)) == 0));
|
H A D | bit_floor.h | 26 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr _Tp bit_floor(_Tp __t) noexcept { 27 return __t == 0 ? 0 : _Tp{1} << std::__bit_log2(__t);
|
H A D | bit_width.h | 25 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int bit_width(_Tp __t) noexcept { 26 return __t == 0 ? 0 : std::__bit_log2(__t) + 1;
|
H A D | rotate.h | 24 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp __rotr(_Tp __t, int __cnt) _NOEXCEPT { 28 return __t; 32 return (__t << (__cnt % __dig)) | (__t >> (__dig - (__cnt % __dig))); // rotr with negative __cnt is similar to rotl 35 return (__t >> (__cnt % __dig)) | (__t << (__dig - (__cnt % __dig))); 39 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp __rotl(_Tp __t, int __cnt) _NOEXCEPT { 40 return std::__rotr(__t, -__cnt); 46 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr _Tp rotl(_Tp __t, int __cnt) noexcept { 47 return std::__rotl(__t, __cn [all...] |
H A D | countr.h | 41 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countr_zero(_Tp __t) noexcept { 42 if (__t == 0) 46 return std::__libcpp_ctz(static_cast<unsigned int>(__t)); 48 return std::__libcpp_ctz(static_cast<unsigned long>(__t)); 50 return std::__libcpp_ctz(static_cast<unsigned long long>(__t)); 54 while (static_cast<unsigned long long>(__t) == 0uLL) { 56 __t >>= __ulldigits; 58 return __ret + std::__libcpp_ctz(static_cast<unsigned long long>(__t)); 63 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countr_one(_Tp __t) noexcept { 64 return __t ! [all...] |
H A D | popcount.h | 41 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int popcount(_Tp __t) noexcept { 43 return std::__libcpp_popcount(static_cast<unsigned int>(__t)); 45 return std::__libcpp_popcount(static_cast<unsigned long>(__t)); 47 return std::__libcpp_popcount(static_cast<unsigned long long>(__t)); 50 while (__t != 0) { 51 __ret += std::__libcpp_popcount(static_cast<unsigned long long>(__t)); 52 __t >>= numeric_limits<unsigned long long>::digits;
|
H A D | countl.h | 56 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 int __countl_zero(_Tp __t) _NOEXCEPT { 58 if (__t == 0) 62 return std::__libcpp_clz(static_cast<unsigned int>(__t)) - 65 return std::__libcpp_clz(static_cast<unsigned long>(__t)) - 68 return std::__libcpp_clz(static_cast<unsigned long long>(__t)) - 75 __t = std::__rotl(__t, __ulldigits); 76 if ((__iter = std::__countl_zero(static_cast<unsigned long long>(__t))) != __ulldigits) 87 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr int countl_zero(_Tp __t) noexcept { 88 return std::__countl_zero(__t); [all...] |
H A D | bit_log2.h | 26 _LIBCPP_HIDE_FROM_ABI constexpr _Tp __bit_log2(_Tp __t) noexcept { 27 return numeric_limits<_Tp>::digits - 1 - std::countl_zero(__t);
|
/freebsd-current/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | empty.h | 32 concept __member_empty = __workaround_52970<_Tp> && requires(_Tp&& __t) { bool(__t.empty()); }; 35 concept __can_invoke_size = !__member_empty<_Tp> && requires(_Tp&& __t) { ranges::size(__t); }; 38 concept __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 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(bool(__t [all...] |
H A D | rend.h | 40 concept __member_rend = __can_borrow<_Tp> && __workaround_52970<_Tp> && requires(_Tp&& __t) { 41 ranges::rbegin(__t); 42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; 50 !__member_rend<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { 51 ranges::rbegin(__t); 52 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>; 56 concept __can_reverse = __can_borrow<_Tp> && !__member_rend<_Tp> && !__unqualified_rend<_Tp> && requires(_Tp&& __t) { 57 { ranges::begin(__t) } [all...] |
H A D | size.h | 51 concept __member_size = __size_enabled<_Tp> && __workaround_52970<_Tp> && requires(_Tp&& __t) { 52 { _LIBCPP_AUTO_CAST(__t.size()) } -> __integer_like; 57 __size_enabled<_Tp> && !__member_size<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { 58 { _LIBCPP_AUTO_CAST(size(__t)) } -> __integer_like; 63 !__member_size<_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 84 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t.size()))) { 85 return _LIBCPP_AUTO_CAST(__t 117 requires(_Tp&& __t) argument [all...] |
H A D | access.h | 44 concept __member_begin = __can_borrow<_Tp> && __workaround_52970<_Tp> && requires(_Tp&& __t) { 45 { _LIBCPP_AUTO_CAST(__t.begin()) } -> input_or_output_iterator; 53 !__member_begin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { 54 { _LIBCPP_AUTO_CAST(begin(__t)) } -> input_or_output_iterator; 59 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[]) const noexcept 62 return __t + 0; 66 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp (&__t)[_Np]) const noexcept 69 return __t + 0; 74 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const 75 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t [all...] |
H A D | data.h | 43 concept __member_data = __can_borrow<_Tp> && __workaround_52970<_Tp> && requires(_Tp&& __t) { 44 { _LIBCPP_AUTO_CAST(__t.data()) } -> __ptr_to_object; 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())) { 55 return __t.data(); 59 _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const 60 noexcept(noexcept(std::to_address(ranges::begin(__t)))) { 61 return std::to_address(ranges::begin(__t)); [all...] |
H A D | rbegin.h | 39 concept __member_rbegin = __can_borrow<_Tp> && __workaround_52970<_Tp> && requires(_Tp&& __t) { 40 { _LIBCPP_AUTO_CAST(__t.rbegin()) } -> input_or_output_iterator; 48 !__member_rbegin<_Tp> && __can_borrow<_Tp> && __class_or_enum<remove_cvref_t<_Tp>> && requires(_Tp&& __t) { 49 { _LIBCPP_AUTO_CAST(rbegin(__t)) } -> input_or_output_iterator; 54 __can_borrow<_Tp> && !__member_rbegin<_Tp> && !__unqualified_rbegin<_Tp> && requires(_Tp&& __t) { 55 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>; 56 { ranges::begin(__t) } -> bidirectional_iterator; 62 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const 63 noexcept(noexcept(_LIBCPP_AUTO_CAST(__t [all...] |
H A D | all.h | 42 [[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 requires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } argument 50 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const 51 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { 52 return ranges::ref_view{std::forward<_Tp>(__t)}; 57 !ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { range [all...] |
/freebsd-current/contrib/llvm-project/libcxx/include/__numeric/ |
H A D | partial_sum.h | 30 typename iterator_traits<_InputIterator>::value_type __t(*__first); 31 *__result = __t; 34 __t = std::move(__t) + *__first; 36 __t = __t + *__first; 38 *__result = __t; 48 typename iterator_traits<_InputIterator>::value_type __t(*__first); 49 *__result = __t; 52 __t [all...] |
/freebsd-current/contrib/llvm-project/libcxx/include/__utility/ |
H A D | cmp.h | 30 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_equal(_Tp __t, _Up __u) noexcept { 32 return __t == __u; 34 return __t < 0 ? false : make_unsigned_t<_Tp>(__t) == __u; 36 return __u < 0 ? false : __t == make_unsigned_t<_Up>(__u); 40 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_not_equal(_Tp __t, _Up __u) noexcept { 41 return !std::cmp_equal(__t, __u); 45 _LIBCPP_HIDE_FROM_ABI constexpr bool cmp_less(_Tp __t, _Up __u) noexcept { 47 return __t < __u; 49 return __t < [all...] |
H A D | forward.h | 25 forward(_LIBCPP_LIFETIMEBOUND __libcpp_remove_reference_t<_Tp>& __t) _NOEXCEPT { 26 return static_cast<_Tp&&>(__t); 31 forward(_LIBCPP_LIFETIMEBOUND __libcpp_remove_reference_t<_Tp>&& __t) _NOEXCEPT { 33 return static_cast<_Tp&&>(__t);
|
H A D | as_lvalue.h | 27 _LIBCPP_HIDE_FROM_ABI constexpr _Tp& __as_lvalue(_LIBCPP_LIFETIMEBOUND _Tp&& __t) { argument 28 return static_cast<_Tp&>(__t);
|
/freebsd-current/contrib/llvm-project/libcxx/include/__compare/ |
H A D | synth_three_way.h | 31 // []<class _Tp, class _Up>(const _Tp& __t, const _Up& __u) 33 _LIBCPP_HIDE_FROM_ABI constexpr auto __synth_three_way(const _Tp& __t, const _Up& __u) 35 { __t < __u } -> __boolean_testable; 36 { __u < __t } -> __boolean_testable; 40 return __t <=> __u; 42 if (__t < __u) 44 if (__u < __t)
|
H A D | compare_strong_order_fallback.h | 33 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept( 34 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)); 41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(noexcept( 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) [all...] |
H A D | compare_weak_order_fallback.h | 33 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept( 34 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)); 41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(noexcept( 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) [all...] |
H A D | weak_order.h | 35 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<3>) noexcept( 36 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))); 44 _LIBCPP_HIDE_FROM_ABI static constexpr weak_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept { 45 partial_ordering __po = (__t <=> __u); 54 bool __t_is_nan = std::isnan(__t); 56 bool __t_is_negative = std::signbit(__t); 70 _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept( 71 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), st [all...] |
/freebsd-current/contrib/llvm-project/libcxx/include/__concepts/ |
H A D | totally_ordered.h | 29 concept __partially_ordered_with = requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) { 30 { __t < __u } -> __boolean_testable; 31 { __t > __u } -> __boolean_testable; 32 { __t <= __u } -> __boolean_testable; 33 { __t >= __u } -> __boolean_testable; 34 { __u < __t } -> __boolean_testable; 35 { __u > __t } -> __boolean_testable; 36 { __u <= __t } -> __boolean_testable; 37 { __u >= __t } -> __boolean_testable;
|
H A D | equality_comparable.h | 30 requires(__make_const_lvalue_ref<_Tp> __t, __make_const_lvalue_ref<_Up> __u) { 31 { __t == __u } -> __boolean_testable; 32 { __t != __u } -> __boolean_testable; 33 { __u == __t } -> __boolean_testable; 34 { __u != __t } -> __boolean_testable;
|