| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| H A D | minmax_init_list.pass.cpp | 24 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); in main()
25 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); in main()
26 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); in main()
27 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); in main()
28 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); in main()
29 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); in main()
32 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); in main()
33 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); in main()
34 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), ""); in main()
35 static_assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3)), ""); in main()
[all …]
|
| H A D | minmax_init_list_comp.pass.cpp | 31 std::pair<int, int> p = std::minmax(il, std::ref(pred)); in test_all_equal()
40 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
41 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
42 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
43 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
44 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
45 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); in main()
46 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); in main()
67 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
68 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); in main()
[all …]
|
| H A D | ranges.minmax.pass.cpp | 70 auto result = std::ranges::minmax(one, two); in test_2_arguments()
76 auto result = std::ranges::minmax(two, one); in test_2_arguments()
122 auto r = std::ranges::minmax(one, two); in test_2_arguments()
186 auto ret = std::ranges::minmax({ 1 }); in test_initializer_list()
193 auto ret = std::ranges::minmax({1, 2, 3}); in test_initializer_list()
200 auto ret = std::ranges::minmax({3, 2, 1}); in test_initializer_list()
252 auto ret = std::ranges::minmax(range); in test_range_types()
261 auto ret = std::ranges::minmax(range); in test_range_types()
270 auto ret = std::ranges::minmax(range); in test_range_types()
301 auto ret = std::ranges::minmax(a, &S::comp); in test_range()
[all …]
|
| H A D | minmax.pass.cpp | 24 std::pair<const T&, const T&> p = std::minmax(a, b); in test()
55 constexpr auto p1 = std::minmax (x, y); in main()
58 constexpr auto p2 = std::minmax (y, x); in main()
|
| H A D | minmax_comp.pass.cpp | 26 std::pair<const T&, const T&> p = std::minmax(a, b, c); in test()
58 constexpr auto p1 = std::minmax(x, y, std::greater<>()); in main()
61 constexpr auto p2 = std::minmax(y, x, std::greater<>()); in main()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | reduction.ll | 203 %rdx.minmax.cmp2 = icmp ult <4 x i16> %rdx.minmax.select, %rdx.shuf1
204 …%rdx.minmax.select3 = select <4 x i1> %rdx.minmax.cmp2, <4 x i16> %rdx.minmax.select, <4 x i16> %r…
229 …%rdx.minmax.select3 = select <8 x i1> %rdx.minmax.cmp2, <8 x i16> %rdx.minmax.select, <8 x i16> %r…
232 …%rdx.minmax.select6 = select <8 x i1> %rdx.minmax.cmp5, <8 x i16> %rdx.minmax.select3, <8 x i16> %…
309 …%rdx.minmax.select3 = select <16 x i1> %rdx.minmax.cmp2, <16 x i16> %rdx.minmax.select, <16 x i16>…
312 …%rdx.minmax.select6 = select <16 x i1> %rdx.minmax.cmp5, <16 x i16> %rdx.minmax.select3, <16 x i16…
315 …%rdx.minmax.select9 = select <16 x i1> %rdx.minmax.cmp8, <16 x i16> %rdx.minmax.select6, <16 x i16…
412 …%rdx.minmax.select3 = select <4 x i1> %rdx.minmax.cmp2, <4 x i16> %rdx.minmax.select, <4 x i16> %r…
431 …%rdx.minmax.select3 = select <4 x i1> %rdx.minmax.cmp2, <4 x i16> %rdx.minmax.select, <4 x i16> %r…
521 …%rdx.minmax.select3 = select <4 x i1> %rdx.minmax.cmp2, <4 x half> %rdx.minmax.select, <4 x half> …
[all …]
|
| H A D | minmax.ll | 210 %minmax = call float @llvm.minnum.f32(float %max, float %c)
211 ret float %minmax
246 %minmax = call float @llvm.minnum.f32(float %c, float %max)
247 ret float %minmax
306 %minmax = call half @llvm.minnum.f16(half %max, half %c)
307 ret half %minmax
357 %minmax = call half @llvm.minnum.f16(half %c, half %max)
358 ret half %minmax
|
| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | minmax.h | 30 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) in minmax() function
40 minmax(const _Tp& __a, const _Tp& __b) in minmax() function
42 return std::minmax(__a, __b, __less<_Tp>()); in minmax()
49 pair<_Tp, _Tp> minmax(initializer_list<_Tp> __t, _Compare __comp) { in minmax() function
60 minmax(initializer_list<_Tp> __t) in minmax() function
62 return std::minmax(__t, __less<_Tp>()); in minmax()
|
| H A D | ranges_minmax.h | 123 inline constexpr auto minmax = __minmax::__fn{};
|
| /llvm-project-15.0.7/lldb/test/API/lang/objc/modules-incomplete/ |
| H A D | module.map | 6 module minmax {
7 header "minmax.h"
|
| H A D | myModule.h | 1 @import minmax;
|
| H A D | main.m | 2 @import minmax;
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/alg.sorting/ |
| H A D | assert.min.max.pass.cpp | 23 TEST_LIBCPP_ASSERT_FAILURE(std::ranges::minmax(init_list), in main()
26 TEST_LIBCPP_ASSERT_FAILURE(std::ranges::minmax(std::array<int, 0>{}), in main()
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | scalable-first-order-recurrence.ll | 60 ; int minmax;
62 ; minmax = min(minmax, max(a[i] - a[i-1], 0));
63 ; return minmax;
92 %minmax.0.cond.lcssa = phi i32 [ %minmax.0.cond, %scalar.body ]
96 %minmax.0.lcssa = phi i32 [ undef, %entry ], [ %minmax.0.cond.lcssa, %for.cond.cleanup.loopexit ]
97 ret i32 %minmax.0.lcssa
102 %minmax.028 = phi i32 [ undef, %for.preheader ], [ %minmax.0.cond, %scalar.body ]
108 %cmp5 = icmp slt i32 %minmax.028, %cond
109 %minmax.0.cond = select i1 %cmp5, i32 %minmax.028, i32 %cond
|
| /llvm-project-15.0.7/clang/test/SemaCXX/ |
| H A D | invalid-member-expr.cpp | 30 template <typename _Tp> pair<_Tp, _Tp> minmax(initializer_list<_Tp> __l) {}; in minmax() function
33 pair<int, int> z = minmax({}); in test0()
|
| /llvm-project-15.0.7/polly/lib/External/isl/ |
| H A D | bound.c | 74 const char *minmax; in verify_point() local
83 minmax = "ub"; in verify_point()
86 minmax = "lb"; in verify_point()
132 p = isl_printer_print_str(p, minmax); in verify_point()
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 134 (void)std::minmax(value, value); in all_the_algorithms()
135 (void)std::minmax(value, value, std::less<void*>()); in all_the_algorithms()
137 (void)std::minmax({ value, value }); in all_the_algorithms()
138 (void)std::minmax({ value, value }, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_nonbool_predicates.pass.cpp | 95 std::ranges::minmax(1, 2, binary_pred); in test_all()
96 std::ranges::minmax(std::initializer_list<int>{1, 2}, binary_pred); in test_all()
97 std::ranges::minmax(in, binary_pred); in test_all()
|
| H A D | robust_re_difference_type.compile.pass.cpp | 171 (void)std::minmax(value, value); in all_the_algorithms()
172 (void)std::minmax(value, value, std::less<void*>()); in all_the_algorithms()
174 (void)std::minmax({ value, value }); in all_the_algorithms()
175 (void)std::minmax({ value, value }, std::less<void*>()); in all_the_algorithms()
|
| H A D | ranges_robust_against_omitting_invoke.pass.cpp | 101 std::ranges::minmax(a, b, &Foo::binary_pred, &Bar::val); in test_all()
102 std::ranges::minmax(std::initializer_list<Bar>{a, b}, &Foo::binary_pred, &Bar::val); in test_all()
103 std::ranges::minmax(in, &Foo::binary_pred, &Bar::val); in test_all()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/diagnostics/ |
| H A D | nodiscard_extensions.pass.cpp | 120 std::minmax(1, 2); in test_algorithms()
121 std::minmax(1, 2, std::greater<int>()); in test_algorithms()
123 std::minmax({1, 2, 3}); in test_algorithms()
124 std::minmax({1, 2, 3}, std::greater<int>()); in test_algorithms()
|
| H A D | nodiscard_extensions.verify.cpp | 227 std::minmax(1, 2); in test_algorithms()
230 std::minmax(1, 2, std::greater<int>()); in test_algorithms()
233 std::minmax({1, 2, 3}); in test_algorithms()
236 std::minmax({1, 2, 3}, std::greater<int>()); in test_algorithms()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | callable.verify.cpp | 28 std::minmax({S{1}}, &S::compare); // expected-error@*:* {{The comparator has to be callable}} in main()
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 161 (void)std::ranges::minmax(value, value, Less(&copies)); assert(copies == 0); in all_the_algorithms()
162 (void)std::ranges::minmax({ value, value }, Less(&copies)); assert(copies == 0); in all_the_algorithms()
163 (void)std::ranges::minmax(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
|
| H A D | robust_against_copying_comparators.pass.cpp | 160 (void)std::minmax(value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
162 (void)std::minmax({ value, value }, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
|