partial_order.h 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. #ifndef _LIBCPP___COMPARE_PARTIAL_ORDER
  9. #define _LIBCPP___COMPARE_PARTIAL_ORDER
  10. #include <__compare/compare_three_way.h>
  11. #include <__compare/ordering.h>
  12. #include <__compare/weak_order.h>
  13. #include <__config>
  14. #include <__type_traits/decay.h>
  15. #include <__type_traits/is_same.h>
  16. #include <__utility/forward.h>
  17. #include <__utility/priority_tag.h>
  18. #ifndef _LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER
  19. # pragma GCC system_header
  20. #endif
  21. _LIBCPP_BEGIN_NAMESPACE_STD
  22. #if _LIBCPP_STD_VER >= 20
  23. // [cmp.alg]
  24. namespace __partial_order {
  25. struct __fn {
  26. // NOLINTBEGIN(libcpp-robust-against-adl) partial_order should use ADL, but only here
  27. template <class _Tp, class _Up>
  28. requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
  29. _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<2>) noexcept(
  30. noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
  31. -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
  32. return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
  33. }
  34. // NOLINTEND(libcpp-robust-against-adl)
  35. template <class _Tp, class _Up>
  36. requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
  37. _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<1>) noexcept(
  38. noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
  39. -> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
  40. return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
  41. }
  42. template <class _Tp, class _Up>
  43. requires is_same_v<decay_t<_Tp>, decay_t<_Up>>
  44. _LIBCPP_HIDE_FROM_ABI static constexpr auto __go(_Tp&& __t, _Up&& __u, __priority_tag<0>) noexcept(
  45. noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
  46. -> decltype(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
  47. return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
  48. }
  49. template <class _Tp, class _Up>
  50. _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t, _Up&& __u) const
  51. noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
  52. -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) {
  53. return __go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>());
  54. }
  55. };
  56. } // namespace __partial_order
  57. inline namespace __cpo {
  58. inline constexpr auto partial_order = __partial_order::__fn{};
  59. } // namespace __cpo
  60. #endif // _LIBCPP_STD_VER >= 20
  61. _LIBCPP_END_NAMESPACE_STD
  62. #endif // _LIBCPP___COMPARE_PARTIAL_ORDER