| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.alg/ |
| H A D | weak_order.pass.cpp | 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()
154 assert(std::weak_order(v[0], v[6]) == std::weak_ordering::less); in test_1_3()
155 assert(std::weak_order(v[0], v[7]) == std::weak_ordering::less); in test_1_3()
156 assert(std::weak_order(v[0], v[8]) == std::weak_ordering::less); in test_1_3()
157 assert(std::weak_order(v[0], v[9]) == std::weak_ordering::less); in test_1_3()
[all …]
|
| H A D | compare_strong_order_fallback.pass.cpp | 70 std::strong_ordering strong_order(A&, A&&) { return std::strong_ordering::less; } in strong_order()
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()
155 assert(std::compare_strong_order_fallback(v[0], v[6]) == std::strong_ordering::less); in test_1_3()
156 assert(std::compare_strong_order_fallback(v[0], v[7]) == std::strong_ordering::less); in test_1_3()
157 assert(std::compare_strong_order_fallback(v[0], v[8]) == std::strong_ordering::less); in test_1_3()
[all …]
|
| H A D | strong_order.pass.cpp | 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()
155 assert(std::strong_order(v[0], v[6]) == std::strong_ordering::less); in test_1_3()
156 assert(std::strong_order(v[0], v[7]) == std::strong_ordering::less); in test_1_3()
157 assert(std::strong_order(v[0], v[8]) == std::strong_ordering::less); in test_1_3()
158 assert(std::strong_order(v[0], v[9]) == std::strong_ordering::less); in test_1_3()
[all …]
|
| H A D | compare_weak_order_fallback.pass.cpp | 66 std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
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()
154 assert(std::compare_weak_order_fallback(v[0], v[6]) == std::weak_ordering::less); in test_1_3()
155 assert(std::compare_weak_order_fallback(v[0], v[7]) == std::weak_ordering::less); in test_1_3()
451 operator std::weak_ordering() const { return std::weak_ordering::less; } in operator std::weak_ordering()
[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()
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()
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()
198 operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
221 assert(std::partial_order(a, std::move(a)) == std::partial_ordering::less); in test_1_4()
[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 <=>()
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()
189 constexpr std::strong_ordering weak_order(A&, A&&) { return std::strong_ordering::less; } in weak_order()
198 operator std::strong_ordering() const { return std::strong_ordering::less; } in operator std::strong_ordering()
[all …]
|
| /llvm-project-15.0.7/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()
87 std::set<set<int, less<int>>, std::less<>> s6; in main()
[all …]
|
| /llvm-project-15.0.7/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()
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()
63 assert( std::is_lteq(std::weak_ordering::less)); in test()
71 assert(!std::is_gt(std::strong_ordering::less)); in test()
[all …]
|
| /llvm-project-15.0.7/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-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_re_difference_type.compile.pass.cpp | 129 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
140 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
152 (void)std::make_heap(first, last, std::less<void*>()); in all_the_algorithms()
154 (void)std::max(value, value, std::less<void*>()); in all_the_algorithms()
157 (void)std::max({ value, value }, std::less<void*>()); in all_the_algorithms()
164 (void)std::min(value, value, std::less<void*>()); in all_the_algorithms()
167 (void)std::min({ value, value }, std::less<void*>()); in all_the_algorithms()
172 (void)std::minmax(value, value, std::less<void*>()); in all_the_algorithms()
200 (void)std::pop_heap(first, last, std::less<void*>()); in all_the_algorithms()
204 (void)std::push_heap(first, last, std::less<void*>()); in all_the_algorithms()
[all …]
|
| H A D | robust_against_adl.compile.pass.cpp | 92 (void)std::is_heap(first, last, std::less<void*>()); in all_the_algorithms()
103 (void)std::is_sorted(first, last, std::less<void*>()); in all_the_algorithms()
115 (void)std::make_heap(first, last, std::less<void*>()); in all_the_algorithms()
117 (void)std::max(value, value, std::less<void*>()); in all_the_algorithms()
120 (void)std::max({ value, value }, std::less<void*>()); in all_the_algorithms()
127 (void)std::min(value, value, std::less<void*>()); in all_the_algorithms()
130 (void)std::min({ value, value }, std::less<void*>()); in all_the_algorithms()
135 (void)std::minmax(value, value, std::less<void*>()); in all_the_algorithms()
165 (void)std::pop_heap(first, last, std::less<void*>()); in all_the_algorithms()
169 (void)std::push_heap(first, last, 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
60 test(std::ranges::includes, in, in2, less, proj1, proj2); in test_all()
67 test(std::ranges::partial_sort_copy, in, in2, less, proj1, proj2); in test_all()
68 test(std::ranges::merge, in, in2, out, less, proj1, proj2); in test_all()
69 test(std::ranges::merge, in, in2, out2, less, proj1, proj2); in test_all()
70 test(std::ranges::set_intersection, in, in2, out, less, proj1, proj2); in test_all()
71 test(std::ranges::set_intersection, in, in2, out2, less, proj1, proj2); in test_all()
72 test(std::ranges::set_difference, in, in2, out, less, proj1, proj2); in test_all()
73 test(std::ranges::set_difference, in, in2, out2, less, proj1, proj2); in test_all()
76 test(std::ranges::set_union, in, in2, out, less, proj1, proj2); in test_all()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/indirectcallable/indirectinvocable/ |
| H A D | indirectly_comparable.compile.pass.cpp | 22 static_assert(!std::indirectly_comparable<int, int, std::less<int>>); // not dereferenceable
24 static_assert( std::indirectly_comparable<int*, int*, std::less<int>>);
25 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>>);
26 static_assert( std::indirectly_comparable<int**, int*, std::less<int>, Deref>);
27 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>, Deref, Deref>);
28 static_assert(!std::indirectly_comparable<int**, int*, std::less<int>, std::identity, Deref>);
29 static_assert( std::indirectly_comparable<int*, int**, std::less<int>, std::identity, Deref>);
49 static_assert(subsumes(std::less<int>()));
50 static_assert(is_subsumed(std::less<int>()));
|
| /llvm-project-15.0.7/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:
|
| H A D | newline-handling.mir | 8 br i1 %0, label %less, label %exit
10 less:
20 br i1 %0, label %less, label %exit
22 less:
43 # CHECK: bb.1.less:
61 bb.1.less:
87 # CHECK: bb.1.less:
102 bb.1.less: $eax = MOV32r0 implicit-def dead $eflags
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/range.cmp/ |
| H A D | less.pass.cpp | 28 static_assert(!std::is_invocable_v<std::ranges::less, NotTotallyOrdered, NotTotallyOrdered>);
29 static_assert(!std::is_invocable_v<std::ranges::less, int, MoveOnly>);
30 static_assert(std::is_invocable_v<std::ranges::less, explicit_operators, explicit_operators>);
32 static_assert(requires { typename std::ranges::less::is_transparent; });
35 auto fn = std::ranges::less(); in test()
59 do_pointer_comparison_test(std::ranges::less()); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.partialord/ |
| H A D | partialord.pass.cpp | 25 DoNotOptimize(&std::partial_ordering::less); in test_static_members()
67 auto& Less = std::partial_ordering::less; in test_constexpr()
117 {std::partial_ordering::less, ER_Less}, in test_constexpr()
145 static_assert(std::partial_ordering::less == std::partial_ordering::less); in test_constexpr()
146 static_assert(std::partial_ordering::less != in test_constexpr()
148 static_assert(std::partial_ordering::less != in test_constexpr()
150 static_assert(std::partial_ordering::less != in test_constexpr()
154 std::partial_ordering::less); in test_constexpr()
163 std::partial_ordering::less); in test_constexpr()
172 std::partial_ordering::less); in test_constexpr()
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.strongord/ |
| H A D | strongord.pass.cpp | 25 DoNotOptimize(&std::strong_ordering::less); in test_static_members()
74 auto V = std::strong_ordering::less; in test_conversion()
92 auto V = std::strong_ordering::less; in test_conversion()
107 auto& Less = std::strong_ordering::less; in test_constexpr()
155 {std::strong_ordering::less, ER_Less}, in test_constexpr()
175 static_assert(std::strong_ordering::less == std::strong_ordering::less); in test_constexpr()
176 static_assert(std::strong_ordering::less != std::strong_ordering::equal); in test_constexpr()
177 static_assert(std::strong_ordering::less != std::strong_ordering::greater); in test_constexpr()
179 static_assert(std::strong_ordering::equal != std::strong_ordering::less); in test_constexpr()
183 static_assert(std::strong_ordering::greater != std::strong_ordering::less); in test_constexpr()
|
| /llvm-project-15.0.7/flang/lib/Decimal/ |
| H A D | binary-to-decimal.cpp | 214 if (less.exponent_ < leastExponent) { in Minimize()
215 leastExponent = less.exponent_; 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()
259 Digit least{less.digit_[offset]}; in Minimize()
307 Binary less{x}; in ConvertToDecimal() local
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.weakord/ |
| H A D | weakord.pass.cpp | 25 DoNotOptimize(&std::weak_ordering::less); in test_static_members()
62 auto V = std::weak_ordering::less; in test_conversion()
87 auto& Less = std::weak_ordering::less; in test_constexpr()
134 {std::weak_ordering::less, ER_Less}, in test_constexpr()
155 static_assert(std::weak_ordering::less == std::weak_ordering::less); in test_constexpr()
156 static_assert(std::weak_ordering::less != std::weak_ordering::equivalent); in test_constexpr()
157 static_assert(std::weak_ordering::less != std::weak_ordering::greater); in test_constexpr()
159 static_assert(std::weak_ordering::equivalent != std::weak_ordering::less); in test_constexpr()
165 static_assert(std::weak_ordering::greater != std::weak_ordering::less); in test_constexpr()
|
| /llvm-project-15.0.7/llvm/test/Transforms/GlobalOpt/ |
| H A D | 2007-06-04-PackedStruct.ll | 7 …less<int>,std::allocator<std::pair<const int, int> > >" = type { %"struct.std::_Rb_tree<int,std::p…
8 …1st<std::pair<const int, int> >,std::less<int>,std::allocator<std::pair<const int, int> > >::_Rb_t…
10 …less<int>,std::allocator<std::pair<const int, int> > >" = type { %"struct.std::_Rb_tree<int,std::p…
11 …td::map<int,int,std::less<int>,std::allocator<std::pair<const int, int> > >" zeroinitializer ; <%…
31 …"struct.std::map<int,int,std::less<int>,std::allocator<std::pair<const int, int> > >", %"struct.st…
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/comparisons/ |
| H A D | less.pass.cpp | 24 typedef std::less<int> F; in main()
36 do_pointer_comparison_test<std::less>(); in main()
39 typedef std::less<> F2; in main()
49 constexpr bool foo = std::less<int> () (36, 36); in main()
52 constexpr bool bar = std::less<> () (36.0, 36); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/tuple/tuple.tuple/tuple.rel/ |
| H A D | three_way.pass.cpp | 53 assert((T1(1) <=> T2(2)) == std::strong_ordering::less); in test()
61 assert((T1(1, 2) <=> T2(2, 2)) == std::strong_ordering::less); in test()
63 assert((T1(1, 2) <=> T2(1, 3)) == std::strong_ordering::less); in test()
71 assert((T1(1, 2, 3) <=> T2(2, 2, 3)) == std::strong_ordering::less); in test()
73 assert((T1(1, 2, 3) <=> T2(1, 3, 3)) == std::strong_ordering::less); in test()
75 assert((T1(1, 2, 3) <=> T2(1, 2, 4)) == std::strong_ordering::less); in test()
84 assert((T1(1) <=> T2(1.1)) == std::partial_ordering::less); in test()
92 assert((T1(1, 2) <=> T2(1.1, 2)) == std::partial_ordering::less); in test()
94 assert((T1(1, 2) <=> T2(1, 3)) == std::partial_ordering::less); in test()
104 assert((T1(1, 2, 3) <=> T2(1, 3, 3)) == std::partial_ordering::less); in test()
[all …]
|
| /llvm-project-15.0.7/clang/test/CXX/class/class.compare/class.spaceship/ |
| H A D | p1.cpp | 7 static const strong_ordering less, equal, greater; member
9 constexpr strong_ordering strong_ordering::less{-1},
17 static const weak_ordering less, equivalent, greater; member
19 constexpr weak_ordering weak_ordering::less{-1},
28 static const partial_ordering less, equivalent, greater, unordered; member
30 constexpr partial_ordering partial_ordering::less{-1},
176 Result equal, less; member
178 constexpr bool operator<(const Val&) const { return toBool(less); } in operator <()
186 …template<typename T> constexpr auto cmp(Result equal, Result less = Mu, Result reverse_less = Mu) { in cmp() argument
187 return Cmp<T>{equal, less} <=> Cmp<T>{Mu, reverse_less}; in cmp()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/associative/ |
| H A D | iterator_types.pass.cpp | 62 typedef std::map<int, int, std::less<int>, Alloc> Map; in main()
69 typedef std::map<int, int, std::less<int>, Alloc> Map; in main()
81 typedef std::multimap<int, int, std::less<int>, Alloc> Map; in main()
88 typedef std::multimap<int, int, std::less<int>, Alloc> Map; in main()
100 typedef std::set<ValueTp, std::less<ValueTp>, Alloc> Set; in main()
107 typedef std::set<ValueTp, std::less<ValueTp>, Alloc> Set; in main()
119 typedef std::multiset<ValueTp, std::less<ValueTp>, Alloc> Set; in main()
126 typedef std::multiset<ValueTp, std::less<ValueTp>, Alloc> Set; in main()
|