| /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/r16/sources/cxx-stl/llvm-libc++/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<>());
|
| /external/tensorflow/tensorflow/contrib/lite/toco/graph_transformations/ |
| read_fake_quant_min_max.cc | 31 const MinMax& minmax, const string& array_name) {
33 if (annotated_array.minmax) {
36 annotated_array.GetOrCreateMinMax() = minmax;
39 minmax.min, minmax.max);
55 if (!fakequant_op->minmax) {
70 fakequant_op->minmax.reset(new MinMax);
71 MinMax& minmax = *fakequant_op->minmax local
96 const MinMax& minmax = *fakequant_op->minmax; local
[all...] |
| hardcode_min_max.cc | 34 if (im2col_array.minmax) {
38 if (!input_array.minmax) {
42 CHECK(!im2col_array.minmax);
51 if (output_array.minmax) {
55 if (!input_array.minmax) {
59 CHECK(!output_array.minmax);
73 if (model->GetArray(input).minmax) {
75 const auto* minmax = model->GetArray(input).minmax.get(); local
76 if (minmax) {
85 const auto* minmax = model->GetArray(op->outputs[0]).minmax.get(); local
228 auto& minmax = input_activations.GetOrCreateMinMax(); local
237 auto& minmax = prev_output_activations.GetOrCreateMinMax(); local
246 auto& minmax = output_concat_temp.GetOrCreateMinMax(); local
255 auto& minmax = output_activations.GetOrCreateMinMax(); local
272 auto& minmax = output_activations_temp.GetOrCreateMinMax(); local
[all...] |
| drop_fake_quant.cc | 36 if (!fakequant_op->minmax) {
41 if (!output_array.minmax) {
|
| resolve_constant_fake_quant.cc | 37 // Yield until the fakequant MinMax has been resolved.
38 if (!fakequant_op->minmax) {
53 output_array.GetOrCreateMinMax() = *fakequant_op->minmax;
59 model->flags, *fakequant_op->minmax, &qparams);
|
| /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...] |
