/external/valgrind/main/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/chromium_org/v8/test/mjsunit/ |
compare-objects.js | 49 function test(a, b, less, greater) { 58 assertEquals(gt(a, b), greater); 59 assertEquals(lt(b, a), greater); 67 var greater = obj1 > obj2; variable 69 test(obj1, obj2, less, greater); 70 test(obj1, obj2, less, greater); 71 test(obj1, obj2, less, greater); 73 test(obj1, obj2, less, greater); 74 test(obj1, obj2, less, greater); 77 test(obj1, obj2, less, greater); 86 var greater = obj1 > obj2; variable 97 var greater = obj1 > obj2; variable 104 var greater = false; variable [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
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...] |
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...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
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...] |
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...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/bin/tests/multisect/ |
bin-align.errwarn | 1 -: warning: section `.foo' internal align of 8 is greater than `align' of 4; using `align' 2 -: warning: section `.bar' internal align of 8 is greater than `valign' of 4; using `valign'
|
/external/clang/test/SemaCXX/ |
namespace.cpp | 75 struct greater {}; struct in namespace:PR6620::numeric::op 78 extern op::greater const greater; 84 op::greater const greater = op::greater(); member in class:PR6620::numeric::__anon3056::op 89 { numeric::greater(l, r); }
|
/external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
is_sorted_until_comp.pass.cpp | 30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 58 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 63 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); 68 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 73 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)) [all...] |
is_sorted_comp.pass.cpp | 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 73 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 78 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
is_sorted_until_comp.pass.cpp | 30 assert(std::is_sorted_until(Iter(a), Iter(a), std::greater<int>()) == Iter(a)); 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 58 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 63 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+2)); 68 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 73 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)) [all...] |
is_sorted_comp.pass.cpp | 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 58 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 63 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 68 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 73 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 78 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())) [all...] |
/external/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, "");
|
/external/stlport/test/unit/ |
heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>()); 60 pop_heap(numbers, numbers + 6, greater<int>()); 62 pop_heap(numbers, numbers + 5, greater<int>()); 64 pop_heap(numbers, numbers + 4, greater<int>()); 66 pop_heap(numbers, numbers + 3, greater<int>()); 68 pop_heap(numbers, numbers + 2, greater<int>()); 97 make_heap(v.begin(), v.end(), greater<int>()); 100 push_heap(v.begin(), v.end(), greater<int>()); 102 sort_heap(v.begin(), v.end(), greater<int>());
|
/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, "");
|
/ndk/tests/device/test-gnustl-full/unit/ |
heap_test.cpp | 57 make_heap(numbers, numbers + 6, greater<int>()); 60 pop_heap(numbers, numbers + 6, greater<int>()); 62 pop_heap(numbers, numbers + 5, greater<int>()); 64 pop_heap(numbers, numbers + 4, greater<int>()); 66 pop_heap(numbers, numbers + 3, greater<int>()); 68 pop_heap(numbers, numbers + 2, greater<int>()); 97 make_heap(v.begin(), v.end(), greater<int>()); 100 push_heap(v.begin(), v.end(), greater<int>()); 102 sort_heap(v.begin(), v.end(), greater<int>());
|