| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| max_init_list_comp.pass.cpp | 23 int i = std::max({2, 3, 1}, std::greater<int>());
25 i = std::max({2, 1, 3}, std::greater<int>());
27 i = std::max({3, 1, 2}, std::greater<int>());
29 i = std::max({3, 2, 1}, std::greater<int>());
31 i = std::max({1, 2, 3}, std::greater<int>());
33 i = std::max({1, 3, 2}, std::greater<int>());
37 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, "");
38 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, "");
39 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, "");
|
| min_init_list_comp.pass.cpp | 23 int i = std::min({2, 3, 1}, std::greater<int>());
25 i = std::min({2, 1, 3}, std::greater<int>());
27 i = std::min({3, 1, 2}, std::greater<int>());
29 i = std::min({3, 2, 1}, std::greater<int>());
31 i = std::min({1, 2, 3}, std::greater<int>());
33 i = std::min({1, 3, 2}, std::greater<int>());
37 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, "");
38 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, "");
39 static_assert(std::min({3, 2, 1}, std::greater<int>()) == 3, "");
|
| minmax_init_list_comp.pass.cpp | 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)));
49 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>()));
68 static_assert((std::minmax({1, 2, 3}, std::greater<int>()) == std::pair<int, int>(3, 1)), "");
69 static_assert((std::minmax({1, 3, 2}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")
[all...] |
| max_comp.pass.cpp | 33 test(x, y, std::greater<int>(), x);
34 test(y, x, std::greater<int>(), y);
39 test(x, y, std::greater<int>(), x);
40 test(y, x, std::greater<int>(), x);
45 test(x, y, std::greater<int>(), y);
46 test(y, x, std::greater<int>(), y);
52 static_assert(std::max(x, y, std::greater<int>()) == y, "" );
53 static_assert(std::max(y, x, std::greater<int>()) == y, "" );
|
| min_comp.pass.cpp | 33 test(x, y, std::greater<int>(), x);
34 test(y, x, std::greater<int>(), y);
39 test(x, y, std::greater<int>(), y);
40 test(y, x, std::greater<int>(), y);
45 test(x, y, std::greater<int>(), x);
46 test(y, x, std::greater<int>(), x);
52 static_assert(std::min(x, y, std::greater<int>()) == x, "" );
53 static_assert(std::min(y, x, std::greater<int>()) == x, "" );
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_init_list_comp.pass.cpp | 23 int i = std::max({2, 3, 1}, std::greater<int>());
25 i = std::max({2, 1, 3}, std::greater<int>());
27 i = std::max({3, 1, 2}, std::greater<int>());
29 i = std::max({3, 2, 1}, std::greater<int>());
31 i = std::max({1, 2, 3}, std::greater<int>());
33 i = std::max({1, 3, 2}, std::greater<int>());
37 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, "");
38 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, "");
39 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, "");
|
| min_init_list_comp.pass.cpp | 23 int i = std::min({2, 3, 1}, std::greater<int>());
25 i = std::min({2, 1, 3}, std::greater<int>());
27 i = std::min({3, 1, 2}, std::greater<int>());
29 i = std::min({3, 2, 1}, std::greater<int>());
31 i = std::min({1, 2, 3}, std::greater<int>());
33 i = std::min({1, 3, 2}, std::greater<int>());
37 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, "");
38 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, "");
39 static_assert(std::min({3, 2, 1}, std::greater<int>()) == 3, "");
|
| minmax_init_list_comp.pass.cpp | 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)), "");
34 static_assert((std::minmax({2, 3, 1}, std::greater<int>()) == std::pair<int, int>(3, 1)), "")
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| greater.hpp | 13 // $Id: greater.hpp 49267 2008-10-11 06:19:02Z agurtovoy $
17 #define AUX778076_OP_NAME greater
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mt/ |
| badsignedimmhigh.s | 1 ; Offset greater than #32767 should cause an error.
|
| badunsignedimmhigh.s | 1 ; Offset greater than #$FFFF should cause an error.
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_comp.pass.cpp | 24 assert(std::is_heap(i1, i1, std::greater<int>()));
25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3))
[all...] |
| is_heap_until_comp.pass.cpp | 24 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1);
25 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1);
28 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2);
29 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2);
30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1);
38 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3);
39 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3);
40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3);
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3);
42 assert(std::is_heap_until(i8, i8+3, std::greater<int>()) == i8+1)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap_comp.pass.cpp | 24 assert(std::is_heap(i1, i1, std::greater<int>()));
25 assert(std::is_heap(i1, i1+1, std::greater<int>()) == (std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1));
28 assert(std::is_heap(i1, i1+2, std::greater<int>()) == (std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2));
29 assert(std::is_heap(i2, i2+2, std::greater<int>()) == (std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2));
30 assert(std::is_heap(i3, i3+2, std::greater<int>()) == (std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+2));
38 assert(std::is_heap(i4, i4+3, std::greater<int>()) == (std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3))
[all...] |
| is_heap_until_comp.pass.cpp | 24 assert(std::is_heap_until(i1, i1, std::greater<int>()) == i1);
25 assert(std::is_heap_until(i1, i1+1, std::greater<int>()) == i1+1);
28 assert(std::is_heap_until(i1, i1+2, std::greater<int>()) == i1+2);
29 assert(std::is_heap_until(i2, i2+2, std::greater<int>()) == i2+2);
30 assert(std::is_heap_until(i3, i3+2, std::greater<int>()) == i3+1);
38 assert(std::is_heap_until(i4, i4+3, std::greater<int>()) == i4+3);
39 assert(std::is_heap_until(i5, i5+3, std::greater<int>()) == i5+3);
40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3);
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3);
42 assert(std::is_heap_until(i8, i8+3, std::greater<int>()) == i8+1)
[all...] |
| /external/valgrind/none/tests/s390x/ |
| cgij.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| cgrj.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| cij.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| clgij.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| clgrj.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| clij.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| clrj.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| crj.stdout.exp | 9 greater than
11 greater or equal
12 greater or equal
15 greater than
17 greater or equal
18 greater or equal
|
| /external/clang/test/SemaCXX/ |
| namespace.cpp | 81 struct greater {}; struct in namespace:PR6620::numeric::op
84 extern op::greater const greater;
90 op::greater const greater = op::greater(); member in class:PR6620::numeric::__anon8127::op
95 { numeric::greater(l, r); }
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/function.objects/comparisons/ |
| greater.pass.cpp | 12 // greater
20 typedef std::greater<int> F;
27 typedef std::greater<> F2;
37 constexpr bool foo = std::greater<int> () (36, 36);
40 constexpr bool bar = std::greater<> () (36.0, 36);
|
