bf20a09790
The tests for these are just copy-pasted from the tests for std::{strong,weak,partial}_order,
and then I added an extra clause in each (test_2()) to test the stuff that's not just the same
as std::*_order.
This also includes the fix for https://wg21.link/LWG3465 (which falls naturally out of the
"you must write it three times" style, but I've added test cases for it also).
There is an action item here to go back and give good diagnostics for SFINAE failures
in these CPOs. I've filed this as https://github.com/llvm/llvm-project/issues/53456 .
Differential Revision: https://reviews.llvm.org/D111514
74 lines
3.6 KiB
C++
74 lines
3.6 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_PARTIAL_ORDER_FALLBACK
|
|
#define _LIBCPP___COMPARE_COMPARE_PARTIAL_ORDER_FALLBACK
|
|
|
|
#include <__compare/ordering.h>
|
|
#include <__compare/partial_order.h>
|
|
#include <__config>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/priority_tag.h>
|
|
#include <type_traits>
|
|
|
|
#ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_CONCEPTS)
|
|
|
|
// [cmp.alg]
|
|
namespace __compare_partial_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(_VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
|
|
-> decltype( _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))
|
|
{ return _VSTD::partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)); }
|
|
|
|
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<0>)
|
|
noexcept(noexcept(_VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
|
|
_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
|
|
_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
|
|
partial_ordering::unordered))
|
|
-> decltype( _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
|
|
_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
|
|
_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
|
|
partial_ordering::unordered)
|
|
{
|
|
return _VSTD::forward<_Tp>(__t) == _VSTD::forward<_Up>(__u) ? partial_ordering::equivalent :
|
|
_VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
|
|
_VSTD::forward<_Up>(__u) < _VSTD::forward<_Tp>(__t) ? partial_ordering::greater :
|
|
partial_ordering::unordered;
|
|
}
|
|
|
|
template<class _Tp, class _Up>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
|
|
noexcept(noexcept(__go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>())))
|
|
-> decltype( __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()))
|
|
{ return __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<1>()); }
|
|
};
|
|
} // namespace __compare_partial_order_fallback
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto compare_partial_order_fallback = __compare_partial_order_fallback::__fn{};
|
|
} // namespace __cpo
|
|
|
|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_CONCEPTS)
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___COMPARE_COMPARE_PARTIAL_ORDER_FALLBACK
|