1*4bdff4beSrobert //===----------------------------------------------------------------------===// 2*4bdff4beSrobert // 3*4bdff4beSrobert // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*4bdff4beSrobert // See https://llvm.org/LICENSE.txt for license information. 5*4bdff4beSrobert // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*4bdff4beSrobert // 7*4bdff4beSrobert //===----------------------------------------------------------------------===// 8*4bdff4beSrobert 9*4bdff4beSrobert #ifndef _LIBCPP___COMPARE_STRONG_ORDER 10*4bdff4beSrobert #define _LIBCPP___COMPARE_STRONG_ORDER 11*4bdff4beSrobert 12*4bdff4beSrobert #include <__bit/bit_cast.h> 13*4bdff4beSrobert #include <__compare/compare_three_way.h> 14*4bdff4beSrobert #include <__compare/ordering.h> 15*4bdff4beSrobert #include <__config> 16*4bdff4beSrobert #include <__type_traits/conditional.h> 17*4bdff4beSrobert #include <__type_traits/decay.h> 18*4bdff4beSrobert #include <__utility/forward.h> 19*4bdff4beSrobert #include <__utility/priority_tag.h> 20*4bdff4beSrobert #include <cmath> 21*4bdff4beSrobert #include <cstdint> 22*4bdff4beSrobert #include <limits> 23*4bdff4beSrobert 24*4bdff4beSrobert #ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER 25*4bdff4beSrobert # pragma GCC system_header 26*4bdff4beSrobert #endif 27*4bdff4beSrobert 28*4bdff4beSrobert _LIBCPP_PUSH_MACROS 29*4bdff4beSrobert #include <__undef_macros> 30*4bdff4beSrobert 31*4bdff4beSrobert _LIBCPP_BEGIN_NAMESPACE_STD 32*4bdff4beSrobert 33*4bdff4beSrobert #if _LIBCPP_STD_VER > 17 34*4bdff4beSrobert 35*4bdff4beSrobert // [cmp.alg] 36*4bdff4beSrobert namespace __strong_order { 37*4bdff4beSrobert struct __fn { 38*4bdff4beSrobert // NOLINTBEGIN(libcpp-robust-against-adl) strong_order should use ADL, but only here 39*4bdff4beSrobert template<class _Tp, class _Up> 40*4bdff4beSrobert requires is_same_v<decay_t<_Tp>, decay_t<_Up>> 41*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI static constexpr auto 42*4bdff4beSrobert __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) 43*4bdff4beSrobert noexcept(noexcept(strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))) 44*4bdff4beSrobert -> decltype( strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))) 45*4bdff4beSrobert { return strong_ordering(strong_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); } 46*4bdff4beSrobert // NOLINTEND(libcpp-robust-against-adl) 47*4bdff4beSrobert 48*4bdff4beSrobert template<class _Tp, class _Up, class _Dp = decay_t<_Tp>> 49*4bdff4beSrobert requires is_same_v<_Dp, decay_t<_Up>> && is_floating_point_v<_Dp> 50*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go__fn51*4bdff4beSrobert __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept 52*4bdff4beSrobert { 53*4bdff4beSrobert if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int32_t)) { 54*4bdff4beSrobert int32_t __rx = _VSTD::bit_cast<int32_t>(__t); 55*4bdff4beSrobert int32_t __ry = _VSTD::bit_cast<int32_t>(__u); 56*4bdff4beSrobert __rx = (__rx < 0) ? (numeric_limits<int32_t>::min() - __rx - 1) : __rx; 57*4bdff4beSrobert __ry = (__ry < 0) ? (numeric_limits<int32_t>::min() - __ry - 1) : __ry; 58*4bdff4beSrobert return (__rx <=> __ry); 59*4bdff4beSrobert } else if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int64_t)) { 60*4bdff4beSrobert int64_t __rx = _VSTD::bit_cast<int64_t>(__t); 61*4bdff4beSrobert int64_t __ry = _VSTD::bit_cast<int64_t>(__u); 62*4bdff4beSrobert __rx = (__rx < 0) ? (numeric_limits<int64_t>::min() - __rx - 1) : __rx; 63*4bdff4beSrobert __ry = (__ry < 0) ? (numeric_limits<int64_t>::min() - __ry - 1) : __ry; 64*4bdff4beSrobert return (__rx <=> __ry); 65*4bdff4beSrobert } else if (__t < __u) { 66*4bdff4beSrobert return strong_ordering::less; 67*4bdff4beSrobert } else if (__t > __u) { 68*4bdff4beSrobert return strong_ordering::greater; 69*4bdff4beSrobert } else if (__t == __u) { 70*4bdff4beSrobert if constexpr (numeric_limits<_Dp>::radix == 2) { 71*4bdff4beSrobert return _VSTD::signbit(__u) <=> _VSTD::signbit(__t); 72*4bdff4beSrobert } else { 73*4bdff4beSrobert // This is bullet 3 of the IEEE754 algorithm, relevant 74*4bdff4beSrobert // only for decimal floating-point; 75*4bdff4beSrobert // see https://stackoverflow.com/questions/69068075/ 76*4bdff4beSrobert if (__t == 0 || _VSTD::isinf(__t)) { 77*4bdff4beSrobert return _VSTD::signbit(__u) <=> _VSTD::signbit(__t); 78*4bdff4beSrobert } else { 79*4bdff4beSrobert int __texp, __uexp; 80*4bdff4beSrobert (void)_VSTD::frexp(__t, &__texp); 81*4bdff4beSrobert (void)_VSTD::frexp(__u, &__uexp); 82*4bdff4beSrobert return (__t < 0) ? (__texp <=> __uexp) : (__uexp <=> __texp); 83*4bdff4beSrobert } 84*4bdff4beSrobert } 85*4bdff4beSrobert } else { 86*4bdff4beSrobert // They're unordered, so one of them must be a NAN. 87*4bdff4beSrobert // The order is -QNAN, -SNAN, numbers, +SNAN, +QNAN. 88*4bdff4beSrobert bool __t_is_nan = _VSTD::isnan(__t); 89*4bdff4beSrobert bool __u_is_nan = _VSTD::isnan(__u); 90*4bdff4beSrobert bool __t_is_negative = _VSTD::signbit(__t); 91*4bdff4beSrobert bool __u_is_negative = _VSTD::signbit(__u); 92*4bdff4beSrobert using _IntType = conditional_t< 93*4bdff4beSrobert sizeof(__t) == sizeof(int32_t), int32_t, conditional_t< 94*4bdff4beSrobert sizeof(__t) == sizeof(int64_t), int64_t, void> 95*4bdff4beSrobert >; 96*4bdff4beSrobert if constexpr (is_same_v<_IntType, void>) { 97*4bdff4beSrobert static_assert(sizeof(_Dp) == 0, "std::strong_order is unimplemented for this floating-point type"); 98*4bdff4beSrobert } else if (__t_is_nan && __u_is_nan) { 99*4bdff4beSrobert // Order by sign bit, then by "payload bits" (we'll just use bit_cast). 100*4bdff4beSrobert if (__t_is_negative != __u_is_negative) { 101*4bdff4beSrobert return (__u_is_negative <=> __t_is_negative); 102*4bdff4beSrobert } else { 103*4bdff4beSrobert return _VSTD::bit_cast<_IntType>(__t) <=> _VSTD::bit_cast<_IntType>(__u); 104*4bdff4beSrobert } 105*4bdff4beSrobert } else if (__t_is_nan) { 106*4bdff4beSrobert return __t_is_negative ? strong_ordering::less : strong_ordering::greater; 107*4bdff4beSrobert } else { 108*4bdff4beSrobert return __u_is_negative ? strong_ordering::greater : strong_ordering::less; 109*4bdff4beSrobert } 110*4bdff4beSrobert } 111*4bdff4beSrobert } 112*4bdff4beSrobert 113*4bdff4beSrobert template<class _Tp, class _Up> 114*4bdff4beSrobert requires is_same_v<decay_t<_Tp>, decay_t<_Up>> 115*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI static constexpr auto 116*4bdff4beSrobert __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) 117*4bdff4beSrobert noexcept(noexcept(strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))) 118*4bdff4beSrobert -> decltype( strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))) 119*4bdff4beSrobert { return strong_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); } 120*4bdff4beSrobert 121*4bdff4beSrobert template<class _Tp, class _Up> 122*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const 123*4bdff4beSrobert noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()))) 124*4bdff4beSrobert -> decltype( __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>())) 125*4bdff4beSrobert { return __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()); } 126*4bdff4beSrobert }; 127*4bdff4beSrobert } // namespace __strong_order 128*4bdff4beSrobert 129*4bdff4beSrobert inline namespace __cpo { 130*4bdff4beSrobert inline constexpr auto strong_order = __strong_order::__fn{}; 131*4bdff4beSrobert } // namespace __cpo 132*4bdff4beSrobert 133*4bdff4beSrobert #endif // _LIBCPP_STD_VER > 17 134*4bdff4beSrobert 135*4bdff4beSrobert _LIBCPP_END_NAMESPACE_STD 136*4bdff4beSrobert 137*4bdff4beSrobert _LIBCPP_POP_MACROS 138*4bdff4beSrobert 139*4bdff4beSrobert #endif // _LIBCPP___COMPARE_STRONG_ORDER 140