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