mirror of
https://github.com/llvm/llvm-project.git
synced 2025-04-28 09:16:05 +00:00
368faacac7
This commit reverts 5aaefa51 (and also partly 7f285f48e77 and b6d75682f9, which were related to the original commit). As landed, 5aaefa51 had unintended consequences on some downstream bots and didn't have proper coverage upstream due to a few subtle things. Implementing this is something we should do in libc++, however we'll first need to address a few issues listed in https://reviews.llvm.org/D106124#3349710. Differential Revision: https://reviews.llvm.org/D120683
72 lines
3.2 KiB
C++
72 lines
3.2 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_PARTIAL_ORDER
|
|
#define _LIBCPP___COMPARE_PARTIAL_ORDER
|
|
|
|
#include <__compare/compare_three_way.h>
|
|
#include <__compare/ordering.h>
|
|
#include <__compare/weak_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 !defined(_LIBCPP_HAS_NO_CONCEPTS)
|
|
|
|
// [cmp.alg]
|
|
namespace __partial_order {
|
|
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<2>)
|
|
noexcept(noexcept(partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
|
|
-> decltype( partial_ordering(partial_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
|
|
{ return partial_ordering(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<1>)
|
|
noexcept(noexcept(partial_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
|
|
-> decltype( partial_ordering(compare_three_way()(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
|
|
{ return partial_ordering(compare_three_way()(_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(partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u)))))
|
|
-> decltype( partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))))
|
|
{ return partial_ordering(_VSTD::weak_order(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u))); }
|
|
|
|
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<2>())))
|
|
-> decltype( __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()))
|
|
{ return __go(_VSTD::forward<_Tp>(__t), _VSTD::forward<_Up>(__u), __priority_tag<2>()); }
|
|
};
|
|
} // namespace __partial_order
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto partial_order = __partial_order::__fn{};
|
|
} // namespace __cpo
|
|
|
|
#endif // !defined(_LIBCPP_HAS_NO_CONCEPTS)
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___COMPARE_PARTIAL_ORDER
|