Home
last modified time | relevance | path

Searched refs:partial_ordering (Results 1 – 12 of 12) sorted by relevance

/src/contrib/llvm-project/libcxx/include/__compare/
H A Dordering.h29 class partial_ordering; variable
39 …template <class _Tp, class = enable_if_t<!__one_of_v<_Tp, int, partial_ordering, weak_ordering, st…
43 class partial_ordering {
46 …_LIBCPP_HIDE_FROM_ABI explicit constexpr partial_ordering(_OrdResult __v) noexcept : __value_(_Val… in partial_ordering() function
48 …_LIBCPP_HIDE_FROM_ABI explicit constexpr partial_ordering(_NCmpResult __v) noexcept : __value_(_Va… in partial_ordering() function
56 static const partial_ordering less;
57 static const partial_ordering equivalent;
58 static const partial_ordering greater;
59 static const partial_ordering unordered;
62 …_LIBCPP_HIDE_FROM_ABI friend constexpr bool operator==(partial_ordering, partial_ordering) noexcep…
[all …]
H A Dcompare_partial_order_fallback.h42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
45 ? partial_ordering::greater
46 : partial_ordering::unordered))
47 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
48 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
50 ? partial_ordering::greater
51 : partial_ordering::unordered) {
52 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
53 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
[all …]
H A Dis_eq.h23 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_eq(partial_ordering __c) noexcept { return __c == 0;… in is_eq()
24 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_neq(partial_ordering __c) noexcept { return __c != 0… in is_neq()
25 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_lt(partial_ordering __c) noexcept { return __c < 0; } in is_lt()
26 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_lteq(partial_ordering __c) noexcept { return __c <= … in is_lteq()
27 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_gt(partial_ordering __c) noexcept { return __c > 0; } in is_gt()
28 _LIBCPP_HIDE_FROM_ABI inline constexpr bool is_gteq(partial_ordering __c) noexcept { return __c >= … in is_gteq()
H A Dpartial_order.h38 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
39 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
40 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
47 … noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 …-> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))))…
49 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
55 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
56 … -> decltype(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
57 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
H A Dweak_order.h49 partial_ordering __po = (__t <=> __u); in __go()
50 if (__po == partial_ordering::less) { in __go()
52 } else if (__po == partial_ordering::equivalent) { in __go()
54 } else if (__po == partial_ordering::greater) { in __go()
H A Dthree_way_comparable.h33 template <class _Tp, class _Cat = partial_ordering>
40 template <class _Tp, class _Up, class _Cat = partial_ordering>
H A Dcommon_comparison_category.h31 if (is_same_v<_Tp, partial_ordering>) in __type_to_enum()
63 return partial_ordering::equivalent; in __get_comp_type()
/src/contrib/llvm-project/libcxx/include/
H A Dcompare18 class partial_ordering;
23 constexpr bool is_eq (partial_ordering cmp) noexcept { return cmp == 0; }
24 constexpr bool is_neq (partial_ordering cmp) noexcept { return cmp != 0; }
25 constexpr bool is_lt (partial_ordering cmp) noexcept { return cmp < 0; }
26 constexpr bool is_lteq(partial_ordering cmp) noexcept { return cmp <= 0; }
27 constexpr bool is_gt (partial_ordering cmp) noexcept { return cmp > 0; }
28 constexpr bool is_gteq(partial_ordering cmp) noexcept { return cmp >= 0; }
39 template<class T, class Cat = partial_ordering>
41 template<class T, class U, class Cat = partial_ordering>
63 // [cmp.partialord], Class partial_ordering
[all …]
/src/contrib/llvm-project/libcxx/modules/std/
H A Dcompare.inc13 using std::partial_ordering;
/src/contrib/googletest/googletest/test/
H A Dgoogletest-printers-test.cc1996 EXPECT_EQ("(less)", PrintToString(std::partial_ordering::less));
1997 EXPECT_EQ("(greater)", PrintToString(std::partial_ordering::greater));
1998 EXPECT_EQ("(equivalent)", PrintToString(std::partial_ordering::equivalent));
1999 EXPECT_EQ("(unordered)", PrintToString(std::partial_ordering::unordered));
/src/contrib/googletest/googletest/include/gtest/
H A Dgtest-printers.h811 inline void PrintTo(std::partial_ordering ordering, std::ostream* os) {
812 if (ordering == std::partial_ordering::unordered) {
/src/contrib/llvm-project/clang/lib/Tooling/Inclusions/Stdlib/
H A DStdSymbolMap.inc2331 SYMBOL(partial_ordering, std::, <compare>)