/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
lower_bound_comp.pass.cpp | 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 30 assert(std::greater<int>()(*j, value)); 32 assert(!std::greater<int>()(*j, value)); 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 30 assert(!std::greater<int>()(value, *j)); 32 assert(std::greater<int>()(value, *j)); 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); 41 std::pop_heap(ia, ia+i, std::greater<int>()); 42 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); 44 std::pop_heap(ia, ia, std::greater<int>());
|
/external/llvm/test/CodeGen/Mips/ |
inlineasm-cnstrnt-bad-I-1.ll | 3 ;is greater than 16 bits.
|
inlineasm-cnstrnt-bad-K.ll | 3 ;is greater than 16 bits (0x00100000).
|
/external/pcre/dist/testdata/ |
testoutput20 | 1 /-- These DFA tests are for the handling of characters greater than 255 in
|
/external/valgrind/massif/tests/ |
insig.c | 3 // In this test, the size of the insignificant nodes is greater than the
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
lower_bound_comp.pass.cpp | 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 30 assert(std::greater<int>()(*j, value)); 32 assert(!std::greater<int>()(*j, value)); 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
upper_bound_comp.pass.cpp | 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 30 assert(!std::greater<int>()(value, *j)); 32 assert(std::greater<int>()(value, *j)); 49 std::sort(v.begin(), v.end(), std::greater<int>());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
pop_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); 41 std::pop_heap(ia, ia+i, std::greater<int>()); 42 assert(std::is_heap(ia, ia+i-1, std::greater<int>())); 44 std::pop_heap(ia, ia, std::greater<int>());
|
/external/icu/icu4c/source/test/intltest/ |
decoll.cpp | 90 { Collator::GREATER, Collator::GREATER }, 91 { Collator::GREATER, Collator::GREATER }, 92 { Collator::GREATER, Collator::GREATER }, 96 { Collator::EQUAL, Collator::GREATER }, 99 { Collator::EQUAL, Collator::GREATER }
|
ficoll.cpp | 61 Collator::GREATER, 63 Collator::GREATER, 66 Collator::GREATER, // v < w per cldrbug 6615
|
/external/llvm/lib/Target/Sparc/ |
Sparc.h | 47 ICC_G = 10 , // Greater 49 ICC_GE = 11 , // Greater or Equal 51 ICC_GU = 12 , // Greater Unsigned 63 FCC_G = 6+16, // Greater 64 FCC_UG = 5+16, // Unordered or Greater 67 FCC_LG = 2+16, // Less or Greater 71 FCC_GE = 11+16, // Greater or Equal 72 FCC_UGE = 12+16, // Unordered or Greater or Equal
|
/external/llvm/test/MC/R600/ |
sop1-err.s | 28 // Immediate greater than 32-bits 32 // Immediate greater than 32-bits
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
inplace_merge_comp.pass.cpp | 45 std::sort(ia, ia+M, std::greater<int>()); 46 std::sort(ia+M, ia+N, std::greater<int>()); 47 binary_counting_predicate<std::greater<int>, int, int> pred((std::greater<int>())); 53 assert(std::is_sorted(ia, ia+N, std::greater<int>()));
|
/frameworks/base/core/tests/coretests/src/android/view/ |
ViewGroupChildrenTest.java | 73 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 91 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 109 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 139 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 160 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 181 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 203 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 224 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT 243 // 24 should be greater than ViewGroup.ARRAY_CAPACITY_INCREMENT
|
/ndk/tests/device/test-gnustl-full/unit/ |
perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>()); 102 prev_permutation(v1.begin(), v1.end(), greater<int>()); 106 prev_permutation(v1.begin(), v1.end(), greater<int>()); 110 prev_permutation(v1.begin(), v1.end(), greater<int>()); 114 prev_permutation(v1.begin(), v1.end(), greater<int>()); 118 prev_permutation(v1.begin(), v1.end(), greater<int>()); 122 prev_permutation(v1.begin(), v1.end(), greater<int>()); 126 prev_permutation(v1.begin(), v1.end(), greater<int>()); 130 prev_permutation(v1.begin(), v1.end(), greater<int>());
|
/ndk/tests/device/test-stlport/unit/ |
perm_test.cpp | 98 prev_permutation(v1.begin(), v1.end(), greater<int>()); 102 prev_permutation(v1.begin(), v1.end(), greater<int>()); 106 prev_permutation(v1.begin(), v1.end(), greater<int>()); 110 prev_permutation(v1.begin(), v1.end(), greater<int>()); 114 prev_permutation(v1.begin(), v1.end(), greater<int>()); 118 prev_permutation(v1.begin(), v1.end(), greater<int>()); 122 prev_permutation(v1.begin(), v1.end(), greater<int>()); 126 prev_permutation(v1.begin(), v1.end(), greater<int>()); 130 prev_permutation(v1.begin(), v1.end(), greater<int>());
|
/external/clang/test/SemaOpenCL/ |
invalid-kernel-attrs.cl | 35 kernel __attribute__((reqd_work_group_size(1,2,0))) void kernel11(){} // expected-error {{'reqd_work_group_size' attribute must be greater than 0}} 36 kernel __attribute__((reqd_work_group_size(1,0,2))) void kernel12(){} // expected-error {{'reqd_work_group_size' attribute must be greater than 0}} 37 kernel __attribute__((reqd_work_group_size(0,1,2))) void kernel13(){} // expected-error {{'reqd_work_group_size' attribute must be greater than 0}}
|
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/heightmap/ |
FluidSimHeightMap.java | 85 * if size of the terrain is not greater that zero, or number of
86 * iterations is not greater that zero, or the minimum initial height
87 * is greater than the maximum (or the other way around)
92 "Either size of the terrain is not greater that zero, "
93 + "or number of iterations is not greater that zero, "
94 + "or minimum height greater or equal as the maximum, "
120 * if size of the terrain is not greater that zero, or number of
121 * iterations is not greater that zero
126 "Either size of the terrain is not greater that zero, "
127 + "or number of iterations is not greater that zero"); [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
sort_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); 39 std::sort_heap(ia, ia+N, std::greater<int>()); 40 assert(std::is_sorted(ia, ia+N, std::greater<int>()));
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
max_element_comp.pass.cpp | 27 Iter i = std::max_element(first, last, std::greater<int>()); 31 assert(!std::greater<int>()(*i, *j)); 74 test_eq0(a, a+N, std::greater<int>());
|
min_element_comp.pass.cpp | 27 Iter i = std::min_element(first, last, std::greater<int>()); 31 assert(!std::greater<int>()(*j, *i)); 74 test_eq0(a, a+N, std::greater<int>());
|
/external/markdown/MarkdownTest/Tests_2007/ |
Backslash escapes.html | 23 <p>Greater-than: ></p> 57 Greater-than: \> 92 <p>Greater-than: <code>\></code></p>
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
sort_heap_comp.pass.cpp | 38 std::make_heap(ia, ia+N, std::greater<int>()); 39 std::sort_heap(ia, ia+N, std::greater<int>()); 40 assert(std::is_sorted(ia, ia+N, std::greater<int>()));
|