
Only the [cmp.alg] part (for `comparison_meow_fallback` CPOs) in the paper required changes. Other parts merely fixed preconditions of some standard library functions. I strongly feel that P2167R3 should be a DR despite that it is not a DR officially: CPOs -> C++20; remain parts -> C++98/11 (except that _`boolean-testable`_ should be transformed into the original _BooleanTestable_ requirements in the old resolution of LWG2114). Note that P2167R3 damaged the resolution of LWG3465: the type of `F < E` was left underconstrained. I've tried to submit an LWG issue for this, which is now LWG4157. Drive-by change: - enable some test coverages in `compare_strong_order_fallback.pass.cpp` when `TEST_LONG_DOUBLE_IS_DOUBLE`, following up #106742 Closes #105241.
73 lines
2.9 KiB
C++
73 lines
2.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
|
|
#define _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
|
|
|
|
#include <__compare/ordering.h>
|
|
#include <__compare/strong_order.h>
|
|
#include <__concepts/boolean_testable.h>
|
|
#include <__config>
|
|
#include <__type_traits/decay.h>
|
|
#include <__type_traits/is_same.h>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/priority_tag.h>
|
|
|
|
#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
// [cmp.alg]
|
|
namespace __compare_strong_order_fallback {
|
|
struct __fn {
|
|
template <class _Tp, class _Up>
|
|
requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
|
|
_LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
|
|
noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
|
|
-> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
|
|
return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
|
|
}
|
|
|
|
template <class _Tp, class _Up>
|
|
requires is_same_v<decay_t<_Tp>, decay_t<_Up>> && requires(_Tp&& __t, _Up&& __u) {
|
|
{ std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable;
|
|
{ std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable;
|
|
}
|
|
_LIBCPP_HIDE_FROM_ABI static constexpr strong_ordering __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(
|
|
noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
|
|
: std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? strong_ordering::less
|
|
: strong_ordering::greater)) {
|
|
return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
|
|
: std::forward<_Tp>(__t) < std::forward<_Up>(__u)
|
|
? strong_ordering::less
|
|
: strong_ordering::greater;
|
|
}
|
|
|
|
template <class _Tp, class _Up>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
|
|
noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())))
|
|
-> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())) {
|
|
return __go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>());
|
|
}
|
|
};
|
|
} // namespace __compare_strong_order_fallback
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto compare_strong_order_fallback = __compare_strong_order_fallback::__fn{};
|
|
} // namespace __cpo
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___COMPARE_COMPARE_STRONG_ORDER_FALLBACK
|