/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
minmax_init_list.pass.cpp | 16 // minmax(initializer_list<T> t); 25 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 26 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 27 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 28 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 29 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 30 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 33 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); 34 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); 35 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "") [all...] |
minmax_init_list_comp.pass.cpp | 16 // minmax(initializer_list<T> t, Compare comp); 32 std::pair<int, int> p = std::minmax(il, std::ref(pred)); 41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 47 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); 50 assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair<int, int>(5, 1))) [all...] |
minmax.pass.cpp | 14 // minmax(const T& a, const T& b); 25 std::pair<const T&, const T&> p = std::minmax(a, b); 56 constexpr auto p1 = std::minmax (x, y); 59 constexpr auto p2 = std::minmax (y, x);
|
minmax_comp.pass.cpp | 15 // minmax(const T& a, const T& b, Compare comp); 27 std::pair<const T&, const T&> p = std::minmax(a, b, c); 59 constexpr auto p1 = std::minmax(x, y, std::greater<>()); 62 constexpr auto p2 = std::minmax(y, x, std::greater<>());
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
minmax_init_list.pass.cpp | 14 // minmax(initializer_list<T> t); 22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); 31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); 32 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "") [all...] |
minmax_init_list_comp.pass.cpp | 14 // minmax(initializer_list<T> t, Compare comp); 23 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 24 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 25 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 26 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 27 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 28 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 31 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); 32 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), ""); 33 static_assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "") [all...] |
minmax.pass.cpp | 14 // minmax(const T& a, const T& b); 23 std::pair<const T&, const T&> p = std::minmax(a, b); 54 constexpr auto p1 = std::minmax (x, y); 57 constexpr auto p2 = std::minmax (y, x);
|
minmax_comp.pass.cpp | 15 // minmax(const T& a, const T& b, Compare comp); 25 std::pair<const T&, const T&> p = std::minmax(a, b, c); 57 constexpr auto p1 = std::minmax(x, y, std::greater<>()); 60 constexpr auto p2 = std::minmax(y, x, std::greater<>());
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
minmax_init_list.pass.cpp | 14 // minmax(initializer_list<T> t); 22 assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3))); 23 assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3))); 24 assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3))); 25 assert((std::minmax({2, 3, 1}) == std::pair<int, int>(1, 3))); 26 assert((std::minmax({3, 1, 2}) == std::pair<int, int>(1, 3))); 27 assert((std::minmax({3, 2, 1}) == std::pair<int, int>(1, 3))); 30 static_assert((std::minmax({1, 2, 3}) == std::pair<int, int>(1, 3)), ""); 31 static_assert((std::minmax({1, 3, 2}) == std::pair<int, int>(1, 3)), ""); 32 static_assert((std::minmax({2, 1, 3}) == std::pair<int, int>(1, 3)), "") [all...] |
minmax_init_list_comp.pass.cpp | 14 // minmax(initializer_list<T> t, Compare comp); 30 std::pair<int, int> p = std::minmax(il, std::ref(pred)); 41 assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 42 assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 43 assert((std::minmax({2, 1, 3}, std::greater<int>()) == std::pair<int, int>(3, 1))); 44 assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 45 assert((std::minmax({3, 1, 2}, std::greater<int>()) == std::pair<int, int>(3, 1))); 46 assert((std::minmax({3, 2, 1}, std::greater<int>()) == std::pair<int, int>(3, 1))); 47 assert((std::minmax({1, 2, 3}, all_equal ) == std::pair<int, int>(1, 3))); 50 assert((std::minmax({1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 5, 3}, std::ref(pred)) == std::pair<int, int>(5, 1))) [all...] |
minmax.pass.cpp | 14 // minmax(const T& a, const T& b); 23 std::pair<const T&, const T&> p = std::minmax(a, b); 54 constexpr auto p1 = std::minmax (x, y); 57 constexpr auto p2 = std::minmax (y, x);
|
minmax_comp.pass.cpp | 15 // minmax(const T& a, const T& b, Compare comp); 25 std::pair<const T&, const T&> p = std::minmax(a, b, c); 57 constexpr auto p1 = std::minmax(x, y, std::greater<>()); 60 constexpr auto p2 = std::minmax(y, x, std::greater<>());
|
/external/syslinux/core/fs/pxe/ |
idle.c | 18 #include <minmax.h>
|
/external/syslinux/com32/lib/sys/ |
isatty.c | 37 #include <minmax.h>
|
null_read.c | 37 #include <minmax.h>
|
err_read.c | 37 #include <minmax.h>
|
err_write.c | 37 #include <minmax.h>
|
null_write.c | 37 #include <minmax.h>
|
read.c | 37 #include <minmax.h>
|
write.c | 37 #include <minmax.h>
|
ansiserial_write.c | 37 #include <minmax.h>
|
rawcon_read.c | 39 #include <minmax.h>
|
/external/blktrace/ |
stats.h | 28 struct minmax { struct 36 static inline void minmax_init(struct minmax *mm) 45 static inline void minmax_account(struct minmax *mm, __u64 value) 56 static inline void minmax_merge(struct minmax *dst, struct minmax *src) 67 static inline void minmax_to_be(struct minmax *mm) 76 static inline double minmax_avg(struct minmax *mm) 81 static inline double minmax_var(struct minmax *mm) 88 static inline int minmax_print(FILE *fp, const char *s, struct minmax *mm)
|
blkiomon.h | 38 struct minmax size_r; 39 struct minmax size_w; 40 struct minmax d2c_r; 41 struct minmax d2c_w; 42 struct minmax thrput_r; 43 struct minmax thrput_w;
|
/cts/tests/camera/src/android/hardware/camera2/cts/rs/ |
raw_converter.rs | 119 float2 minmax; 120 minmax.x = sorted.x; 121 minmax.y = sorted.z; 124 minmax = native_powr(minmax, 3.f) * toneMapCoeffs.x + 125 native_powr(minmax, 2.f) * toneMapCoeffs.y + 126 minmax * toneMapCoeffs.z + toneMapCoeffs.w; 131 newMid = minmax.y; 133 newMid = minmax.x + ((minmax.y - minmax.x) * (sorted.y - sorted.x) [all...] |