| /llvm-project/libcxx/test/std/language.support/cmp/cmp.alg/ |
| H A D | weak_order.pass.cpp | 40 std::strong_ordering weak_order(const A&, const A&) { return std::strong_ordering::less; } in weak_order()
66 std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
75 explicit operator std::weak_ordering() const { return std::weak_ordering::less; } in operator std::weak_ordering()
91 assert(std::weak_order(a, std::move(a)) == std::weak_ordering::less); in test_1_2()
100 assert(std::weak_order(c1, c2) == std::weak_ordering::less); in test_1_2()
149 assert(std::weak_order(v[0], v[1]) == std::weak_ordering::less); in test_1_3()
150 assert(std::weak_order(v[0], v[2]) == std::weak_ordering::less); in test_1_3()
151 assert(std::weak_order(v[0], v[3]) == std::weak_ordering::less); in test_1_3()
152 assert(std::weak_order(v[0], v[4]) == std::weak_ordering::less); in test_1_3()
153 assert(std::weak_order(v[0], v[5]) == std::weak_ordering::less); in test_1_3()
[all …]
|
| H A D | compare_strong_order_fallback.pass.cpp | 44 std::strong_ordering strong_order(const A&, const A&) { return std::strong_ordering::less; } in strong_order()
70 std::strong_ordering strong_order(A&, A&&) { return std::strong_ordering::less; } in strong_order()
79 explicit operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
95 assert(std::compare_strong_order_fallback(a, std::move(a)) == std::strong_ordering::less); in test_1_2()
104 assert(std::compare_strong_order_fallback(c1, c2) == std::strong_ordering::less); in test_1_2()
150 assert(std::compare_strong_order_fallback(v[0], v[1]) == std::strong_ordering::less); in test_1_3()
151 assert(std::compare_strong_order_fallback(v[0], v[2]) == std::strong_ordering::less); in test_1_3()
152 assert(std::compare_strong_order_fallback(v[0], v[3]) == std::strong_ordering::less); in test_1_3()
153 assert(std::compare_strong_order_fallback(v[0], v[4]) == std::strong_ordering::less); in test_1_3()
154 assert(std::compare_strong_order_fallback(v[0], v[5]) == std::strong_ordering::less); in test_1_3()
[all...] |
| H A D | strong_order.pass.cpp | 44 std::strong_ordering strong_order(const A&, const A&) { return std::strong_ordering::less; } in strong_order()
70 std::strong_ordering strong_order(A&, A&&) { return std::strong_ordering::less; } in strong_order()
79 explicit operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
95 assert(std::strong_order(a, std::move(a)) == std::strong_ordering::less); in test_1_2()
104 assert(std::strong_order(c1, c2) == std::strong_ordering::less); in test_1_2()
150 assert(std::strong_order(v[0], v[1]) == std::strong_ordering::less); in test_1_3()
151 assert(std::strong_order(v[0], v[2]) == std::strong_ordering::less); in test_1_3()
152 assert(std::strong_order(v[0], v[3]) == std::strong_ordering::less); in test_1_3()
153 assert(std::strong_order(v[0], v[4]) == std::strong_ordering::less); in test_1_3()
154 assert(std::strong_order(v[0], v[5]) == std::strong_ordering::less); in test_1_3()
[all...] |
| H A D | compare_weak_order_fallback.pass.cpp | 40 std::strong_ordering weak_order(const A&, const A&) { return std::strong_ordering::less; } in weak_order()
66 std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
75 explicit operator std::weak_ordering() const { return std::weak_ordering::less; } in operator std::weak_ordering()
91 assert(std::compare_weak_order_fallback(a, std::move(a)) == std::weak_ordering::less); in test_1_2()
100 assert(std::compare_weak_order_fallback(c1, c2) == std::weak_ordering::less); in test_1_2()
149 assert(std::compare_weak_order_fallback(v[0], v[1]) == std::weak_ordering::less); in test_1_3()
150 assert(std::compare_weak_order_fallback(v[0], v[2]) == std::weak_ordering::less); in test_1_3()
151 assert(std::compare_weak_order_fallback(v[0], v[3]) == std::weak_ordering::less); in test_1_3()
152 assert(std::compare_weak_order_fallback(v[0], v[4]) == std::weak_ordering::less); in test_1_3()
153 assert(std::compare_weak_order_fallback(v[0], v[5]) == std::weak_ordering::less); in test_1_3()
[all...] |
| H A D | partial_order.pass.cpp | 40 std::strong_ordering partial_order(const A&, const A&) { return std::strong_ordering::less; } in partial_order()
66 std::strong_ordering partial_order(A&, A&&) { return std::strong_ordering::less; } in partial_order()
75 explicit operator std::partial_ordering() const { return std::partial_ordering::less; } in operator std::partial_ordering()
91 assert(std::partial_order(a, std::move(a)) == std::partial_ordering::less); in test_1_2()
100 assert(std::partial_order(c1, c2) == std::partial_ordering::less); in test_1_2()
109 constexpr std::partial_ordering operator<=>(A&, A&&) { return std::partial_ordering::less; } in operator <=>()
136 assert(std::partial_order(a, std::move(a)) == std::partial_ordering::less); in test_1_3()
156 assert(std::partial_order(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
166 assert(std::partial_order(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
176 assert(std::partial_order(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
[all …]
|
| H A D | compare_partial_order_fallback.pass.cpp | 40 std::strong_ordering partial_order(const A&, const A&) { return std::strong_ordering::less; } in partial_order()
66 std::strong_ordering partial_order(A&, A&&) { return std::strong_ordering::less; } in partial_order()
75 explicit operator std::partial_ordering() const { return std::partial_ordering::less; } in operator std::partial_ordering()
91 assert(std::compare_partial_order_fallback(a, std::move(a)) == std::partial_ordering::less); in test_1_2()
100 assert(std::partial_order(c1, c2) == std::partial_ordering::less); in test_1_2()
109 constexpr std::partial_ordering operator<=>(A&, A&&) { return std::partial_ordering::less; } in operator <=>()
136 assert(std::compare_partial_order_fallback(a, std::move(a)) == std::partial_ordering::less); in test_1_3()
156 assert(std::compare_partial_order_fallback(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
166 assert(std::compare_partial_order_fallback(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
176 assert(std::compare_partial_order_fallback(F(1), F(2)) == std::partial_ordering::less); in test_1_3()
[all...] |
| /llvm-project/clang-tools-extra/test/clang-tidy/checkers/modernize/ |
| H A D | use-transparent-functors.cpp | 26 struct less { struct
31 struct less<void> { struct
52 class Compare = std::less<>,
58 class Compare = std::less<Key>,
75 using std::less; in main()
76 std::set<int, std::less<int>> s; in main()
79 set<int, std::less<int>> s2; in main()
82 set<int, less<int>> s3; in main()
85 std::set<int, std::less<>> s4; in main()
86 std::set<char *, std::less<std::string>> s5; in main()
[all …]
|
| /llvm-project/libcxx/test/std/language.support/cmp/compare.syn/ |
| H A D | named_functions.pass.cpp | 27 assert(!std::is_eq(std::strong_ordering::less)); in test()
30 assert(!std::is_eq(std::weak_ordering::less)); in test()
33 assert(!std::is_eq(std::partial_ordering::less)); in test()
38 assert( std::is_neq(std::strong_ordering::less)); in test()
41 assert( std::is_neq(std::weak_ordering::less)); in test()
44 assert( std::is_neq(std::partial_ordering::less)); in test()
49 assert( std::is_lt(std::strong_ordering::less)); in test()
52 assert( std::is_lt(std::weak_ordering::less)); in test()
55 assert( std::is_lt(std::partial_ordering::less)); in test()
60 assert( std::is_lteq(std::strong_ordering::less)); in test()
[all …]
|
| /llvm-project/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 95 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
98 (void)std::clamp(value, value, value, std::less<void*>()); in all_the_algorithms()
113 (void)std::equal_range(first, last, value, std::less<void*>()); in all_the_algorithms()
128 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
130 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
132 (void)std::is_heap_until(first, last, std::less<void*>()); in all_the_algorithms()
141 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
143 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
145 if (!TEST_IS_CONSTANT_EVALUATED) (void)std::inplace_merge(first, mid, last, std::less<void*>()); in all_the_algorithms()
148 (void)std::lexicographical_compare(first, last, first2, last2, std::less<voi in all_the_algorithms()
[all...] |
| H A D | robust_against_adl.compile.pass.cpp | 57 (void)std::binary_search(first, last, value, std::less<void*>()); in all_the_algorithms()
60 (void)std::clamp(value, value, value, std::less<void*>()); in all_the_algorithms()
75 (void)std::equal_range(first, last, value, std::less<void*>()); in all_the_algorithms()
90 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
92 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
94 (void)std::is_heap_until(first, last, std::less<void*>()); in all_the_algorithms()
103 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
105 (void)std::is_sorted_until(first, last, std::less<void*>()); in all_the_algorithms()
110 (void)std::lexicographical_compare(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
116 (void)std::lower_bound(first, last, value, std::less<void*>()); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_differing_projections.pass.cpp | 52 std::ranges::less less; in test_all() local
63 test(std::ranges::includes, in, in2, less, proj1, proj2); in test_all()
70 test(std::ranges::partial_sort_copy, in, in2, less, proj1, proj2); in test_all()
71 test(std::ranges::merge, in, in2, out, less, proj1, proj2); in test_all()
72 test(std::ranges::merge, in, in2, out2, less, proj1, proj2); in test_all()
73 test(std::ranges::set_intersection, in, in2, out, less, proj1, proj2); in test_all()
74 test(std::ranges::set_intersection, in, in2, out2, less, proj1, proj2); in test_all()
75 test(std::ranges::set_difference, in, in2, out, less, proj1, proj2); in test_all()
76 test(std::ranges::set_difference, in, in2, out2, less, proj1, proj2); in test_all()
77 test(std::ranges::set_symmetric_difference, in, in2, out, less, proj1, proj2); in test_all()
[all …]
|
| /llvm-project/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| H A D | ctor_iter_constraint.compile.pass.cpp | 40 static_assert( std::is_constructible<std::priority_queue<int>, int*, int*, std::less<int>>::value, …
41 static_assert(!std::is_constructible<std::priority_queue<int>, int , int , std::less<int>>::value, …
43 static_assert( std::is_constructible<std::priority_queue<int>, int*, int*, std::less<int>, std::vec…
44 static_assert(!std::is_constructible<std::priority_queue<int>, int , int , std::less<int>, std::vec…
46 static_assert( std::is_constructible<std::priority_queue<int>, int*, int*, std::less<int>, std::vec…
47 static_assert(!std::is_constructible<std::priority_queue<int>, int , int , std::less<int>, std::vec…
52 static_assert( std::is_constructible<std::priority_queue<int>, int*, int*, std::less<int>, std::all…
53 static_assert(!std::is_constructible<std::priority_queue<int>, int , int , std::less<int>, std::all…
55 static_assert( std::is_constructible<std::priority_queue<int>, int*, int*, std::less<int>, std::vec…
56 static_assert(!std::is_constructible<std::priority_queue<int>, int , int , std::less<int>, std::vec…
[all …]
|
| /llvm-project/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
| H A D | indirectly_comparable.compile.pass.cpp | 24 static_assert(!std::indirectly_comparable<int, int, std::less<int>>); // not dereferenceable
26 static_assert( std::indirectly_comparable<int*, int*, std::less<int>>);
27 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>>);
28 static_assert( std::indirectly_comparable<int**, int*, std::less<int>, Deref>);
29 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>, Deref, Deref>);
30 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>, std::identity, Deref>);
31 static_assert( std::indirectly_comparable<int*, int**, std::less<int>, std::identity, Deref>);
51 static_assert(subsumes(std::less<int>()));
52 static_assert(is_subsumed(std::less<int>()));
58 static_assert(std::indirectly_comparable<Holder<Incomplete>**, Holder<Incomplete>**, std::less<Hold…
|
| /llvm-project/libcxx/test/support/ |
| H A D | test_container_comparisons.h | 37 assert(testOrder(l1, l2, Order::less)); in test_sequence_container_spaceship_with_type()
49 assert(testOrder(l1, l2, Order::less)); in test_sequence_container_spaceship_with_type()
116 assert(testOrder(ca1, ca2, Order::less)); in test_sequence_container_adaptor_spaceship_with_type()
132 assert(testOrder(ca1, ca2, Order::less)); in test_sequence_container_adaptor_spaceship_with_type()
196 assert(testOrder(l1, l2, Order::less)); in test_ordered_map_container_spaceship_with_type()
208 assert(testOrder(l1, l2, Order::less)); in test_ordered_map_container_spaceship_with_type()
237 assert(testOrder(l1, l2, Order::less)); in test_ordered_map_container_spaceship_with_type()
241 assert(testOrder(l3, l4, Order::less)); in test_ordered_map_container_spaceship_with_type()
257 assert(testOrder(l1, l2, Order::less)); in test_ordered_map_container_spaceship_with_type()
261 assert(testOrder(l3, l4, Order::less)); in test_ordered_map_container_spaceship_with_type()
[all …]
|
| /llvm-project/libcxx/test/std/time/time.cal/time.cal.ymd/time.cal.ymd.nonmembers/ |
| H A D | comparisons.pass.cpp | 41 std::strong_ordering::less)); in test()
47 std::strong_ordering::less)); in test()
53 std::strong_ordering::less)); in test()
59 std::strong_ordering::less)); in test()
65 std::strong_ordering::less)); in test()
71 std::strong_ordering::less)); in test()
77 std::strong_ordering::less)); in test()
86 : i < j ? std::strong_ordering::less in test()
96 : i < j ? std::strong_ordering::less in test()
106 : i < j ? std::strong_ordering::less in test()
|
| /llvm-project/llvm/test/CodeGen/MIR/X86/ |
| H A D | virtual-registers.mir | 10 br i1 %0, label %less, label %exit
12 less:
22 br i1 %0, label %less, label %exit
24 less:
45 successors: %bb.2.exit, %bb.1.less
52 JMP_1 %bb.1.less
54 bb.1.less:
79 successors: %bb.2.exit, %bb.1.less
86 JMP_1 %bb.1.less
88 bb.1.less
[all...] |
| /llvm-project/flang/lib/Decimal/ |
| H A D | binary-to-decimal.cpp | 212 BigRadixFloatingPointNumber &&less, BigRadixFloatingPointNumber &&more) { in Minimize() argument
214 if (less.exponent_ < leastExponent) { in Minimize()
215 leastExponent = less.exponent_; in Minimize()
224 while (less.exponent_ > leastExponent) { in Minimize()
225 --less.exponent_; in Minimize()
226 less.MultiplyBy<10>(); in Minimize()
232 if (less.Mean(*this)) { in Minimize()
233 less.AddCarry(); // round up in Minimize()
238 while (less.digits_ < more.digits_) { in Minimize()
239 less.digit_[less.digits_++] = 0; in Minimize()
[all …]
|
| /llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.three.way/ |
| H A D | lexicographical_compare_three_way.pass.cpp | 40 …raphical_compare<Iter1, Iter2>(std::array<int, 0>{}, std::array{0, 1}, std::strong_ordering::less); in test_given_iterator_types()
47 …icographical_compare<Iter1, Iter2>(std::array{0, 1}, std::array{0, 2}, std::strong_ordering::less); in test_given_iterator_types()
51 …icographical_compare<Iter1, Iter2>(std::array{0, 2}, std::array{1, 1}, std::strong_ordering::less); in test_given_iterator_types()
53 …graphical_compare<Iter1, Iter2>(std::array{0, 1}, std::array{0, 1, 2}, std::strong_ordering::less); in test_given_iterator_types()
90 … std::array<StrongOrder, 2>{0, 1}, std::array<StrongOrder, 2>{1, 1}, std::strong_ordering::less); in test_comparison_categories()
92 std::array<WeakOrder, 2>{0, 1}, std::array<WeakOrder, 2>{1, 1}, std::weak_ordering::less); in test_comparison_categories()
94 …std::array<PartialOrder, 2>{0, 1}, std::array<PartialOrder, 2>{1, 1}, std::partial_ordering::less); in test_comparison_categories()
98 …std::array<StrongOrder, 2>{0, 1}, std::array<StrongOrder, 3>{0, 1, 2}, std::strong_ordering::less); in test_comparison_categories()
100 std::array<WeakOrder, 2>{0, 1}, std::array<WeakOrder, 3>{0, 1, 2}, std::weak_ordering::less); in test_comparison_categories()
102 …::array<PartialOrder, 2>{0, 1}, std::array<PartialOrder, 3>{0, 1, 2}, std::partial_ordering::less); in test_comparison_categories()
|
| /llvm-project/libcxx/test/std/language.support/cmp/cmp.partialord/ |
| H A D | partialord.pass.cpp | 25 DoNotOptimize(&std::partial_ordering::less); in test_static_members()
63 auto& Less = std::partial_ordering::less; in test_constexpr()
112 {std::partial_ordering::less, ER_Less}, in test_constexpr()
140 static_assert(std::partial_ordering::less == std::partial_ordering::less); in test_constexpr()
141 static_assert(std::partial_ordering::less != in test_constexpr()
143 static_assert(std::partial_ordering::less != in test_constexpr()
145 static_assert(std::partial_ordering::less != in test_constexpr()
149 std::partial_ordering::less); in test_constexpr()
158 std::partial_ordering::less); in test_constexpr()
167 std::partial_ordering::less); in test_constexpr()
|
| /llvm-project/libcxx/test/std/language.support/cmp/cmp.strongord/ |
| H A D | strongord.pass.cpp | 25 DoNotOptimize(&std::strong_ordering::less); in test_static_members()
70 auto V = std::strong_ordering::less; in test_conversion()
88 auto V = std::strong_ordering::less; in test_conversion()
103 auto& Less = std::strong_ordering::less; in test_constexpr()
150 {std::strong_ordering::less, ER_Less}, in test_constexpr()
170 static_assert(std::strong_ordering::less == std::strong_ordering::less); in test_constexpr()
171 static_assert(std::strong_ordering::less != std::strong_ordering::equal); in test_constexpr()
172 static_assert(std::strong_ordering::less != std::strong_ordering::greater); in test_constexpr()
174 static_assert(std::strong_ordering::equal != std::strong_ordering::less); in test_constexpr()
178 static_assert(std::strong_ordering::greater != std::strong_ordering::less); in test_constexpr()
|
| /llvm-project/libcxx/test/std/utilities/function.objects/range.cmp/ |
| H A D | less.pass.cpp | 29 static_assert(!std::is_invocable_v<std::ranges::less, NotTotallyOrdered, NotTotallyOrdered>);
30 static_assert(!std::is_invocable_v<std::ranges::less, int, MoveOnly>);
31 static_assert(std::is_invocable_v<std::ranges::less, explicit_operators, explicit_operators>);
33 static_assert(requires { typename std::ranges::less::is_transparent; });
36 auto fn = std::ranges::less(); in test()
60 do_pointer_comparison_test(std::ranges::less()); in main()
|
| /llvm-project/libcxx/test/std/language.support/cmp/cmp.weakord/ |
| H A D | weakord.pass.cpp | 25 DoNotOptimize(&std::weak_ordering::less); in test_static_members()
60 auto V = std::weak_ordering::less; in test_conversion()
83 auto& Less = std::weak_ordering::less; in test_constexpr()
129 {std::weak_ordering::less, ER_Less}, in test_constexpr()
150 static_assert(std::weak_ordering::less == std::weak_ordering::less); in test_constexpr()
151 static_assert(std::weak_ordering::less != std::weak_ordering::equivalent); in test_constexpr()
152 static_assert(std::weak_ordering::less != std::weak_ordering::greater); in test_constexpr()
154 static_assert(std::weak_ordering::equivalent != std::weak_ordering::less); in test_constexpr()
160 static_assert(std::weak_ordering::greater != std::weak_ordering::less); in test_constexpr()
|
| /llvm-project/libcxx/test/std/containers/associative/set/set.nonmember/ |
| H A D | compare.three_way.verify.cpp | 25 std::set<int, std::less<int>, std::allocator<int>> s1; in main()
26 std::set<int, std::less<int>, test_allocator<int>> s2; in main()
34 std::set<int, std::less<int>> s1; in main()
42 std::set<int, std::less<int>> s1; in main()
43 std::set<int, std::less<float>> s2; in main()
|
| /llvm-project/libcxx/test/std/containers/associative/map/map.nonmember/ |
| H A D | compare.three_way.verify.cpp | 26 std::map<int, int, std::less<int>, std::allocator<int>> s1; in main()
27 std::map<int, int, std::less<int>, test_allocator<int>> s2; in main()
35 std::map<int, int, std::less<int>> s1; in main()
43 std::map<int, int, std::less<int>> s1; in main()
44 std::map<int, int, std::less<float>> s2; in main()
|
| /llvm-project/libcxx/test/std/containers/associative/multiset/multiset.nonmember/ |
| H A D | compare.three_way.verify.cpp | 25 std::multiset<int, std::less<int>, std::allocator<int>> s1; in main()
26 std::multiset<int, std::less<int>, test_allocator<int>> s2; in main()
34 std::multiset<int, std::less<int>> s1; in main()
42 std::multiset<int, std::less<int>> s1; in main()
43 std::multiset<int, std::less<float>> s2; in main()
|