HomeSort by relevance Sort by last modified time
    Searched refs:greater (Results 1 - 25 of 513) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
max_init_list_comp.pass.cpp 26 int i = std::max({2, 3, 1}, std::greater<int>());
28 i = std::max({2, 1, 3}, std::greater<int>());
30 i = std::max({3, 1, 2}, std::greater<int>());
32 i = std::max({3, 2, 1}, std::greater<int>());
34 i = std::max({1, 2, 3}, std::greater<int>());
36 i = std::max({1, 3, 2}, std::greater<int>());
40 static_assert(std::max({1, 3, 2}, std::greater<int>()) == 1, "");
41 static_assert(std::max({2, 1, 3}, std::greater<int>()) == 1, "");
42 static_assert(std::max({3, 2, 1}, std::greater<int>()) == 1, "");
min_init_list_comp.pass.cpp 26 int i = std::min({2, 3, 1}, std::greater<int>());
28 i = std::min({2, 1, 3}, std::greater<int>());
30 i = std::min({3, 1, 2}, std::greater<int>());
32 i = std::min({3, 2, 1}, std::greater<int>());
34 i = std::min({1, 2, 3}, std::greater<int>());
36 i = std::min({1, 3, 2}, std::greater<int>());
40 static_assert(std::min({1, 3, 2}, std::greater<int>()) == 3, "");
41 static_assert(std::min({2, 1, 3}, std::greater<int>()) == 3, "");
42 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...]
  /prebuilts/ndk/r11/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...]
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/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...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mt/
badsignedimmhigh.s 1 ; Offset greater than #32767 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...]
  /prebuilts/ndk/r11/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...]
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/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...]
  /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::__anon15762::op
95 { numeric::greater(l, r); }

Completed in 645 milliseconds

1 2 3 4 5 6 7 8 91011>>